Home
Class 12
MATHS
Find the remainder when sum(r=1)^(n)r! i...

Find the remainder when `sum_(r=1)^(n)r!` is divided by 15, if `n ge5`.

Text Solution

Verified by Experts

Let `N=underset(r=1)overset(n)(sum)r!=1!+2!+3!+4!+5!+6!+7!+ . . .+n!`
`=(1!+2!+3!+4!)+(5!+6!+7!+ . . .+n!)`
`=33+(5!+6!+7!+ . . .+n!)`
`implies(N)/(15)=(33)/(15)+((5!+6!+7!+ . . .+n!))/(15)`
`=2+(3)/(15)+` interger [as `5!,6!`, . . . are divisible by 15]
`=(3)/(15)+`Integer
Hence, remainder is 3.
Promotional Banner

Similar Questions

Explore conceptually related problems

Find the remainder when x^(3) + 3x^(2) + 3x+1 is divided by : x+1

Evaluate sum_(r=1)^(n)rxxr!

Find the remainder when x^(3) + 3x^(2) + 3x+1 is divided by : x-(1)/(2)

Find the remainder when 2x ^(2) - 3x + 5 is divided 2x-3. Does it exactly divided the polynomial ? State reason.

Sum of the series sum_(r=1)^(n) (r^(2)+1)r! is

A certain polynomial P(x)x in R when divided by k x-a ,x-ba n dx-c leaves remainders a , b ,a n dc , resepectively. Then find remainder when P(x) is divided by (x-a)(x-b)(x-c)w h e r eab, c are distinct.

.........is the remainder if P (n) : 3^(2n+2) - 8n is divided by 64.