Slashdot Mirror


Mathematician Claims Proof of Riemann Hypothesis

TheSync points to this press release about a Purdue University mathematician, Louis de Branges de Bourcia, who claims to have "proven the Riemann hypothesis, considered to be the greatest unsolved problem in mathematics. It states that all non-trivial zeros of the zeta function lie on the line 1/2 + it as t ranges over the real numbers. You can read his proof here. The Clay Mathematics Institute offers a $1 million prize to the first prover."

561 comments

  1. If there's one thing I know by Anonymous Coward · · Score: 5, Funny

    It's that mathematicians love to exaggerate! Like infinity is infinite, or pi goes on forever! Those guys are always talking big.

    1. Re:If there's one thing I know by Anonymous Coward · · Score: 2, Funny

      Wooaahhhh!!!! Next he'll be solving problems that are NP-Complete. We'll have to re-write all our textbooks!

    2. Re:If there's one thing I know by PeeCee · · Score: 5, Informative
      Next he'll be solving problems that are NP-Complete. We'll have to re-write all our textbooks!

      Not to spoil your joke or anything, but actually, AFAIK, NP-complete problems are perfectly solvable. The problem is how long it takes to solve them in general (a certain instance of a problem could prove easy). They cannot be solved deterministically in polynomial time (i.e., quickly).

    3. Re:If there's one thing I know by Ckwop · · Score: 4, Interesting

      De branges is a bit of a crank on the Riemann hypothesis. No-one believes his approach(s) will work. This is well documented in the book "Riemann's Zeros". When some of the leading mathematians were asked about his approach they said it was "full of errors" and "unlikely to work". The only reason he is given the light of day is because he managed to prove to the Bieberbach conjecture. That was a difficult problem, hats off to him for getting it aswell, but it's no Riemann hypothesis!

      Rest assured, we'll all be dead and burried when it actually gets solved.

      Simon

    4. Re:If there's one thing I know by zonker · · Score: 1, Funny

      umm... okay. so how is this going to help us with flying cars and hoverboards?

      ie, what are the practical uses of this other than for writing books about it?

    5. Re:If there's one thing I know by gtall · · Score: 1

      I don't know the answer to that, but what was the practical significance of Einstein's work on quantum theory...back in 1910-1920...you know, before anyone thought of computers and silicon and quantum effects in very small circuits?

    6. Re:If there's one thing I know by Anonymous Coward · · Score: 0

      PI, well part of it I guess...close enough.

    7. Re:If there's one thing I know by Anonymous Coward · · Score: 0

      actually, AFAIK you are wrong in most cases...you might even say in general...

    8. Re:If there's one thing I know by Anonymous Coward · · Score: 1, Insightful

      yeah but back then it was new and people could recognize it would be useful someday (Nobel prize in 1921) but this everybody assumes so a proof really doesn't change much, besides its probably flawed

    9. Re:If there's one thing I know by smallfries · · Score: 4, Informative

      It would appear that mathworld.com agrees with you...

      ----------------

      Riemann Hypothesis "Proof" Much Ado About Noithing
      A June 8 Purdue University news release reports a proof of the Riemann Hypothesis by L. de Branges. However, both the 23-page preprint cited in the release (which is actually from 2003) and a longer preprint from 2004 on de Branges's home page seem to lack an actual proof. Furthermore, a counterexample to de Branges's approach due to Conrey and Li has been known since 1998. The media coverage therefore appears to be much ado about nothing.

      --
      Slashdot: where don knuth is an idiot because he cant grasp the awesome power of php
    10. Re:If there's one thing I know by Hydrogenoid · · Score: 0

      It hasn't been (dis)proven that you can't solve NP-complete problems deterministically in polynomial time. It certainly looks like it is impossible, but the proof has yet to be seen.

    11. Re:If there's one thing I know by PastaLover · · Score: 3, Informative

      NP-Complete problems are by definition problems that can't be solved in polynomial time(at least not by a Turing machine?). However, most problems that are considered NP-Complete are not mathematically proven to be so. Some are though, and the thing with NP-Complete problems is that you can always translate one NP-Complete problem to another NP-Complete problem.

      So in practice, NP-complete problems can be solved (you can solve just about anything by just trying every single solution) but for very big instances you will need several times the age of the universe etc.

      Several other posters in this thread seem to be mistaken about what the term actually means, but they were being so vague I thought I'd write this up. :)

    12. Re:If there's one thing I know by Anonymous Coward · · Score: 2, Informative

      The definition of NP-Complete has nothing to do with whether the problem can be solved in polynomial time. NP-Complete problems are the hardest of the class of problems in the set NP. The set NP is defined as all problems whose solutions can be verified in polynomial time. It hasn't been proven whether or not NP-Complete problems can or cannot be solved in polynomial time. Because of the way the proofs have been constructed, if you can solve any of the NP-Complete problems in polynomial time, you can solve all of them in polynomial time. That's why it is considered unlikely that any of the NP-Complete problems has a polynomial time solution, but it hasn't been proven.

    13. Re:If there's one thing I know by Anonymous Coward · · Score: 0

      "They cannot be solved deterministically in polynomial time (i.e., quickly)."

      Actually, you may or may not be correct on that point.
      An open proof is whether P = NP or P != NP. No proof of either has been submitted to date. I believe there is a prize for this proof as well.

    14. Re:If there's one thing I know by Deliberate_Bastard · · Score: 4, Informative

      The definition of NP-Complete has nothing to do with whether the problem can be solved in polynomial time.

      Not quite correct, because:

      The set NP is defined as all problems whose solutions can be verified in polynomial time

      ...is one of *two* equivalent definitions of the class NP. The other is:

      "Set of all problems which can be solved in polynomial time by a nondeterministic Turing Machine."

      So the question "Does P equal NP?" is also the question "Does an NTM have the same computional power(in time) as a TM, or does it have more?" (It is already known that as far as decidiblity is concerned, TMs and NTM are equivalent.)

      Because of the way the proofs have been constructed, if you can solve any of the NP-Complete problems in polynomial time, you can solve all of them in polynomial time.

      Some more detail here:

      An NP-hard problem is a problem to which any problem in NP can be reduced in polynomial time.

      (Essentially, it can be used as a subroutine for any NP problem, with only a polynomial number of calls. Thus a solution to it is a solution to any problem in NP.)

      An NP-complete problem is one that is:

      1. NP-hard
      2. In the set NP.

      Thus if a polynomial-time solution exists to an NP-complete problem, then P=NP, because a polynomial number of calls to a function that terminates in polynomial time is O({polynomial}*{polynomial}) = O({polynomial}) .

      Please note, however, that not all NP-hard problems are NP-complete.

      --
      NOTICE: This notice will appear at the bottom of all my slashdot posts.
    15. Re:If there's one thing I know by Stephan+Schulz · · Score: 3, Informative
      NP-Complete problems are by definition problems that can't be solved in polynomial time(at least not by a Turing machine?). However, most problems that are considered NP-Complete are not mathematically proven to be so. Some are though, and the thing with NP-Complete problems is that you can always translate one NP-Complete problem to another NP-Complete problem.
      Sorry, but you got things mixed up.

      NP problems are problems that can be solved by a Nondeterministic Turing machine in Polynomial time. NP-Complete problems are the class of "hardest" problems in NP. All the usual suspects (Traveling Salesman, 3-SAT, SAT, ...) are proven to be in NPC.

      We know that we can solve NPC problems in exponential time (as we can simulate a non-deterministic Turing maschine on deterministic hardware with exponential overhead). What we do not know is if there is any smarter way. That is the P=?=NP question.

      --

      Stephan

    16. Re:If there's one thing I know by mblase · · Score: 1

      The only reason he is given the light of day is because he managed to prove to the Bieberbach conjecture

      You must mean "given the time of day". Professional mathematicians have better things to do than expose themselves to the Great Yellow Evil in the Sky.

    17. Re:If there's one thing I know by Anonymous Coward · · Score: 0

      "Much Ado About Noithing"? Noithing, eh? Sounds like a 3 Stooges clip to me, nyuk nyuk nyuk!

    18. Re:If there's one thing I know by merlin_jim · · Score: 1

      You are correct sir.

      Basically, the theory (unproven) is that an NP complete problem can only be solved in polynomial time if an oracle function exists.

      To say another way, an NP complete problem is one such that an algorithm cannot differentiate between useful and unuseful avenues of research without having a way to determine the result of the research being done; as far as we know, prognostication is the only way to do so.

      All bets are off in the case of quantum computing, of course.

      --
      I am disrespectful to dirt! Can you see that I am serious?!
    19. Re:If there's one thing I know by saforrest · · Score: 3, Informative

      NP-Complete problems are by definition problems that can't be solved in polynomial time(at least not by a Turing machine?).

      No, you're wrong. NP problems are, by definition, problems that can be solved in polynomial time by a nondeterministic Turing machine .

      Essentially this means that a Turing machine could solve the problem in polynomial time, if it had some magic 'oracle' which instructed it on the right computational path to follow for a given input.

      Obviously there are problems out there that would require exponential time for even a nondeterministic Turing machine to solve. An example from the Wikipedia link I provided is finding the best move in a chess or Go game.

      Such problems are not in NP, and proving P=NP would not suddenly give us algorithms for solving these problems deterministically in polynomial time.

      However, most problems that are considered NP-Complete are not mathematically proven to be so.

      What? Sorry, if there ain't a proof, it ain't NP-complete. There are a lot of problems that are described as "believed to be NP-complete", but that's different.

    20. Re:If there's one thing I know by mikeee · · Score: 1

      Would a working quantum computer be equivalent to a nondeterministic Turing machine?

    21. Re:If there's one thing I know by Lodragandraoidh · · Score: 2, Insightful

      This whole thread is precisely why Computer Science should have never been allowed to fall into the Mathematics Department.

      How many practical computing problems have I run into in my carreer that have been NP complete? 0 - in 10+ years.

      99.999% of the computer science graduates will not have to deal with this issue - which is mainly concerned with or cutting edge theoretical issues (for example, how to do ray tracing in real time in a video game). Most programming is algorithmic, rather than mathematical, and what little math is needed is generally polynomial or matrix transformations.

      In many instances rigorous mathematics isn't needed at all, and fuzzy logic or rules of thumb can be used effectively to get the job done. However, due to computer science being tied at the hip to mathematics, people are getting educations which don't mesh with the reality they see in the business world (where 85% - give or take - of the graduates will end up).

      I propose the 2 following divisions of computer science:

      Theoretical Computing - the mathematics ladden branch - includes logic design and engineering, as well as software to support 'deep science' in peripheral disciplines as well as applied to computing and theoretical mathematics.

      Algorithmic Computing - the art of computer programming and system integration. This is the trial and error, get your hands dirty department.

      Finally, I don't know if I like the idea of having a seperate Information Technology curriculum in the business department. From my experience, I always end up having to teach these folks new on the job things that I learned in school (if they need to learn it, they should pay for learning it - praticularly if they end up with a salary equivalent to mine). They are getting an incomplete education that is not useful in an environment where systems integration is the norm, and thus being a jack of all trades is more important than being able to write an SQL query or kick out a Cobol program to calculate the depreciation of someone's stock portfolio.

      --

      Lodragan Draoidh
      The more you explain it, the more I don't understand it. - Mark Twain
    22. Re:If there's one thing I know by Anonymous Coward · · Score: 0
      Sorry, if there ain't a proof, it ain't NP-complete. There are a lot of problems that are described as "believed to be NP-complete", but that's different.


      No, SAT3 was in fact proved to be NP-complete. All the other usual suspects have been shown to be equivalent to SAT3 and thus also NP-complete.

    23. Re:If there's one thing I know by Anonymous Coward · · Score: 0

      Theoretical Computing => Computer Science
      Algorithmic Computing => ITT Technical Institute

    24. Re:If there's one thing I know by curri · · Score: 1

      > How many practical computing problems have I run into in my carreer that have been NP complete? 0 - in 10+ years.

      Of course, that's your career :) but most people actually find those problems a lot. Many optimization problems are NP-Complete. For example Scheduling, or Traveling Salesperson (which is equivalent to many practical problems), or Optimizing SQL queries :).

      Also, the fact that we know they're too hard to solve optimally, we don't even try or use a heuristic method that produces good solutions. If we didn't know, we'd try to brute-force them !

    25. Re:If there's one thing I know by Daniel+Dvorkin · · Score: 1

      Your proposed "Algorithmic Computing" branch would very quickly become the sort of fluffy IT curriculum you decry.

      --
      The correlation between ignorance of statistics and using "correlation is not causation" as an argument is close to 1.
    26. Re:If there's one thing I know by Anonymous Coward · · Score: 0

      Erm.

      You're confusing Computer Science with Computer Engineering, Software Engineering and Information Systems.

    27. Re:If there's one thing I know by Deliberate_Bastard · · Score: 1

      This whole thread is precisely why Computer Science should have never been allowed to fall into the Mathematics Department.

      It wasn't "allowed to". Computer science came from mathematics in the first place.

      How many practical computing problems have I run into in my carreer that have been NP complete? 0 - in 10+ years

      This isn't very meaningful to us unless you tell us what it is you do.

      In fact, NP-hard problems are not abtruse things that exist only in the minds of researchers. They are quite common. Most problems in the field of AI are at least NP-hard, if not PSPACE-hard.

      99.999% of the computer science graduates will not have to deal with this issue - which is mainly concerned with or cutting edge theoretical issues (for example, how to do ray tracing in real time in a video game).

      I'm afraid that's a very poorly chosen example. Rendering is in P.

      In fact, issues of complexity theory are dealt with by basic tasks in a great many subfields of comp. sci. The reason most commercial programmers (folks who got their BSCS and got out) never see them is because they are dealt with in system calls and library routines which they call, but do not write, and seldom even read.

      To give you an example, many programmers encrypt things. Many of them are not aware, while doing so, that the whole private key/public key system is based upon the characteristics of NP-hard problems. No NP, no asymetric encryption.

      In many instances rigorous mathematics isn't needed at all, and fuzzy logic

      The way you use this term is a bit unclear. Are you entirely sure you know what it actually means? I find it difficult to imagine that you solve most problems by coding Bayesian reasoning agents...

      rules of thumb can be used effectively to get the job done.

      I am afraid this is the very attitude that leads to the production of a lot of very, very bad code.

      However, due to computer science being tied at the hip to mathematics, people are getting educations which don't mesh with the reality they see in the business world (where 85% - give or take - of the graduates will end up).

      Now I'm going to have to be blunt and just say you're dead wrong.

      You seem to be under the impression that academic research isn't "real", and that business is "reality". In actuality, computing in the business sector is a hothouse flower, which could not have sprouted, and would not continue to grow and thrive, without the tending and care given to it, for free, by research/theoretical/academic computer science.

      The everyday benefits of this allegedly "abtruse" research surround you every day; they permeate your world. Without them, you have no operating system, no compiler, no VLSI-designed CPU, no heirarchical cache, no network computing, no internet, no Google, no...

      But I digress. The point is that academic computer science has done its job almost too well, so well that the people who use its largesse every waking hour of their lives are largely unaware of whence these magical benefits came.

      You are taking the stance of a man who kicks the tree whilst munching on an apple.

      --
      NOTICE: This notice will appear at the bottom of all my slashdot posts.
    28. Re:If there's one thing I know by Jerbiton · · Score: 1

      While I agree with what you say, I just feel compelled to add a little something:

      > To give you an example, many programmers
      > encrypt things. Many of them are not aware, while
      > doing so, that the whole private key/public key
      > system is based upon the characteristics of NP-hard
      > problems.

      I assume you are referring to the difficulties involved in factoring large numbers. While that problem (deciding composites) is a tough one, I don't think it has been proven to be NP-hard.

      IIRC, it's a bit of an odd one by being polynomial-time reducible to its complement problem of deciding primes. Since these are both members of NP, an NP-hardness proof for either problem would mean that both are in NPC and coNPC, which would prove identity between NP and coNP.

      While that would be nice, I think it would be a tad optimistic to assume it is possible. Try to reduce an NPC problem to primes, you'll see what I mean.

    29. Re:If there's one thing I know by Deliberate_Bastard · · Score: 1

      I assume you are referring to the difficulties involved in factoring large numbers. While that problem (deciding composites) is a tough one, I don't think it has been proven to be NP-hard

      No, I am not. I am refering to (G to the X mod P). Nobody bases encryption on prime factorization any more.

      IIRC, it's a bit of an odd one by being polynomial-time reducible to its complement problem of deciding primes.

      Actually, you don't recall correctly. Prime factorization is not polynomial-time reduceable to deciding primes...unless P=NP. This is because deciding primes is in P.

      Try to reduce an NPC problem to primes, you'll see what I mean.

      Been there. If we could do that, then P=NP=coNP.

      --
      NOTICE: This notice will appear at the bottom of all my slashdot posts.
    30. Re:If there's one thing I know by Lodragandraoidh · · Score: 1

      Most problems in the field of AI...

      You guys must all be in research or universities. I don't have a single system that I work with that uses AI - and I doubt 99.999% of the programmers out there in the business world do either. Most people deal with storing and retrieving data, and displaying that data in a meaningful way (creating information from the data).

      The assumption that heuristics lead to poor programs is false. This gets to the core of the problem: the mathematics field is too invested in exact proofs. On the other hand, in reality - where the rubber meets the road - that level of accuracy is not attainable most of the time due to incomplete and/or imperfect data. Why adhere to something that does not represent reality?

      Rather than basing our development model on mathematical rigor, we should instead look to the most complex thinking system in the world: human beings. We go blissfully through life dealing with contradictions, incorrect and incomplete information with ease. Our software designs should emulate this behavior, and be as fail safe and robust. What do humans depend upon most often? Heuristics.

      Don't get me wrong (and I think some of you have) I am not advocating an abandonment of mathematics in computing. On the contrary. The key issue is that we, as CS graduates, must walk a fine line - a middle way - where we pick and choose when to use one method over another. My point is we have a tendency, due to the culture of the Mathematics department, to put more emphasis on proving our algorithms are correct - rather than getting any practical tools in user's hands. We are not working with marble; computer programs are extremely maleable objects - user feedback can drive the heuristic model as we shape the system over time. Thinking - which is what a computer emulates - is not all about math. We must realistically balance the two methods without becoming zealously attached to either.

      --

      Lodragan Draoidh
      The more you explain it, the more I don't understand it. - Mark Twain
    31. Re:If there's one thing I know by illuminatedwax · · Score: 1

      Sorry, but Computer Science started in the Math Department and should stay tied to the Math Department. It's always better to know why and how something works, rather than just know that it works. Computer Science is no exception. The study of algorithms in itself is a definite mathematical pursuit.

      Computer scientists should be more than electricians.

      --Stephen

      --
      Did you ever notice that *nix doesn't even cover Linux?
    32. Re:If there's one thing I know by Lodragandraoidh · · Score: 1

      The problem is the imbalance between the focus on the 'how and why' at the expense of recognizing other methods that would be more appropriate in a given situation.

      There is a battle that is raging now between the old school 'process' camp (waterfall development is the only way to do development), and the extreme programming camp that is emblematic of the problem. The process people do not want to change and see xtreme programming as undisciplined and unscientific. The xtreme camp sees the benefit that tight feedback loops can provide for software development.

      Historically, when computers first were developed, the need for rigorous attention to accuracy was necessary. Why? Due primarily to the jobs these early machines performed: number crunching.

      Later computers were put to the task of storing and organizing textual data. Today most of the work done by computers falls into this category - and the data types have expanded to include multimedia objects. Furthermore, the complexity of these systems has gone up due to the need to tie many disparate systems together.

      This will be the most common computer programing and development work in the future - as stand alone distributed applications give way to mesh/grid systems.

      We need to be training people today to work in these environments.

      Will a narrowly defined Computer Science cirriculum support this? No. I was a CS major - and I learned over 50% of what I needed to do the job. The focus on mathematical rigor was only 5% of my day to day job - whereas it was 80% of my university training.

      Will a narrowly defined Information Technology cirriculum do the job. No. As I said, having trained these people - they do not have the deeper skills to succeed at the task.

      This is why I would recommend something else - keep the technical degree for those who will be involved in pushing the frontiers of computer science, but 'beef up' the IT/CIS cirriculum to make that degree more applicable to the reality that is fast approaching. The reason I went the CS route in the first place was because the IT/CIS cirriculum was so flimsy. Sadly, the CS course work was beyond what I needed - also leaving a gap. What I propose is to fill that gap - because that gap is where most of the students will be working after they graduate.

      --

      Lodragan Draoidh
      The more you explain it, the more I don't understand it. - Mark Twain
    33. Re:If there's one thing I know by illuminatedwax · · Score: 1

      I think you want a tech school or something. What a good CS curriculum will do is not teach you any one language or area of computer science. What it should do instead is teach you how to adapt quickly to any computer environment. Teaching you the mathematical concepts behind computer science does this.

      Now, I'm not sure where you went, so I'm not sure what exactly you mean by a "mathematical rigor" - you could have gone to Purdue or MIT (or in my case U of C), both excellent schools, but for example, you'd get much more math at MIT than Purdue.

      I certainly wouldn't expect most normal tech jobs to require more than 5% mathematical rigor, but the 5% of your time that you spend on that goes a long way. Without that 80% of your univerisity studies, you wouldn't be able to do all of that 5%. That 5% is important.

      --Stephen

      --
      Did you ever notice that *nix doesn't even cover Linux?
    34. Re:If there's one thing I know by ZiggyM · · Score: 1

      Ive also had 10+ years of programming experience, but I do not think the parent post is correct. Comp. Sci should be tied to Math as it currently is. Sure most programming jobs dont need that much science, but for that you can also go to a technical 2-year programming course and skip all the science part. This is true for most careers where you dont specialize.
      Some of the toughest algorithms do need such math and the people that continue on to their masters/PhD in Comp.Sci really need that math to create/improve those algorithms. To show an example, I dont think Google hiring dept. would consider a resume that didnt have such knowledge (and thats why I didnt send them mine :)

    35. Re:If there's one thing I know by Lodragandraoidh · · Score: 1

      What it should do instead is teach you how to adapt quickly to any computer environment.

      Agreed.

      Teaching you the mathematical concepts behind computer science does this.

      Understanding computer architecture does not require calculus. Learning how to use the most effective algorithm does not require math - except in the most narrow of problem domains that few developers ever have to enter. Usually algebra or precalculus is sufficient for most mathematical problems encountered - perhaps a bit of statistics thrown in on the side.

      I'm not sure where you went, so I'm not sure what exactly you mean by a "mathematical rigor"...

      For my degree I had to complete the following:

      College Algebra
      Calculus I, II and III
      Linear Algebra
      Statistics I and II

      From my experience, this is more math than I needed. I could have spent some of those 21 hours on Computer Science electives that would have been more useful to me from a practical standpoint when I entered the job force. All of that math should not have been required - some of it, yes; all of it - no.

      The real issue here is that a university education is not designed to prepare you for the work you will be doing in the real world. The people who develop the cirriculi are too far removed from that world.

      --

      Lodragan Draoidh
      The more you explain it, the more I don't understand it. - Mark Twain
    36. Re:If there's one thing I know by illuminatedwax · · Score: 1
      For my degree I had to complete the following:

      College Algebra
      Calculus I, II and III
      Linear Algebra
      Statistics I and II

      Yuck. Yuck yuck yuck. Besides Linear Algebra, none of those things are Computer Science mathematics. Were those part of a liberal education core or part of the CS degree? Here's what I had to take (and this is at the U of C; a very theory-heavy CS program):

      Calculus 161,162,163 (Calculus thru Spivak; lots of proofs. This was required by core, not by the CS dept.)
      Linear Algebra
      Discrete Mathematics
      Algorithms
      Computability & Complexity Theory

      and that's it. But that can get to be heavy stuff (especially since Lazlo Babai was teaching Discrete and Algorithms). You use the stuff you learn in these classes way more than you would ever use calculus or stat. I do like that I took the calculus course because that course taught me how to prove things ("real" math).

      Believe it or not, these courses are math, and they are useful. It sounds like what you took was more of a college "core" or some kind of curriculum all "science and math" majors took rather than something you need for CS.

      --Stephen
      --
      Did you ever notice that *nix doesn't even cover Linux?
    37. Re:If there's one thing I know by Lodragandraoidh · · Score: 1

      Its been a while - I probably left some things off.

      Computability was covered in a Datastructures and Algorithms course that I don't remember being very heavy on math. For that matter Algorithms were covered in the same course - as the name implies. I didn't consider this course a 'math' course.

      I also had to take a discrete math - I forgot that one - I don't remember that being very difficult - and I don't remember considering it 'math' as much as 'logic' - to my mind apples and oranges (logic, boolean algebra, etc) . In addition, I had a mandatory logic design course that built upon that knowledge, but wasn't too math intensive (the design of physical circuits - basically simple microchip design) - although if you messed up the math, your circuit wouldn't work in the simulator.

      You could be right about the 'core' science majors needing calculus, versus it being a CS specific requirement - I am 40, so my mind could be starting to decay. :p

      'Computer Science' math - didn't really seem like math to me (in comparison to calculus, for example) - and is something I would want to see CIS students taking, as well - which I do believe would make them better programmers. Understanding logic and computer architecture is key, in my mind.

      Maybe its just a mental hangup for me - or maybe I just lucked out and got cruddy Calculus teachers...?

      --

      Lodragan Draoidh
      The more you explain it, the more I don't understand it. - Mark Twain
    38. Re:If there's one thing I know by Jerbiton · · Score: 1

      Well, this was certainly interesting...

      Actually I *did* recall correctly, but as it turns out, my complexity theory courses and books predate the primes-is-in-P proof, so I'll update my view of the relationship of the complexity classes. Thanks for the heads-up!

      Also, I'm apparently guilty of having confused the factorization problem with the complement of the primes problem. Mea culpa. I'll maintain that primes is polynomially equivalent to co-primes, though. =)

      If anyone needs me, I'll be over in the corner revising my view of the world.

    39. Re:If there's one thing I know by illuminatedwax · · Score: 1

      I think what you call math is simply raw calculation - something "real" mathematicians don't like doing.

      "Real" math is Thm-Pf Thm-Pf Thm-Pf. Wonder what your calculus profs do with their research? Solve proofs. Proofs have just as much to do with logic as they do math.

      That's because Math is Logic, simple as that. In discrete, you probably learned about combinatorics and graph theory. Those are well-established mathematical fields. When you learned about algorithms, you looked at how to analyze an algorithm and how to prove it worked - that's math. When you learned computability theory, you were learning the basics of a very new field of mathematical study, started in the CS field by Turing and continued by Cook-Levin, etc. Those theoretical results are very much mathematical and very much useful.

      What you got was "how to do partial fractions" and "how to do the chain rule" and "how to integrate stuff" and "how to use the integration table in the back of your book." That's boring stuff. What is interesting is how those techniques were invented and proven to work.

      --Stephen

      --
      Did you ever notice that *nix doesn't even cover Linux?
    40. Re:If there's one thing I know by Deliberate_Bastard · · Score: 1

      You guys must all be in research or universities.

      Indeed I am. Perhaps you could enlighten me on what it is you do? Then I'd have a better idea where you're coming from, here.

      Rather than basing our development model on mathematical rigor, we should instead look to the most complex thinking system in the world: human beings. We go blissfully through life dealing with contradictions, incorrect and incomplete information with ease. Our software designs should emulate this behavior, and be as fail safe and robust. What do humans depend upon most often? Heuristics.

      Ironically enough, what you have just described is the field of AI, which is all about how we approach problems to complex to solve computationally/mathematically.

      But, as you say, most commercial programmers do not solve problems like that. They solve problems which fall squarely into the realm of the mathematically tractible, and that's what the stuff you seem not to like (algorithm design, complexity analysis) is all about.

      My point is we have a tendency, due to the culture of the Mathematics department, to put more emphasis on proving our algorithms are correct - rather than getting any practical tools in user's hands.

      Now I must confess I am puzzled. What exactly are you advocating?
      Should we change the way we teach computer science? Should we teach SQL instead of O(x)-notation, HTML instead of the pumping lemma?
      Or are you talking about how programs get written?
      What would be the benefit that we think we would derive from writing our programs more inefficiently?

      --
      NOTICE: This notice will appear at the bottom of all my slashdot posts.
    41. Re:If there's one thing I know by Lodragandraoidh · · Score: 1

      Point well taken.

      I guess it is just my perception of math versus logic instead of math is logic that is my achilles heel. Discrete math was a breeze for me, whereas Calculus kicked my arse.

      --

      Lodragan Draoidh
      The more you explain it, the more I don't understand it. - Mark Twain
    42. Re:If there's one thing I know by Lodragandraoidh · · Score: 1

      Perhaps you could enlighten me on what it is you do?

      I work for a telecommunications company. I design and build tools for operational users, and do system integration where needed to glue multiple diverse systems together. I am a jack of all trades.

      most commercial programmers do not solve problems like that. They solve problems which fall squarely into the realm of the mathematically tractible...

      You are right and wrong at the same time. You are right that the problems are computable. However, what you miss is that the reality of tight deadlines prevent you from taking careful mathematical analysis of every aspect of a system. There are plenty of off the shelf systems that are suitable for most applications - both open source and commercial - so at times it becomes a choice between implementation versus acquisition. We have an IT shop that does in house development - but they end up going over budget and missing their milestones on a consistent basis (they are a strict waterfall lifecycle development shop - and I suspect they do all the mathematical computability and algorithm analysis that you advocate for every module). I have come to the conclusion that it is better for me to do my own development in most cases - to the satisfaction of my user community.

      The business world is messy - and marketing departments drive unrealistic schedules - that we as developers must meet regardless, once the decision is made (and believe me, we argue for more realistic timelines, but we are told that the schedules are 'challenging' - and failure is not an option - so we do what we can not to fail). I would hazzard a guess that most of the CS graduates entering the business world are under these same pressures.

      Now I must confess I am puzzled. What exactly are you advocating?

      Given the above reality, the mathematical side of the computer science cirriculum must be balanced with a more artistic emphasis; professors need to look at what is going on in the extreme programming movement - incorporate new ways of thinking about software development outside of traditional patterns.

      Additionally, I think it does a disservice to both the CS and the IS graduates to keep their cirriculas(sic) apart; the IS folks need more of the theoretical side; the CS folks need more of the practical side. Both suffer as a result when confronted with a challenging business environment that requires both. Perhaps there needs to be a third discipline that is neither strictly CS or IS (just throwing ideas out here).

      I don't have all the answers - but I do recognize a problem when I see it. How would you deal with it?

      --

      Lodragan Draoidh
      The more you explain it, the more I don't understand it. - Mark Twain
    43. Re:If there's one thing I know by Deliberate_Bastard · · Score: 1

      I work for a telecommunications company. I design and build tools for operational users, and do system integration where needed to glue multiple diverse systems together. I am a jack of all trades.

      Okay, then I take it you are someone who has taught himself to program, rather than going through a computer science curiculum{sp?}?

      This explains some of your views on what mathematical computer science is; you're going off your impressions based on the way a couple of people with BSCS degrees behave.

      tight deadlines prevent you from taking careful mathematical analysis of every aspect of a system.

      Not really. Time and space complexity analysis should take no more than five minutes for even the slowest of students (and trust me, some of them are dumb as a sack of wet hammers).

      What takes time is designing alogrithms with lower time/space complexity (several large subfields of CS are devoted entirely to this activity).

      Now, it is a mistake to spend too much time designing/finding the lowest time/space complexity alogrithm when a simpler one will do. But when you say:

      they are a strict waterfall lifecycle development shop - and I suspect they do all the mathematical computability and algorithm analysis that you advocate for every module

      ...it makes me suspect that you do not have to clear an idea what this sort of algorithm analysis actually is. It takes five minutes. Really.

      What I think is going on here is that you're frustrated by them spending a lot of time planning and it seems like they're spinning their wheels rather than accomplishing anything.

      Now, in your defense, I will say that it's entirely possible that these guys are not doing a very good *job* of planning, and could probably use some time on the whetstone, but *in general*, what you say about planning vs XP reminds me of a joke I once heard:

      Foreman: What'cha doin', Louie?
      Louie: I'm sawin' these planks, boss... got a bunch of 'em to do!
      Foreman: Ummmmm, yeah... Louie, I can't tell for sure from this angle but it looks like your saw's kinda dull.
      Louie: Eyes of a hawk, boss... I seen better edges on butter-knives!
      Foreman: Ummmm, yeah... so tell me, Louie, if you don't mind my askin'... why don'cha sharpen the saw, then?
      Louie: Oh, I can't do that now, boss... I'm too busy cuttin' these planks!

      You see my point. When a system reaches a certain level of complexity, making something that is properly modularized, well-structured, and easily debugged is analougous to sharpening the saw. It takes a lot of time, but the alternative is worse.

      I don't have all the answers - but I do recognize a problem when I see it. How would you deal with it?

      There's a difference between accidental and essential complexity.

      -Accidental complexity is problems that we create on our own and can be fixed. For example, the complexity of writing and optimizing assembly code can be removed by writing programs in C++.

      -Essential complexity is caused by the problem to be solved, and nothing can remove it. If users want a program to do 30 different things, then those 30 things are essential and the program must do those 30 different things.

      The problem here is that most accidental complexity has already been removed from modern software engineering practices, so there's no magical way to make the rest simpler.

      Turning programming back from a science/engineering field into a craft will definitely NOT help.

      --
      NOTICE: This notice will appear at the bottom of all my slashdot posts.
    44. Re:If there's one thing I know by Lodragandraoidh · · Score: 1

      Okay, then I take it you are someone who has taught himself to program, rather than going through a computer science curiculum{sp?}?

      Yes and no. I am a CS graduate. However, I was writing programs long before I entered the university - having taken a computer science course in Highschool in 1981. So, no - I am not prejudiced out of ignorance - just experience.

      Time and space complexity analysis should take no more than five minutes for even the slowest of students

      Multiply this times hundreds or thousands of modules and millions of lines of code; you can certainly get an overall feel for it (and perhaps that is all that is needed) - but you can not, with any certainty, validate all possible paths through a complex system before writing any code.

      You see my point. When a system reaches a certain level of complexity, making something that is properly modularized, well-structured, and easily debugged is analougous to sharpening the saw. It takes a lot of time, but the alternative is worse.

      I agree 100% with that. However, the team I have to deal with produces buggy, hard to extend, poorly structured applications that don't even meet 50% of the functionality as defined in the functional specs.

      Turning programming back from a science/engineering field into a craft will definitely NOT help.

      I agree. Perhaps I did not explain myself as well as I should have. I am not advocating turning CS into a craft. What I am advocating is bringing those elements of craftwork that are missing from the CS cirriculum into the mix, while keeping the proper level of math. Right now I think the degree is imbalanced; I advocate a balanced approach to make the theoretical and the practical mesh for the benefit of the graduates.

      Every discipline has this to a certain extent: English majors learn to write by not only studying grammer, but by writing. Physicists(sic) not only study physics, they perform experiments to tie their observations to the theory behind it. On the same token, Computer Science majors should similarly do more hands on practical work. Most, if not all, of the non-mathematical degrees prepare the holder in some small way for what they can expect to see in the real world. My frustration stems from neither the CS nor the CIS degrees filling that need in any significant manner.

      --

      Lodragan Draoidh
      The more you explain it, the more I don't understand it. - Mark Twain
    45. Re:If there's one thing I know by Deliberate_Bastard · · Score: 1

      Perhaps I did not explain myself as well as I should have. I am not advocating turning CS into a craft. What I am advocating is bringing those elements of craftwork that are missing from the CS cirriculum into the mix, while keeping the proper level of math.

      Ah, okay, I get you now.

      You don't want so much to *change* the CS curiculum as to add more coding experience to it.

      I agree *to some extent*. I think that what needs to be taught that isn't is some coursework on structuring software *at a lower-division level*.

      The problem is not that CS students are doing too much computer science; it's they are doing too little; specificly, they are doing too little software engineering.

      What happens is that in basic CS courses, the ones that teach programming (usually C++), no attention is paid to teaching students *how to structure and plan*, starting with "here's how to psuedocode" and teaching them how to modularize properly, how to design a class interface, etc. I've been advocating this for quite some time, but to little avail, since it would cost money.

      Most "software engineering" courses are taught at the upper-division level, where the damage is already done. Practice doesn't make perfect, it makes permanent (which is why I don't think "self-taught" programming is a good idea).

      Every discipline has this to a certain extent: English majors learn to write by not only studying grammer, but by writing. Physicists(sic) not only study physics, they perform experiments to tie their observations to the theory behind it. On the same token, Computer Science majors should similarly do more hands on practical work.

      Actually, they do far more than other majors in this regard. Far, far more.

      But you are correct that some of them are not quite prepared to be programmers. As with any discipline, some are going to graduate with excellent kung fu, while some did just enough actual coding to get by with C's. It's a skills problem, not a techniques problem.

      I assume you have read Brooks's "No Silver Bullet"?.

      --
      NOTICE: This notice will appear at the bottom of all my slashdot posts.
    46. Re:If there's one thing I know by Lodragandraoidh · · Score: 1

      Yes. However, I disagree with some of his conclusions.

      For one thing, shops do not leverage the amount of modularization that they could, opting instead to reinvent the wheel during every new project. Some of this is laziness, some of this is the common belief that obscurity increases continued employability, and finally the lack of a common 'toolset' that programmers can bring with them between corporations (mostly having to do with intellectual property and/or licensing issues - and the fact that whatever libraries are used usually fall into those catagories). Inefficiencies are unacceptably high, as a result.

      How do we fix this? I think one of the things is to adopt languages that have some very powerful built-in and extensible libraries that are freely available - and thus able to translate from job to job across enterprises. Good candidates are Perl and Python - both of which have a very rich - and more importantly accessible - set of modules for doing just about any programming job you can think of. These languages, while not efficient in terms of loading, and to a lesser extent execution times - are sufficient for the vast majority of programming that is the current day to day projects in business. Advances in hardware speed have made these languages very viable for most jobs. (I am not saying every job - there will always be a need for assembly language, for example, in the embedded space - and to a lesser extent for increasing system performance - for OS efficiencies, video games and simulations - but we must admit that advances in hardware have made this less of a requirement as time goes on).

      Brooks also mentions rapid prototyping, but doesn't say much about this idea taken to the extreme in the form of xtreme programming and iterative development lifecycles. As has been seen in quite a few open source development projects - building soon and often returns more useful feedback about an application than traditional methods alone.

      Finally, his ideas regarding software ownership and compensation are not in tune with the reality that is the internet in the 21st century. My worry is that considering software as IP only stifles innovation by locking up the possible expansion of ideas. All of us stand upon the shoulders of those who came before; IP disrupts that process (think of all the developments we have seen in the last century that would have been blocked as a result of heavy handed IP enforcement).

      While I may not hold out the hope for a software development panacea, I similarly believe that it is too premature to say that there is no new ground to be investigated, either. These statements make me think of IBM stating that there will not be a need for more than 4 computers world wide - or Bill Gates assertion that no one will need more than 640 Kbytes of ram. If there is one thing we can be sure of, it is the pervasiveness of change.

      --

      Lodragan Draoidh
      The more you explain it, the more I don't understand it. - Mark Twain
    47. Re:If there's one thing I know by Deliberate_Bastard · · Score: 1

      Yes. However, I disagree with some of his conclusions.

      {snip material on modularization, re-use, high-level languages, "extreme" programming, etc}

      Well, most of these have helped, but they are not, and won't be, the quantum leap that would allow us to start narrowing the design productivity gap.

      The problem is that hardware capability leaps have resulted from one or two processes, mostly involving shrinking the CMOS transistor. The geometric gains this has produced is the result of literally a geometric factor: A linear reduction in the size of PMOS/NMOS results in a quadratic increase in the amount that will fit on a wafer.

      But there is no physical geometric factor in software design. So our linear gains in efficiency remain linear, and our design process capabilities cannot keep up with what our hardware can support.

      It's not that software engineering is inherently blighted. It's that hardware design is inherently blessed. And without some unlikely (not impossible, but unlikely) discovery that will somehow bless the software design process in the same manner, the design productivity gap will continue to expand until such time as the compiler itself can read a specification document and write the requested code. (An 'AI-complete' problem.)

      --
      NOTICE: This notice will appear at the bottom of all my slashdot posts.
    48. Re:If there's one thing I know by dvdeug · · Score: 1

      This whole thread is precisely why Computer Science should have never been allowed to fall into the Mathematics Department.

      Where exactly has that happened? I've never seen a university that didn't have a seperate mathematics and compsci department, and UNLV put it in with the engineering college.

      For computer science at Oklahoma State, I had to take Calculus (as required for all BS's), Discrete Math I & II, Theoretical Foundations of Computing and Data Structures and Algorithm Analysis, most of which are in the computer science department. (I eventually got my degree in something else, but I took most of those classes.)

      How many practical computing problems have I run into in my carreer that have been NP complete? 0 - in 10+ years.

      Really? Are you sure? What would you do if you did, and didn't have the algorithmic analysis to figure out that you needed to go around the problem instead of through it.

      Furthermore, other classes are Design and Implementation of Operating Systems, Organization of Programming Languages and Numeric Methods for Digital Computers. I wouldn't be surprised if you hadn't implemented an operating system, implemented numeric code or actually used APL or ML.

      If you don't want a Computer _Science_ degree, there's many technical schools that will teach you to program. Perhaps you should be complaining more about the Buisness schools (which are aiming for what you want) than the computer science degree.

  2. Apology by Anonymous Coward · · Score: 5, Funny

    Apology for the proof of the Riemann hypothesis (in pdf format).

    "We humbly apologize for the complete illegibility of this proof. The mathematician responsible has been sacked."

    1. Re:Apology by Tackhead · · Score: 5, Funny
      > "We humbly apologize for the complete illegibility of this proof. The mathematician responsible has been sacked."

      "A Slashdotter has discovered a truly wonderful proof of the sacking of the mathematician responsible, but his bandwidth is too narrow to host it!"

    2. Re:Apology by badboy_tw2002 · · Score: 4, Insightful

      Uh, the above comment was a joke people. The quote in the parent post does NOT appear in the document. Apology in this case means a defense of the proof.

    3. Re:Apology by ssssmemyself · · Score: 4, Informative

      Note to mods: Mod parent funny, not interesting! This is a play off a quote from the beginning credits sequence in Monty Python and the Holy Grail. As for the pdf link, it's the first link in the purdue page referenced in the article. RTFA, people!

    4. Re:Apology by MerlynEmrys67 · · Score: 4, Interesting
      Of course if I were to RTFA - and more importantly UTFA (Understand the Article) I wouldn't be able to post this for another 2 years or so...

      As it is, it looks like he proposed this solution over a year ago and has been getting it vetted in a tightly controlled community. Now that the cat is out of the bag he will have to get it into a peer reviewed journal (takes 6 months or so) and wait 2 years to see how it is bashed...

      Yeah - that is about the time it would take for me to UTFA, except I am not a Mathemetician, so add in another 6-8 years to get that training as well. So I will get back to you sometime around 2120 with an insightful comment after UTFA

      --
      I have mod points and I am not afraid to use them
    5. Re:Apology by gniv · · Score: 5, Interesting
      The last paragraph of the article is interesting:
      A curious coincidence needs to be mentioned as part of the chain of events which con- cluded in the proof of the Riemann hypothesis. The feudal family de Branges originates in a crusader who died in 1199 leaving an emblem of three swords hanging over three coins, surmounted by the traditional crown designating a count, and inscribed with the motto "Nec vi nec numero." This is a citation from Chapter 4, Verse 6, of the Book of Zechariah: "Not by might, nor by power, but by my Spirit, says the Lord of Hosts." The chateau de Branges was destroyed in 1478 by the army of Louix XI of France during an unsuccessful campaign to wrest Franche-Comte from the heirs of Charles the Bold of Burgundy. The family de Branges performed administrative, legal, and religious functions in Saint-Amour for the marquisat d'Andelot during Spanish rule of Franche-Comte. Francois de Branges of Saint-Amour received the seigneurie de Bourcia in 1679 when Franche-Comte became part of France. The chateau de Bourcia remained the home of his descendants until it was destroyed by Parisian revolutionaries in 1791. The chateau d'Andelot near Saint-Amour, which survived the revolution, was bought in 1926 by Pierre du Pont, an elder brother of Irenee du Pont, for a nephew assigned in diplomatic service to France. This coinci- dence accounts for the interest which Irenee du Pont showed in a student of mathematics. The ruin of the chateau de Bourcia overlooks a fertile valley surrounded by wooded hills. The site is ideal for a mathematical research institute. The restoration of the chateau for that purpose would be an appropriate use of the million dollars offered for a proof of the Riemann hypothesis.
      That's quite noble of him.
    6. Re:Apology by princewally · · Score: 2, Insightful

      Yeah, there's no chance I'm going to understand a mathematical proof, so I'm relegated to the realms of the ignorant.

      --

      -
      "Vengeance is fine," sayeth the Lord.
    7. Re:Apology by Anonymous Coward · · Score: 0

      I thought it was interesting that the quote on the place was "Not by might, nor by power, but by my Spirit, says the Lord of Hosts" and so the place was destroyed the first time it was built by might, destroyed the second time it was built by power, and if it is rebuilt this time it could be interpreted to be built "by my Spirit" as says the lord of hosts

    8. Re:Apology by letxa2000 · · Score: 3, Funny
      You know, I had this exact same idea several years ago but I figured it couldn't possibly be [b]that[/b] obvious so I figured I was just wrong. Rats. :)

    9. Re:Apology by Ralph+Wiggam · · Score: 3, Funny

      The Bourcia Mathematical Research Institute will involve more whores and cocaine than a typical research institute, but for tax purposes it's a research institute.

      -B

    10. Re:Apology by The+Clockwork+Troll · · Score: 1

      Oh come on we all know he's going to blow it on booze and whores.

      --

      There are no karma whores, only moderation johns
    11. Re:Apology by Anonymous Coward · · Score: 0

      Sweet when he rebuilds it lets knock it down again then we shall have vested his spirit ... then what has the lord of the hosts have to say :)

      A bummper sticker you all should have ...

      I LOVE MATHEMATICS

    12. Re:Apology by Anonymous Coward · · Score: 0

      Find positive integers a, b, and c such that

      a^3 + b^3 = 22c^3

      Since the problem was more interesting than plane geometry, I spent the fourth form year solving it. For this purpose I had access to the libraries of Saint Andrew's School, the Biochemical Research Foundation, and the University of Delaware. With the help of these sources I was able to acquire the representation theory of positive integers in the form a^2 + ab + b^2 for integers a and b. This information is a prerequisite to a solution of the problem, which I have unfortunately lost.

      I think he worked in a Fermat-style joke of his own (p. 5).

    13. Re:Apology by D'Sphitz · · Score: 1

      Does this mean that prime numbers can now be predicted, and all the supercomputers endlessly trying to calculate larger and larger primer numbers can be shut off?

    14. Re:Apology by jatencio · · Score: 1

      When a proof comes out one of three things follow. One, it is wrong, two, it is trivial (obvious), or three, I wrote it.

    15. Re:Apology by IdleTime · · Score: 1

      I've just been reading the 23 pages of proof and anecdotes.
      I'm nut sure what is more sad, the fact that I was able to understand the paper or that I never pursued a carrier in math 20 years ago..

      Anyhow, I will sleep much better now that the Riemann hypothesis has been proven :)

      --
      If you mod me down, I *will* introduce you to my sister!
    16. Re:Apology by Anonymous Coward · · Score: 0

      wow... if his proof holds, its truly a magnificent accomplishment, but this pretentious ass almost mananges to top it in this most obnoxious and rambling of proofs.

      poving the riemann hypothesis does not require proving that you are a very important and interesting person... that should be a consequence of proving the theorem, not the focus of the proof.

    17. Re:Apology by openlurker · · Score: 1

      No, it doesn't. "Prediction" of primes is still an open question, and would be a stronger result. In fact, if one could show exactly how primes occur with a function, the distribution of them would be pretty trivial, so the Reimann Hypothesis would be solved as well.

    18. Re:Apology by dasmegabyte · · Score: 5, Interesting
      This guy is an all around class act. I've always found mathematicians to be kind of standoffish, and while this guy is obviously at the top of his field, he's also on top of the rhetorical game, the very structure of this "Apology" shows that he's having a great deal of fun with his chosen profession.

      My favorite selection:
      The solution of a celebrated problem creates a disturbance in the otherwise quiet flow of mathematical events. The solution escapes the planning of committees. Colleagues are unprepared because the possibility of a solution has not been included in their research proposals. Students have avoided related thesis topics because of the risk that the work will not be welcome to a prospective employer. Friends are discouraged from research activity by the demands of the situation created by the solution. The manuscript, which is necessarily written at the highest research level, is readable only to a limited audience. An introduction is therefore needed which makes available the opportunities created by the solution. This is done by supplying motivation for the argument in a chronological order which also gives an account of how the solution was obtained.

      Hilarious stuff. He apologizes to the people who will now feel the need to go over his proof with a fine toother comb, looking for mistakes...and also explains (three pages in) why he's chosen to start his proof with a history of the golden age of mathematics, stretching back to Newton. Basically, he's saying "oh hey, thanks for joining me. I was just explaining ALL OF MATHEMATICS for those playing at home. Bear with me, this one's worth it, and I promise you can get back to your euclidian algorithms and Ving diagrams in short time."

      Ever read "The Life and Opinions of Tristram Shandy?" It's an amazing book from the 18th century, which attempts to tell a simple narrative but due to the extremely schizophrenic style of the narrator, it keeps breaking down into tangential pockets of narrative self awareness. Basically, the author wrote from the perception of a disturbed dandy who couldn't keep his mind on the task at hand, an author who keeps apologizing to his readers for the inconvenience of his own poor editing.

      This mathematical proof reminds me a lot of this book...the text of the proof doesn't act as though the proof isn't something interesting or ground breaking, nor does it make a big deal of this. It just ambles on in all directions until the Riemann hypothesis is well and truly proven, but with no real hurry to illustrate the proof until the outlines have been inked. Not that I know for sure that Riemann is proven or isn't...my brain was full when I got to differentials. But if it is, this paper will stand out not only as a great work of mathematics, but a great work of WRITING about mathematics.

      I'm going to read it again. Maybe I'll understand it this time!
      --
      Hey freaks: now you're ju
    19. Re:Apology by logicnazi · · Score: 1

      Well, not quite. It all depends on how this prediction is represented. After all we *can* compute the n-th prime, there is a simple procedure to do this which can even be written in basic number theory.

      --

      If you liked this thought maybe you would find my blog nice too:

    20. Re:Apology by Anonymous Coward · · Score: 0

      Yes, you are right. I was trying to answer the question as directly as possible without confusing the issue. That is why prediction is quoted. It's not much of a prediction to compute directly or to concoct some post hoc function, or any other easy outs.

      What do you think, is it a valid proof? My gut tells me no.

    21. Re:Apology by Anonymous Coward · · Score: 0

      I was having some trouble understanding this document. After ten minutes or so, I realized that I was holding it upside down.

    22. Re:Apology by Anonymous Coward · · Score: 0

      The writing style is very cool; reminds me of Lovecraft :)

      "As the last shreds of my sanity slowly dissolved, I delved deeper into the unfathomable depths of the Riemann Hypothesis, convinced that somewhere, somehow, it would pinpoint the location of ancient R'lyeh"

    23. Re:Apology by Anonymous Coward · · Score: 1

      Gotta agree there, doubt if I will ever grasp it, but I thoroughly enjoyed reading it.

      on the subjects of books, if you enjoyed this look around for Fermats Enigma (Singh version, I believe there is another).

    24. Re:Apology by Anonymous Coward · · Score: 1

      The Life and Opinions of Tristram Shandy:

      http://www.gifu-u.ac.jp/~masaru/TS/contents.html

    25. Re:Apology by Anonymous Coward · · Score: 0

      The person responsible for sacking the IT guy who cases the methematician to be sacked, has been sacked.

    26. Re:Apology by Casca · · Score: 1

      Oh dear, those responsible for the sacking have now been sacked.

      --
      Casca
    27. Re:Apology by value_added · · Score: 1

      If your day job doesn't work out, consider writing book reviews for a living. If it does, consider it anyway.

    28. Re:Apology by Anonymous Coward · · Score: 0

      I was having some trouble understanding this document. After ten minutes or so, I realized that I was holding it upside down.

      I bow to you, sir. That takes some doing on a computer.

    29. Re:Apology by Anonymous Coward · · Score: 0

      For non maths geeks here is a translation.

      "He is writing like grandpa simpson"

  3. Good job by Thinkit4 · · Score: 5, Funny

    It's too bad that most of society does not recognize truly great achievements like this. I, for one, admit interest but not enough knowledge of the details to read and understand the proof. I'm sure most people here on /., as representatives of the intelligent future of sentient life, have the interest as well.

    --
    -I am an elective eunuch.
    1. Re:Good job by Anonymous Coward · · Score: 0

      What are you talking about? Most people on /. can't even spell 'mathematician'.

      Or at least the submitter couldn't.

    2. Re:Good job by Anonymous Coward · · Score: 3, Funny

      Well, first thing I thought was "Thank God someone solved that problem. Could not have waited much longer."

    3. Re:Good job by nametaken · · Score: 5, Insightful

      You're probably right. But society does recognize a one million dollar prize. This one may actually get TV time. Funny how that works.

    4. Re:Good job by slasher999 · · Score: 1

      I really wanted to be interested, but my eyes just glazed over when I tried to read any of that.

    5. Re:Good job by MerlynEmrys67 · · Score: 1
      But society does recognize a one million dollar prize.

      Yeah once every 6 months the new survivor gives out a million bucks... Lets boot this math geek off the island today.

      --
      I have mod points and I am not afraid to use them
    6. Re:Good job by Anonymous Coward · · Score: 0

      In the last 25 years a lot of long time problems have fallen: 4 Color, Fermat's Last, someone claims to have proven the Twin Prime Hypothesis, just a few weeks ago.

      It would be stunning if this, really the jewel in the crown of 19th and 20th Century analysis, would be solved as well.

      Keeping my fingers crossed the proof holds up.

    7. Re:Good job by servognome · · Score: 1

      Why should society as a whole recognize this as a great achievement? Its great and personally I find the creativity and logic required to solve such a problem amazing, but 99.9% of people have no interest in these sorts of things. It's not something that changes people's lives, its proving an answer to a question. Nothing more.
      How can the average person think "wow that's great" when they the proof is practically another language, and people can't even relate to the meaning of the hypothesis itself
      Imagine walking down the street and a group of people were looking at a bunch of scribbles, and they tell you that it is the answer to the "question of thingamagig". You have no context to understand whats going on, and in the end it really doesn't matter to you either way.

      --
      D6 63 0D 70 89 81 BB 8E 7B 7C 5F 5D 54 EA AB 73
    8. Re:Good job by gowen · · Score: 1

      Only one problem. De Branges has been announcing proofs of RH since the late 1980s. None of them have been accepted so far. This one *might* be right (he is a talented mathematician -- he proved the Bieberbach conjecture -- but he's also something of a loony), but its too early to heap praise on him yet.

      --
      Athletic Scholarships to universities make as much sense as academic scholarships to sports teams.
    9. Re:Good job by Anonymous Coward · · Score: 0

      They're dancing in the streets of Baghdad. Al Queda are turning in their AK-47s. Bin Laden smiles happily as he goes to the first day of his new job at a Kibbutz. Cats and dogs, living together. All because the Riemann Hypothesis has been proven!

    10. Re:Good job by kabocox · · Score: 1

      You're probably right. But society does recognize a one million dollar prize. This one may actually get TV time. Funny how that works.

      It'd be funny that some one that has never heard of this proof or had formal math training came up with a simple way to prove it. For a million dollars, you could have alot of folks atleast attempt it.

    11. Re:Good job by Zork+the+Almighty · · Score: 1

      Which, as in the case of Fermat's last theorem, is a colossal waste of time for everyone involved.

      --

      In Soviet America the banks rob you!
  4. I have a trivial solution to this problem... by Anonymous Coward · · Score: 0

    ...but, oh you know the joke.

  5. Gotta prove 'em all by foidulus · · Score: 5, Funny

    They really should make mathematics more like pokemon, it would get more people interested in the subject
    Riemann-chu, I prove you! Then bust out the paper.

    1. Re:Gotta prove 'em all by TJ_Phazerhacki · · Score: 1, Funny
      Not a bad Idea -

      Introducing - ( Cheesy Background Music )

      The Theorem CCG - Gotta Prove 'Em All

      My Riemann beats your Trans-Zeta !

      --
      Physics is nothing like religion. If it was, we'd have an easier time trying to raise money!
    2. Re:Gotta prove 'em all by Felinoid · · Score: 5, Funny

      Mathomon?
      Yeah but then a few years later Yu-Physics-Oh comes along and replaces it in popularity. Then before you know it that two is gone replaced by annother populare science.
      Plus it would replace Arceology the gathering.

      Magic The Gathering, Pokemon and yugioh are in the 15 minuts of fame catagory. Populare today gone tomarow.

      I don't want Math to be gone tomarow. I'm counting on it to stay for a while.

      Now english I wouldn't mind if it's own end was spelled out. You can see the proof reading this very post.

      --
      I don't actually exist.
    3. Re:Gotta prove 'em all by per11 · · Score: 1

      It still would not make any sens.

    4. Re:Gotta prove 'em all by frodo+from+middle+ea · · Score: 1
      "A man is only as strong as the weakest woman he has ever loved."

      With that logic, everybody here should be supermen. ;)

      --
      for the last time people, I am "frodo from middle eaRTH", not "middle eaST".
    5. Re:Gotta prove 'em all by Anonymous Coward · · Score: 0

      sorry to burst your bubble but magic the gathering is not expieiencing 15 minutes of fame its been around for years (almost 10 i belive but i couldnt find a link), for two reasons it is not a spin off (the others started as tv shows) and so interest will not be lost as the next big show comes along, and secondly because it is so well designed and the gameplay is so good that no one is going to come out with a game to compete, at least for a good long time, this can be seen by the fact that no one has tried. And also in case you couldnt tell the parent was a joke and math isnt going to be gone tommorow (although wether it has ever been all there is questionable).

    6. Re:Gotta prove 'em all by wmspringer · · Score: 1

      More than 10, actually; I'm pretty sure Magic:TG was out by '93. (I started playing the Star Trek CCG in 94, and that was white border, coming after black border, which obviously came out after Magic)

    7. Re:Gotta prove 'em all by kerasineAddict · · Score: 1

      I'd concede Pokemon and Yu-Gi-Oh as kid fads, Magic: the Gathering OTOH just celebrated it's 10th Anniversary a few months back. Still releasing new sets, tournaments still being played. Most fads don't last that long.

    8. Re:Gotta prove 'em all by Mulletproof · · Score: 1

      Would that be BeyologyBlade? Now witness my Lurch impression! :D

      Uuuuuuuuhhhhuuuggg....

      --
      You need a FREE iPod Nano
    9. Re:Gotta prove 'em all by Tjebbe · · Score: 1

      Pokemon did not start as a tv show, but as a game (which was quite good from what i'm told). The cartoon was used to make it more popular (as are almost all cartoons).

    10. Re:Gotta prove 'em all by JTMON · · Score: 0

      Just because it is still around doesn't mean it's popular. People still create velvet paintings and hold conventions for them but I wouldn't say they are popular

    11. Re:Gotta prove 'em all by mrtroy · · Score: 1

      They really should make mathematics more like pokemon, it would get more people interested in the subject Riemann-chu, I prove you! Then bust out the paper.

      HAHA. +10000 funny

      Sadly, I can read and understand most of the proof, as a result of my damned math courses....

      But I never have to take another math course AGAIN! Ph33r!

      So I can look at this, say hmm interesting, and move on.

      --
      [I can picture a world without war, without hate. I can picture us attacking that world, because they'd never expect it]
    12. Re:Gotta prove 'em all by ccg · · Score: 1

      LOL!

      Thank you. That's the funniest thing I've heard in a while.

  6. Nope! Nice try by ajboyle · · Score: 5, Funny

    I read through his proof and...nope, it's wrong. I know the real answer, but am leaving it as an exercise for the interested student.

  7. Googlized HTML version by Anonymous Coward · · Score: 3, Informative
    1. Re:Googlized HTML version by magefile · · Score: 0, Offtopic

      Are the mods on crack? Clearly this post is a joke, as the parent that posted the original link posted AC. It may be a non-slashdottable version, but it is no more Karma-whoring free than the other one.

    2. Re:Googlized HTML version by Anonymous Coward · · Score: 0

      Are the mods on crack?

      You must be new here.

    3. Re:Googlized HTML version by cluke · · Score: 1

      It's not karma-whoring because he posted it anonymously!!

  8. Failed proof by MobyDisk · · Score: 5, Informative

    Ha! They've already found an error in the proof! All that he posted was his apology! :-)

    Yes, I was actually confused at first. For the non-math geeks like myself, who are feeling stupid, look at definition 2a of apology.
    1. Re:Failed proof by stigin · · Score: 1

      Indeed, this paper is/seems like only a short history of the Riemann Hypothesis. Anyone a link with the original paper? (or just an answer to the question, was it long?)

      --
      #1) Respect the privacy of others. #2) Think before you type.
    2. Re:Failed proof by martinX · · Score: 1

      Wow. I'm going to use some of that as filler in my web pages.

      --
      When they came for the communists, I said "He's next door. Take him away. Goddam commies."
    3. Re:Failed proof by Anonymous Coward · · Score: 0

      FYI, that usage of the word "apology" is not limited to mathematics. Surely you've heard someone called an apologist before?

    4. Re:Failed proof by Anonymous Coward · · Score: 0

      There's a subtle difference, but I think definition 3 (from the parent's link) applies here.

      1. asks forgiveness.
      2. gives reasons/justification for failure.
      3. is just an approximation.

      The author uses the term apology to say "Here is my best guess at how you would go about proving the problem." Such a "proof" is basically a mathematician's pseudocode, and is not meant to be treated as an actual proof. Instead, think of it as a "path that looks promising but needs work."

  9. This is great for academia by Anonymous Coward · · Score: 0

    In a time where funding for many non-practical research is being cut, it's nice to someone established accomplish something.

  10. He is very brave by Anonymous Coward · · Score: 2, Informative

    The paper is called, Apology for the proof of the Riemann hypothesis (in pdf format). To find the apology you have to read through to page 4 where he talks briefly about the problems that the solution of a celebrated problem creates for others who weren't expecting it. Basically the title is, "a form of Mathematical smack talk" (to quote a co-worker).

    Most of the paper appears to be history, and the results leading up to his proof. Only a few pages at the end make up the actual new proof, so the novel material is far shorter than 23 pages.

    I wouldn't be surprised if there is a fairly final verdict on his proof very quickly. This is not like Wiles' proof of Fermat that was very long and nobody had the background to understand. This proof looks reasonably short and straightforward.

    Cheers,
    Ben Tilly

    1. Re:He is very brave by Anonymous Coward · · Score: 0

      Or, you know, he could be using the more formal definition of "apology" :

      1. A formal justification or defense.
      2. An explanation or excuse.

    2. Re:He is very brave by frodo+from+middle+ea · · Score: 1
      Most of the paper appears to be history, and the results leading up to his proof. Only a few pages at the end make up the actual new proof,

      Much most of the papers I always submitted.

      --
      for the last time people, I am "frodo from middle eaRTH", not "middle eaST".
    3. Re:He is very brave by radicalaxis · · Score: 1

      I don't have the mathematical background to fully confirm this, but his "apology" paper looks like a sketch of a proof of the Riemann hypothesis. With all the details worked out, it would be a good bit longer. It appears that de Branges has published this in order to back up priority claims as needed, and the apology would be sufficient for such a purpose.

    4. Re:He is very brave by radicalaxis · · Score: 2, Informative

      Hm. It appears that I did not notice that the real proof is in fact here.

  11. Uh-oh! There's a mistake! by Anonymous Coward · · Score: 5, Funny

    I don't want to give it away, but you'll see it.

  12. Hilbert Turns in his Grave? by kaalamaadan · · Score: 5, Interesting

    "If I were to awaken after having slept for a thousand years, my first question would be: Has the Riemann hypothesis been proven?"

    David Hilbert

    1. Re:Hilbert Turns in his Grave? by Mark_in_Brazil · · Score: 5, Interesting

      Hilbert may have been referring to the importance of the Riemann Conjecture, and not the difficulty of proving it.

      Really, folks, this is a big deal if it's true. It just doesn't get the attention Fermat's Last Theorem did because it's harder to understand what it means and why it's important.

      After all, most people don't even know what complex numbers are, much less complex functions. The zeta function, then, is already beyond the understanding of most people, not because they're incapable, but because they're not interested. But the implications of the Riemann Conjecture are far-reaching indeed, affecting things like quantum mechanics and statistical physics.

      --Mark

      --
      "It is nice to know that the computer understands the problem. But I would like to understand it too." --Eugene Wigner
    2. Re:Hilbert Turns in his Grave? by rattler14 · · Score: 4, Funny

      "If I were to awaken after having slept for a thousand years, my first question would be: Has the Riemann hypothesis been proven?"

      Oh yeah? Mine would be "Is Doom 3 out yet?"

      Honestly, which is more likely?

      --
      my last sig was too controversial... now, a new and improved useless sig!
    3. Re:Hilbert Turns in his Grave? by Anonymous Coward · · Score: 0

      Forget that vaporware, where is my flying car!

    4. Re:Hilbert Turns in his Grave? by Anonymous Coward · · Score: 0

      "If I were to awaken after having slept for a thousand years, my first question would be: Has the Riemann hypothesis been proven?" ---David Hilbert

      Interesting.

      Why is the Riehmann hypothesis bear such import to mathematicians?

      Is it merely because mathematicians hate long-standing open problems? Or, conversely, once the Riehmann hypothesis is proven, what sort of implications does it have for mathematics at large?

    5. Re:Hilbert Turns in his Grave? by Anonymous Coward · · Score: 0

      "Is Linux on the desktop?"

    6. Re:Hilbert Turns in his Grave? by JonMartin · · Score: 2, Funny
      "If I were to awaken after having slept for a thousand years, my first question would be: Has the Riemann hypothesis been proven?"

      Oh yeah? Mine would be "Is Doom 3 out yet?"

      I notice that you won't even bother asking about Duke Nukem Forever.

      --
      Serve Gonk.
    7. Re:Hilbert Turns in his Grave? by Sepper · · Score: 1

      Or the classic: 'Is Duke Nukem 4Ever gone gold?'

      --
      I live in Soviet Canuckistan you insensitive clod!
    8. Re:Hilbert Turns in his Grave? by Tony-A · · Score: 2, Interesting

      "The structure of mathematical journals creates the impression that mathematics is fragmented into unrelated disciplines. The underlying unity of mathematics is however maintained by problems which span these disciplines. ... The Riemann hypothesis is listed as an important link between algebra and analysis."

      The significance may be more in the mathematical machinery required to prove it than in the result itself.

    9. Re:Hilbert Turns in his Grave? by DreadSpoon · · Score: 1

      Mine would be, "I really need to find the bathroom!"

      http://www.vanvonhunter.com/vvh43.html

    10. Re:Hilbert Turns in his Grave? by perlchild · · Score: 1

      You might also get away with interesting the uninformed by saying that Riemann's Function (not Conjecture, although they may be related, my math proof skill reading sucks) has some applications in cryptography.

      I believe Stephenson mentions this in the Cryptonomicon(I believe he is quoting some early work done about the time of the Enigma cipher, but I can't find my copy at present).

      Although I believe algorithms and implementations tend to stay away from using it, for a code size/in-place memory size/compute load perspective. (The Z function's Magnitude is quite large, at least without specialized instructions to deal with powers of complex functions).

      While my postulate that this is related to cryptography may not be strictly true, at least, in currently-used implementations, it may yet serve to interest people to this applied science. Which wouldn't do that much harm, now would it?

      On a related note, I keep reading what I can understand of the proof, and I can't help but noticing there's a LOT of hypotheses in there, perhaps he's proving the theorem for only a restricted set of conditions?

    11. Re:Hilbert Turns in his Grave? by dasmegabyte · · Score: 1

      Duke Nukem Forever has a release date. It's also the most popular day for starting diets.

      Tomorrow.

      --
      Hey freaks: now you're ju
    12. Re:Hilbert Turns in his Grave? by xC0000005 · · Score: 1

      Don't be silly. When the sun goes cold and dark, its last feeble rays will fall on an unfinished alpha of a leaked tech demo from the 126th engine to host DN4Ever. On another note - I tried applying the same approach the DN4 team uses to a turkey I was cooking once. I started it out in the oven, switched to a convection cooker about two hours later, fried it in oil until it blistered, and later put it in a toaster oven. Every time I switched I hyped it to anyone in earshot. I told my family "it will be done when it's done." What I failed to realize is that the turkey smelled funny, was more than a little poisonous, and most importantly - *no one cared to eat it anymore*. That's what DN4 is like now.

      --
      www.voiceofthehive.com - Beekeeping and Honeybees for those who don't.
    13. Re:Hilbert Turns in his Grave? by RAMMS+EIN · · Score: 1, Interesting

      However important this proof may be to mathematicians, it hardly has any impact on real life. Gödel has already proven that mathematics, or really any complex system at all, is incomplete, meaning that there are true things that cannot be proven. The approach taken in real life, as well as pretty much any science, is to accept a hypotheses tentatively and use it until one that better predicts observations is found. Any "law" of nature that we have now has been used for so long without shocking inconsistencies that the proof or falsification for any hypothesis can only have a very minor impact on it.

      --
      Please correct me if I got my facts wrong.
    14. Re:Hilbert Turns in his Grave? by smsp · · Score: 0

      HAHA. +1, Funny.

    15. Re:Hilbert Turns in his Grave? by Anonymous Coward · · Score: 1, Interesting
      The significance may be more in the mathematical machinery required to prove it than in the result itself.
      No. Large parts of modern mathematics rest on proofs which begin "Assuming the Riemann Hypothesis to be true...". If it turns out to be false, there's a lot of work to do over again (of course, that could be fun, too...)
    16. Re:Hilbert Turns in his Grave? by kabocox · · Score: 1

      "If I were to awaken after having slept for a thousand years, my first question would be: Has the Riemann hypothesis been proven?"

      Oh yeah? Mine would be "Is Doom 3 out yet?"

      Honestly, which is more likely?


      Oh, come on, you should ask "Has Duke Nukem Forever been released?"

    17. Re:Hilbert Turns in his Grave? by Anonymous Coward · · Score: 0

      I feel your karma pain, but thanks anyway :)

    18. Re:Hilbert Turns in his Grave? by skifreak87 · · Score: 1

      The fact that Riemann has been proven, IMHO, will simply remove those footnotes that say Assuming the General Riemann Hypothesis. The first 1.5 billion zeroes have been checked and verify the conjecture, and it's long been assumed that it is true. The significance of the proof will lie in a) how it was proven - perhaps these new methods will be applicable in the future since so many attacks have failed and probably b) providing mathematical fame to the prover for finding a new attack that worked. This proof will be a very big deal if correct but NOT directly because Riemann's hypothesis has been proven (and thus the Miller-Rabin primality test is now proven to run in polynomial time on a deterministic machine as opposed to assumed very strongly and not yet disproven) b/c the proof has been assumed to be true for a VERY long time. A counterexample would shake things up MUCH more than a proof.

    19. Re:Hilbert Turns in his Grave? by nutbarpsycho · · Score: 1

      "If I were to awaken after having slept for a thousand years, my first question would be: Has the Riemann hypothesis been proven?" Oh yeah? Mine would be "Is Doom 3 out yet?" Honestly, which is more likely? Well, they're both more likely than Duke Nukem Forever.

  13. I'm in trouble by martinX · · Score: 5, Funny

    You know you're in trouble when you don't even understand the question.

    --
    When they came for the communists, I said "He's next door. Take him away. Goddam commies."
    1. Re:I'm in trouble by Carnildo · · Score: 1

      The question itself is pretty straightforward. It's the answer that's the problem.

      --
      "They redundantly repeated themselves over and over again incessantly without end ad infinitum" -- ibid.
    2. Re:I'm in trouble by southpolesammy · · Score: 1
      Well, for the layperson, let me try to translate what it being proven here.
      "Gobbledy gook, gobbledy gook, blah, blah, blah, QED. Chateau de Bourcia rules!"


      (ObDisclaimer: No, I can't possibly go through the proof, even with my college education including what amounts to nearly a minor in Mathematics. Then again, I'm too far out of that loop and like many others, that which isn't used is doomed to atrophy. Truth be told, I do know that this is a breakthrough, but I haven't 1/100th of the knowledge remaining, nor 1/1000th of the time (aren't kids fun?) to go through it myself.)
      --
      Rule #1 -- Politics always trumps technology.
    3. Re:I'm in trouble by haluness · · Score: 1

      No justification required!

  14. Is it... by Anonymous Coward · · Score: 5, Funny

    ... 42?

    1. Re:Is it... by Nuclear_Loser · · Score: 1

      Let's hope not.. the answer and the question are mutually exclusive. If by chance someone does know both the answer and the question, well, the universe will be destroyed and replaced by something even stranger.. which most people believe has already happened.... or course, you know this already.

      --


      You've got 8% of my love - 8% of my love - 8/100's of the time you're the only girl I'm dreaming of.
    2. Re:Is it... by Anonymous Coward · · Score: 0

      yeah, but the mice knew that already.

    3. Re:Is it... by Anonymous Coward · · Score: 0

      Actually, it's what you get if you multiply six by nine.

    4. Re:Is it... by Anonymous Coward · · Score: 0

      -42 is a zero. 42 isn't.

    5. Re:Is it... by Alsee · · Score: 1

      It worked out to 41.999999 when I tried it.

      -

      --
      - - You can't take something off the Internet! That's like trying to take pee out of a swimming pool.
  15. WTF? Mods? by Unnngh! · · Score: 5, Informative
    From reference.dictionary.com:

    Apology - 2: a formal written defense of something you believe in strongly

    This should at most have earned a "Funny", or is there something I'm missing here?

  16. Re:Proof of theory by Anonymous Coward · · Score: 1, Interesting

    um, he says in the paper what he'll do with it. (And actually, it's not the only time it's ever challenged. The whole field of mathematics is nothing but this sort of thing; this one only had big money attached to it because it has eluded the world's best mathematicians for so long.)

  17. Impact on crypto? by Anonymous Coward · · Score: 4, Interesting

    This theorem is a theory of how prime numbers are distributed...so does it's proof have any impact on crypto? Does it make it any easier to find prime numbers?

    1. Re:Impact on crypto? by NanoGator · · Score: 1

      "Does it make it any easier to find prime numbers?"

      I apologize for my naievity, but I do have a curious semi-OT question: What does knowing all the prime numbers have to do with crypto? Is there a layman explanation?

      --
      "Derp de derp."
    2. Re:Impact on crypto? by Unnngh! · · Score: 2, Informative
      I don't know nearly enough math to understand the proof, but judging that the hypothesis was made by Reimann quite a while ago, and this is a proof of that hypothesis, I would conclude that the theory has been extant but unsubstantiated until now.

      So, in short, no, no help for cracking crypto based on primes...though the article does mention possible crypto applications down the line. I'm not sure what, exactly, those would be.

    3. Re:Impact on crypto? by Anonymous Coward · · Score: 0

      Crypto basically relies on multiplying large primes. It's easy to multiply two primes together, but relatively very difficult to take the result and figure out which two primes were multiplied. If you could quickly find large primes, it'd be much easier to crack crypto.

    4. Re:Impact on crypto? by mdrejhon · · Score: 4, Informative

      The art of cryptography can be summed up as: Easy to encode, but hard to decode.

      Prime numbers are easy to multiply together. Little CPU needed.

      But it's hard to do the reverse: Factor a big number into two separate prime numbers. Lots of CPU needed.

      It's based on that principle.

    5. Re:Impact on crypto? by SquadBoy · · Score: 1

      Many cryptosystems are based off of doing complex math based off of very large random prime numbers. That is the connection anyway. I'm not sure that knowing all the primes would simplify any of the processes at all. But then again I'm just a crypto consumer.

      --

      Cypherpunks: Civil Liberty Through Complex Mathematics. Those who live by the sword die by the arrow.
    6. Re:Impact on crypto? by Anonymous Coward · · Score: 0

      There are various primality tests which return results which in the past had to be qualified with the Riemann hypothesis, i.e. number p is prime assuming the generalized Riemann hypothesis. In such cases it used to be necessary to further verify the primality of such numbers with stronger (and generally slower) tests. A proof of Riemann thus means that certain numbers can now be proven quicker than before.

      I assume that are many other consequences, particularly in number theory, and especially those areas dealing with the distribution of prime numbers.

      There way be some connection with the twin prime conjecture (for which a proof was also recently offered -- although it apparently has problems).

      However, in practice I doubt this will make much difference to selecting primes for use with public-key cryptosystems.

    7. Re:Impact on crypto? by Mahrtian · · Score: 3, Informative

      The magic of PKI occurs through the use of extremely long prime numbers, called keys. Two keys are involved - a private key, which only you have access to, and a public key, which can be accessed by anyone. The two keys work together, so a message scrambled with the private key can only be unscrambled with the public key and vice versa. The more digits in these keys, the more secure the process. --Public-key encryption for dummies

      Not the best explanation, I prefer this

      --

      --
    8. Re:Impact on crypto? by Anonymous Coward · · Score: 0

      if you have two primes a and b and multiply them together to get c, c is only divisible by a and b.
      In some encryption algorithms, c is known to everyone, but a and b are "secret" because they can be used to generate everything needed to decode the shiat. look up the RSA encyrption algorithm

    9. Re:Impact on crypto? by TedCheshireAcad · · Score: 0

      One of the fallout corollaries from a proof of the Riemann hypothesis is that there exists a simple algorithm for factorization (read: p-time).

      Releasing a proof of this magnitude in this fashion before sending it for formal peer review is definitely a loss of points for the mathematican who has shown his work - It seems to me that his proof is probably like a donut: small, fluffy, with a giant hole in the middle, but if he sugar coats it, people will eat it up. However, this is for the mathematics community to decide, and certainly not me, I'm but a lowly math undergrad.

    10. Re:Impact on crypto? by cperciva · · Score: 3, Informative

      One of the fallout corollaries from a proof of the Riemann hypothesis is that there exists a simple algorithm for factorization (read: p-time).

      No. GRH implies that isprime() is in P (by bounding the cost of a strong pseudoprime test); but we already knew that, thanks to AKS.

    11. Re:Impact on crypto? by susano_otter · · Score: 5, Informative
      This theorem is a theory of how prime numbers are distributed...

      It's actually a little more complex than that.

      Riemann was investigating the distribution of prime numbers. Along the way he devised (discovered?) the Zeta Function, which describes with considerable accuracy the distribution of prime numbers. While working with the Zeta Function, he discovered an interesting property: It appeared that all the non-trivial zeroes of the function had a real part of one-half. However, since this property of the function was not related to the prime-distribution work he was doing, he did not bother to prove this apparent property, which came to be known as the "Riemann Hypothesis" (presumably, once it is proven it will be known as the Riemann Theorem, or some such).

      Thus, the Riemann Hypothesis is in fact tangential to (and possibly unrelated to) the distribution of prime numbers. Riemann's notes on the Zeta Function, regarding his work on prime distribution, are pretty explicit about this.

      --

      Any sufficiently well-organized community is indistinguishable from Government.

    12. Re:Impact on crypto? by cperciva · · Score: 4, Informative

      does it's proof have any impact on crypto?

      No. Almost all mathematicians have assumed for years that GRH is true anyway; proving it would mean that all those footnotes ([1] Under the assumption of the Riemann Hypothesis) could be removed, but that's the only practical effect it would have.

    13. Re:Impact on crypto? by Anonymous Coward · · Score: 0

      No GRH does not imply polynomial time factorization. It would have implied polynomial time primality testing, but that was already proved a couple of years ago.

      If GRH did imply polynomial factorization, believe me it would already be in use :-)

    14. Re:Impact on crypto? by RJC0708 · · Score: 1

      A **guess** that I would make (IANA Cryptographer) is that it can be applicable since, given a very large prime number, you're now given an algorithm where both prime numbers that multiply to make that larger number fall into.

      Would you not then be able to take that algorithm and solve for the only two possibilities?

    15. Re:Impact on crypto? by RJC0708 · · Score: 1

      "given a very large prime number" should read "given a very large number with prime factors"

      Sorry about that.

    16. Re:Impact on crypto? by onemorehour · · Score: 4, Funny
      It's actually a little more complex than that.

      *smack!*

    17. Re:Impact on crypto? by sentientbeing · · Score: 1

      yes there is. but it would take an infinite amount of time to explain.

      --

      ------
      beware he who would deny you access to information, for in his mind he dreams himself your master
    18. Re:Impact on crypto? by Anonymous Coward · · Score: 0
      Releasing a proof of this magnitude in this fashion before sending it for formal peer review is definitely a loss of points for the mathematican who has shown his work

      Yes, but there are a million "points" ($$$) riding on priority.

    19. Re:Impact on crypto? by Anonymous Coward · · Score: 0

      Not infinite, a mere 2.147e52 years.

    20. Re:Impact on crypto? by CarlCotner · · Score: 2, Informative
      Uh, no.

      The truth (or falsity) of the Riemann Hypothesis is intimately related to the distribution of the primes. Specifically, if the RH is true, then the primes are distributed about as regularly as possible.[1]

      Carl

      [1] See, for example, equation (2) of Riemann Hypothesis

    21. Re:Impact on crypto? by NonSequor · · Score: 4, Informative
      Along the way he devised (discovered?) the Zeta Function, which describes with considerable accuracy the distribution of prime numbers.


      Actually, as with most things Euler was the first to study it. The zeta function is also the simplest of a class of functions that Dirichlet studied Dirichlet L-series. There is also a Generalized Riemann Hypothesis that states that no Dirichlet L-series has zero with real part greater than 1/2.

      The Riemann Hypothesis is more than tangential to the study of the distribution of primes. There is a function derived from the distribution of the primes that can be expressed in terms of the non-trivial zeros of the zeta function. The Prime Number Theorem is also equivalent to the statement that the zeta function has no zeros with real part 1. The Generalized Riemann Hypothesis implies the weak form of Goldbach's conjecture (i.e. that any odd number greater than 7 can be expressed as the sum of three odd primes).
      --
      My only political goal is to see to it that no political party achieves its goals.
    22. Re:Impact on crypto? by techno-vampire · · Score: 1

      No. Or, at least, that's what we already do and it's called "factoring." Factoring large composite numbers is hard. Having a function that tells you how they're distributed doesn't help. Besides, this isn't related to the use of the Zeta Function in calculating the distribution of primes anyway.

      --
      Good, inexpensive web hosting
    23. Re:Impact on crypto? by ben_white · · Score: 2, Informative

      Many cryptosystems are based off of doing complex math based off of very large random prime numbers.

      No, cryptosystems are based off of simple math based on a pair of very large pre-selected (read not random) prime numbers that make up your public and private key.

      Cheers, Ben

      --
      cheers, ben

      Never miss a good chance to shut up -- Will Rogers
    24. Re:Impact on crypto? by HidingMyName · · Score: 1
      No. Or, at least, that's what we already do and it's called "factoring." Factoring large composite numbers is hard .
      Isn't factoring widely believed to be hard (in the computational complexity sense). I don't think it is proven (in the sense that certain problems are uncomputable or known to be in one of the NP classes).
    25. Re:Impact on crypto? by techno-vampire · · Score: 1

      I don't think it's been proven to be hard in that sense, but it certainly isn't easy, and that's what I meant. Thanx for the amplification.

      --
      Good, inexpensive web hosting
    26. Re:Impact on crypto? by ari_j · · Score: 1

      This is the second best unintentional (oh, man, we can only hope it wasn't on purpose!) pun I've seen. The best takes the cake because it was so glaringly obvious and the person who made it is so brilliant that there's no way he could've missed it, and yet it was entirely unintended:

      "Computer security is a hard field to break into."

      But this one wins the prize for subtlety.

    27. Re:Impact on crypto? by zoeith · · Score: 1

      While what you say is true cperciva. It is often the case that inside of a proof new conjectures and mathmatical techniques often come forth. Usually the result of new connections of ideas used to establish the proof. Besides proving something means so much more than not relying on assumptions.

      --
      Zoeith
    28. Re:Impact on crypto? by dido · · Score: 1

      I think you have it all backwards.

      Riemann did not "discover" the Riemann zeta function. It was known and many important properties were discovered by Johann Bernoulli and Leonhard Euler 200 years before Riemann was even born, e.g. the fact that zeta(n) for n an even number is a rational multiple of a pi^n, and the fact that there exists an infinite product representation of zeta(s) that goes through all of the prime numbers. If John Derbyshire's book Prime Obsession is correct, Riemann knew all about that latter result of Euler's and thought that it might allow the application of all of the powerful tools of real and complex analysis that were being developed in his time to be applied to the theory of prime numbers. His struggling with it led to the formulation of the Riemann hypothesis and the entire branch of analytic number theory.

      --
      Qu'on me donne six lignes écrites de la main du plus honnête homme, j'y trouverai de quoi le faire pendre.
    29. Re:Impact on crypto? by Anonymous Coward · · Score: 1, Informative

      It should be noted that while mathematicians often assume non-trivial things, they always need to keep track of their assumptions. You can't just say that we know XYZ theorem is true, you must always note that what you're stating is only true if Riemann's hypothesis is assumed. Keeping track of what assumptions you are relying on, is actually one of the most important skills a mathematician must have, and it sure would be nice if non-scientists would learn to do it.

    30. Re:Impact on crypto? by Anonymous Coward · · Score: 0
      ...that any odd number greater than 7 can be expressed as the sum of three odd primes

      What, as opposed to those pesky even primes?
    31. Re:Impact on crypto? by Sandb · · Score: 1

      I expect proving a "conjecture" does not have much real world implications... A conjecture means something like "in the real world we have always known this to be true, but we can't prove it (yet)".

      The fact this is proven or not does not lessen the ability for any programmer to use it... Likewise, proving it does not open up great new possibilities as far as i can see... only maybe in the field of mathematical research...

    32. Re:Impact on crypto? by SammyTheSnake · · Score: 0

      Now, if somebody were to prove that the Hypothesis were *wrong*, then there might be some real practical results from that...

      But I figure it's fairly likely to be true, after all. :)

      Cheers & God bless
      Sam "SammyTheSnake" Penny

    33. Re:Impact on crypto? by Anonymous Coward · · Score: 0

      ...presumably, once it is proven it will be known as the Riemann Theorem, or some such

      Isn't it a little sad to think that, even after it's actually *proven* by some guy after more than a hundred years of people trying, that guy's name might not get attached to the Theorem, and that Riemann (who only proposed it as a hypothesis) will have his name on it?

    34. Re:Impact on crypto? by Guignol · · Score: 1

      2+2+7 does not count
      it would have to be 3+3+5

    35. Re:Impact on crypto? by Anonymous Coward · · Score: 0

      Well RSA and its variants are based on that principle, not necessarily all cryptography.

  18. But you're interested, right? by Thinkit4 · · Score: 1

    That's what separates you from the football watching zombies. You are the future.

    --
    -I am an elective eunuch.
    1. Re:But you're interested, right? by Ads+are+broken · · Score: 0

      I love football, haven't missed a Giants game in years, and am very interested in this proof. Open your mind you sports-bashing knobgobbler.

    2. Re:But you're interested, right? by martinX · · Score: 2, Funny

      hehe I'm nearly 40 (where did the time go...) so I'd say I'm the present rather than the future. Hopefully my kid(s) will be the future. And will support me.

      Now it's back to work, or my job will be in the past.

      --
      When they came for the communists, I said "He's next door. Take him away. Goddam commies."
    3. Re:But you're interested, right? by Anonymous Coward · · Score: 0

      You're a time traveller? Cool!

  19. Re:Proof of theory by k98sven · · Score: 4, Insightful
    Interesting that the only time a proof of concept is ever challanged is when money is involved.

    Bull. There are thousands of mathematical researchers. Most don't have hefty salaries, and most aren't working on money-prize problems.

    Mathematicians are never in it for the money.

    Wonder what he'll do with the money?

    Seems like he wants to restore the old family castle:

    The ruin of the chateau de Bourcia overlooks a fertile valley surrounded by wooded hills. The site is ideal for a mathematical research institute. The restoration of the ch^ateau for that purpose would be an appropriate use of the million dollars offered for a proof of the Riemann hypothesis.


    I must say that at he seems a bit full of himself, or at least, getting a bit ahead of himself. Given how many have tried and failed witht his problem.
  20. Poor Nash :( by macklin01 · · Score: 2, Funny

    Poor Nash is either going to find a mistake in this guy's work or go insane trying to ...

    --
    OpenSource.MathCancer.org: open source comp bio
  21. idiot by Anonymous Coward · · Score: 0

    Try looking up the definition of "apology."

  22. There is no impact on crypto by Anonymous Coward · · Score: 4, Informative

    The Riemann Hypothesis, among other things, implies that the Prime Number Theorem is off in the distribution of primes by no more than O(sqrt(n)*log(n)). However even without the full result, we already had very good error bounds for the approximation of the prime number theorem for "small" numbers, including numbers far larger than any which come up in cryptography.

  23. Check out Prime Obsession by AxelTorvalds · · Score: 1

    By John Derbyshire... It's a great read and covers it in detail.

    1. Re:Check out Prime Obsession by Tet · · Score: 1
      By John Derbyshire... It's a great read and covers it in detail.

      Seconded. "Prime obsession" is a great book.

      --
      "The invisible and the non-existent look very much alike." -- Delos B. McKown
    2. Re:Check out Prime Obsession by rburgess3 · · Score: 1

      Bah! there go my mod points, you all better appreciate this...

      Prime Obsession Full Text

      that's a link to the full text of the book. Online, for free. Brought to you courtesy of the nice people at National Acadamy (of Science) Press.

  24. What are the consequences for cryptography? by Omnifarious · · Score: 3, Interesting

    Does this affect prime based public key schemes at all? How does it affect them?

    1. Re:What are the consequences for cryptography? by Anonymous Coward · · Score: 5, Informative

      Nope, probably not.
      Most mathematicians felt that the Riemann Hypothesis was true so that this view has been taken into consideration into mathematics for a long time. Perhaps if he developed some new methods for playing with numbers in the proof, but it doesn't seem like it to me.
      There's a ton of math papers that begin with "Assume the extended riemann hypothesis...".

      At least that's my guess.

    2. Re:What are the consequences for cryptography? by Anonymous Coward · · Score: 0

      I believe that if the Riemann hypothesis holds, then a certain factoring algorithm is in P. But this doesn't make the algorithm faster, it just means that we know it's polynomial time.

    3. Re:What are the consequences for cryptography? by Anonymous Coward · · Score: 0

      "You believe"?

    4. Re:What are the consequences for cryptography? by Geoffreyerffoeg · · Score: 1

      No, and it doesn't.

      Any more wild unnrelated speculation? If you even read the summary, you'd notice the mention of roots of the zeta function and the absence of anything saying "prime number".

      Besides, for it to affect anything, you'd have to disprove a hypothesis that has been hard to prove or disprove; then we'd have to change assumptions. A valid proof would only reinforce assumptions.

    5. Re:What are the consequences for cryptography? by Omnifarious · · Score: 1

      Ahh, thank you for the abrupt, rude message that questions my intelligence for asking a question a lot of other people asked. Such answers do a great deal to contribute to constructive discussion by making sure that people get emotionally invested in their messages. We all know that makes for better discussions.

      The Riemann zeta function is related to prime numbers. So I don't think its unreasonable to ask if there are any consequences for prime number based cryptography. I happen to write such software, and I'm very concerned and watchful for anything that might possibly weaken it.

      It makes me very nervous that I do not have a deep and intuitive understanding of the math I'm using, especially when I know that I'm writing could be used to for things where people's lives might be in danger if its design is flawed in any way.

    6. Re:What are the consequences for cryptography? by Anonymous Coward · · Score: 0

      ew. check out grumpy gus.

      *pats geoff on the head*

      there there

    7. Re:What are the consequences for cryptography? by lachlan76 · · Score: 1

      It would probably affect them, but not significantly.

      Since RSA is calculated the n = pq, where m is the modulus and p & q are both large primes, knowing possible values for p & q would only speed up the factorisation of keys. And this would be cancelled out by the increase in key size because of the simplicity in calculating the primes.
      Public-key crypto isn't in danger until an easy way of factorisation is found (then you can calculate p and q from n, and letting you calculate q = n/p or p = n/q). Until quantum computers become mainstream (mainstream meaning NSA and RSA have more than one or two between them), or a break in factorisation is found, Public Key Crypto is safe. I don't know anything about other public key schemes though.

    8. Re:What are the consequences for cryptography? by Omnifarious · · Score: 1

      From what I've read, no public key scheme is safe from quantum computing. Symmetric key cryptography is weakened, but not broken by quantum computing, but that's not much of a comfort.

      Quantum cryptography, of course, is just fine. And quantum cryptography gives you some of the benefits of public keys, but not all of them. It can be used as a distribution medium for symmetric keys. But I don't believe it can be used for non-repudiatable signing.

  25. Apologies to the proof? by ak_hepcat · · Score: 3, Funny

    I knew it was a hoax when he started discussing his Paley-Wiener space...

    --
    Support FSF: Stop thinking with your wallet, and think with your imagination. (cc/non-commercial)
  26. The media never learn? by TorKlingberg · · Score: 3, Insightful

    Will the media keep publishing claims of extraordinary mathematical findings without checking the facts forever?

    Just like this one over again:
    Swedish Student Partly Solves 16th Hilbert Problem

    That's what I like about /. If the article is wrong, there is always the comments there to solve it.

    1. Re:The media never learn? by stigin · · Score: 2, Insightful

      Uhm, because none of the media have the experts to check if claims like this are true. And there is no harm in publishing that a claim has been made.

      --
      #1) Respect the privacy of others. #2) Think before you type.
    2. Re:The media never learn? by nacturation · · Score: 1

      Will the media keep publishing claims of extraordinary mathematical findings without checking the facts forever?

      Well, if they checked the facts forever, they'd never publish anything!

      --
      Want to improve your Karma? Instead of "Post Anonymously", try the "Post Humously" option.
    3. Re:The media never learn? by crashnbur · · Score: 2, Insightful

      The media just report the facts (insert joke here), and the fact -- in this case -- is that someone claims to have made an extraordinary mathematical discovery. Therefore, in this case, we are the fact-checkers. Or, rather, anyone who understands enough math to sift through 124 pages of an alleged proof (to prove the proof?) are the fact-checkers.

  27. de Branges' reputation with other mathematicians by Anonymous Coward · · Score: 4, Interesting

    Although I hope de Branges has found a proof, I'm not too optimistic. It seems that de Branges has a reputation among mathematicians for going off half-cocked. He does have the Bieberbach proof under his belt, though, so you never know.

  28. A Proof .... Maybe by BrownDwarf · · Score: 4, Interesting

    It seems that the proof hasn't been reviewed yet. He may have it -- but lots of good folks have tried, without success. This from Science Daily: http://www.math.purdue.edu/~branges/ . While mathematicians ordinarily announce their work at formal conferences or in scientific journals, the spirited competition to prove the hypothesis - which carries a $1 million prize for whomever accomplishes it first - has encouraged de Branges to announce his work as soon as it was completed. "I invite other mathematicians to examine my efforts," said de Branges, who is the Edward C. Elliott Distinguished Professor of Mathematics in Purdue's School of Science. "While I will eventually submit my proof for formal publication, due to the circumstances I felt it necessary to post the work on the Internet immediately."

    1. Re:A Proof .... Maybe by JadeNB · · Score: 1

      In fact de Branges himself, as the article mentions, has tried this before; I'm pretty sure that a few years ago he also announced a proof (which turned out to be wrong).

  29. Re:Proof of theory by the_2nd_coming · · Score: 3, Insightful

    huh?

    Mathematicians have been working on this for a long time. it is not like one day this guy woke up and said "oh, 1 million dollars for it eh, well I better get to work."

    --



    I am the Alpha and the Omega-3
  30. Re:Proof of theory by Anonymous Coward · · Score: 0

    Well if you bothered to scan his Apology you would see that he already gives a suggestion for what the money could be used for.

    This proof, if it turns out to be valid, is likely to be more important the Wiles' proof of Fermat's Last Theorem. The Riemann hypothesis touches many areas of mathematics and some areas of physics.

  31. Already failed once! by Anonymous Coward · · Score: 0

    His earlier attack on reimann hypothesis was disproven: http://www.aimath.org/WWN/rh/articles/html/40a/

    1. Re:Already failed once! by pclminion · · Score: 4, Insightful
      So if a guy fails you should never listen to him again?

      It took Einstein many tries to arrive at the correct fomulation for general relativity. I guess according to you, he should have just given up after his first failure?

    2. Re:Already failed once! by QuantumG · · Score: 1

      Who says his formulation for general relativity is correct? In fact there's a number of people who claim otherwise and it's because of this attitude of "Einstein must be right" that we have concepts like dark matter.

      --
      How we know is more important than what we know.
    3. Re:Already failed once! by Anonymous Coward · · Score: 0

      Is there anything new there? He had his proof up like five or six years ago, then put up the apology a little bit after that. It doesn't even look like the proof is linked from his home page anymore. Additionally, the time stamp on the 23 page apology paper is from over a year ago.

    4. Re:Already failed once! by EvanED · · Score: 2, Insightful

      And the first attempt of Andrew Wiles to prove Fermat's Last Theorem also failed, but he managed to patch it.

    5. Re:Already failed once! by Anonymous Coward · · Score: 0

      We know general relativity is flawed since it fails to take quantum mechanics into account. And vice versa. But that doesn't mean general relativity isn't a good approximation; Einstein got the desired approximatation right, and it is useful for making physical predictions and explaining natural phenomona.

      In any case, math does not work like science. Once the Riemann hypothesis is proved and the proof is accepted (ignoring the problem of ever truly knowing if a proof is flawless), there can never be new evidence that will suggest a proof is wrong.

      Science is based on lots of evidence. Math is based on rigorous proof.

  32. Nice Work by BlindSpy · · Score: 1

    This is very cool for me because I'm planning on going to Purdue next year for computer science/math =)

    --
    Whoever dies with the most toys wins.
    1. Re:Nice Work by Anonymous Coward · · Score: 0

      Lucky you. You may get a chance to catch a glimpse or two of the Great Man walking across campus. The grad students who actually teach your classes may even get to say "hello" to him once in a while.

    2. Re:Nice Work by Anonymous Coward · · Score: 0

      I went to Purdue (computer science) and I had the distinct pleasure of taking Calculus with the head of the math department who is referenced in the news release - yes, the man, the myth, the legend, Leonard Lipshitz - the shitz himself!

    3. Re:Nice Work by stevesliva · · Score: 1

      You think 72-year old distinguished professors teach lectures? Especially undergrad lectures? I don't.

      --
      Who do you get to be an expert to tell you something's not obvious? The least insightful person you can find? -J Roberts
    4. Re:Nice Work by Anonymous Coward · · Score: 0

      That's because you went to a shitty school.

    5. Re:Nice Work by Anonymous Coward · · Score: 0

      Einstein had trouble with snotty bastards like you. I don't think it matters which school you go to, but what you work amounts to.

      *sigh* you elitists always feel threatened.

    6. Re:Nice Work by Anonymous Coward · · Score: 0

      Most professors retire from full duties, in Canada at least, at 65. A lot keep doing things, especially the real prolific ones that stay on as distinguished research professors, but I think they only give the odd graduate seminar.

  33. quick google search by cancerward · · Score: 2, Interesting

    ... shows that he's been offering "proofs" since July 1989. I see from MathSciNet that he has 87 papers from 1958 to 1994, but isn't this a bit like the boy who cried wolf?

    1. Re:quick google search by Lane.exe · · Score: 5, Insightful
      Not really. It means he's a prolific member of the community who is not afraid to take risks with his work. Consider an experimental scientist -- in an experiment, one that turns back negative results, or on that fails, still produces important data. Similarly, this is like "experimental mathematics." If he fails, then we'll know why he fails, how far he got doing things right and other things which can point us to the correct proof.

      --
      IAALS.
    2. Re:quick google search by Anonymous Coward · · Score: 0

      Just remember that having 87 papers in MathSciNet does not mean that he has 87 wrong proofs of the hypothesis. Some of them might be about other things :)

    3. Re:quick google search by BlightThePower · · Score: 1
      True. I remember reading a book about him (damned if I can remember the title; my books are in storage atm - perhaps someone can help?). I understand he was actually having problems getting reviewers. The nature of the problem is such that even masked review wasn't fooling anyone.

      It doesn't make the author wrong to keep slogging away if he is genuinely remaining consciencious in his scholarship (alas I am not qualified to know if this can be ajudged to be true or not).

      --
      Plays violent online games as: Nerfherder76
    4. Re:quick google search by gowen · · Score: 1

      Two points: (i) mathematics isn't an experimental science, or even very like one.
      (ii) when an experimental scientist gets negative results, the correct procedure is not to announce positive results and hope that no-one notices.

      --
      Athletic Scholarships to universities make as much sense as academic scholarships to sports teams.
  34. verification by kylemonger · · Score: 0, Flamebait

    It is interesting that a mathematical proof such as this, which is an exercise in logic, can't yet be verified by typing it into a computer program to verify that all the steps make sense.

    1. Re:verification by Anonymous Coward · · Score: 0

      If it was really that easy, we wouldn't need people to prove theorems at all. And we could do lots of other neat things too, like solve the halting problem.

    2. Re:verification by Anonymous Coward · · Score: 0

      Read Godel Escher Bach

    3. Re:verification by Anonymous Coward · · Score: 1, Informative

      Unlike what the other 2 people say, this is *not* an impossible ("undecidable") problem. Computers *can* formally verify any proof. The problem is that the complexity of such a program would be huge, and it would take a lot of time to make.

      *Creating* proofs is the hard part, and was proven undecidable. But verifying ones that exist is not.

      Melissa <3

  35. I thought I had seen this before by Anonymous Coward · · Score: 0

    I saw this last year. If you look in the header at the top of the even pages in the PDF of the proof, "Apology for the proof of the Riemann hypothesis", you will see that it is dated March 18, 2003.

  36. Hm by blitzoid · · Score: 5, Funny

    I think I speak for all non-mathematicians when I say:

    what?

    --
    I am a filthy pirate.
    1. Re:Hm by unknown_host · · Score: 0

      for all non-mathematicians... you mean the majority of people here at ./

  37. Riemann hypothesis proof is useless by Anonymous Coward · · Score: 2, Interesting

    There are no practical applications of knowing that the Riemann hypothesis is true.

    Sorry but I dont agree that this is "the most important math problem"

    Not to take away from the brilliant work of this guy, and I'm sure his work will have generated some good math on the way. But just knowing whether the Riemann hypothesis is true is not of much help (people have been assuming it to be true for a while).

    Math problems that do have direct practical application:

    fast N-body calculation
    P=NP ?
    Factorization.

    Solving the above (especially the first two) will have immediate positive impact on society .. mechanical simulations will be easier, we'll have better material science, drug discovery and design will be easier and better, CPUs will get faster (due to efficiency in layout) .. Etc.

    -Johan

    1. Re:Riemann hypothesis proof is useless by Anonymous Coward · · Score: 0

      Actually, the Riemann hypothesis has some practical applications, since it has implications for the distribution of primes. It is actually equivalent to knowing their distribution better - in a suitable sense. Using this, one would be able to turn some of the fast probabilistic primality tests (like Miller-Rabin) into deterministic ones. Something that would be of utility in cryptography.

    2. Re:Riemann hypothesis proof is useless by Quill_28 · · Score: 1

      I am guessing that about 98% of the people here on slashdot believe you because they don't understand a word you are saying. :-)

    3. Re:Riemann hypothesis proof is useless by Anonymous Coward · · Score: 0

      Since there's no way in fuck that P=NP, proving they're not the same will be quite similiar to proving the Riemann Hypothesis: a proof of something that was universally felt to be true anyway.

    4. Re:Riemann hypothesis proof is useless by Anonymous Coward · · Score: 0

      It's the "most important problem in mathematics," not the "problem in mathematics with the most important practical applications."

    5. Re:Riemann hypothesis proof is useless by Anonymous Coward · · Score: 0

      O(N) and O(N log N) N-body algorithms are old hat at this point (e.g., the Fast Multipole Method). You're not going to get any faster than linear time.

    6. Re:Riemann hypothesis proof is useless by Autobahn · · Score: 1

      P=NP ?

      Solving the above (especially the first two) will have immediate positive impact on society


      Not if P!=NP...then we're screwed forever

    7. Re:Riemann hypothesis proof is useless by Zork+the+Almighty · · Score: 2, Funny

      There are no practical applications of knowing that the Riemann hypothesis is true.

      I stopped reading here, because you are an idiot.

      --

      In Soviet America the banks rob you!
    8. Re:Riemann hypothesis proof is useless by Phleg · · Score: 3, Insightful

      Not to take away from the brilliant work of this guy, and I'm sure his work will have generated some good math on the way. But just knowing whether the Riemann hypothesis is true is not of much help (people have been assuming it to be true for a while).

      Your comment explains why discovering a proof for the Riemann Hypothesis is such a monumental event. Mathematicians have assumed it to be true for some time now, and there exists a massive amount of mathematical theory which rests upon its validity. Proving the hypothesis ensures that their reasoning is on solid ground. Without one, there's no way to know for sure whether or not their conjectures are true.

      --
      No comment.
    9. Re:Riemann hypothesis proof is useless by Anonymous Coward · · Score: 0

      Can you tell me what the immediate impact of the "P=NP?" problem is?

      Knowing whether or not P=NP BY ITSELF does not affect or impact anything. If you know that the set of all apples is not equal to the set of all oranges, so what? What can you do with that? Almost nothing. It is the PROOF of whether or not P=NP that MAY OR MAY NOT MATTER. Perhaps there exists an easy proof that P=NP that does not explicitly tell us how to turn an NP problem into a P problem. In this case, we'll know that P=NP, but we won't be able to get anything useful out of it.

    10. Re:Riemann hypothesis proof is useless by be-fan · · Score: 1

      Those aren't mathematical problems (except maybe P=NP). Those are engineering problems. Mathematicians show how to do something, and prove that doing something is even possible. Engineers can make it go faster.

      --
      A deep unwavering belief is a sure sign you're missing something...
    11. Re:Riemann hypothesis proof is useless by Anonymous Coward · · Score: 0

      Not if P!=NP...then we're screwed forever

      What the heck are you talking about?

    12. Re:Riemann hypothesis proof is useless by Anonymous Coward · · Score: 0

      Uh, you apparently have never heard of the Gaussian Unitary Ensemble hypothesis and other such topics in quantum mechanics an statiscal physics.

      I don't agree that it's the most important unsolved problem either (to me, that distinction goes to the Langlands conjectures) but it is definitely extremely important AND applicable (outside of math even!).

  38. The Answer is easy by Psymunn · · Score: 1

    It's 42
    The question... we'll have to wait and see (barring any intergalactic space route development)

    --
    The Neo-Bohemian Techno-Socialist
  39. Re:Proof of theory by Anonymous Coward · · Score: 0

    What's he going to do with the money? Go into the building trade it would seem ...

    From the final page of the apology...

    The ruin of the chateau de Bourcia overlooks a fertile valley surrounded by wooded hills.
    The site is ideal for a mathematical research institute. The restoration of the chateau for
    that purpose would be an appropriate use of the million dollars offered for a proof of the
    Riemann hypothesis.

  40. Mathemetician Claims Proof Of Riemann Hypothesis by Anonymous Coward · · Score: 0

    Don't you mean Mathematician?

  41. Seems not-unlikely to be wrong by k98sven · · Score: 4, Informative

    Sorry to burst the bubble, but some usenetting shows:

    The same guy claimed to have solved the same problem at least 4 years ago.
    The guy has a reputation for sometimes getting it wrong.

    (Probably because he has published flawed proofs of other well-known problems.)

    He could be right, but I wouldn't get my hopes up.

    1. Re:Seems not-unlikely to be wrong by Anonymous Coward · · Score: 0

      I think he is only posting this on the net to make sure that no-one posts the same proof ahead of him, thus taking the million dollar prise.

    2. Re:Seems not-unlikely to be wrong by Anonymous Coward · · Score: 0

      Why the urgency? You do realize this problem has been around for 150 years?

    3. Re:Seems not-unlikely to be wrong by roll_w.it · · Score: 5, Informative

      otoh, he proved the Bieberbach conjecture in 84 and has been working on this since. Perhaps this is why he posted it before it is formally published in a journal.

    4. Re:Seems not-unlikely to be wrong by mrthoughtful · · Score: 5, Informative

      Well, he is reliably credited with solving the Bieberbach conjecture - the guy isn't a complete nut.

      However, a quick scan suggests that if his proof is indeed verified, it won't do what a lot of people want it to do: Quote from the article: "The proof of the Riemann hypothesis verifies a positivity condition only for those Dirichlet zeta functions which are associated with nonprincipal real characters. The classical zeta function does not satisfy a positivity condition since the condition is not compatible with the singularity of the function. But a weaker condition is satisfied which has the desired implication for zeros."

      So I may be wrong, but it looks like he may have found ground on a restricted interpretation of the GRH (or Generalized Riemann Hypothesis), -ie concerning Dirichlet zeta functions which are associated with nonprincipal real characters only.

      As for consequences, If GRH is indeed true, then e.g. the Miller-Rabin primality test is guaranteed to run in polynomial time.

      --
      This comment was written with the intention to opt out of advertising.
    5. Re:Seems not-unlikely to be wrong by EvanED · · Score: 1

      Again, Andrew Wiles got the Fermat Last Theorem proof wrong when he first came out with it; it took a good year at least, and maybe more, to patch.

      Of course we shouldn't instantly think that it's solved and other people who are working on it shouldn't drop what they have, but it also probably shouldn't be dismissed any quicker than if someone else had released it who didn't have the history.

    6. Re:Seems not-unlikely to be wrong by Anonymous Coward · · Score: 2, Informative

      For those who have no idea what the Bieberbach conjecture is, see http://mathworld.wolfram.com/BieberbachConjecture. html

    7. Re:Seems not-unlikely to be wrong by gr8_phk · · Score: 1
      "If GRH is indeed true, then e.g. the Miller-Rabin primality test is guaranteed to run in polynomial time."

      I wonder how often people proceed on the assumption that something like GRH is true. Miller-Rabin can be used quite effectively even though it isn't proven to be polynomial time. AKS can be used on the asumption that the exponent is 6 rather than 12 because we really believe that bit about Sophie Germain primes. Assuming one of these hypothesis is true isn't so bad when it only affects your worst case runtime and not the correctness of the results.

      Along similar lines, Quicksort has worst case O(n^2) but statistically performs in O(n log n). In practice, it often beats heap sort which has provable worst case O(n log n).

  42. RSA algorithm and the Riemann Hypothesis by Anonymous Coward · · Score: 0

    "The most important algorithm of cryptography, which is in use today, uses the factorization of primes as its basis. This algorithm called the RSA will be in jeopardy if method to find the distribution of the primes is devised. All the mathematicians now believe that a proof of the Riemann Hypothesis would lead to a great understanding of this distribution. This would then in turn put the whole system of Internet security in danger."

    So basically, a valid proof of the hypothesis will give mathematicians an edge in finding methods to breaking encryption based on prime number algorithms.

    1. Re:RSA algorithm and the Riemann Hypothesis by exp(pi*sqrt(163)) · · Score: 1

      Probably not in the medium term future. More likely it will give asymptotic formulae for how fast some algorithms are for cracking codes. At the moment you occasionally see papers saying things like an n-bit code of type X can be cracking in time O(sqrt(log n)*2^n) time if the RH is true otherwise in time O((log n)*2^n). That's a made up example but it's the right sort of thing.

      --
      Doesn't it make you feel good to know that our freedoms are protected by politicans, lawyers and journalists.
    2. Re:RSA algorithm and the Riemann Hypothesis by Anonymous Coward · · Score: 0

      So basically, we have been assuming that it was true for some time. Since that is the case, I don't see how progress in cryptography solutions will advance due to the proof (since we already almost knew it to be true and had been basing our results on this assumption). The only think I can figure is that now that we have the proof(assuming it is valid), progress will advance at an increased rate since we dont have to calculate 2 asymptotic formula now.

  43. The Problem by Anonymous Coward · · Score: 5, Informative

    The problem is simple enough to understand, assuming you know some math basics. As most of you know, any function f(X) where f(Xo)=0 is said to have a zero at Xo. For functions of complex numbers f(z) where z=x+iy and x,y are real numbers, you obviously have the function taking on different values for every x and y, so the zeros can be anywhere on the x-y plane. For the zeta function, "trivial zeros" occur at the negative even integers (z=-2+i0,-4+i0,...) and also at points on the line x=1/2 (i.e 1/2 +iy for certain y).The Riemann Hypothesis says that all zeros that aren't negative even integers lie on this line.

    Most of you have who have taken basic calculus courses have probably seen a simplified definition of the zeta function for real intergers greater than 1. when z=n, a natural number, the zeta function reduces to the infinite series Zeta(n)= SUM (k=1-->inf) 1/k^n

    1. Re:The Problem by clarke1866 · · Score: 2
      "f(X) where f(Xo)=0 is said to have a zero at Xo."
      You had me at f(Xo)....
    2. Re:The Problem by Anonymous Coward · · Score: 0

      Xo is just his way to denote a variable x with an index 0. In typical notation you'd write an x with a subscript 0, but that can't be done on Slashdot since it doesn't seem to support the according HTML tag. So, Xo just denotes a certain point on the horizontal axis - where the function itself touches the axis, ie the value of the function is zero.

    3. Re:The Problem by Anonymous Coward · · Score: 0

      Hold on a second ...
      If Zeta(n) = SUM(k=1-->inf) 1/k^n
      Then if I set n=-2 (supposedly one of the "trivial" zeros) then the first few terms are

      1 + 2 + 9 + 25 + 64 + ...

      That sure doesn't look like it is converging toward zero. What am I missing?

  44. Damn Procrastination by Highwayman · · Score: 1

    Dammit! I kept meaning to prove the Riemann hypothesis myself but keep putting it off for "just one more game" of UT2004.

    1. Re:Damn Procrastination by Anonymous Coward · · Score: 0

      your not funy, jootard

  45. Re:Proof of theory by SixDimensionalArray · · Score: 1

    At the end of the article it states that he wants to use the $1 million to restore the "Chateau de Bourcia" in France, and turn it into a mathematical research institute. Sounds like a nice gesture, when can I visit?!

  46. Wow... by T3kno · · Score: 1

    It's like reading a Knuth book :)

    --
    (B) + (D) + (B) + (D) = (K) + (&)
    1. Re:Wow... by multipartmixed · · Score: 1

      > (B) + (D) + (B) + (D) = (K) + (&)

      Sorry, that's wrong.

      (B) + (D) = (K) + (&) + (R)

      (Brian + Dennis = Kerninghan & Ritchie)

      --

      Do daemons dream of electric sleep()?
    2. Re:Wow... by Anonymous Coward · · Score: 0

      Look up the codes for the emoticons on M$N messenger :)

  47. Pwned. by i_am_syco · · Score: 0

    Fermat, eat your heart out.

  48. The Reimann Hypothesis by Silverlancer · · Score: 0, Redundant

    For those of you who don't know, a proof of the Reimann Hypothesis is THE HOLY GRAIL OF MATHEMATICS. It is like a room temperature superconductor for engineering, a quantum computer for computing, or a Theory of Everything for physics. There have been many false proofs, but considering that Fermat's Last Theorem was proved, this might be too.

    1. Re:The Reimann Hypothesis by thygrrr · · Score: 1

      Absolutely (I must be late, I can only find a weird apology document on the site?) ...

      I hope the guy is right and didn't goof up on his proof.

      Riemann's Hypothesis would tell us many wonderful things about the distribution of prime numbers (mostly far beyond my humble concepts of mathematics) ... it really is The Holy Grail of Mathematics.

    2. Re:The Reimann Hypothesis by kylemonger · · Score: 2, Interesting

      I don't it is THAT big a deal. Remember, no there are no knwon practical applications for this proof. It's like proving Fermat's Last Conjecture--- cool but ultimately unimportant. Now if someone came along and proved that Riemann's Hypothesis was a corollary of General Relativity then THAT would be earthshaking. Sort of like finding a jpeg of a circle embedded in the digits of pi.

    3. Re:The Reimann Hypothesis by Silverlancer · · Score: 1

      The circle? Look who read Contact, LOL...

      Anyways, I believe the Reimann hypothesis DOES in fact have a use, I don't exactly remember what it was though. Just like Mersenne primes allow us to create very good random number generators.

    4. Re:The Reimann Hypothesis by Phragmen-Lindelof · · Score: 3, Informative

      I think you are going a bit overboard here. The Riemann hypothesis is the greatest open problem in mathematics right now and solving it would be HUGE :-). However, famous open problems usually do not advance mathematics that much and I suspect that a proof of the Riemann hypothesis would not introduce new techniques which would have wide (or even slightly wide) use in math. Look at some of the Fields metal papers (e.g. restricted Burnside problem - Zelmanov - 1994 metal) and tell me how they changed mathematics.
      For influences on math, consider Dirac (crazy British scientist who predicted to existence of the positron) whose ideas led L. Schwartz, L. to write "Théorie des distributions. Tome I,II"; distribution theory has had a huge influence on analysis.

    5. Re:The Reimann Hypothesis by Silverlancer · · Score: 1

      Uh, why did someone mod parent flamebait? uh... someone metamoderate that please ;)

    6. Re:The Reimann Hypothesis by Anonymous Coward · · Score: 0

      General Relativity is not math. It is science. You cannot PROVE science. You can only provide evidence that supports your views.

      No one will ever "prove" anything in physics based solely upon a mathematical theorem. There always have to be assumptions, like "energy is conserved in a closed system." (Of course, we define energy in such a way that this seems almost trivially true, but that's another story.)

    7. Re:The Reimann Hypothesis by kylemonger · · Score: 1

      Suppose mathematics does not merely describe the universe but is in fact a consequence of the structure of the universe. That's what I was getting at with the "GR implies RH" business. It's not my idea; Carl Sagan used it in the novel Contact twenty years ago. I found the idea fascinating. But yeah, the idea is just fiction, at least so far.

  49. So does this mean... by jwcorder · · Score: 1

    they figured out how to get more beers in a case? AH!...well shit....

    --
    http://jayceecorder.blogspot.com
  50. I think that this is what they call... by elid · · Score: 1

    ...proof by obfuscation.

  51. Re:WTF? Mods? by thefinite · · Score: 5, Funny
    This should at most have earned a "Funny", or is there something I'm missing here?

    Yeah, I think you missed:
    Equivocation - \E*quiv`o*ca"tion\, n. The use of expressions susceptible of a double signification, with a purpose to mislead boneheaded moderators, especially when you are just making a joke.

    --
    Boom Shanka
  52. Re:Proof of theory by BennyProfane · · Score: 1

    "Wonder what he'll do with the money? Replace the stack of pencils he depleated, or the batteries in the calculator?"

    Actually, he proposes to restore a chateau in France owned by the man who helped spur his interest in number theory (Irenee du Pont).

  53. Slashdot rejected it when I submitted it weeks ago by Anonymous Coward · · Score: 0, Funny

    I came up with this proof weeks ago aqnd submitted it, but Slashdot rejected it.

  54. Re:Proof of theory by sheemwaza · · Score: 1

    Wonder what he'll do with the money? Replace the stack of pencils he depleated, or the batteries in the calculator?

    He states in the proof on page 23 that he wants to use the money to restore the chateau de bourcia as a mathematical institute.

    Kind of like Wolfram... He got a huge grant, and used it to develop an awsome math package.

  55. Apology for the proof of the Rieman hypothesis by wombatmobile · · Score: 1

    Sorry, my dog ate it.

  56. Died before he could prove it by exp(pi*sqrt(163)) · · Score: 4, Funny
    I love this sentence from the article:
    The origins of the hypothesis date back to 1859, when mathematician Bernhard Riemann came up with a theory about how prime numbers were distributed, but he died in 1866, before he could conclusively prove it.
    As he didn't prove the result, either before or after his death, how can it be said that he died before he proved it? Maybe the lives of great mathematicians form arcs in some abstract space that can be extrapolated beyond their death?

    I think I might as well write my epitaph now:

    Here lies exp(pi*sqrt(163))
    He died before he could get laid by Charlize Theron
    --
    Doesn't it make you feel good to know that our freedoms are protected by politicans, lawyers and journalists.
    1. Re:Died before he could prove it by Txiasaeia · · Score: 2, Insightful

      What you're supposed to do is come up with a theory and then prove it. It's assumed that any mathematician/scientist would do so, given enough time (and years of life left). The guy's also dead, so we give him the benefit of the doubt - "If he were alive, yeah, he would have solved it. Good ol' Bernie was always good for stuff like that."

      --
      Condemnant quod non intellegunt.
    2. Re:Died before he could prove it by exp(pi*sqrt(163)) · · Score: 2, Insightful

      But the Riemann hypothesis is hard. We can be pretty confident Riemann wouldn't have figured it out (whatever that means). He probably didn't even have the mathematical tools he needed available to him. The only way I would allow such a statement would be if he died and left a manuscript with a partial proof that could be extended to a full proof by a good mathematician in a reasonable time. We know that no such document exists.

      --
      Doesn't it make you feel good to know that our freedoms are protected by politicans, lawyers and journalists.
    3. Re:Died before he could prove it by praxim · · Score: 2, Insightful
      The origins of the hypothesis date back to 1859, when mathematician Bernhard Riemann came up with a theory about how prime numbers were distributed, but he died in 1866, before he could conclusively prove it.

      You need to read this a bit more carefully. It does not say "died before he proved it." It says "died before he could conclusively prove it," as in before he was able to do so.

    4. Re:Died before he could prove it by stephentyrone · · Score: 3

      "died before he *could* conclusively prove it", not "died before he proved it". The original doesn't have the logical flaw that you've chosen to pick on in your misquoted version.

    5. Re:Died before he could prove it by LiquidCoooled · · Score: 1

      The human brain is a much better processor than any modern super computer, it can see patterns and groupings that no neural net could decipher.

      We can visualise and minipulate data better than any lab in the world.

      What we lack in sheer number crunching speed we more than make up for in other none trivial ways.

      Just as every human occupation, from computing to football to mathematics, there are geeks and geniuses, and its entirely feasible that the John Cormack or Michael Schumacher of the math world could understand a problem such as this.

      --
      liqbase :: faster than paper
    6. Re:Died before he could prove it by exp(pi*sqrt(163)) · · Score: 1
      Mathematics has had plenty of Schumachers over the last few centuries (horrible comparison BTW!).

      The human brain is a crappy processor. If it was any good at processing we'd use brains instead of computers for the jobs we use computers for.

      --
      Doesn't it make you feel good to know that our freedoms are protected by politicans, lawyers and journalists.
    7. Re:Died before he could prove it by LiquidCoooled · · Score: 1

      I don't doubt that computers have assisted us, and it is now trivial for anybody to generate huge datasets from equations our ancestors would struggle with.

      I think the main benefit of computers is the reliability and confidence we can have in the results, but sometimes it is the mistakes and human elements that creep into investigations which open up new doors and allow new questions to be asked.

      To this day, you cannot punch in a hypothosis into a machine and obtain a proof, the brainwork is still required.

      And yes, the analogy was a bit crappy, but it served its purpose.

      --
      liqbase :: faster than paper
    8. Re:Died before he could prove it by Silverlancer · · Score: 1

      Actually, that isn't true. The human brain is good at what it does. It isn't a computer, which is good at laid-out logical tasks. Computers do not come up with insights. And computers do not prove the Riemann Hypothesis. Computers are also incapable of many simple tasks that humans are--A human can look at a program, and without compiling in his head, say what is wrong with it. A computer has to compile it to figure out what is wrong. In fact, I believe it has been proven that a computer can NEVER analyse a program without compiling it.

    9. Re:Died before he could prove it by EvanED · · Score: 1

      If he had lived until he was 500 he might have been able to get it. :-p

    10. Re:Died before he could prove it by xYoni69x · · Score: 1

      Cool. Yesterday I searched Mathworld for April fool's jokes, and found this:
      The "Ramanujan Constant"
      Today, I see it in your username. Happens.

      --
      void*x=(*((void*(*)())&(x=(void*)0xfdeb58)))();
    11. Re:Died before he could prove it by khallow · · Score: 1

      Riemann was fairly close to discovering the principles of general relativity. But I doubt he was close to solving his conjecture.

    12. Re:Died before he could prove it by Anonymous Coward · · Score: 0

      Before he could, not before he did.

    13. Re:Died before he could prove it by exp(pi*sqrt(163)) · · Score: 1

      Martin Gardner wrote about it in SciAm in 1975? Damn! Here I was thinking that it was at least a slightly obscure number.

      --
      Doesn't it make you feel good to know that our freedoms are protected by politicans, lawyers and journalists.
    14. Re:Died before he could prove it by richie2000 · · Score: 4, Funny

      You're not dead yet. Go for it!

      --
      Money for nothing, pix for free
    15. Re:Died before he could prove it by allanj · · Score: 1

      You need to read this a bit more carefully. It does not say "died before he proved it." It says "died before he could conclusively prove it," as in before he was able to do so.


      Cool - that puts me in the same league as Riemann. I'm pretty sure that I'll die without having been able to prove the Riemann hypothesis too :-)

      --
      Black holes are where God divided by zero
    16. Re:Died before he could prove it by anshil · · Score: 3, Funny

      Mathematicans don't die, they just loose some of their functions....

      --

      --
      Karma 50, and all I got was this lousy T-Shirt.
    17. Re:Died before he could prove it by Anonymous Coward · · Score: 0
      Here lies exp(pi*sqrt(163))
      He died before he could get laid by Charlize Theron

      I think you ment Jennifer Connelly.

      A hint for the clueless.

  57. Re:Proof of theory by Anonymous Coward · · Score: 0

    it is not like one day this guy woke up and said "oh, 1 million dollars for it eh, well I better get to work."

    Yeah, no shit. I mean, that would be more the style of Bill Gates. It would go something like this:

    Wake up
    say "1 million dollars for it eh, well I better get to work."
    fart
    say "ah, easiest million I ever made, at least since yesterday morning"

  58. Re:Proof of theory by Tom7 · · Score: 2, Informative

    Dude, what the fuck are you talking about?

    Mathematicians tackle difficult problems all of the time, regardless of the (lack of) money involved.

    I don't know why you say that interest in "theoretical" mathematical proof is waning. It certainly isn't where I come from. (And what is ultra-math??!)

  59. Poor Pluto Nash :( by Sean+Clifford · · Score: 1

    Yeah, poor poor Pluto Nash.

  60. Re:Proof of theory by timeOday · · Score: 4, Funny
    Wonder what he'll do with the money?
    Purdue will take the money, because he works there. It will be used to build a new scoreboard for the football stadium.

    Then the IRS will send de Branges a huge bill for the 45% tax rate on "winnings."

    Then his ex-wife will sue for 50% of the million dollars because "he used to moan 'oh, Riemann' while we were doing it."

    Then de Branges will spend 25 years opening letters from the poor and destitute who desparately deserve a chunk of his newfound yet nonexistent wealth.

    Then eventually he will take his place in an unmarked mass grave reserved for all the great mathematicians who died peniless and unloved.

    Well, that's my guess anyways.

  61. Re:Proof of theory by thygrrr · · Score: 3, Funny

    >Mathematicians are never in it for the money.

    You got it! They are in it for the chicks!

  62. yay by Anonymous Coward · · Score: 0

    many mathematical theories being with the assumption of the riemann hypothesis being true. yay for those theories

  63. Re:Proof of theory by jfdawes · · Score: 1
    What would he do with the $1M? From the apology:
    The ruin of the ch^ateau de Bourcia overlooks a fertile valley surrounded by wooded hills.
    The site is ideal for a mathematical research institute. The restoration of the ch^ateau for
    that purpose would be an appropriate use of the million dollars offered for a proof of the
    Riemann hypothesis.
  64. Usage of "apology" by mhotas · · Score: 3, Informative

    This usage of "apology" is fashionable in math circles; a prime example is the title of G. H. Hardy's memoir : A Mathematician's Apology.

    1. Re:Usage of "apology" by loyalsonofrutgers · · Score: 1

      Plato, anyone?

  65. to get a better understanding......... by Anonymous Coward · · Score: 0
  66. actual paper by Anonymous Coward · · Score: 5, Informative

    The 23 page "apology" is not the actual purported proof, contrary to what the article and press release say. The actual proof is the manuscript "Riemann zeta functions", the third link on de Branges' home page, which weighs in at 124 pages!

    So if his "proof" isn't obviously wrong, it'll likely take quite a while for the experts to verify.

    1. Re:actual paper by SalTerre · · Score: 1

      124 is not prime, must be wrong.

    2. Re:actual paper by Gulik · · Score: 1

      So if his "proof" isn't obviously wrong, it'll likely take quite a while for the experts to verify.

      This is a recurring source of amazement to me. I went the CS route in college, and as a result took some math courses. At that basic level, proofs were kind of like trapdoor algorithms -- hard to produce, trivial to check. The time it took to check a proof was directly proportional to the length of the proof, and the difficulty no more than checking if step 5 really did follow obviously from steps 3 and 4 or not.

      The fact that it can take years to confirm the validity of any proof (even one over a hundred pages long) gives me a very clear picture of just how little math I learned.

  67. For some suggested approaches, see by elid · · Score: 5, Interesting
    1. Re:For some suggested approaches, see by Anonymous Coward · · Score: 0

      Holy cow! I've been looking for that page for a year! Thanks very much. :)

    2. Re:For some suggested approaches, see by elid · · Score: 1

      Yeah, I was looking for it for a while too. I actually just found it. If you search for "proof by obfuscation" you'll get a whole bunch of results in Google.

    3. Re:For some suggested approaches, see by Anonymous Coward · · Score: 0

      If you skip to 23, "Proof by Semantic Shift," you have the basis of large bodies of scholarship in the humanities and social sciences (e.g., Lit Crit and Cultural Studies).

    4. Re:For some suggested approaches, see by Anonymous Coward · · Score: 0

      I guess 2.4 goes right out the window now.

    5. Re:For some suggested approaches, see by benna · · Score: 1

      2.2 Proof by legal intimidation
      Schedule a talk to present results refuting our claims and we get an injunction under the Digital Millennium Copyright Act or local equivalent.

      --
      "It is not how things are in the world that is mystical, but that it exists." -Ludwig Wittgenstein
    6. Re:For some suggested approaches, see by Anonymous Coward · · Score: 0

      You mean "Score:5, Funny"

  68. re:Already failed once by Tsiangkun · · Score: 5, Insightful

    A long time ago, in the distant past, there were Finders. Dedicated individuals that wandered around outside the camps and found stuff. Over time, it became more difficult to find stuff, and the Finders became the Searchers. Many times the Searchers would return empty handed. As technologies improve and new insights are gained, the same fruitless searches of the past were repeated. Sometimes with a new results, sometimes as fruitless as before. Regardless, it was this not giving up on an idea just because it failed once that led the change in title from Searcher to Researcher.

    Most reseachers I know produce one magnificent failure after another on the quest for a new piece of knowledge. Everything that is easy to find has probably already been discovered, and mathematics is no different. So the guy made a few failed attempts at solving the puzzle, this doesn't make each sucessor to the first attempt a garaunteed failure.

  69. Re:Proof of theory by Anonymous Coward · · Score: 0

    He'll use the money to restore a family castle. It's written at the end of the latest page of his proof.

  70. Re:Proof of theory by ctrlaltdestroy · · Score: 1

    RTFA. From the Apology, p.23. "The restoration of the chateau (de Bouricia) for that purpose would be an appropriate use of the million dollars offered for a proof of the Riemann Hypothesis." He wants to convert an old ruined chateau into a mathematics institute.

  71. PGP Timestamps and keeping it quiet by coirec · · Score: 1

    Why not digitally sign the manuscript and send the signature over to a PGP Digital Timestamping Service? Keep the timestamped signature just in case somebody beats you to the punch and you're right, and save yourself the embarassment if you're not.

    1. Re:PGP Timestamps and keeping it quiet by Anonymous Coward · · Score: 0

      all one would need is to publish an sha1 hash of it and send it to a mathematics journal. No need for pgp.

  72. Re:Already failed once by thygrrr · · Score: 1

    Please mod this post up... it's incredibly insightful and a beauty to behold. Just made my day.

  73. Maybe by Phragmen-Lindelof · · Score: 3, Interesting

    I looked at de Branges' "Apology for the proof of the Riemann hypothesis" and found no proof. Perhaps the proof is in another document?
    Even though he is a kook, I root for him; no one believed him when he claimed he had proven the Bieberbach conjecture. I believe, however, that he has claimed to have proven the Riemann hypothesis previously. One should check carefully before trusting his claim.

    1. Re:Maybe by Quill_28 · · Score: 1

      What makes him a kook?

      I don't know anything about him but I thought a kook who solved the Bieberbach conjecture, would be called ecentric.

    2. Re:Maybe by 0x0d0a · · Score: 1

      Why is he a kook?

      Were the Wright brothers kooks because many of their original airplane designs had flaws, and it took them a while to correct all of them?

      I wish *more* people would post stuff to the Internet to allow discussion. The copyright ownership rules associated with Science, Nature, and other major publications are not very researcher-friendly. :-(

    3. Re:Maybe by Phragmen-Lindelof · · Score: 1

      "What makes him a kook?"
      I did not mean this is a mean or unkind way. I like your term "ecentric" but you have realize that he has a big ego and I am not certain that "ecentric" includes this.
      I am rooting for his proof to be correct but I am extremely skeptical I am rooting for him because so many "good" mathematicians (e.g. Paul Cohen), have wanted to prove the Riemann Hypothesis for a very long time. It would be nice if a "little guy" got the prize.
      (By the way, you should realize that the proof of the Bieberbach conjecture turned out to be fairly easy; compare this with Fred Almgren's BIG (1200 pages?) paper.)

  74. Re:Proof of theory by Anonymous Coward · · Score: 0

    Sorry, but I find parent exceedingly funny.

    I am poor and destitute of mod points and would ask for contributions to my beloved parent.

  75. Except that... by Anonymous Coward · · Score: 0

    ...except that all of those other things you mentioned would actually be useful. This thing has been taken for granted for decades.

  76. homer simpson by Anonymous Coward · · Score: 5, Funny

    mmmmmmmm......infinite pie..!

  77. Re:Proof of theory by cynic10508 · · Score: 1

    Purdue will take the money, because he works there. It will be used to build a new scoreboard for the football stadium.

    I think the scoreboard is covered by the large numbers of football tickets sold. The elevators in the Math building, however, could use a little re-vamping.

  78. MOD PARENT DOWN by Anonymous Coward · · Score: 0
    You apparently do not understand the word "apology" very well. Many others are having the same problem in this thread. He isn't "apologizing" for it in the sense that he thinks it's wrong or incomplete or anything. It's a defense of something that he's worked on. Reread page four, and you'll hopefully see that he isn't expressing regret. Quite the opposite. It sounds very arrogant.

    -- SNS

    1. Re:MOD PARENT DOWN by Anonymous Coward · · Score: 0

      Admittedly, I don't understand mathematics well enough to know whether he's right or not, but I'm guessing he's pretty smart, and that often comes off as arrogance. I would think this would be especially the case when you've "solved" such a major problem in your field of endeavor. And from reading the proof, I have little doubt he believes he's solved it.

  79. Re:Proof of theory by Anonymous Coward · · Score: 0

    Mathematicians are never in it for the money.

    Well, maybe some of them. Though that's being awfully charitable with the definition of 'mathematician'...
  80. It's already been solved... by blueforce · · Score: 4, Funny

    It's 42.

    Besides, I think he forgot to carry the one.

    --
    If you do what you always did, you get what you always got.
  81. google by Daemonik+CyCow · · Score: 0
    cåsh?

    http://64.233.161.104/search?q=cache:NMJzXzKh1-0 J:www.math.purdue.edu/ftp_pub/branges/invariantban ach.pdf+Cardinality+And+Invariant+Subspaces+(in+pd f+format).&hl=en

    1. Re:google by Daemonik+CyCow · · Score: 0

      guess i don't know how to link it..... uhmmmm or a zeta function?? http://64.233.161.104/search?q=cache:qgs-56VnzywJ: www.aimath.org/~hughes/papers.html+Riemann+zeta+fu nctions+in+pdf+format&hl=en somebody help me with PHP????? Poor favør??

  82. Not quite... by Impeesa · · Score: 1

    See, the man of steel has some finite strength. It would be more correct to say that everyone here is undefinably strong.

    1. Re:Not quite... by Anonymous Coward · · Score: 0

      Unless you're a perl programmer, in which case undef evaluates as zero.

  83. Bio please? by Frohan · · Score: 1

    Is it ok if we just go back to articles about bio? At least I understood those :P

  84. That's a load off by bstadil · · Score: 2, Funny
    "If GRH is indeed true, then e.g. the Miller-Rabin primality test is guaranteed to run in polynomial time"

    Thank god, I used to lie awake at night worrying about that

    --
    Help fight continental drift.
  85. a million dollars by Anonymous Coward · · Score: 0

    man with that prizemoney hes gonna have soo much fun.

    surrounded by babes behaving all irrational all over him, a big line of them stretching out to infinity...all in their prime
    and as much pi as he can eat.

  86. Re:Proof of theory by Trogre · · Score: 1

    The elevators in the Math building, however, could use a little re-vamping.

    Bah. Take the stairs.

    Most mathematicians need all the exercise they can get.

    --
    "Nine times out of ten, starting a fire is not the best way to solve the problem." - my wife
  87. He's going to donate the $1,000,000 by Anonymous Coward · · Score: 0, Funny

    From, http://www.math.purdue.edu/ftp_pub/branges/apology .pdf :

    "The ruin of the chateau de Bourcia overlooks a fertile valley surrounded by wooded hills. The site is ideal for a mathematical research institute. The restoration of the chateau for that purpose would be an appropriate use of the million dollars offered for a proof of the Riemann hypothesis."

    I guess when you work with numbers as big as he does one million is no big deal. :-)

  88. "Apology" an old paper? by jim3e8 · · Score: 3, Informative

    The 23-page "Apology" referred to in the press release is also apparently mentioned in this 1996 Usenet post. So is there a new proof? No one seems to know yet.

  89. Another Proof by larry2k · · Score: 3, Funny

    I have another proof Of Riemann Hypothesis but this text area is too small for it, anyway /. comments doesn't allow math symbols.

    --

    The package said "Windows XP or better. Pentium Class Processor or better"... So I got a Mac with OS X

  90. Cool background material by Anonymous Coward · · Score: 5, Informative

    A cool overview of why this is such an interesting hypothesis.

    If nothing else check out the animation.

    mind-boggling

  91. Re:I submitted this story this morning by Anonymous Coward · · Score: 0

    sorry? did somebody say something?

  92. The Riemann Hypothesis for Non-Mathematicians by Anonymous Coward · · Score: 1, Informative

    The Riemann Hypothesis is a pain to explain before getting into some complex stuff about complex analysis (calculus involving complex numbers; IE numbers involving i = sqrt(-1)). I'm going to show the Riemann Hypothesis in the simplest terms possible, something that calculus students could understand (though not prove, of course!).

    The Riemann hypothesis states that if this function:

    sum from n=1 to infinity ((-1)^(n+1) / n^(x+iy))

    equals zero, then x = 1/2 . x and y are variables; x+iy is a complex number normally labeled "z".

    If you don't want to deal with complex numbers, you can use the equivalent statement about real numbers: If the following function:

    (sum from n=1 to infinity ((-1)^(n+1) * cos(y*ln(n)) / n^x))^2 + (sum from n=1 to infinity ((-1)^(n+1) * sin(y * ln(n)) / n^x))^2)

    equals zero, then x = 1/2 . The following URL is a picture of the above in normal notation so it's easier to read:

    http://www.geocities.com/myriachan/riemann.png

    Melissa <3

    1. Re:The Riemann Hypothesis for Non-Mathematicians by Anonymous Coward · · Score: 1, Informative

      I want to say 2 things about what I said above...

      1. The function I showed was *not* the Zeta function. That's because the standard 1 + 1/1^z + 1/2^z + ... 1/n^z notation does not converge for Re[z] 0), and its zeros by its definition are the nontrivial zeros of the Zeta function. It is the Dirichlet Eta function that I showed.

      2. The version not involving complex numbers is pretty easy to derive. Use "a^(b+c) = a^b * a^c", "e^ix = cos x + i sin x", "x^y = e^(y ln x)", and "cos^2 x + sin^2 x = 1", then separate out the real and imaginary parts. The square just acts as an absolute value here. A negative sign on the "sin" half is removed by the square/absolute value.

      Melissa <3

  93. BEER! by POLAX · · Score: 2, Funny

    OK, I'm no mathematician and although the Clay Mathematics Institute is offering $1 million to anyone who proves this theory. I'm offering a case of beer to anyone who can make sense of any 3 words after "It states that..."

    1. Re:BEER! by Cyno01 · · Score: 1

      Its about numbers and math and some shit like that.

      --
      "Sic Semper Tyrannosaurus Rex."
    2. Re:BEER! by Ghouki · · Score: 1

      ..um try drinking that beer you're offering then read it again ;) .

      --

      insert witty comment here
  94. Re:WTF? Mods? by asl24 · · Score: 1, Informative

    This should at most have earned a "Funny", or is there something I'm missing here?

    Uh, yeah. I'm going to assume that the thing you missed was "Monty Python and the Holy Grail." Or, at least the opening credits.

    --
    I signed this
  95. That's astonishing by gustgr · · Score: 1, Redundant

    Great minds have already tried and failled on proving Riemann Hypothesis, including John Nash and John Von Neumann, both from Princeton Advanced Studies Center.

    If this proof were accepted by the mathematician community I belive Louis the Branges will be considered one of the greatest mathematicians of this new millenium.

  96. a computer can NEVER analyse a program by exp(pi*sqrt(163)) · · Score: 1
    You need to get that one right. What you are probably referring to is something like the halting problem. You can't write a 100% reliable computer program that can take as input another program and determine, in a finite time, whether or not that program is guaranteed to terminate in a finite time. As we have no reason to believe humans can do this either it doesn't show anything.
    A human can look at a program, and without compiling in his head, say what is wrong with it
    Sometimes. Computers can do this too. Most compilers emit helpful error and warning messages all the time.

    The human brain is good at what it does
    Does that mean anything? If the human brain wasn't good at what it did what state of affairs would give?

    Computers do not come up with insights.
    They make some pretty insightful moves in chess, for example. I don't think it's fair to say they don't ever have insights.
    --
    Doesn't it make you feel good to know that our freedoms are protected by politicans, lawyers and journalists.
    1. Re:a computer can NEVER analyse a program by man_ls · · Score: 1

      Why don't we have autocorrecting compilers?

      Since the compiler can automatically tell us where we didn't put a ; or put too many of the same, would it be that hard for it to add or delete as necessry, and put out a "WARNING: Autocorrected syntax (syntax error) on line (x): Inserted Semicolen" or something.

      this is tangentially related but I felt it needed to be said.

    2. Re:a computer can NEVER analyse a program by exp(pi*sqrt(163)) · · Score: 1

      There are many times when the compiler says exactly what the error is and says exactly what to do to correct it. But it's probably a good idea that the compiler doesn't actually make those changes. I think it's good to have just one person make the final decision about whether a change should be made.

      --
      Doesn't it make you feel good to know that our freedoms are protected by politicans, lawyers and journalists.
  97. If this is a valid proof, think of it this way... by Jrod5000+at+RPI · · Score: 1

    it'll be one more thing they'll make you learn in school! :D

  98. The question, explained by SamSim · · Score: 5, Informative

    First: complex numbers, explained. You may have heard the question asked, "what is the square root of minus one?" Well, maths has an answer and we call it i. i*i = -1. If the real number line ...-4, -3, -2, -1, 0, 1, 2, 3, 4... is represented as a horizontal line, then the numbers ...-4i, -3i, -2i, -i, 0, i, 2i, 3i, 4i... can be thought of as the *vertical* axis on this diagram. The whole plane taken together is then called the complex plane. This is a two-dimensional set of numbers. Every number can be represented in the form a+bi. For real numbers, b=0.

    Right. Now the Riemann Zeta Function is a function/map (like f(x)=x^2 is a function) on the complex plane. For any number a+bi, zeta(a+bi)will be another complex number, c+di.

    Now, a zero of a function is (pretty obviously) a point a+bi where f(a+bi)=0. If f(x)=x^2 then the only zero is obviously at 0, where f(0)=0. For the Riemann Zeta Function this is more complicated. It basically has two types of zeros: the "trivial" zeroes, that occur at all negative even integers, that is, -2, -4, -6, -8... and the "nontrivial" zeroes, which are all the OTHER ones.

    As far as we know, *all* the nontrivial zeroes occur at 1/2 + bi for some b. No others have been found in a lot of looking... but are they ALL like that? The Riemann Hypothesis suggests that they are... but until today nobody has been able to prove it.

    1. Re:The question, explained by Anonymous Coward · · Score: 0

      Mod parent way the hell up!

    2. Re:The question, explained by Skjellifetti · · Score: 1

      That's a nice explanation and truly appreciated. But I want to know what significance, if any, this has for any other discipline. I mean if the Riemann Hypothesis is true, does this imply that the Earth is flat, that spaceships can be built to fly at warp 6, or that George Bush will win reelection? Or is it all just a wonderfully fun problem which would be OK, too?

    3. Re:The question, explained by martinX · · Score: 1

      I sort of think that I have a bit of an idea of it now. Not enough to put it in my next PowerPoint presentation, but enough to do for now.

      Question. "what is the square root of minus one? Well, maths has an answer and we call it i". Isn't that 'begging the question' a bit. It seems like the answer (well, we'll call it "i") has been proposed before anyone has shown if can really happen.

      I'll close my arse and stop talking now.

      --
      When they came for the communists, I said "He's next door. Take him away. Goddam commies."
    4. Re:The question, explained by Spam+Bandito · · Score: 1

      What is the number that you add to one to get zero? We call it -1. (What? Negative numbers?)

      What is the number that you multiply by two to get one? We call it 1/2. (What? Rational numbers?)

      What is the number that you raise ten to the power of to get two? We call it log(2). (What? Irrational numbers?)

      What's this now? Complex numbers? Bah.

      (Props for actually using 'begging the question' correctly, by the way.)

      --
      Krama: Exlnelect (msltoy affteced by rreesceahrs at Elgisnh uetnirisvys)
    5. Re:The question, explained by graveyhead · · Score: 1
      OK, I'm a newbie experimenting here, perhaps you will help. After reading your post and a good definition of the Zeta function, I knocked this up to calc zeta on the real number line:
      from math import pow

      def zeta(s):
      t = 0;
      # does no. samples affect results?
      for x in range(1, 25):
      f = 1.0/x
      n = pow(f,s)
      t += n
      return t

      print str(zeta(-2))

      (ugh stupid 'ecode' tag doesn't indent my python correctly)

      For zeta(n<=-1) I get a large positive integer (which I believe translates to infinity). For zeta(n>=1) I get a number approaching 1 for larger values of n.

      Am I missing something here? How do (-2, -4, -6...) etc produce a "trivial zero"? Does this function only work with complex numbers?

      Thanks for the great post!

      --
      std::disclaimer<std::legalese> sig=new std::disclaimer; sig->dump(); delete sig;
    6. Re:The question, explained by gfody · · Score: 1

      Well it means that if you employ a computer to test a hypothesis to 15 BILLION solutions, nobody cares.. but write a paper with a buncha chinese and hieroglyphics and some math consortium will give you a million bucks.

      the 15million positive tests was good enough for me, personally. in fact.. I'd be convinced after the first 5 or 6

      --

      bite my glorious golden ass.
    7. Re:The question, explained by h4rm0ny · · Score: 5, Informative
      It seems like the answer (well, we'll call it "i") has been proposed before anyone has shown if can really happen.

      Great Cthulhu help me, but I'm going to try and answer this for you.

      We have natural numbers - 1,2,3, ... - and people are happy with this. It's an abstract way of representing a real property. I have five oranges, I owe you four oranges. Natural.

      And then we have Zero and once upon a time this disturbed people. You grew up with it, you're happy with it; but we can see that it was less intuitive than 1,2,3, ... because it developed so much later and the greeks managed without it for quite a long time. It's not an abstraction in the same way that these other numbers are. People used to ask questions such as, 'how can something exist and yet be nothing?' 'How can zero x zero = zero since that means you have no zero's?' Can you prove that it does mathematically, right now? *

      And yet, the discovery (or creation ;) of Zero allowed people to abstract in new ways that produced real world results. The same can be said of Negative numbers which are even less intuitive. If I give you those four oranges mentioned earlier (not bloody likely since I'm writing this before breakfast), then that leaves me with one. But suppose I owe you six oranges? We can't carry out that operation with oranges, but the operation is useful in many other areas, the most obvious is probably money. You can be overdrawn for example - that's applied negative numbers. Is there really anti-money in your account? Well, yes, why not? It's just numbers, and numbers are an abstraction, a model of something if you like. It's perfectly normal to represent some properties as negatives. Try basic Newtonian physics - two bodies moving in opposite directions towards each other. You treat the momentum of one of them as negative and the other positive which lets you work out which direction they're going in after collision.

      Now perhaps at this point, you're nodding and saying 'yes, yes, I know that already.' If so, then good, because you've just understood the principle of a complex number. It's another abstraction that can't easily be represented in the real world (nuclear physicists shut up, please). And yet, it has very real use in making calculations.

      If you're a programmer, think about how much code there is behind the scenes of a program to produce the result you want from it. Suppose that your program counts how many oranges people have given you. Maybe it has the line
      for (i=0; i &lt oranges_owed; i++) {}

      Well i isn't physically real, it doesn't represent a physical aspect of what you are modelling (the oranges) but it's useful. And in the same way, i is also useful, even if it's just part of a intellectual model.

      For a mathematician: I think therefore i is.

      The only thing remaining is to give you an example of how it is useful. Easily done - Quantum Physics. All of it. ;)

      Hope this helps, IASNAM (I Am Surprisingly Not...)


      * Proof that 0x0=0:
      0=1x0
      0=(0+1)x0
      0=0x0+1x0
      0=0x0+0
      0=0+0x0
      0=0x0
      --

      Aide-toi, le Ciel t'aidera - Jeanne D'Arc.
    8. Re:The question, explained by Anonymous Coward · · Score: 0
      the 15million positive tests was good enough for me, personally. in fact.. I'd be convinced after the first 5 or 6
      Hey - every number is less than 10! Look: 1 is less than 10, 2 is less than 10, 3 is less than 10, 4 is less than 10, 5 is less than 10, 6 is less than 10, there's the first 5 or 6 examples so you're convinced, right?

      15 million zeroes means absoultely nothing. 15 million zeros is precisely 0% of the zeroes that needed to be checked.
    9. Re:The question, explained by Anonymous Coward · · Score: 0
      Am I missing something here?
      Yes: the definition of the zeta function you have used is only applicable when the real part of s is greater than 1. For numbers where the real part of s is less than 1 (for example, -2), you need to find another expression for zeta (an "analytic continuation" in the jargon).
    10. Re:The question, explained by Anonymous Coward · · Score: 0

      have somebody called you, well not dumbass but not too brigh?!?

      i would not be surprised, most people just dont get what mathematics is for...

    11. Re:The question, explained by tehcyder · · Score: 1
      Finally, a genuinely useful and informative post.

      You're not new here by any chance are you?

      --
      To have a right to do a thing is not at all the same as to be right in doing it
    12. Re:The question, explained by Anonymous Coward · · Score: 0

      "And yet, the discovery (or creation ;) of Zero allowed people to abstract in new ways that produced real world results."

      The Arabs gave us nothing.

    13. Re:The question, explained by JadeNB · · Score: 2, Informative
      * Proof that 0x0=0: 0=1x0 0=(0+1)x0 0=0x0+1x0 0=0x0+0 0=0+0x0 0=0x0

      This is fine as a proof that 0 x 0 = 0 once you know that 1 x 0 = 0. The proof (of either) is roughly as in your second and third lines:

      a x 0 = a x (0 + 0) = a x 0 + a x 0

      Cancelling a x 0 from both sides (which we may do, since we're in a group) gives a x 0 = 0.

    14. Re:The question, explained by Mikkeles · · Score: 1
      '"what is the square root of minus one? Well, maths has an answer and we call it i". Isn't that 'begging the question' a bit.'

      Yes, sort of. There is still the question of whether 'i' makes sense and is consistent, that is: is (a theory encompassing) 'i' well-defined? For example: given the simultaneous equations x+1=3 and 2x=6, the fact that we have labelled the answer 'k' does not guarentee that there is, in fact, an answer; in this case there is not.

      Here, for i, we have the equation x^2=-1 and have said that, if there is a solution, call it 'i'. Obviously i cannot be real (hence the name 'imaginary'), but can we construct a consistent theory incorporating i? It turns out that we can, i.e.: complex numbers.

      --
      Great minds think alike; fools seldom differ.
    15. Re:The question, explained by henrygb · · Score: 2, Informative
      Not the safest way to be convinced.

      For example, try looking at the difference between n^n and the largest factorial less than or equal to it. This starts 1^1-1!=0, 2^2-2!=2, 3^3-4!=3,... and goes on 136, 2405, 6336, 460663, 13148416, 347503689,... which looks as if it is increasing. Keep going, and it still looks as if it is increasing, but keep going and after more than 4 million steps you are dealing with numbers with around 30 million decimal digits when it suddenly takes a small step down.

    16. Re:The question, explained by rsidd · · Score: 1
      Question. "what is the square root of minus one? Well, maths has an answer and we call it i". Isn't that 'begging the question' a bit. It seems like the answer (well, we'll call it "i") has been proposed before anyone has shown if can really happen.

      In addition to the long reply by h4rm0ny, let me point out this: you may be objecting here that, once you throw in this "i", the next question is "well, what's the cube root of -1?" and you have to introduce a new number for that. Well, the remarkable thing is that you don't have to. The complex numbers are enough for all polynomial equations (and more). "Analytic" functions of complex variables (basically, well-behaved functions, in a certain technical sense) have all sorts of remarkable properties and make calculations easier in all kinds of other ways: the square root of -1 is just the beginning. (For example, you can express the trigonometric functions, sin and cos, with complex exponentials, which is incredibly useful in calculations.) Plus, in quantum mechanics (needed when you deal with sub-atomic particles), the "wave function" of a particle is intrinsically a complex-valued function: you cannot represent it as a real function. (You can of course represent it as two real functions with certain rules, which is the same thing as a complex function.)

    17. Re:The question, explained by gmrath · · Score: 1

      There are many different kinds of complex number systems in addition to the usual complex number system most everyone has seen where: z = x +iy (x, y are real numbers) and i^2 = -1.

      There are systems such that C (a complex number system) = {x+iy (x, y are real numbers), i^2 = p} where p less than 0 (the usual complex number system lives here at p = -1), p equals 0, or p greater than 0 (p a real number).

      For a very interesting, informative, and most importantly, accessible article, see The Mathematical Association of America's (MAA) Mathematics Magazine Vol. 77, No. 2, April 2004, page 118, "Geometry of Generalized Complex Numbers."

      (maa.org).

    18. Re:The question, explained by MrBlackBand · · Score: 1
      Complex numbers are also used in AC circuit analysis. I remember a college electronics textbook warning:

      Caution: Current expressed as an imaginary number can hurt you as much as current expressed as real numbers.

      --
      "It is difficult to get a man to understand something when his salary depends upon his not understanding it."
    19. Re:The question, explained by h4rm0ny · · Score: 1
      Proof that 0x0=0:

      0=1x0
      0=(0+1)x0
      0=0x0+1x0 Distributive Law
      0=0x0+0
      0=0+0x0
      0=0x0


      The Distributive Law states that (a+b)c = ac + bc.
      It is one of the axioms of mathematics and generally accepted in a proof without explanation. Having said that, I just knew that I should have put it in there or some smart arse would try and pull me up on it. Correction humbly accepted.
      --

      Aide-toi, le Ciel t'aidera - Jeanne D'Arc.
    20. Re:The question, explained by h4rm0ny · · Score: 1

      The Arabs gave us nothing.

      In which case we should all sincerely say to them, "Thanks for Nothing." ;)

      --

      Aide-toi, le Ciel t'aidera - Jeanne D'Arc.
    21. Re:The question, explained by Nick_dm · · Score: 1

      If I remeber correctly the rule 1*0=0 is not specified in the axioms for the integers/rational/real numbers. Each step he took used one axiom and would be the usual way to prove things at that sort of level from my experience.

    22. Re:The question, explained by Alzheimers · · Score: 1

      Not that I remember everything from number theory, but doesn't that definition of the distributive law imply:

      ac/c + bc/c = (a+b)/(1/c)

      which would be undefined at C = 0?

    23. Re:The question, explained by Anonymous Coward · · Score: 0

      Nice, except nowhere (including the links provided) have I seen an actual definition for the complex Riemann Zeta function. All I've seen are real number simplifications and various approximations.

      How the !#@$(* is anyone supposed to solve a problem whose actual definition doesn't appear anywhere on the internet?

    24. Re:The question, explained by JadeNB · · Score: 1

      I don't have any problem with the distributive law (I used it myself in my argument). I was bothered by the assumption that 1 x 0 = 0 until I reflected (just now) that 1 is a multiplicative identity, so the statement is beyond reproach. Sorry. (Correction, that is, humbly withdrawn by the relevant smart arse.)

    25. Re:The question, explained by JadeNB · · Score: 1
      ac/c + bc/c = (a+b)/(1/c)

      This is a puzzling statement -- it's false unless a + b = 0 or c = 1. Maybe you meant the right-hand side to be ((a + b)c)/c, or something? In any case, the distributive law as stated tells you only about multiplication. To get a statement about division, you have to divide, which is an illegitimate operation if the putative divisor is 0.

      This is, of course, the lesson of Abu Ghraib: You can get any statement you want if you use illegal techniques.

    26. Re:The question, explained by BitchKapoor · · Score: 1

      See equation 18 at MathWorld for an expression of the analytic continuation to the complex plane. Sure, it's expressed as an infinite series, but who says there has to be a simple closed-form definition (I don't know if there is one).

    27. Re:The question, explained by The+Conductor · · Score: 1

      what significance, if any, this has for any other discipline

      Well, a weaker form of the hypothesis used to prove the prime number theorem, which makes a prediction of how many prime numbers are on a given interval (e to the 1 over sqrt(pi*something), hell it's been years...anyone interested look it up in wiki yourself). Basically, someone in the 1910's proved that all the non-trivial zeros have an imaginary part really close to -1/2 (within a ~1/log(b) assymptote).

      Given its relation to prime numbers, cryptography might be affected by the Riemann Hypothesis, especially if it is proven false. A "non-Riemann" zero might have some really wierd cryptographic applications.

  99. Headlines will read..... by Anonymous Coward · · Score: 0

    Mathematcian finally picks up at university bar!

    In breaking news today the, now millioaire, mathematician who proved the Riemann hypothesis was finally able splash enough money around at the university to attract the ladies. Rumour has it the whole evening went sour when he got stuck trying to prove the things in the bed room worked.

  100. Completely selfless by Anonymous Coward · · Score: 1, Insightful

    And who do you think is going to manage and live in the wonderful chateau doing all this research?

  101. Big deal... by Eric+Damron · · Score: 2, Funny

    "It states that all non-trivial zeros of the zeta function lie on the line 1/2 + it as t ranges over the real numbers."

    So what. My wife proved to me that there are no (and never will be) any non-trivial zeros on the left side of the decimal point in my checking account!

    --
    The race isn't always to the swift... but that's the way to bet!
  102. good to know! by bluethundr · · Score: 1

    "proven the Riemann hypothesis, considered to be the greatest unsolved problem in mathematics.

    Cool! Now that this one's been done, I guess all of the other hypothoses'll be proven||disproven in a snap!

    --
    Quod scripsi, scripsi.
  103. background info on this guy by radicalaxis · · Score: 2, Informative

    This review of Karl Sabbagh's book The Riemann Hypothesis contains some background on De Branges. http://www.maa.org/reviews/sabbaghRH.html He sounds like quite a character, from that and from his "apology"... given recent trends, I wonder if someone might write a novel or play about him?

  104. What does this imply? by pukvete · · Score: 1, Interesting

    What ramifications would this have on the world if it was solved? What possibilites would it unveil?

    1. Re:What does this imply? by The+Conductor · · Score: 1

      I think it may have implications for cryptography. See my post higher up in this page.

  105. Umm.. Fake by jmoore2333 · · Score: 1

    Anyone care to mention the apology he posts on his web page...? Another faker. Click the damn link.

  106. Proof? by tmillard · · Score: 0

    Mathemetician Claims Proof Of Riemann Hypothesis. First of all, to "prove" a hypothesis (or thorie or law) would not be with the scientific method. The sci. method is to have refinment etc. etc. if you "prove" that the stars circle the earth, what would happen when you find moons of jupider orbiting it?

    The heading should read, Mathematician Claims Strong Evidence Of Riemann Hypothesis

    1. Re:Proof? by Anonymous Coward · · Score: 2, Insightful

      Math does not rely on the scientific method. Math relies on rigorous proof based on axiomatic definitions, i.e. logic. Proofs can be flawed, i.e. wrong, but we can never at a later date say, "Hey, it turns out that x^3 = y^3 imples x = y is just not true this time."

      Unless, of course, you think that logic could have some holes in it. But let's not go down that road.

  107. Re:de Branges' reputation with other mathematician by stevesliva · · Score: 4, Funny
    He's just trying to disprove the "Field's Medal Hypothesis" -- no one over the age of 40 can accomplish innovative math.

    He appears to be 72.

    --
    Who do you get to be an expert to tell you something's not obvious? The least insightful person you can find? -J Roberts
  108. rhetoric by Anonymous Coward · · Score: 0

    I always thought it was a rhetorical Hypothesis

  109. Re:Proof of theory by techno-vampire · · Score: 1
    I must say that at he seems a bit full of himself, or at least, getting a bit ahead of himself. Given how many have tried and failed witht his problem.

    Not really. He says it would be a good use, not will be. I don't see that as counting his chickens before they're hatched.

    --
    Good, inexpensive web hosting
  110. Good Book about the Hypothesis by Anonymous Coward · · Score: 3, Interesting

    Prime Obsession: Bernhard Riemann and the Greatest Unsolved Problem in Mathematics

    This is a very informative book about Riemann's work on the hypothesis, as well as the work of many other mathematicians. You probably need a solid college-level understanding of math to follow most of the technical explanations, but the historical parts of the book are very interesting.

  111. Re:Proof of theory by cynic10508 · · Score: 1

    Most mathematicians need all the exercise they can get.

    The ones with offices on the ninth floor seem pretty fit.

  112. God, shut the fuck up. by Anonymous Coward · · Score: 0

    Subject says it all.

    1. Re:God, shut the fuck up. by Anonymous Coward · · Score: 0

      So says the MTV-generation idiot with the attention span of a gnat.

  113. Track record by wviperw · · Score: 2, Interesting

    Of course we all know what happened to the last supposed proof that appear on Slashdot (regarding twin primes).

    In case you *don't* know, the paper was withdrawn as a result of a "serious error in lemma 8." I can only hope that this proof fairs better, though I'm not betting on it.

    --
    Nothing disturbs me more than blind loyalism towards some unrealistic and over-idealistic notion of one's nationality.
  114. String Theory by adzoox · · Score: 1

    I thought the string theory was the hardest and most useful theory to prove or solve.

    Dr Michio Kaku has set out to prove or disprove it and says if solved would allow time travel, teleportation, and agelessness.

    --
    Yell & scream & rant & rave... it's no use... you need a shaaaave ~ Bugs Bunny
    1. Re:String Theory by wmspringer · · Score: 1

      Well, to be fair, he only called it the greatest problem; he didn't say it was useful for anything :-)

  115. Re:Proof of theory by Anonymous Coward · · Score: 1, Funny

    Naw, it's gotta be the pie... at least that's all I ever hear them talking about...

  116. Re:Already failed once by Mudcathi · · Score: 4, Funny
    A long time ago, in the distant past, there were Finders. Dedicated individuals that wandered around outside the camps and found stuff. Over time, it became more difficult to find stuff, and the Finders became the Searchers.

    And so it came to pass, Gentle Reader, that some of the Finders did find their fruit, and these were known as Keepers. But a few still lost their newfound fruit on the way home, and these poor souls were thenceforth known as Losers, unless they wept, in which case they were also known as Weepers.

    --

    "He who throws mud, loses ground." - proverb

  117. Definitely Not Humble by Anonymous Coward · · Score: 0
    Reading that "apology" made me want to vomit. The man has a colossal ego.

    "So when mumsie and I fled that nasty war on the continent, we set up home in Delaware, and I soon found myself attending a snooty boarding school (where they incidentally filmed Dead Poet's Society) and caddying for father and the former CEO of DuPont, who I sure showed a thing or two, proving my mathematical genius at the tender age 17. I later attended MIT, where in my free time as an undergrad, I pointed out several flaws in pre-publication versions of famous math texts, and was generally an astounding genius. Yet when applying to Math graduate programs, I hadn't done enough coursework for more presitigious institutions, so I applied and went to lowly Cornell. However, I eventually got my PhD, and accepted an associate professorship at Purdue, followed immediately by a full professorship. Of course.

    Also, I rule. Kiss my aristocratic ass, you pretenders."

  118. Re:Already failed once by mattgreen · · Score: 1

    Being a researcher is far more fulfilling than sitting in your parents basement posting on Slashdot about how Linux is ready for the desktop.

  119. Well crap... by LilMikey · · Score: 0

    ...now what am I going to do with all of my free time. I guess it's back to video games... *sigh*

    --
    LilMikey.com... I'll stop doing it when you sto
  120. Re:Proof of theory by Anonymous Coward · · Score: 0

    You had me at "scoreboard".

  121. THE APOLOGY IS NOT THE PAPER! by Anonymous Coward · · Score: 1, Informative

    See "Riemann Zeta Functions" lower for the actual paper in question. The bibliography has a date of May 25th, 2004 at the top. This looks like a modification of a previous paper he had posted there for several years (his previous attempt.)

  122. Nash by nycsubway · · Score: 1

    I wonder how John Nash is doing? From the book "A Beautiful Mind", it seems he was working on the Riemann Hypothesis in his later years at Princeton. I wonder how far he got.

    The movie and book were completely different. I think the book was more in depth, considering the movie didn't even mention Nash's first illegitimate son. But Jennifer Connelly is HOT.

  123. Why people haven't believed him so far by This+is+outrageous! · · Score: 5, Informative
    As others mentioned, de Branges has been claiming a proof along the same lines for years. He's hard to dismiss because he actually proved the Bieberbach conjecture -- a startling exception in the series of wrong proofs he's been famous for, before and since.

    The reasons why most specialists doubt that his approach can ever yield the result are well described in this paper from 1998:

    In this note, we shall (...) give examples showing that de Branges' positivity conditions, which imply the generalized Riemann hypothesis, are not satisfied by defining functions of reproducing kernel Hilbert spaces associated with the Riemann zeta function zeta(s)
    (i.e., despite the name, the "generalized RH" proved by de Branges actually did not include the standard RH as a special case.)
    --
    This is...

    O
    U
    T
    R
    A
    G
    E
    O
    U
    S

    !

    1. Re:Why people haven't believed him so far by Anonymous Coward · · Score: 0

      so...you are saying: perhaps he proved something, but he/we cannot prove that what he proved, is the RH?

      still could be interesting for the progress of mathematics me thinks.

  124. And then there's the RPN crowd.... by SageMusings · · Score: 1

    Hah!! I'm waiting for some slashdotter to explain how the proof would've progressed faster had the good mathematician used a stack-based, RPN methodology to write it.

    --
    -- Posted from my parent's basement
  125. I've got four words for you: by crashnbur · · Score: 1

    Double. You. Tee. Eff.

  126. Damn... by nwbvt · · Score: 1

    I wanted that million bucks. How else can my math dgree earn any money?

    --
    Mathematics is made of 50 percent formulas, 50 percent proofs, and 50 percent imagination.
  127. Oh Hocky Sticks!!!! by Dasein · · Score: 5, Insightful

    There's the occasional post that deserves to be modded to "+10 -- Best Damn Thing I've Read On Slashdot This Year".

    Thanks!

    --
    You are not a beautiful or unique snowflake -- but you could be if you got off your ass.
    1. Re:Oh Hocky Sticks!!!! by Anonymous Coward · · Score: 0

      please don't think you understand the riemann hypothesis now.

    2. Re:Oh Hocky Sticks!!!! by Dasein · · Score: 1

      Nope, don't think I understand it. I'm taking a lot of math courses but I figure I have about another year before I have the background to understand this thing.

      By that time, the money will be paid or the proof will be on the scrapheap.

      --
      You are not a beautiful or unique snowflake -- but you could be if you got off your ass.
  128. I went to Purdue by Anonymous Coward · · Score: 0

    Get ready to get butt-raped.

  129. I feel very ripped off by leonbrooks · · Score: 1

    My Panasonic remote controller doesn't even have a zeta function, let alone a way of zeroing it. It's got some real numbers, though. Is there a way to hack a zeta function in? Can I interface it with a learning remote?

    --
    Got time? Spend some of it coding or testing
  130. Same problem as far as I can see by exp(pi*sqrt(163)) · · Score: 0
    The difference between hypothesizing about whether he would have proved it, or hypothesizing about whether he would have been able to have proved it, seems pretty minor to me.

    But just for you, I'll rewrite my epitaph:

    Here lies exp(pi*sqrt(163))
    He died ere he could get laid by Charlize Theron
    --
    Doesn't it make you feel good to know that our freedoms are protected by politicans, lawyers and journalists.
  131. title of article misspells by sentientbrendan · · Score: 1

    mathematician.
    Now here are some words to keep this from being modded down as too short. Note how none of them are misspelled? Wooooo

  132. Re:Proof of theory by Anonymous Coward · · Score: 0

    The man is brilliant at what he does, and deserves to dream like the rest of us. I say good luck to him, and to the vistor go the spoils.

  133. Re:WTF? Mods? by cyberfunk2 · · Score: 0

    For those of us who've taken philosophy, it might be interesting to note that this particular use of the word apology may stem from Socrates' Apology wherein he defends himself from his accusers.

  134. Infinite, or really infinite?? by quinkin · · Score: 2, Funny
    Degrees of infinity... now that screwed with my head...

    Q.

    --
    Insert Signature Here
    1. Re:Infinite, or really infinite?? by Hatta · · Score: 1

      You know, it does for a while. But then the elegance of Cantor's diagonal proof sinks in, and you start to appreciate the beauty of it.

      --
      Give me Classic Slashdot or give me death!
    2. Re:Infinite, or really infinite?? by quinkin · · Score: 1
      Cantor was always a bit dry and DUSTy for me... (geddit, geddit?? ok, +5 humour negligible).

      Besides, I never said I didn't think it was beautiful, I just said it fucked with my head. A lot like my wife really...

      Q.

      --
      Insert Signature Here
    3. Re:Infinite, or really infinite?? by Anonymous Coward · · Score: 0

      yeah, that was pretty cool when I first saw it, also mapping (0-1) one to one and onto anything else was pretty cool....hmm I think I'd better go AC for this one...

  135. The reputation of de Branges by Big_Oh · · Score: 1

    No serious mathematician would suggest that de Branges is a kook or crank. He has solved important and difficult problems in the past by introducing creative approaches and developing new tools. When he first announced that he had proved the RH, he was taken seriously.

    As I understand it, his first attempt was awfully written, and it took quite some effort to figure out what he was saying, let alone if it was correct or not. A hole was found, the hole was patched. Another hold was found, another hole was patched. Like a bubble under the carpet, each correction created another error. At this point, no serious mathematician thinks that his attack on the RH is viable. Not because committees didn't plan for it, as he suggests, but because it has been looked at and simply doesn't work.

  136. Meh by Anonymous Coward · · Score: 0

    Enough about the Riemann Hypothesis. What we need is more talk about Riemann noodles.

  137. I have a better proof for this by Claire-plus-plus · · Score: 2, Funny

    But there is not enough room in this posting.

    --
    99 bottles of beer in 175 characte
  138. Re:de Branges' reputation with other mathematician by tobar+mersa · · Score: 1

    In which case, I dearly hope that he has indeed found a proof. Again, however, it is best to remain skeptical until peer review has signed off on this paper.

    --
    This sig space intentionally left blank.
  139. Proof claimed to be invalid by Anonymous Coward · · Score: 2, Informative

    Mathworld has a link to a paper which claims de Branges' method of proof is invalid. Here is a direct link to the site with the paper.

  140. Riemann Hypothesis Interview by qpacberty · · Score: 3, Informative

    Berkeley Groks has an interview that aired today with John Derbyshire discussing the Riemann Hypothesis. He states that after talking with many mathematicians in the field, the prospects for a solution any time soon are quite low.

  141. Relation to Goedel's Thm? by freejung · · Score: 1
    OK, NS, you sound like you really know what you're talking about, so I'll ask you:

    If true, does this proof also prove that the sequence of primes does not terminate? And if so, does this mean that the primes can't be used as an example of Goedel's thm any more?

  142. Re:de Branges' reputation with other mathematician by Anonymous Coward · · Score: 0

    He looked to be in his mid 50's when I took a math course of his 10 years so, so around 70 is about right.

  143. Probably a hoax: by usmcpanzer · · Score: 4, Informative

    mathworld.wolfram.com
    Riemann Hypothesis "Proof" Much Ado About Noithing A June 8 Purdue University news release reports a proof of the Riemann Hypothesis by L. de Branges. However, both the 23-page preprint cited in the release (which is actually from 2003) and a longer preprint from 2004 on de Branges's home page seem to lack an actual proof. Furthermore, a counterexample to de Branges's approach due to Conrey and Li has been known since 1998. The media coverage therefore appears to be much ado about nothing

    1. Re:Probably a hoax: by PingPongBoy · · Score: 1

      None of this debate would occur if proofs, especially proofs for theorems about numbers, were fully expanded to show each step of logic. Expansion by hand is usually infeasible, requiring thousands of pages, but computers can be used to apply theorems - do such programs exist? Can Mathematica do this?

      --
      Know your pads. One time pad: good for cryptography. Two timing pad: where to take your mistress.
    2. Re:Probably a hoax: by Anonymous Coward · · Score: 0

      No and No.

    3. Re:Probably a hoax: by csirac · · Score: 1

      Mathematica can evaluate an implementation of a theorem (over a finite domain), but you obviously can't just throw a theorem at it and have it say yes/no.

      Actually my experience is with Matlab, the primary use being numerical computation, although it can do various expansions of messy integrals and control systems. Maple can work with/manipulate more complex algebraic expressions.

      Still, I'm not sure that these tools could be very useful in such an abstract proof as this. IANAM, but AFAIK proofs requiring "thousands of pages" via purely algebraic/analytical means are rooted in a more "practical" domain such as control systems theory (godawful nightmarishly messy unless you give up, estimate, and solve numerically). I was under the impression that the more "pure" maths of number theory which I assume this proof belongs was more self-contained and clean... a real mathematician might be able to clear this up for us :-)

  144. Or am I just confused? by freejung · · Score: 1
    So maybe I have no clue what I'm talking about. This is probably the case. But now I'm really confused.

    In the apology, he states that "the existence of an infinite number of primes was known" in antiquity, but he doesn't say specifically whether it was proven.

    Now, for some reason I had the impression that we believe there are an infinite number of primes, but it has never been proven and may be impossible to prove, making it a possible example of Goedel's thm. But this seems to imply that I was completely wrong, and the existence of an infinite number of primes was proven by the Greeks. So what's up with all this?

    1. Re:Or am I just confused? by Ryan+Hemage · · Score: 1

      No, there are an infinite number of primes, and this is easlily proven. Given that there is no largest prime (first year undergrad stuff that I can't remember), we have that the size of N (the -- infinite -- set of natural numbers) must be less than or equal to the size of P (the set of primes) since you can map n in N to the nth prime in P. And since P is a subset of N we have that the size of P is less than or equal to the size of N. Therefore the size of P is equal to the size of N, i.e., P is infinite.

    2. Re:Or am I just confused? by Anonymous Coward · · Score: 0

      The other reply gave you a proof, and the proof was already figured out in ancient Greece by Euclid. You might be remembering something you read about twin primes, ie. pairs of primes whose difference is 2, for example 5 and 7, or 17 and 19. There seem to be lots of such pairs but it is not known whether there are an infinite number of them or not.

    3. Re:Or am I just confused? by Red+Pointy+Tail · · Score: 1

      The infinitude of primes, my friend, is one of the most basic thing in maths class, have you been sleeping? The prove (attributed to Euclid) is simply that say P(n) is the nth prime and the largest prime, then P(1) * P(2) * P(3) * ... P(n) + 1 will give you a even bigger prime (since it is not divisable by any of the other primes), so P(n) can't be the largest prime.

    4. Re:Or am I just confused? by Red+Pointy+Tail · · Score: 1

      ... sorry, P(1) * P(2) * P(3) ... P(n) + 1 is either a bigger prime or divisable by a bigger prime that P(n), therefore a bigger prime exists!

    5. Re:Or am I just confused? by Thuktun · · Score: 1

      The infinitude of primes, my friend, is one of the most basic thing in maths class, have you been sleeping? The prove (attributed to Euclid) is simply that say P(n) is the nth prime and the largest prime, then P(1) * P(2) * P(3) * ... P(n) + 1 will give you a even bigger prime (since it is not divisable by any of the other primes), so P(n) can't be the largest prime.

      Interestingly, the proof that there exists no largest prime is itself a simple counterexample to the oft-cited assertion that one cannot prove an existential negative.

    6. Re:Or am I just confused? by freejung · · Score: 1
      have you been sleeping?

      Apparently so. It's been a while since I've taken a math class. I remembered something about this issue, but I wasn't sure what it was! ;-)

      That's a rather nice proof. But, just one question: doesn't this provide a means of searching for higher primes? I thought that was trickier than that. Of course, since your new number need not necessarily be prime, but may be divisible by other primes between it and P(n), this isn't a sure-fire algo to give you a higher prime, but at least it gives you a pretty good hint.

    7. Re:Or am I just confused? by freejung · · Score: 1
      a simple counterexample to the oft-cited assertion that one cannot prove an existential negative

      Ah, now, this one I'm not confused about. What you can't prove is an ontological negative. That is, you can't prove the non-existence of something in the physical universe (at least, not without searching the whole thing, which is impossible due to the speed limit). Of course you can prove the non-existence of something in math, because math is a made-up logical system, not an external reality. Now, there's a pretty good argument that the universe isn't an external reality either, but if I made it up, I don't remember doing so!

    8. Re:Or am I just confused? by Red+Pointy+Tail · · Score: 1

      Even if the formula always gives a prime, it is not recursively generative, because the formula only works if you can list down *all* the primes up till P(X) = P(1) * P(2) *... P(N) + 1.

      Which is to say that P(N+1) is not neccessarily P(X). To reuse the formula you need to find P(N+1) , P(N+2), P(N+3) ... P(X-1) as well. If N is large, then there are really a LOT of primes in between still unknown and difficult to determine.

    9. Re:Or am I just confused? by Red+Pointy+Tail · · Score: 1

      Accidently posted to parent, reposted.

      Even if the formula always gives a prime, it is not recursively generative, because the formula only works if you can list down *all* the primes up till P(X) = P(1) * P(2) *... P(N) + 1.

      Which is to say that P(N+1) is not neccessarily P(X). To reuse the formula you need to find P(N+1) , P(N+2), P(N+3) ... P(X-1) as well. If N is large, then there are really a LOT of primes in between still unknown and difficult to determine.

    10. Re:Or am I just confused? by Anonymous Coward · · Score: 0

      I was intrigued when I read this so...after putting my computer through the paces for 40 minutes or so, I've found that

      P(1)*P(2)*...*P(N)+1 turns out to prime only 13 times in the first thousand primes...5 of those times are the first 5 cases. So not only is it not true in general, it's rarely true.

  145. Re:Nope! Nice try by Anonymous Coward · · Score: 0

    It's 42 isn't it?

  146. Huh, whaddaya know by KlausBreuer · · Score: 1

    Never thought there'd be big money in mathematics...

    (Go, Flo!) ;)

    --
    Free PC version of ChipWits at http://www.breueronline.de/klaus/chipwits/
  147. Much ado about nothing? by Scorillo47 · · Score: 5, Informative

    The proof (or, better said, the sketch of the proof) actually starts at the end of page 21, very close to the last page. The original work is actually pretty hard to find since it is buried in so many unrelated side notes.

    Here is the general outline:
    1) At the end of page 19 he mentions that "The positivity condition which is introduced implies the Riemann hypothesis if it applies to Dirichlet zeta functions."
    2) After some introduction of the quantum gamma functions that lasts two pages, the actual proof starts at the end of page 21 with the phrase "A quantum gamma function is obtained when is nonnegative. A proof of positivity is given from properties of the Laplace transformation."
    3) The proof ends in the middle of page 23 with the a verification that W(z) is a quantum gamma function with quantum q = exp(-2*pi), obtained from a spectral theory of the shift operator.

    Overall this is just a very brief sketch of the whole proof.

    BTW, to add gas on fire, here is an exceprt from mathworld.com, which surprisingly was missed by /. until now :-)

    http://mathworld.wolfram.com

    Riemann Hypothesis "Proof" Much Ado About Noithing (sic)
    A June 8 Purdue University news release reports a proof of the Riemann Hypothesis by L. de Branges. However, both the 23-page preprint cited in the release (which is actually from 2003) and a longer preprint from 2004 on de Branges's home page seem to lack an actual proof. Furthermore, a counterexample to de Branges's approach due to Conrey and Li has been known since 1998. The media coverage therefore appears to be much ado about nothing.

    The counterexample to Brangles approach can be reached here: http://arxiv.org/abs/math.NT/9812166

    --
    Don't try to use the force. Do or do not, there is no try.
    1. Re:Much ado about nothing? by kluut · · Score: 1

      Mod up this post! It makes sense.

  148. Not Miller-Rabin by Paul+Crowley · · Score: 1

    You're confusing MR with another primiality test (whose name I don't recall). MR is guaranteed to run in poly time, but it's not guaranteed to give the right answer. There's another test which runs in poly time and gives the right answer, but only if GRH is true. Of course now we have AKS, which runs in poly time and always gives the right answer without relying on any unproven hypothesis.

    And in the real world, MR is still your best practical choice.

    1. Re:Not Miller-Rabin by Anonymous Coward · · Score: 0
      MR is guaranteed to run in poly time, but it's not guaranteed to give the right answer.
      Hell, I'll give you an algorithm that will run under 500 ms, but I won't guarantee it will give the right answer. In fact, I'll give you as many programs and algorithms you would like, but I won't guarantee they'll give the right answer.
    2. Re:Not Miller-Rabin by Paul+Crowley · · Score: 1

      I have no intention of explaining Miller-Rabin's strengths to you. Google could answer the question in detail a moment. The choice of learning or noisy ignorance is entirely yours.

  149. Re:Nope! Nice try by hashwolf · · Score: 1

    I'm waiting for an apology from you!

    --
    - "They misunderestimated me."
  150. Nice job but.. by ObsessiveMathsFreak · · Score: 1

    Why couldn't he just write a three page proof with no rambling. Talk is cheap, but maths sticks! P.S. I wonder will this have much of an impact on RSA encryption?

    --
    May the Maths Be with you!
  151. zetagrid program by TheCoop1984 · · Score: 1
    Thank goodness the whacko is issuing an apology, the Zetagrid program would have been completely pointless.

    But I suspect that brute-forcing the function isnt really going to work, but it is useful for calculating primes i think...

    --
    95% of all computer errors occur between chair and keyboard (TM)
  152. Purdue's scoreboard by Anonymous Coward · · Score: 0

    I hope so. I've been to that stadium and the scoreboard is a bit antiquated. I'm glad to see this geeks work actually turn into something useful.

  153. Re:Uh-oh! There's a mistake! by D-Cypell · · Score: 1

    I see it, I see it....

    He forgot to carry the 1!!

  154. Overview of proof? by alex_tibbles · · Score: 2, Interesting

    Could someone capable in the apropriate math(s) please explain how the proof works?

    1. Re:Overview of proof? by cardshark2001 · · Score: 1
      Could someone capable in the apropriate math(s) please explain how the proof works?

      No, they can't. Sorry about that.

      --
      WWJD? JWRTFA!
  155. An apology for the good professor's business model by Anonymous Coward · · Score: 0

    Step 3: Profits.

  156. Why does he list a Russian phone number? by Anonymous Coward · · Score: 0

    If he teaches in Indiana, why is the phone number on his web page 011-765-494-6057? The 7 is Russia, with the 65 as some city code. Is this whole thing a scam to get us to call a Russian 900 number?

    1. Re:Why does he list a Russian phone number? by Anonymous Coward · · Score: 0

      765 is an area code! The 011 in front of it is a mistake. (Should be a 1.)

      I like the idea, though: Absent-minded mathematicians calling Russia without thinking about it. It's a brilliant scam!

  157. Re:de Branges' reputation with other mathematician by BizidyDizidy · · Score: 1

    Hmm, must not be much of a teacher.

    --
    The safest way to approach lava is to have another person with you and he goes first.
  158. Title by fasura · · Score: 1

    Am I the only person who has noticed that Mathematician has been spelled incorrectly in the title. I know /. hires educationally sub-normal editors but when they can't run a spell checker you know the Ramen has addled their brain cell.

    --
    -- Be careful what you say. Someone might remind you about it another day.
  159. I found a wonderful proof for this theorem by Cryogenes · · Score: 2, Funny

    but unfortunately it was censored by the Slashdot lameness filter.

  160. Mathemetician??? by The+Grassy+Knoll · · Score: 1

    Mathem a tician!

    --
    They will never know the simple pleasure of a monkey knife fight
  161. Re:Nope! Nice try by Anonymous Coward · · Score: 0

    I have a proof too, but this comment entry box is too small.

  162. Read the Book: Dr Riemann's Zeros by Hawking · · Score: 1

    If you are interested in the problem, read the book Dr. Riemann's Zeros: The Search for the $1million Solution to the Greatest Problem in Mathematics by Karl Sabbagh. It includes a fair bit about Louis de Branges, including an appendix with a high-level version of this proof.

  163. Oddly Funny line from article... by Anonymous Coward · · Score: 0

    De Branges is perhaps best known for solving another trenchant problem in mathematics, the Bieberbach conjecture, about 20 years ago. Since then, he has occupied himself to a large extent with the Riemann hypothesis.

    You know, we mathematicians sure don't look like pathetic losers when we have this wonderful characterization.... "In the last 20 years, he's done nothing but examine this hypothesis".

  164. Re:Apology - you guys are all wrong by LesDawson · · Score: 2, Funny

    You guys all have it wrong .. the apology is not referring to the proof, it's for having linked to a pdf ..

  165. Uhm, no..... by Anonymous Coward · · Score: 1, Funny

    He forgot to carry the 7.

  166. According to Wolfram Research... by Muad · · Score: 1

    Riemann Hypothesis "Proof" Much Ado About Nothing

    A June 8 Purdue University news release reports a proof of the Riemann Hypothesis by L. de Branges. However, both the 23-page preprint cited in the release (which is actually from 2003) and a longer preprint from 2004 on de Branges's home page seem to lack an actual proof. Furthermore, a counterexample to de Branges's approach due to Conrey and Li has been known since 1998. The media coverage therefore appears to be much ado about nothing.

    Of course, What is not proven by Wolfram himself might not get attention from them, but you would think Mathworld (http://mathworld.wolfram.com) is a pretty authoritative site on this :-)

    --
    --- "I didn't think anyone would understand it" -Prof. Bob Muller
  167. Re:Nope! Nice try by Captain_Chaos · · Score: 2, Funny

    Don't you mean that know the real answer but have no room to write it down here?

  168. Fermat's theorem by Anonymous Coward · · Score: 0

    "greatest unsolved problem in mathematics"

    How does the author come to that conclusion? For instance, Fermat's problem is much more widely known and at least as famous.

    1. Re:Fermat's theorem by xoran99 · · Score: 1
      Fermat's theorem is proven.

      Google agrees with the article...

      --

      Karma: Bad (mostly due to all those "In Soviet Russia" jokes)

  169. Re:homer simpson - Deep Thoughts by pteaxwa · · Score: 2, Funny

    How about some Jack Handey:
    When you die, if you get a choice between going to regular heaven or pie heaven, choose pie heaven. It might be a trick, but if it's not, mmmmmmm, boy.

  170. My brain hurts by Anonymous Coward · · Score: 0

    I think it is safe to say that since I don't understand the problem that I probably shouldn't bother trying to understand the (supposed) proof.

  171. Re:Proof of theory by Anonymous Coward · · Score: 0

    I think Purdue must have been expecting the money, because they are just finishing up an extensive rebuilding of the entire football stadium. This proof couldn't have come at a better time!

  172. Re:Proof of theory by Anonymous Coward · · Score: 0

    You know, I used to hate those elevators. But then I graduated, moved to Chicago and met a girl. Who lived on the 16th floor of a building with elevators that were even slower.

    I must be cursed.

  173. Ramen Hypothesis by underworld · · Score: 1

    Well, that's all very well, and indeed, quite good mathematics, sir. However, it says very little about the more infamous, and infinitely more important, Ramen Hypothesis.

    In short, this theory states that:

    All non-trivial zeroed-out accounts of the bank function lie on their backs while consuming large amounts of artificial flavors with real noodles. Don't forget the water.

    To date, this is the only one of the acclaimed Menial Problems from the Claypot Mathematics Institute that has not been solved. The Pointcare Conjecture was thrown out, because no one cared about the point. The Hodge-Podge Conjecture was also thrown out as it was revealed to be nothing more than an aggregation of previous "mathematical refuse".

  174. Well, not exactly by mrgeometry · · Score: 3, Informative

    Sorry, but...

    It is not proved; he is not at the top of his field; this "paper" will be quickly forgotten among professional mathematicians; and I doubt any professional mathematician is going over the proof with any sort of comb.

    L. de Branges first achieved fame for proving the Bieberbach conjecture. His proof went through strange and abstract methods. He went on the road to present his proof at various seminars in France, Russia, etc; IIRC a bunch of Russian students got very excited and basically rewrote his proof. Their new proof was much shorter and avoided the use of strange methods. Nowadays, their proof is remembered and his is not, but the proof still bears his name, since after all he was the first to come up with *some* kind of proof, and their proof did more or less come out of his.

    So he deserves credit for that, and it was quite an achievement to prove the Bieberbach conjecture. But even then he was using unwieldy proofs with unnecessarily abstract methods.

    For many years he has been claiming to have a proof of the Riemann Hypothesis. Professional mathematicians stopped listening a long time ago.

    This guy is washed-up.

    I whole-heartedly agree that this short article is hilarious, but I would like to add the adjective condescending. What kind of asshole apologizes for solving a problem? Does he think he lives on some higher plane, and therefore must take direct, personal responsibility for every aspect of our lives?

    Look at how G. Perelman submitted his ideas on proving the Poincare conjecture just a little while ago. He didn't waste anyone's time by rehashing the already-available history of the problem or its wider context in mathematics. Nor did he apologize for having an idea. Rather, he submitted his ideas for consideration, with the full awareness that there may have been a mistake. .... Now, this is where I admit that I do not really understand that area of math, and have not been closely following the status of (alliteration alert) Perelman's proposed proof. Still, Perelman is a real mathematician, and even if the proof is (was?) wrong, it has real ideas of value in it.

    de Branges is so full of crap, it makes me sick.

    zach

    1. Re:Well, not exactly by dasmegabyte · · Score: 2, Insightful

      OK. So your claim is that he's not a real mathematician because, though he proves things, he does so in an unusual manner? And that he will be forgotten because of his eccentricity?

      I'm sorry, but if you had to make a brief list of mathematicians...just off the top of your head...I'm willing to bet real cash that most of them have "eccentricities" of their own. Are you claiming Newton wasn't a moody asshole? Or that Fermat wasn't a bit nutty? That Rene Descartes was some kind of boring pencil pusher with no ponderance on philosophy and life?

      What about DaVinci? What about Nash? And I hear that Galileo and Kepler were rogues as well.

      I mean, come on! Insanity and flair make a mathematician's career more than any actual acheivment. I mean, look at your post. As much as you claim to hate de Branges, you know everything about him. And you don't even know the NAMES of the Russian students who rewrote his hypothesis.

      --
      Hey freaks: now you're ju
    2. Re:Well, not exactly by mrgeometry · · Score: 1

      Good point. Maybe I went a little too far.

      I'm sure experts in complex analysis know the names of the Russian students who rewrote his proof; I just took a complex analysis class once upon a time.

      But you're right: proving things in an unusual manner is not at all a problem.

      Provided they are actually proofs. Nash may have been off his rocker, but his proofs were solid. Wiles's proof of Fermat's Last Theorem was up in the stratosphere (for such a concrete statement, the methods are insanely abstract)---but the proof is appropriate and carefully done and all that good stuff. Didn't hurt that people expected that sort of method, either.

      LdB's proofs, both for Bieberbach and RH, have been unnecessarily wacky. The RH proof has been decisively discredited. Not just the specific proof, but the whole method of proof----we're not talking about a typo on line 17, or a lemma that needs to be rewritten. No, the whole idea he uses has been shown mathematically to be inadequate to proving RH.

      Yet he still claims to have a proof. This is insane: putting out the same proof and thinking this time it'll be accepted.

      Whatever. This guy is annoying, but fortunately it's easy to ignore him...

    3. Re:Well, not exactly by Anonymous Coward · · Score: 1

      Let me first say i'm a scientist, in a different field, but still a scientist. And if in my fields there are wacky persons making weird statements ofcourse everybody will take them with a grain of salt. But I'm 100% sure that I will go through those statements and experiments very very thorougly to be absoletly sure that it is bullshit.

      You, on the otherhand seem to say that other mathematicians do not agree with his methods. WTF? I want to see a 20+ page retributtal with at least as many integrals that show the errors in this guys work. This is how science works, if you do not agree with him, prove him wrong.
      Ignoring him is about the worst thing you can do.

      Second, I think you should check the meanings of the word "apology" in a dictionary. The title is very good.

    4. Re:Well, not exactly by eyeoftheidol · · Score: 2
      What kind of asshole apologizes for solving a problem

      He is using "Apology" in the sense of "defence of", cf. John Henry Newman's Apologia Pro Vita Sua
    5. Re:Well, not exactly by mrgeometry · · Score: 1

      Hmmm, that's not the impression I got.


      The solution of a celebrated problem creates a disturbance in the otherwise quiet flow of mathematical events. The solution escapes the planning of committees. Colleagues are unprepared because the possibility of a solution has not been included in their research proposals. Students have avoided related thesis topics because of the risk that the work will not be welcome to a prospective employer. Friends are discouraged from research activity by the demands of the situation created by the solution. The manuscript, which is necessarily written at the highest research level, is readable only to a limited audience. An introduction is therefore needed which makes available the opportunities created by the solution.


      He's really sorry that he disturbed the otherwise quiet flow of our pathetic lives. Also, since we are complete idiots, he will patiently tell us about the opportunities created by the solution. Isn't he nice?

      I may be talking out my ass here, but the habit of modern scientists in all branches seems to be to avoid unseemly self-promotion. This is why papers say things like "WE" or "ONE" instead of "I". It is also why scientists usually don't issue a press release of their research before publishing it. LdB is not displaying any sort of modesty or humility here... I don't think he's defending his proof. In his mind, his proof is right. He's apologizing for solving it before the rest of us.

    6. Re:Well, not exactly by hding · · Score: 1

      I think it's somewhat unfair to characterize de Branges approach to the Bieberbach conjecture to be unnecessarily wacky, and certainly not everyone does. Consider, for example, the following quote from Donald Sarason's book Sub-Hardy Hilbert Spaces in the Unit Disk, p.7 (empahsis mine)

      The ideas of contractive containment and complementary space were critical in de Branges's discovery of his proof of the Bieberbach conjecture. Although a proof of the conjecture that expunges these ideas can be given, and such a proof might seem preferable to specialists in geometric function theory, the role of Hilbert space ideas is really very natural, as is made manifest by the study of V.I. Vasyunin and N.K. Nikolskii, which further develops de Branges's approach.

      Now, I do have respect for Sarason and his opinion and, as with just about everything in mathematics, how strange or natural a particular approach to a problem is may depend strongly on one's own background.

  175. I think I speak for everyone when I say... by Junior+J.+Junior+III · · Score: 1

    "HUH?"

    --
    You see? You see? Your stupid minds! Stupid! Stupid!
  176. Re:de Branges' reputation with other mathematician by gr8_phk · · Score: 1

    I noticed in his apology that he must be rather old. He should have given the proof to one of his children or grandchildren so as to avoid the inevitable inheritance tax on that million dollars ;-)

  177. Purdue by mrokkam · · Score: 1

    Yayyy... Purdue ROCKS.
    Hey... if a prof here doesnt get the money.... we atleast got greatt profs like him....

    My personal theory is that geeks need to have a sense of Humor. Else......they die young. The more geeky you be... the more you appreciate a joke (Not tell it...only appreciate it)

  178. Re: there is an anti-zero, it's an one. by Anonymous Coward · · Score: 0
    0^0=1 because of x^0=1.

    The composite operator with zeros 0 op 0 does not always give zero.

    open4free ©

  179. Re: there is an anti-zero, it's an one. by Anonymous Coward · · Score: 0

    It raises an exception: Division by Zero.

    Is it undefined? Argggghhhh, many headaches!!!

  180. $1,000,000 by sbaker · · Score: 1

    So there is a million dollar prize for proving Reimann - how much do you get if you manage to disprove it?

    --
    www.sjbaker.org
  181. Re:Uh-oh! There's a mistake! by Anonymous Coward · · Score: 0

    yes i am not a mathematician, but a friend who is explained the error to me. I recall he told me "well the funcion beta sigma pi is bla bla bla bla to the logarithmic integral divided by bla bla bla bla which is convergent, although bla bla bla bla is complex it cant be proved, understand?"...uh.... yea.

  182. dates by physman · · Score: 0

    The apology for the proof is dated March 18, 2003 on page 2, the documents 'riemann zeta functions' is dated May 24, 2004 on page 2, but where is latest proof?

    --
    Murphy's Law of Research: Enough research will tend to support your theory.
  183. Problem with million dollar prizes by cardshark2001 · · Score: 1
    Is that it causes people to rush to publication.

    Just in the general case (disregarding this "proof"), what if a million dollar "proof" is published, is found to have a non-trivial error, and someone else fixes the error and publishes a very similar proof largely based on the incorrect one, which turns out to be correct? Who gets the money? Who decides the triviality of the error?

    --
    WWJD? JWRTFA!
  184. failure and... more failure by sdedeo · · Score: 1
    Most reseachers I know produce one magnificent failure after another on the quest for a new piece of knowledge.

    Yes! It's nice to hear this once in awhile, since most failures are presented at first as great successes, and when their flaws are discovered, they sort of quietly disappear. A young researcher entering the field sees all around what appear to be amazing, intimidating solutions, and it takes a while to understand that nearly all (or in my field, all) of them have more or less fatal flaws.

    There's a balance to be struck between presenting the half-baked and having the guts to present something completely new and only half-understood. It seems like this guy has built up enough "credit" in the community with his earlier work to have the option to throw this up in the air without damaging his reputation too much.

    It is a pity that you have to build up credit like that, but given the number of people working in the field, it takes a bit of karma to rise above the noise.

    --
    Protect your liberties. Donate to the ACLU
  185. noble??? by Cryptnotic · · Score: 1

    You did notice that his last name is de Bourcia, right? It's his family's ancestoral home. It's only noble in an aristocratic sense.

    --
    My other first post is car post.
  186. How you torture me! by exp(pi*sqrt(163)) · · Score: 1
    You are indeed correct. And given that my epigraph could be
    Here lies exp(pi*sqrt(163))
    He died before he could get laid by Jennifer Connelly
    regardless of how long I live, I may as well just end it all now.
    --
    Doesn't it make you feel good to know that our freedoms are protected by politicans, lawyers and journalists.
  187. Re:Uh-oh! There's a mistake! by MicroBerto · · Score: 1
    Sing my math songs with me! - i made these up:

    Sine, sine, cosine sine.. 3.14159!!!!!!

    e, e, is so great.. 2.71828!!!!

    --
    Berto
  188. apology.pdf ?? by stock · · Score: 1
    Inside this article http://www.math.purdue.edu/ftp_pub/branges/apology .pdf titled "APOLOGY FOR THE PROOF OF THE RIEMANN HYPOTHESIS" the author and mathematician Louis de Branges de Bourcia doesn't prove anything. He only ends with this quote :

    "The ruin of the chateau de Bourcia overlooks a fertile valley surrounded by wooded hills. The site is ideal for a mathematical research institute. The restoration of the chateau for that purpose would be an appropriate use of the million dollars offered for a proof of the Riemann hypothesis."

    How curious. Did he actually publish a possible Riemann hypothesis proof, or is it only a day dream of a mathematician about how to spend a million dollars? This dude is strange.

    Robert

  189. Well by Pan+T.+Hose · · Score: 1

    "If I were to awaken after having slept for a thousand years, my first question would be: Has the Riemann hypothesis been proven?"

    Oh yeah? Mine would be "Is Doom 3 out yet?"

    If I were to be awaken after having been sleeping forever, my first question would be:

    "Has Duke-- ah, never mind..."

    --
    Sincerely,
    Pan Tarhei Hosé, PhD.
    "Homo sum et cogito ergo odi profanum vulgus et libido."
  190. We want "i" so as to solve equations by GlobalEcho · · Score: 1

    I'm afraid this is going to get buried in all the responses about your proof of 0 = 0 x 0, but...

    Aside from quantum physics, I like to explain the yearning for "i" as follows:
    (1) Start with your arguments for why we might want zero.
    (2) In order solve problems like 6 + z = 4, we want the negative numbers. For example, z might be $-2 if we were doing accounting.
    (3) Now, we also want to be able to split an orange or a dollar among, say, 5 people. That requires solving 5 * z = 1. Thus, we need fractions, or the rational numbers.
    (4) We start thinking about other multiplicative equations, such as z * z = 9/4 where we get z=3/2. That's fine, but z * z = 2 has no rational solution. It seems weird we should be able to solve this only for certain values of the RHZ, and we end up getting ourselves to the real numbers.
    (5) But wait! The real numbers only get us solutions for nonnegative values of the RHS. What if we want to solve z * z = -2 ? Bingo, we need irrational numbers.

    So basically, you can think of irrational numbers as being a way of "completing" our usual notion of numbers so as to have solutions to equations that "feel" as though they ought to have them.

    That said, I suspect most people consider quantum mechanics a better justification.

    IAAMSICA [I am a mathematician specializing in complex analysis]

    Bonus Proof

    Theorem:
    A ham sandwich is better than eternal happiness.

    Proof:
    - A ham sandwich is better than nothing.
    - Nothing is better than eternal happiness
    - Therefore, a ham sandwich is better than eternal happiness. QED.

    1. Re:We want "i" so as to solve equations by h4rm0ny · · Score: 1

      I'm afraid this is going to get buried in all the responses about your proof of 0 = 0 x 0, but...

      Yep, I should not have put that in there. I was just trying to show how something the oringinal poster might regard as intuitive wasn't always seen that way.

      Bonus Proof

      Theorem:
      A ham sandwich is better than eternal happiness.


      UGH! That's a bastard to correct just using english language. Clearly, English is a flawed language and should be replaced with something we can validate with formal proofs.

      --

      Aide-toi, le Ciel t'aidera - Jeanne D'Arc.
  191. Hail the ignorance! by Anonymous Coward · · Score: 0

    The guy was born in 1932 and proved the Beierbach conjecture in 1985, from which we conclude (no higher math needed) he was 53 years of age at the time.

  192. Irony of the situation by agentpi · · Score: 1

    John Nash states that the Riemann Hyopothesis drove him to his extreme problems with schizophrenia, perhaps the Holy Grail of Pure Mathematics has taken another victim to the edge of insanity and beyond. I am reminded of the sage advices of my Calculus teacher, Mr. Jack Albers: "Don't let yourself be victimized by the problem!"