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 | Comment 8 of 13 |
(In reply to incomplete solu by phi)

Phi, your approach (by induction), unfortunatelly, lead us to prove that the number (14*P - 13 (when P is a prime) is not a prime, and so the induction doesnīt hold for (n+1).

I  canīt see (yet) how to prove it.

Maybe, someone who reads your comment or mine, succeed in this proof. 

  

 


  Posted by pcbouhid on 2005-06-21 16:55:39
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