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

Home > Numbers
Prime Test (3) - Final (Posted on 2011-06-25) Difficulty: 4 of 5

Let P be any prime.

P is in the set S, unless P^72-1 is evenly divisible by 20174525280.

Using the results of Prime Tests (1) and (2), or some other method, prove that S is finite.

Optional: List the members of S.

  Submitted by broll    
No Rating
Solution: (Hide)
The problem is related to the Bernoulli Numbers, see A006863 in Sloane. Let P be any prime; then P^n-1 is divisible by A006863(n) unless (for obvious reasons)P itself is a factor of A006863(n).

20174525280 = 2^5×3^3×5×7×13×19×37×73, so those primes are all the members of S, and every other prime is so divisible.

Comments: ( You must be logged in to post comments.)
  Subject Author Date
Apologiesbroll2011-08-21 06:22:09
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 (3)
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