Home > Numbers
A question of primes (Posted on 2005-06-08) |
|
Find the smallest integer n that makes 11 x 14^n + 1, a prime number, or, prove that it doesn't exist.
|
Submitted by pcbouhid
|
Rating: 2.8571 (7 votes)
|
|
Solution:
|
(Hide)
|
a) If n is odd, 14^n ends in 4. So does 11 x 14^n.
Therefore, 11 x 14^n + 1 ends in 5, and hence is divisible by 5.
b) If n is even, say equal to 2m, 11 x 14^n + 1 is equal to 11 x 196^m + 1. Since 196 = 3 x 65 + 1, (3 x 65 + 1)^m will always leave a remainder of 1 when divided by 3. Therefore, 11 x 196^m + 1 is equal to 11(3k + 1) + 1 = 33k + 12. Hence, when n is even, 11 x 14^n + 1 is always divisible by 3.
Therefore, 11 x 14^n + 1 is never a prime, being a multiple of 5 or 3, according as n is odd or even.
|
Comments: (
You must be logged in to post comments.)
|
|
Please log in:
Forums (1)
Newest Problems
Random Problem
FAQ |
About This Site
Site Statistics
New Comments (6)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On
Chatterbox:
|