All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Just Math
A multiple of 42 (Posted on 2022-03-23) Difficulty: 3 of 5
Prove that
n^7-n
is divisible by 42
for any integer n.

See The Solution Submitted by Ady TZIDON    
Rating: 5.0000 (1 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
Solution Puzzle Solution | Comment 2 of 6 |
At the outset, we observe that any power of an odd number is odd and any power of an even number is even. 
Then, n^7 and n must possess the same parity, and accordingly, we must have:
n^7= n (mod 2)   .
n^7-n=0( mod 2), for any given integer n..........  (i)

Now, we observe that:
n^7-n =n(n^3+1)(n^3-1) .........(*)

If n=0(mod 3), then by (*), we have:
n^7-n =0(mod 3)
If n= 1(mod 3) => n^3=1(mod 3) => (n^3-1)= 0(mod 3) => n^7-n =0(mod 3)(by (*))
If n=2(mod3)=> n^3+1=0(mod 3) => n^7-n=0(mod 3) (by (*)
Accordingly,  we must have:
n^7-n=0(mod 3) for any integer n. ..........(ii)

Again, as before if n=0(mod 7), then it trivially follows that:
n^7-n= 0(mod 7)
If n=1,2,4(mod 7) => n^3-1=0(mod7) => n^7-n =0(mod 7) (by *)
If n=3,5,6 (mod 7) => n^3+1 = 0(mod7) => n^7-n =0(mod 7) (by *)
Accordingly,  for any given integer n, it follows that:
n^7-n=0(mod 7).............(iii)

From (i), (ii), and (iii), we observe that, for any given integer n, (n^7-n) is divisible by each of 2,3, and 7

Consequently,  for any integer n, (n^7-n) must be divisible by lcm(2,3,7) = 42, 


Edited on March 23, 2022, 8:32 am

Edited on March 23, 2022, 8:47 am

Edited on March 23, 2022, 8:47 am
  Posted by K Sengupta on 2022-03-23 08:29:54

Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (13)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2024 by Animus Pactum Consulting. All rights reserved. Privacy Information