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

Home > Numbers
Primary problem III (Posted on 2015-07-03) Difficulty: 3 of 5
Prove that there are infinitely many primes of the form 3n + 1.

No Solution Yet Submitted by Ady TZIDON    
Rating: 5.0000 (1 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
Solution Prime answer | Comment 1 of 2
Suppose p1, p2, ..., px are all of the primes of the form 3n+1. Let q=p1*p2*...*px. The number 4q^2+3 cannot be divisible by any of p1, p2, ..., px. However, it can only have factors of the form 3n+1. Therefore, there are infinitely many primes of the form 3n+1.


  Posted by Math Man on 2015-07-03 19:30: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 (3)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2017 by Animus Pactum Consulting. All rights reserved. Privacy Information