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.

See The Solution Submitted by pcbouhid    
Rating: 2.8571 (7 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
Some Thoughts re(2): incomplete solu - thinking better | Comment 10 of 13 |
(In reply to re: incomplete solu - thinking better by pcbouhid)

Induction doesn't always have to proceed by showing that if a proposition is true for n then it is true for n + 1.  In this case, given that we know the divisibility is different for even and odd n, we note that:

f(0) = 12 is divisible by 3,
f(1) = 155 is divisible by 5.

Then f(n+2) - f(n) = 11 × 14n(142 - 1) = 11 × 3 × 5 × 13 × 14n is divisible by both 3 and 5, and the result follows by induction.
(f(n) divisible by 3 implies f(n+2) divisible by 3; f(n) divisible by 5 implies f(n+2) divisible by 5.)


  Posted by Nick Hobson on 2005-06-22 11:36:15
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