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.)
re: incomplete solu - thinking better | Comment 9 of 13 |
(In reply to incomplete solu by phi)

Phi, I was thinking better in your way of solving this.

Once we already know that there´s no n that makes 11 x 14^n + 1 a prime, your reasoning must be :

a) N = 11 x 14^n + 1, for n= 1, equals 155, that is NOT a prime.

b) assuming that for n, 11 x 14^n +1 is NOT a prime (say , Q), we have to prove that this holds for n+1.


  Posted by pcbouhid on 2005-06-22 03:26:54
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 (3)
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