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

Home > Numbers
A question of primes (Posted on 2005-06-08) Difficulty: 2 of 5
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.)
  Subject Author Date
SolutionPuzzle SolutionK Sengupta2008-11-21 00:41:34
AnswerK Sengupta2008-11-07 01:27:45
re(3): incomplete solu - thinking betterpcbouhid2005-06-22 15:18:51
Some Thoughtsre(2): incomplete solu - thinking betterNick Hobson2005-06-22 11:36:15
re: incomplete solu - thinking betterpcbouhid2005-06-22 03:26:54
re: incomplete solupcbouhid2005-06-21 16:55:39
incomplete soluphi2005-06-21 09:11:13
re: Trial and Errorpcbouhid2005-06-11 23:23:27
Questionre: Trial and ErrorNick Hobson2005-06-11 14:19:38
Hints/TipsTrial and ErrorPaddy2005-06-11 11:26:39
SolutionModulo solutionNick Hobson2005-06-09 12:30:05
alsoarmando2005-06-09 07:17:26
Solutionfull solutionRobby Goetschalckx2005-06-08 14:00:19
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 (9)
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