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

Home > Numbers
Fermat’s Little Theorem (Posted on 2025-04-18) Difficulty: 3 of 5
The number 2027 is prime. Let m = 242026 + 252027. Find the smallest positive integer n for which mn = 2027k + 1 for some integer k.

No Solution Yet Submitted by Danish Ahmed Khan    
No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
analytic solution Comment 2 of 2 |
Since 2027 = p is prime, phi(p) = p-1 and any number coprime to p obeys x^(p-1) = 1 mod p

Write m = 24^2026 + 25^2027 = 24^(p-1) + 25 * 25^(p-1)

m = 1 + 25 * 1 mod p = 26 mod p. Then we seek n such that

26n = 1 mod p

Let's look at where 26n transitions from < p to > p:

26 * 100 = 2600 (> p)
26 * 20 = 520 so
26 * 80 = 2600 - 520 = 2080 (> p; 26*80 - p = 2080 - 2027 = 53 -- we can get closer)
26*2 = 52, so
26*78 = 2028 which, since it's p+1 is clearly = 1 mod p

then n = 78

  Posted by Paul on 2025-04-19 23:06:40
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 (8)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

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