perplexus.info :: Just Math : Seven Divisibility Settlement

Seven Divisibility Settlement (Posted on 2010-11-13)

M is a positive integer ≥ 2 such that 3^M + 4^M is divisible by M.

Is M always divisible by 7?

If so, prove it. Otherwise, provide a counterexample.

See The Solution Submitted by K Sengupta

Rating: 3.0000 (3 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)

re: Possible Solution

| Comment 4 of 5 |

(In reply to Possible Solution by broll)

Ty, broll.

I confirm having hyperlinked your methodology in the official solution.

Posted by K Sengupta on 2024-05-07 02:38:24

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 (3)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:


perplexus dot info