Find the remainder when 1 3 1 9 + 1 7 1 9 is divided by 15.
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^n + b^n is divisible by a+b, provided n is odd. Here it is 30. So obviously, remainder is 0.
1 3 1 9 + 1 7 1 9 = ( 1 3 + 1 7 ) ( 1 3 1 8 − 1 3 1 7 . 1 7 + ⋯ − 1 7 1 7 . 1 3 + 1 7 1 8 ) = 3 0 × ( s u m ) → multiple of 15
I used a n + b n = ( a + b ) ( a n − 1 − a n − 2 b + a n − 3 b 2 − ⋯ + a 2 b n − 3 − a b n − 2 + b n − 1 ) for odd n > 1 .
Problem Loading...
Note Loading...
Set Loading...
We seek to find x such that 1 3 1 9 + 1 7 1 9 ≡ x ( m o d 1 5 ) .
Fortunately, by rules of modular arithmetic , we know that
1 3 1 9 ≡ ( − 2 ) 1 9 ( m o d 1 5 ) .
Similarly, 1 7 1 9 ≡ 2 1 9 ( m o d 1 5 ) .
Therefore,
1 3 1 9 + 1 7 1 9 ≡ ( − 2 ) 1 9 + 2 1 9 ≡ 0 ( m o d 1 5 ) .