Summing the factorials

Algebra Level 5

Let a n = n ! ( n + 1 ) 2 \displaystyle a_n = n!(n+1)^2 and S = n = 0 94 a n \displaystyle S=\sum_{n=0}^{94} a_n .

Find the remainder when S S is divided by 97 .

Notation : ! ! denotes the factorial notation. For example, 8 ! = 1 × 2 × 3 × × 8 8! = 1\times2\times3\times\cdots\times8 .


The answer is 95.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Mark Hennings
Jun 18, 2016

Since a n = ( n + 1 ) 2 n ! = ( n + 1 ) ( n + 1 ) ! = ( n + 2 ) ! ( n + 1 ) ! a_n \; = \; (n+1)^2 n! \; = \; (n+1) (n+1)! \; = \; (n+2)! - (n+1)! we deduce that S = j = 0 94 a j = 96 ! 1 ! = 96 ! 1 S \; = \; \sum_{j=0}^{94} a_j \;= \; 96! - 1! \; = \; 96! - 1 Since 97 97 is prime, 96 ! 1 96! \,\equiv\, -1 modulo 97 97 by Wilson's Theorem, and hence S 2 S \,\equiv\, -2 modulo 97 97 . The remainder is 95 95 .

@Mark Hennings , we really liked your comment, and have converted it into a solution. If you subscribe to this solution, you will receive notifications about future comments.

Brilliant Mathematics Staff - 4 years, 12 months ago

Sir, how remainder can be negative ?

Aditya Sky - 4 years, 12 months ago

Log in to reply

The congruence expression a b a \equiv b modulo n n simply means that n n divides a b a-b . There is no restriction on the signs of a a and b b . Of course, any integer a a is congruent to some remainder r r , with 0 r n 1 0 \le r \le n-1 .

Mark Hennings - 4 years, 12 months ago

Log in to reply

Got it .. Thanks Sir :)

Aditya Sky - 4 years, 12 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...