9 ms·
Every odd number greater than five is the sum of three primes
- deleted 14y ago[deleted]
- deleted 14y ago[deleted]
- andreaja 14y agoBecause it's there :)
- martin-adams 14y agoBecause any new discovery could open up possibilities that we don't yet understand?
- willvarfar 14y agoOne example of the applicability of number theory is cryptography.
- ColinWright 14y agoThe material on which RSA is based was once thought completely useless, studied for interest alone. You never know when things like this may turn out to be useful.
- glenjamin 14y agoThis question prompts the discussion - which can be a good thing, please don't just downvote because you disagree.
- shardling 14y agoOn the other hand, it's a discussion I've seen over and over and over again. And it's not actually specific to this particular link at all, so it would be reasonable to downvote if you feel the discussion is out of place. And you'll note that currently, ~90% of the comments in this thread are in response to the question -- it's something of an attractive hazard.
- AndrewDucker 14y ago1) Some people enjoy researching it. Therefore it adds to their lives. 2) Some people enjoy knowing about it. The researchers therefore add to these people's lives too. 3) Pure research frequently turns out to have an application later - numerous branches of pure mathematics later turn out to have applications. New knowledge is added to the toolkit we can use to understand the world.
- brey 14y agoentirely in agreement with 3) I know you were answering the question as written, but IMO 1) and 2) are out of place in a discussion about 'value', with the implied context of 'and why are we spending public money on this useless rubbish?'. you may as well replace 'learning about number theory' with 'windsurfing'. sure, it adds to their lives, but it's only the public good that has an impact on the discussion.
- JabavuAdams 14y agoWhy do we build concert halls and stadiums? There's this thing called "culture"... It's hard to define, but you know when it's missing.
- saraid216 14y ago(Note, the original question was deleted, so I can't see context.) The public good most certainly includes the good of the people doing it, though. The notion that those who act on behalf of the public good must commit a sacrifice of their own, individual good is simply wrong.
- deleted 14y ago[deleted]
- brey 14y agoof itself, probably nothing. asking this question is somewhat like driving to your mother's house, looking out the window on the way and asking, "Why the hell am I on a freeway onramp? I didn't want to be here, I want to be at my mother's house!" academic discovery is a journey, building on top of the progress made by others along the way. not all points along that route have intrinsic value. public-key crypto has incredibly high real-world value. most of the things learnt by number theory researchers building up to RSA's discovery - not so much.
- xenophanes 14y agoIn addition to what other people said, some of the methods used to approach the problem may be reused on other problems.
- raverbashing 14y agoWhat does this electron circling an atomic nucleus adds to our lives? It's purely theoretical What does this adding numbers that only can be zero or one add to our lives? It's purely theoretical What does this imaginary number things and the square root of negative numbers adds to our lives? It's purely theoretical
- Trufa 14y agoFirst of all you have to understand that when something is not solved, it's in human nature to try to find a way to solve it, that said, it is also hard to know the implications of a new discovery/demonstration. That said, prime numbers are a very important and discussed topic in math, they also have high implications on computer systems since prime numbers are at the core of many secure systems' implementations. So, when we know something new about primer numbers, new doors may open concerning the generation of prime numbers or the detection of prime numbers, basically it's just that a small step in knowledge, let's see where it takes us.
- Trufa 14y agoFirst of all you have to understand that when something is not solved, it's in human nature to try to find a way to solve it, that said, it is also hard to know the implications of a new discovery/demonstration. That said, prime numbers are a very important and discussed topic in math, they also have high implications on computer systems since prime numbers are at the core of many secure systems' implementations. So, when we know something new about primer numbers, new doors may open concerning the generation of prime numbers or the detection of prime numbers, basically it's just that a small step in knowledge, let's see where it takes us.
- deleted 14y ago[deleted]
- terhechte 14y agoIt would be nice to take a common gadget, say an iPhone or an Android phone, and split it up into small bits and pieces (including software) and then list all the pieces which are based upon a theory or research which decades ago was considered irrelevant and useless. I.e. all the findings which make up an iPhone, but where decades ago people would have said 'what does this add to our life'. What I can think of, right now, is - Cryptography (iCloud, iMessage, Online Banking): Is all based on prime numbers. For hundreds of years, prime number theory in math was considered a purely academic exercise, something with no real world usage at all. And suddenly it is the basis of many things we consider granted. [1] [1] http://www.claymath.org/posters/primes/ http://www.claymath.org/posters/primes/
- laumars 14y agoPure mathematics has a habit of trickling down to real world applications. Sometimes that influence is direct, as seen with cryptography. In fact much of the worlds security is based on prime numbers. eg HTTPS (SSL / TLS) uses RSA. Sometimes that influence is indirect. Such as math theorems that are applied to physics. Which in turn lead to real world products (eg faster processors, GPS, etc).
- ocharles 14y agoThe most famous quote for this is by G. H. Hardy, a famous number theorist. He said: "No one has yet discovered any warlike purpose to be served by the theory of numbers or relativity, and it seems unlikely that anyone will do so for many years." Yet here we are a few decades later with the fundamentals of modern cryptography based on number theory results. Specifically, the difficult in factorizing the product of two primes into the original prime factors (RSA). So while this specific might seem abstract and without purpose, it often goes in mathematics that we'll find the purpose for it later.
- smutticus 14y agoIn Sid Meier's Civilization you can only build catapults after you research mathematics.
- saraid216 14y agohttp://hwhelp.s3.amazonaws.com/hwhdocs/The%20Math%20Behind%20A%20CatapultMay%20General%20Newsletter.pdf http://hwhelp.s3.amazonaws.com/hwhdocs/The%20Math%20Behind%2... [PDF] Pythagoras: why we throw giant rocks at walls.
- Sharlin 14y agoAnd those fancy JDAMs and other GPS-guided toys wouldn't be nearly as accurate if GPS did not account for the effects of both the special and the general relativity.
- brazzy 14y agoThat's physics, not mathematics (let alone number theory).
- altcognito 14y agoBut sometimes we discover the math to support we discover the physics. Knowing the physics alone is less useful (but not useless) than knowing the underlying mathematical relationship of the physics.
- lclarkmichalek 14y agoI'd recommend A Mathematician's Apology for a defense of number theory by someone who was quite prominent in the field. It's slightly dated ("No one has yet discovered any warlike purpose to be served by the theory of numbers or relativity, and it seems unlikely that anyone will do so for many years."), but a lot of it is still relevant, or at very least, interesting.
- ocharles 14y agoWhether or not it's relevant, I still second the recommendation to read this book - it's a great read :)
- dingfeng_quek 14y agoYou ask: 1. Is X good? How is it good? 2. Is it entirely separate from reality? While you might think of it as a simple question, you asked it in the general sense, without any context. In the general sense, these are two central questions in 2 separate domains of philosophy. 1. Ethics/Moral Philosophy 2. Dualism (philosophy of mind). Neither has a simple answer, although you could start form Wikipedia or the Stanford Encyclopedia of Philosophy. Furthermore, the idea and enterprise of science and math is complex. It's not familiar to the layman. Instead, try approaching the question with more familiar ideas: Think of a person who doesn't use Facebook at all. 1. What does Facebook add to his life? 2. As far as he can see, Facebook is a purely virtual social network, isn't it? 3. Why is it worth everyone's time to check/use Facebook? Think about it from the perspective of a non-Facebook user. Perhaps one of the tribesmen in Africa should you know any.
- aidos 14y agoAs someone who doesn't study this subject, intuitively it seems so unlikely. I would guess that 130 pages of proves is probably a little too much to tackle to try to get a handle on it :) Very curious result though.
- lmm 14y agoAs I understand it this is largely a technical refinement of the argument from Tao's earlier paper http://arxiv.org/abs/1201.6656 http://arxiv.org/abs/1201.6656 , which is a bit shorter and very readable by the standards of such papers (though admittedly not exactly elementary)
- MojoJolo 14y agoHere's the research paper discussing and proves the conjecture. http://arxiv.org/pdf/1305.2897v1.pdf http://arxiv.org/pdf/1305.2897v1.pdf It's a 130 page research paper excluding references mostly containing proofs and formulas.
- MojoJolo 14y agoCuriosity. With this 130 page research paper, I'm really curious what's its application in the near future. I'm sure there will be, I'm seeing this in the branch of cryptography. I'm imagining it to be implemented like a public-private key. Maybe the odd number can be the private key. And three prime numbers can be the public keys. The hash can't be decoded by just the single public key. It needs all three of the public key to decode the hash. Well, with just abrupt thinking, I think it can be more secure? (Not really sure about it though. Just a guess.)
- lmm 14y agoI don't see such an application; given a number which is known to be a sum of primes it's very easy to reverse this and extract the primes (unlike multiplication, which is how RSA works). And for practical cryptography processes it's always been perfectly reasonable to assume the goldbach conjecture - even though there's no formal proof yet, it's true in such an overwhelming majority of cases that you really wouldn't worry about hitting a counterexample, the odds are far smaller than e.g. a hash collision.
- Retric 14y agoIf you add three large primes I don't see how you could quickly reverse that process. May be possible that several set's of 3 primes also sum to that number so you would need a process for finding all of them.
- lifeisstillgood 14y agoThe known prime number - (3 + 5) ? This is extremely amenable to a rainbow attack - just start here, http://primes.utm.edu/lists/small/1000.txt http://primes.utm.edu/lists/small/1000.txt.
- CJefferson 14y agoThis is less amenable to a rainbow attack than cracking RSA. When cracking RSA you have to factorise a number N into P.Q, so you only have to check up to sqrt(N). With this, you have to get 3 numbers, and check up to N/3.
- asdr 14y agoSuch papers MUST include source code available for further research activities.
- deleted 14y ago[deleted]
- rdl 14y agoThis sort of terrifies me. I know there's no known connection to factoring, but still.
- arethuza 14y agoReally? I thought it was fascinating and spent a few minutes running through some examples... Quite a sensawunda moment.
- deleted 14y ago[deleted]
- rdl 14y agoMy only real interest in number theory is applied number theory; i.e. the basis of many schemes of asymmetric cryptography.
- phillmv 14y agoWell… the weak Goldbach conjecture has been known for a couple hundred years and my understanding is it's one of those things we've suspected was true but just never found a solid way to prove that it was so. This is a neat result, but no one's surprised, per se.
- nicknash 14y agoInteresting that it involved a significant computational effort in verifying the GRH up to a large finite constant.
- igravious 14y agoAnd also that, among others, the four-colour theorem's only known proof is a computerized check of hundreds of cases. Will this increasingly be the case? Is this the way mathematics is going? Will any sufficiently difficult problem from now on require a computational step? Does that mean that mathematicians until now were using the non-computational subset of mathematics?
- lquist 14y agoCan a mathematician explain the significance of this result please?
- ColinWright 14y agoBriefly ... To a large extent the primes appear to be distributed in a manner indistinguishable from randomly. There seems underneath to be no reason to believe that there are results like this. If they were random then there might be numbers that cannot be expressed as the sum of 3 primes, but somehow every number ends up so expressible. Why should that be true? Indeed, is it true? This result says it is true, but we really don't see why. Understanding how the primes are distributed may have far-reaching implications for cryptography, and possibly even for solving things like the TSP. We just don't know, just as we initially never suspected that public-key cryptosystems were possible, and would involved primes. Random matrices is another area where a lot of research was done just because people found it an interesting problem, and now there appear to be deep connections with practical physics that may allow us to further bend the world to our will. Sometimes it's the chase that's exciting, never knowing what may turn out to have world-changing implications.
- cscheid 14y ago> We don't really see why. Huh? if the proof holds, that's precisely what it does. The proof might be delicate enough to not apply in other settings, so our wider intuition about prime numbers might not be enriched (at least not immediately). Still, a correct proof is very much a formal explanation? And, what's the connection between TSP and prime numbers? I thought the current consensus in complexity is that the factoring is likely not NP-hard, but not in P either.
- ColinWright 14y agoNo, the proof will show us that it's true, but that's not the same as understanding why it's true. There's a difference that most mathematicians grok, but can be hard to see from the outside. And I don't know if there's a connection between primes and TSP, but people never suspected a connection between modular forms and elliptic curves, either. And this result may have nothing to do with factoring, but the techniques may give better approximation algorithms for things that are NP Hard. That's the point, we really don't yet know what this result, but more particularly, what these proof techniques will yield.
- CurtMonash 14y agoOne of the amazing things about mathematics is that you'd like to work in one branch and wind up working in another. E.g., who knew before Riemann that number theory would often wind up being an exercise in calculus of one complex variable? The example perhaps best known to non-mathematicians is that there were two formulations of quantum mechanics, namely in group theory and in partial differential equations, and they turned out to be pretty much the same thing. -------------------------------- Come to think of it, that's been a great lesson for me in business life. I come in supposedly to consult about one kind of problem, and really wind up addressing a different subject entirely.
- chii 14y agoi find it more amazing that some seemingly completely unrelated things are somehow deeply connected (and unintuitive connected), and in reality are two facets of the "same object".
- X4 14y agoIt appears like the constant flux that the new discoveries provoke fruit in better and better solutions. This is utter joy, the heist for more knowledge. Evolutionary and peer reviewed improvments :)
- sytelus 14y agoFrom Wikipedia: Goldbach's conjecture is one of the oldest and best-known unsolved problems in number theory and in all of mathematics. If this proof is correct then it's a bigger deal than Fermat's Last Theorem.
- lquist 14y agoThis is a proof of Goldbach's weak conjecture (http://en.wikipedia.org/wiki/Odd_Goldbach_conjecture http://en.wikipedia.org/wiki/Odd_Goldbach_conjecture), not Goldbach's (strong) conjecture.
- deleted 14y ago[deleted]
- chiaro 14y agoWhat are the other practical applications of number theory, primes and this the results in the paper outside cryptography?
- ximeng 14y agoAlso interesting work on twin primes this week: http://www.nature.com/news/first-proof-that-infinitely-many-prime-numbers-come-in-pairs-1.12989 http://www.nature.com/news/first-proof-that-infinitely-many-...
- sold 14y agoTerence Tao's post https://plus.google.com/114134834346472219368/posts/XESxA9bL5um https://plus.google.com/114134834346472219368/posts/XESxA9bL... However, in absence of a preprint, it's IMO too soon to make announcements.
- Zenst 14y agoTrue, especialy given we don't know the largest prime closest to infinity, but whilst not a formal mathmatician (autistic) it is true. Just needs simpler explanation as anything more than a page is probably over detailed in my oppinion. But I can understand why it is as long. Still all 133 pages already exist somewhere in Pi's infinite digits, and how many pages would it take to prove that one :-).
- dEnigma 14y ago"the largest prime closest to infinity" What do you even mean by that?
- Zenst 14y agoSorry, probably not the best way to point out that we do not know what the largest prime is as we constantly keep proving larger known primes and by that they are infinite and expressed as infinity being the largest possible ever number. Hope that explains what I mean't by that term you quoted now.
- jhart3333 14y agoThere is no largest prime. In fact the classic proof that there are infinitely many primes starts with the assumption that there is a largest prime and proceeds to use this number to construct a larger number which is also prime. This is a contradiction: "this is the largest prime" and "this is not the largest prime." So the original assumption must be false and "there is no largest prime" or equivalently "there are infinitely many primes". Recently it has been shown that this proof is a result of misunderstanding the one given in Euclid's Elements. Nevertheless it's still a fine proof.
- jart 14y agoOh my god this is so much math http://arxiv.org/pdf/1305.2897v1.pdf http://arxiv.org/pdf/1305.2897v1.pdf
- deleted 14y ago[deleted]
- kokey 14y agoWill this be useful for PKI encryption?
- Zenst 14y agoI thought this was already know, been using in a pet project for a few years, though I don't use numbers near infinity and with that you have to give the chap credit as it is due. Shame it is not a prime number of pages as well and simpler in explanation. Maybe for his next paper he could do: "Every even number greater than five is the sum of three primes and one" Though one is a funny prime and with that I did not say four primes too keep the peace. Can reference his previous paper and with that get two papers for less than 134 pages compared to only one proof for 133 pages. No I can't say what my pet project is, not everybody does lottery tickets ;).
- grimman 14y ago"numbers near infinity" is such a neat thing to say, because you're always going to be wrong. Or are you? ;)
- Fargren 14y agothough one is a funny prime and with that I did not say four primes too keep the peace. One is not prime. A prime number is a natural number p (positive integer) p>1 that has only the two divisors 1 and p [1]. [1]http://www.encyclopediaofmath.org/index.php/Prime_number http://www.encyclopediaofmath.org/index.php/Prime_number
- gizmo686 14y agoIt is not unreasonable to construct prime numbers to include 1. It is just that, over time, the mathametics community came to the consensus that the set of primes that does not include 1 is more useful. If primes were constructed to include 1, math would not be seriously different, we would simply have to say 'prime greater than 1' when we want to exlude one. The same way that we often have to say x/=0 when we divide by x.
- frontfor 14y ago> I thought this was already know, been using in a pet project for a few years You were merely assuming that the conjecture is true. Actually proving it is a non-trivial task. Oh and I look forward to hear your "simpler explanation", given that you have been using it "for a few years" ;)
- lifeformed 14y agoWhy greater than 5? Don't 3 and 5 work as well? 3 = 1 + 1 + 1 5 = 3 + 1 + 1 Or do they mean different primes? EDIT: Oops, I forgot about 1 not being prime.
- mcherm 14y ago1 is not considered prime.
- ArikBe 14y agoOne is not prime. http://primes.utm.edu/notes/faq/one.html http://primes.utm.edu/notes/faq/one.html
- theIV 14y agoI think it depends on what school of thought you are coming from, but generally 1 is not considered a prime.
- iTrollFreely 14y agoonly in the school of i-failed-math. 1 is not prime. no general consideration required.
- winthrowe 14y agoI haven't read the paper, but in other 'fun with primes' exercises, 1 is often excluded.
- yock 14y agoNot to be a "pile on", but Numberphile did a great video on why 1 is not prime. http://www.youtube.com/watch?v=IQofiPqhJ_s http://www.youtube.com/watch?v=IQofiPqhJ_s
- mratzloff 14y agoI understand "we got tired of saying 'excluding 1'", but I still don't grasp how the product of zero primes is 1 and not 0.
- deleted 14y ago[deleted]
- postit 14y agoCan't wait to use this to prove that are infinite primes. :P
- deleted 14y ago[deleted]
- deleted 14y ago[deleted]
- michael_nielsen 14y agoVery amusing. Here's a proof by contradiction, for the record. Assume that there are only a finite number, n, of prime numbers. There are at most n^3 distinct odd numbers that can be formed as a sum of three of those primes. But n^3 is finite, and so the number of odd numbers must be finite, which is, of course, false, and so our original assumption must have been false. QED There are some hilarious variations on this theme (using difficult theorems to prove simple facts) here: http://mathoverflow.net/questions/42512/awfully-sophisticated-proof-for-simple-facts http://mathoverflow.net/questions/42512/awfully-sophisticate...
- SatvikBeri 14y agoAssume there are a finite number of primes. Let p be the largest prime. Then 3p+2 is an odd number > 5, so it must be expressible as the sum of 3 primes. But since p is the largest prime, the sum of 3 primes can never be larger than 3p, contradiction.
- deleted 14y ago[deleted]
- deleted 14y ago[deleted]
- ajuc 14y agoSo we now can take 2 greatest known prime numbers, substract them from some HUGE odd number (bigger than (both these prime numbers) * 2 + 1), and we have a new greatest known prime number? Or am I missing sth? EDIT: ah, I get it now, it's sum of SOME 3 prime numbers, but not neccesarily these 2 that I've choosen to make it and another one, it may be 3 completely different primes
- Aushin 14y agoI don't believe that would work. Because it doesn't specify that it's the sum of ANY three primes. For example, you can't take 21, subtract 7, subtract 5 and say that you have a prime. It has to be two specific primes.
- azakai 14y agoNot every sum is of three primes. 15 = 5 + 5 + 5 which are three primes, but 15 = 2 + 3 + 10 which are not. The theorem says there there is such a sum, not that all sums are of that form.
- deleted 14y ago[deleted]
- wcfields 14y agoWell, duh, of course it's every odd number greater than Five.... Because Seven eight Nine. I'll be here all week folks. Try the fish.
- wyck 14y agoAt this point it's not about practical applications. I find the idea that number's (number theory, primes, etc) could be Platonist very interesting, meaning it's existence could be outside ourselves and not an archetype. In other words, a mathematical structure doesn't describe a universe, it is a universe. Ya I know, It sounds very "hippy".
- erikb 14y agoIt's a proof. That doesn't say it's true.
- danbruc 14y agoIt is absolutely mind-blowing how much time and passion humans have invested in understanding the consequences of nine simple statements...and how hard they resist against unveiling their secrets. 0∈ℕ ∀x∈ℕ:S(x)∈ℕ ∀x∈ℕ:S(x)≠0 ∀x,y∈ℕ:S(x)=S(y) ⇒ x=y 0∈X∧∀x∈ℕ:(x∈X ⇒ S(x)∈X) ⇒ ℕ⊆X x + 0 := x x + S(y) := S(x + y) x · 0 := 0 x · S(y) := x · y + x These are the Peano axioms [1] defining the natural numbers with addition and multiplication. And for at least 3000 years humans are tying to figure out properties of these natural numbers, all consequences of these definition, and the end is not in sight. [1] https://en.wikipedia.org/wiki/Peano_axioms https://en.wikipedia.org/wiki/Peano_axioms
- dmvaldman 14y agoIt's not so surprising. This could also be summarized as "God created the integers." But really the process is reversed: given arithmetic, what is the smallest axiom set to give us the power to prove our theorems. It's like, given all code, what is the smallest language we can use to express it. Which is sequences of 0s and 1s.
- zwegner 14y ago> It's like, given all code, what is the smallest language we can use to express it. Which is sequences of 0s and 1s. This should be of interest: https://en.wikipedia.org/wiki/Binary_lambda_calculus https://en.wikipedia.org/wiki/Binary_lambda_calculus
- cscurmudgeon 14y agoI wouldn't say they define the natural numbers. A more apt phrasing would be "describe the natural numbers." They are more like the laws of physics for the natural numbers. Also, there are easily understandable theorems about the natural numbers not provable from the Peano axioms. http://en.wikipedia.org/wiki/Goodsteins_theorem http://en.wikipedia.org/wiki/Goodsteins_theorem
- strangestchild 14y agoHow then are the naturals defined? By the Von Neumann construction? (0, {0}, {0, {0}}, ...)