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

Home > Just Math
Powerful Divisor (Posted on 2014-05-01) Difficulty: 3 of 5
Let us consider the expression MM+1, where M is a positive integer.

It can be verified that M=3 is the least value for which 22 divides MM+1.

Given that n is a positive integer, find the least value of M (in terms of n) for which MM+1 is divisible by 2n.

No Solution Yet Submitted by K Sengupta    
No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
re(2): solution Comment 8 of 8 |
(In reply to re: solution by broll)

Are a quarter of the numbers be divisible by 4?  If so, why should it be every other number divisible by 2?  Are one-seventh of the numbers M^M+1 divisible by 7?  Is it every seventh number?

The answers to these may be 'yes' but I think the proof is needed.  So I did the math to prove it.

  Posted by Jer on 2014-05-02 12:39:33

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

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

Copyright © 2002 - 2019 by Animus Pactum Consulting. All rights reserved. Privacy Information