the remainder when ((15^23) +( 23^23 )) is divided by 19 ???
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.
When we apply binomial theorem, odd terms get cancelled and even terms remain. it is perfectly divisible by 19
Let the expression given be Z . So, Z = 1 5 2 3 + 2 3 2 3 . The expression can be rewritten as,
Z = ( 1 9 − 4 ) 2 3 + ( 1 9 + 4 ) 2 3 ⟹ Z ≡ ( 0 − 4 ) 2 3 + ( 0 + 4 ) 2 3 ( m o d 1 9 ) ⟹ Z ≡ − 4 2 3 + 4 2 3 ( m o d 1 9 ) ⟹ Z ≡ 0 ( m o d 1 9 )
Hence, the remainder when the given expression is divided by 1 9 is 0
Problem Loading...
Note Loading...
Set Loading...
we know a^n + b^n is exactly divisible by a+b when n is odd here n is odd therfore the whole no. is divisible by 23+15 =38 38 is a multiple of 19 hence it is also divisible by 19 rem.=0