For , find the remainder of when it is divided by .
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.
Putting n = 1 0
3 2 1 0 − 1 = ( 3 2 9 + 1 ) ( 3 2 9 − 1 ) = ( 3 2 9 + 1 ) ( 3 2 8 + 1 ) ( 3 2 8 − 1 ) = ⋯ = ( 3 2 9 + 1 ) ( 3 2 8 + 1 ) ( 3 2 8 − 1 ) . . . ( 3 2 2 + 1 ) ( 3 2 + 1 ) ( 3 + 1 ) ( 3 − 1 )
Each of the 12 factors will release exactly a single factor of 2 because in the binomial expansion of 3 2 k + 1 will give a factor 2 and rest part is odd.
So the number will be 3 2 1 0 − 1 = 2 1 2 ( 2 m + 1 ) = 2 1 2 . 2 m + 2 1 2 = 2 1 3 m + 2 1 2
So the remainder is 2 1 2 = 4 0 9 6