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

Home > Just Math
Prime power divisibility (Posted on 2024-10-15) Difficulty: 2 of 5
How many prime numbers p make the number 3p2+p+1 + 7p2+p+1 divisible by p?

No Solution Yet Submitted by Danish Ahmed Khan    
Rating: 5.0000 (1 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
Solution Analytic solution Comment 2 of 2 |
First note that p = 3 and p = 7 are not solutions, because in each case one term is a multiple of p and the other isn't so the sum isn't a multiple of p.

Now rewrite p^2 + p + 1 as (p-1)(p+2) + 3

x^(p-1) = 1 mod p for all x co-prime to p. Since p is not 3 or 7, any power of 3 or 7 is co-prime to p. 

In particular, we can write 3^(p^2 + p + 1) as 
3^((p-1)(p+2) + 3)
 = 3^3 * (3^(p+2))^(p-1)
That second term is equal to 1 mod p so overall, this term = 3^3 mod p. 

Ditto for the 7^(p^2+p+1) term.

Then mod p, the sum is 3^3 + 7^3 = 27 + 343 = 370. Since we want this to be a multiple of p, it must be that 370 = 0 mod p

This in turn demands that p is one of (2, 5, 37)

  Posted by Paul on 2024-10-15 16:29:51
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 (12)
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