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.)
Australia essay | Comment 7 of 8 |
Home series is carrying the numbers and the numbers are properly bound within the series of reflections in the arts. These thoughts are bringing the great plan with the australia essay writing adverse scene of the better kind of the confirmations of the long term stance.
  Posted by Naida Rich on 2022-01-11 01:27:56
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 (0)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

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