A cool divisibility problem

If a a , b b , and c c are positive integers that satisfy 30 ( a + b + c ) , 30 {\large\mid} (a+b+c), is it also true that 30 ( a 5 + b 5 + c 5 ) ? 30 {\large\mid} \big(a^5+b^5+c^5\big)?

Yes No

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.

3 solutions

Mark Hennings
Apr 4, 2018

Since m 5 m = m ( m 4 1 ) = m ( m 2 1 ) ( m 2 + 1 ) = ( m 1 ) m ( m + 1 ) ( m 2 + 1 ) 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 m-1,m,m+1 , it is clear that 6 6 divides m 5 m m^5 - m for any integer m m . Fermat's Little Theorem tells us that 5 5 divides m 5 m m^5 - m for all integers m m . Hence we deduce that 30 30 divides m 5 m m^5 - m for all integers m m . It follows that 30 30 divides ( a 5 + b 5 + c 5 ) ( a + b + c ) = ( a 5 a ) + ( b 5 b ) + ( c 5 c ) (a^5 + b^5 + c^5) - (a + b + c) \; = \; (a^5 - a) + (b^5 - b) + (c^5 - c) for all integers a , b , c a,b,c . Thus, if a , b , c a,b,c are integers such that 30 30 divides a + b + c a+b+c , then 30 30 divides a 5 + b 5 + c 5 a^5 + b^5 + c^5 as well.

Sir, why do you start up with m 5 m m^5-m ? I have posted solution for for m 5 m m^5-m before however, the author has deleted the problem.

Naren Bhandari - 3 years, 2 months ago

Log in to reply

Sir , I got it . :)

Naren Bhandari - 3 years, 2 months ago

Wow. So nice!!!

A Former Brilliant Member - 3 years, 1 month ago
Luca Bernardelli
Apr 11, 2018

30 = 2 3 5 a a 5 ( m o d 2 ) a a 5 ( m o d 3 ) a a 5 ( m o d 5 ) 30 = 2*3*5 \\ \\ a \equiv a^5 \pmod 2 \\ a \equiv a^5 \pmod 3 \\ a \equiv a^5 \pmod 5 Then, ( a + b + c ) ( a 5 + b 5 + c 5 ) ( m o d 30 ) (a+b+c) \equiv (a^5+b^5+c^5) \pmod {30}

this is Indonesian MO

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...