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.)
incomplete solu | Comment 7 of 13 |

let us prove by induction

for n = 1 it is trivial and then for some n we assume that it is a prime

11 x 14^n + 1 gives prime. say P

now for n+1 the eq becomes

11 x 14x14^n + 1

11 x (13+1)14^n +1

11 x 13x14^n +1 +11 x 14^n +13 -13

13(P) + P - 13

14P -13


  Posted by phi on 2005-06-21 09:11:13
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 (16)
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