If a , b , and c are positive integers that satisfy 3 0 ∣ ( a + b + c ) , is it also true that 3 0 ∣ ( a 5 + b 5 + c 5 ) ?
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.
Sir, why do you start up with m 5 − m ? I have posted solution for for m 5 − m before however, the author has deleted the problem.
Wow. So nice!!!
3 0 = 2 ∗ 3 ∗ 5 a ≡ a 5 ( m o d 2 ) a ≡ a 5 ( m o d 3 ) a ≡ a 5 ( m o d 5 ) Then, ( a + b + c ) ≡ ( a 5 + b 5 + c 5 ) ( m o d 3 0 )
this is Indonesian MO
Problem Loading...
Note Loading...
Set Loading...
Since m 5 − m = m ( m 4 − 1 ) = m ( m 2 − 1 ) ( m 2 + 1 ) = ( m − 1 ) m ( m + 1 ) ( m 2 + 1 ) has three consecutive factors m − 1 , m , m + 1 , it is clear that 6 divides m 5 − m for any integer m . Fermat's Little Theorem tells us that 5 divides m 5 − m for all integers m . Hence we deduce that 3 0 divides m 5 − m for all integers m . It follows that 3 0 divides ( a 5 + b 5 + c 5 ) − ( a + b + c ) = ( a 5 − a ) + ( b 5 − b ) + ( c 5 − c ) for all integers a , b , c . Thus, if a , b , c are integers such that 3 0 divides a + b + c , then 3 0 divides a 5 + b 5 + c 5 as well.