Quote: GreasyjohnI completely understand that there's no largest prime. I was merely trying to continue the calculation. Perhaps there is no calculation--multiply any know primes and add one and there' s always a prime greater than ANY prime on our list.
Right. Do the multiplication, add one, and either
a) the result will be prime, or
b) a prime larger than one in the list will divide the result.
Maybe you can characterize when this will happen and will a Fields medal? ;)
Quote: TwirdmanYes if you take a list of all the primes up to a certain value say 23 so you have 2*3*5*7*11*13*17*19*23+1 you will get a larger prime. Though you have to still find what that larger prime is by doing repeated divisions of the number and there are simply much easier ways to find incredibly large primes.
But you could have any primes in your calculation? Is 3x17x509 just as valid as any more complete list of primes?
a) the number is prime, or
b) a prime not in your list divides the result.
Quote: GreasyjohnBut you could have any primes in your calculation? Is 3x17x509 just as valid as any more complete list of primes?
Yeah that is a valid list but you won't necessarily get a bigger prime then just one not on the list. Like I showed with 3*5+1=16 that is 2^4 so 2 is the new prime you got but its not bigger than 3 or 5 its just not on your list.
Quote: TwirdmanYes if you take a list of all the primes up to a certain value say 23 so you have 2*3*5*7*11*13*17*19*23+1 you will get a larger prime.
No, that's incorrect. There's already been a counter-example given in this thread which shows that that's wrong (2*3*5*7*11*13 + 1 = 59 * 509)
Quote: AxiomOfChoiceNo, that's incorrect. There's already been a counter-example given in this thread which shows that that's wrong (2*3*5*7*11*13 + 1 = 59 * 509)
And 59 is a larger prime then any on the list. I could have worded it better I guess but I was just saying it will prove the existence of a larger prime which you can find by either a simplistic algorithm of just dividing or some more advanced algorithms that I don't know since my area of math isn't number theory or algorithms.
Quote: AxiomOfChoiceNo, that's incorrect. There's already been a counter-example given in this thread which shows that that's wrong (2*3*5*7*11*13 + 1 = 59 * 509)
I'm guessing that Twirdman means not "will get a larger prime" but that there IS a larger prime than is on his list.
Quote: GreasyjohnI'm guessing that Twirdman means not "will get a larger prime" but that there IS a larger prime than is on his list.
Yeah I will admit I worded that badly and should have been more careful. I normally am but think I got lazy since I'm on break.
In a rather odd way, except for the number 2 and the number 5, all known primes have a final digit of either 1, 3, 7, or 9. However further testing is still needed: 21 is not prime as is 49 for example.
Quote: 98ClubsOne of the ways to attack the problem of large primes is a rather simple rule that will eliminate 60% of all numbers larger than 5.
In a rather odd way, except for the number 2 and the number 5, all known primes have a final digit of either 1, 3, 7, or 9. However further testing is still needed: 21 is not prime as is 49 for example.
I'll do better than that; I will eliminate 2/3 of all numbers greater than 3.
If n > 3 and is prime, then either n+1 is a multiple of 6 or n-1 is a multiple of 6.
Proof: if n / 6 has a remainder of 0, 2, or 4, then it is a multiple of 2; if its remainder is 3, it is a multiple of 3; if it is 1, then n-1 is a multiple of 6; if it is 5, then n+1 is a multiple of 6.
![](http://imgs.xkcd.com/comics/riemann-zeta.jpg)
![](http://imgs.xkcd.com/comics/goldbach_conjectures.png)
The weak twin primes conjecture states that there are infinitely many pairs of primes. The strong twin primes conjecture states that every prime p has a twin prime (p+2), although (p+2) may not look prime at first. The tautological prime conjecture states that the tautological prime conjecture is true.
IMO it's not that funny, but the two statements on the left are obviously true, and the two statements on the right are obviously false. The "Strong" and "Weak" are open problems (the Goldbach Conjecture) with "Strong" being a stronger statement than "Weak" (ie, Strong ==> Weak).
The joke is that there are several statements collectively known as "strong" or "weak" versions of the goldbach conjecture. When people say "The Goldbach Conjecture" they usually mean the one that is labelled "Strong" in the comic.
http://en.wikipedia.org/wiki/Goldbach_conjecture might help.
edit: I found it.
Quote:Randall is riffing on the relationship between "strong" and "weak" logical statements, which are an interplay between the boldness or usefulness of a statement and the ease with which it might be proven to be true. For example, if Goldbach's conjecture (given in the comic under the label "strong") could be proven to be true, it would automatically imply that Goldbach's weak conjecture (given in the comic under the label "weak") is also true, because any odd number greater than 5 can be expressed as 3 (a prime number) plus an even number greater than 2 (which, per the strong conjecture, would itself be the sum of two prime numbers), resulting in a way to express the original odd number as the sum of three prime numbers. The weak conjecture does not, however, imply the strong conjecture.
Mathematicians have been solving related problems that are "weaker" than the weak conjecture, and working towards "stronger" ones. For example, in 1937 the weak conjecture was proven for odd numbers greater than 314348907. In 1995 a version was proven based on the sum of no more than seven prime numbers, and in 2012 the ceiling was lowered to five primes. In 2013 the weak conjecture was claimed proven for numbers greater than 1030, while all numbers below 1030 have been verified by supercomputer to satisfy the conjecture; these together imply that the weak conjecture is true (although there is no general proof of it for all numbers). Goldbach's strong conjecture remains unsolved.
This comic plays on the "strong" and "weak" naming of Goldbach's conjectures by extending it to further degrees of strength or weakness. The "very weak" and "extremely weak" conjectures are indeed implied by Goldbach's weak conjecture, just as the weak conjecture is implied by the strong one. The "very strong" and "extremely strong" conjectures are extensions of Goldbach's strong conjecture, even as it is an extension of the weak conjecture. However, the "very weak" and "extremely weak" conjectures are so obviously true that they are hardly worth stating, while the "very strong" and "extremely strong" conjectures make such bold claims that they are obviously false.
Moreover, the "extremely weak" and "extremely strong" conjectures contradict each other, even though they're both derived (albeit in opposite directions) from the same initial conjectures.
http://www.explainxkcd.com/wiki/index.php/1310:_Goldbach_Conjectures
Quote: 98ClubsTWO is the ONLY even prime discovered.
Do you suspect that there are undiscovered ones?
Quote: 98ClubsNo. Like my statement about "one" thats how I learned... so far its holding up. ;o)
Am I missing some humor here?