Let a n = n ! ( n + 1 ) 2 and S = n = 0 ∑ 9 4 a n .
Find the remainder when S is divided by 97 .
Notation : ! denotes the factorial notation. For example, 8 ! = 1 × 2 × 3 × ⋯ × 8 .
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.
@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.
Sir, how remainder can be negative ?
Log in to reply
The congruence expression a ≡ b modulo n simply means that n divides a − b . There is no restriction on the signs of a and b . Of course, any integer a is congruent to some remainder r , with 0 ≤ r ≤ n − 1 .
Problem Loading...
Note Loading...
Set Loading...
Since a n = ( n + 1 ) 2 n ! = ( n + 1 ) ( n + 1 ) ! = ( n + 2 ) ! − ( n + 1 ) ! we deduce that S = j = 0 ∑ 9 4 a j = 9 6 ! − 1 ! = 9 6 ! − 1 Since 9 7 is prime, 9 6 ! ≡ − 1 modulo 9 7 by Wilson's Theorem, and hence S ≡ − 2 modulo 9 7 . The remainder is 9 5 .