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.)
No Subject Comment 8 of 8 |
<style type="text/css">td {border: 1px solid #cccccc;}br {mso-data-placement:same-cell;}</style>iYogi makes the site lyogiyogi, and so on that makes it workable for individuals for clients or the clients to impart well and for additionally choosing the right program or plan for themselves. Rather than failing to remember <style type="text/css">td {border: 1px solid #cccccc;}br {mso-data-placement:same-cell;}</style>knowledgestech.com/ the sites that helped us out from the soup, I will propose you make a bookmark of these sites, for issues are consistently around the bend.
  Posted by Oren Harper on 2022-09-16 12:57:11
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