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

Home > Numbers
Divisibility (Posted on 2007-01-08) Difficulty: 3 of 5
Let A be an integer, P an odd prime and n=3 be the smallest integer for which A^n - 1 is divisible by P.
Determine the smallest integer m for which (A+1)^m - 1 is divisible by P.

No Solution Yet Submitted by atheron    
No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
Some more thoughts | Comment 2 of 6 |

If A=4 and n=3, [A^n - 1] = 63 which is divisible by P=3
With the integer A=4 and the odd prime P=3, m can be equal to the small value of 2... [(A+1)^m - 1] = 24 which is still divisible by P=3

Therefore, the minimum value is at most 2.

  Posted by Dej Mar on 2007-01-09 00:59:26
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 (6)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

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