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.)
Comment Comment 6 of 6 |
The question can be intrepreted as:
If order of A modulo P is 3. find the order of (A+1) modulo P

I can clearly say that order of (A+1) modulo P is independent of
order of A modulo P, but the value it can presume is one
among the values of positive divisors of (P-1)

  Posted by Praneeth on 2007-08-01 12:55:25
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 (4)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

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