Let a , b and c be distinct, positive, odd integers. What is the remainder if a 8 + b 8 + c 8 is divided by 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.
We note that ( 2 k + 1 ) 2 = 4 k ( k + 1 ) + 1 where is k ≥ 0 is any integer also it can be noted k and k + 1 are consecutive integers implying that k ( k + 1 ) = 2 N for some integer N . Putting back we have then ( 2 k + 1 ) 2 m o d ( 8 ) ⟹ ( 8 N + 1 ) m o d ( 8 ) ⟹ ( 8 N + 1 ) 4 m o d ( 8 ) = 1 Hence we have then a 8 + b 8 + c 8 ≡ 1 + 1 + 1 m o d ( 8 ) ≡ 3 m o d ( 8 )
Using binomial expansion,
( 2 n + 1 ) 8 = a + b ( 2 n ) + c ( 2 n ) 2 + d ( 2 n ) 3 . . . . .
Where a, b, c,... are binomial coefficients.
All the terms after the third will be divisible by 8, as all will have 2 to the power > o r = 3 .
b=8, c will be even, which tells us that even the first 2 terms will be divisible by 8.
Which only leaves 1, thus any odd number to the eighth power when divided by 8 leaves the remainder = 1. Thus, three of these numbers will give the remainder as 3 .
Problem Loading...
Note Loading...
Set Loading...
By Euler's Totient Theorem, a φ ( 8 ) = a 4 ≡ 1 ( m o d 8 ) since a and 8 are coprime. So a 8 ≡ 1 ( m o d 8 ) . Repeating this process for b and c , we find that a 8 + b 8 + c 8 ≡ 1 + 1 + 1 = 3 ( m o d 8 ) .