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

 Seven Divisibility Settlement (Posted on 2010-11-13)
M is a positive integer ≥ 2 such that 3M + 4M is divisible by M.

Is M always divisible by 7?

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

 No Solution Yet Submitted by K Sengupta Rating: 2.0000 (2 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
 Possible Solution | Comment 1 of 3

1. 3^M+4^M is odd, so even M merit no further consideration.

2. By reason of addition/multiplication of powers, we need further only check odd prime M.

3. If M is odd prime, then we have 3^(M-1) congruent to 1 and 4^(M-1) congruent to 1, modM (Fermat).

4. Hence, 3^M is worth 3, mod5 or larger and 4^M is worth 4, mod5 or larger.

5. Accordingly, M is always divisible by 7.

Edited on November 13, 2010, 12:40 pm
 Posted by broll on 2010-11-13 12:39:18

 Search: Search body:
Forums (45)
Random Problem
Site Statistics
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox: