If is a positive integer ,then what will be the remainder when the above expression 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.
A simple way to find the answer is substituting n = 1 ; we get 3 6 − 2 6 = 7 0 3 = 4 ⋅ 1 6 9 + 2 7 .
But we must prove that it works for all positive integers n .
3 3 n + 3 = ( 3 3 ) n + 1 = ( 1 + 2 ⋅ 1 3 ) n + 1 . Use the binomial expansion: ⋯ = ( 0 n + 1 ) 1 n + 1 + ( 1 n + 1 ) 1 n ⋅ ( 2 ⋅ 1 3 ) + ( 2 n + 1 ) 1 n − 1 ⋅ ( 2 ⋅ 1 3 ) 2 + ⋯ + ( n + 1 n + 1 ) ( 2 ⋅ 1 3 ) n + 1 . From the second term onward, each term is a multiple of 1 3 2 = 1 6 9 . Therefore, modulo 169, we have ⋯ ≡ 1 + ( n + 1 ) ⋅ 2 ⋅ 1 3 = 1 + 2 6 ( n + 1 ) = 2 7 + 2 6 n . Finally, 3 3 n + 3 − 2 6 n ≡ 2 7 + 2 6 n − 2 6 n = 2 7 .