Proving Infinite Primes of 6m+1 and 6m+5 Form Using Euclid's Method

  • Thread starter Thread starter cragar
  • Start date Start date
  • Tags Tags
    Primes Proof
cragar
Messages
2,546
Reaction score
3

Homework Statement


Except 2 and 3 , prove that their an infinite amount of primes
of the form 6m+1 and 6m+5 for some integer m
It says to use Euclid's method but replace the +1 with a -1.

The Attempt at a Solution


Would I just multiply some of these forms together and subtract 1
[itex](6m+1)...(6n+1)-1=x[/itex]
If I divide my new number x by (6m+1) it won't divide it evenly.
this doesn't seems like it proves it, am I on the right track?
 
on Phys.org
I wouldn't think so. You would only be able to show that x is not divisible by primes of the form 6m+1. You won't be able to show it is not divisible by other primes.
 
If you multiply k primes of the form (6m+1) and l primes of the form (6m+5), you get a product of the form (6m+1) for even l and (6m+5) for odd l. This allows to find new primes, assuming a finite number of primes of those types. I am not sure how to get an infinite number of (6m+1)-primes, but it is certainly possible for (6m+5)-primes.
 
ok thanks for the replies Ill work on it.
 
Suppose p to be the largest prime of a given one of those two types, and construct the product of all primes (except a certain few) up to p.
 
So I make a product of all primes of the form 6m+1 and then add one
to it. I am still not really sure exactly what you guys are telling me, Ill keep thinking about it.
another thing i noticed is that all of the odd numbers greater than 5 are of the form
6m+1 or 6m+3 or 6m+5, but we know that 6m+3=3(2m+1) so it never produces primes.
so we know because their are an infinite amount of odd primes that
either or both 6m+1 or 6m+3 contain an infinite amount of primes.
 
Last edited:
cragar said:
So I make a product of all primes of the form 6m+1 and then add one
That's not what I wrote: "the product of all primes (except a certain few) up to p."
 
1 is a bad thing to add, as the result will be divisible by 2.
so we know because their are an infinite amount of odd primes that
either or both 6m+1 or 6m+3 contain an infinite amount of primes.
Right
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 10 ·
Replies
10
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
5
Views
2K
  • · Replies 7 ·
Replies
7
Views
4K
Replies
4
Views
2K
  • · Replies 16 ·
Replies
16
Views
3K
  • · Replies 6 ·
Replies
6
Views
2K
Replies
4
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K