Slashdot Mirror


More on Riemann Hypothesis

Anonymous Coward writes "The NYTimes has a little story on a recent conference at New York University's Courant Institute where mathematicians gathered to discuss potential attacks on the Riemann hypothesis. The Clay Mathematics Institute had announced an award of a million dollars for a proof (or refutation) of the Riemann hypothesis during the millenial celebrations. That million dollars won't be worth much if it takes as long as that Last Theorem by Fermat to solve. There were some interesting observations such as the statistical distribution of the zeros looked just like calculations on the energy levels of large atoms." We did a related story on hard math problems two years ago.

234 comments

  1. Not more attacks! by Torgo's+Pizza · · Score: 4, Funny

    We're already being searched at airports, now mathematicians can't carry a protractor or a compass without being looked as being suspicious. When will terrorists learn that attacking math problems never solves anything. Wait, maybe it does...

  2. Who stands a better chance? by Zen+Mastuh · · Score: 0, Troll

    Who stands a better chance at proving/refuting the hypothesis: mathematicians pushing chalk or an NSA supercomputer using brute force? After all, this has an application in encryption...

    I do hope that a mathematician wins the prize money though.

    --
    "What is the sound of one belly slapping?"
    1. Re:Who stands a better chance? by krog · · Score: 2, Insightful

      seeing as an NSA supercomputer could only refute the hypothesis, and out of the billions of numbers it's already tried there have been exactly zero refutations, i'd put my money on the mathematicians.

      specifically, i'd place my bets on the smelliest and most Russian of them.

    2. Re:Who stands a better chance? by b_pretender · · Score: 4, Interesting
      That's an easy one to answer...

      The mathematician stands a better chance of proving the hypothesis, but the NSA supercomputer stands a better chance of refuting the hyposthesis.

      With current technology, it's extremely unlikely that the mathematician would refute the hypothesis or the computer might prove it (although it is possible).

      Finally, props goes out to the Courant Institute of Mathematical Sciences. The best, my favorite, and my current graduate school (@ nyu).

    3. Re:Who stands a better chance? by rupe · · Score: 1

      is it really that easy to refute it ? how many zeroes after the decimal point would you need to be happy with ?

    4. Re:Who stands a better chance? by evalhalla · · Score: 2, Insightful

      With current technology it is extremely unlikely, although possible, that a mathematician would refute the hypothesis, but it is impossible for a computer to prove it.

      While a mathematician can't try some random still untested number and hope to get the "right" one (all of the "small" numbers have been tried), he could always try and build some "special" class of numbers that could refuse the hypothesis and test those, or he could find some logical contradiction etc.

      On the other side, with current technology computers can only try more and more cases, so that if the hypothesis is false they eventually find an example, but they just can't try every number (not in a finite time :) ), nor actually prove a theorem by logical means.

      I know that somebody is researching some theorem-proving capable AI, but it seems that they didn't succeed yet in proving whether it can exist or not, so it will be quite some time before those could be available, if ever.

    5. Re:Who stands a better chance? by rupe · · Score: 1

      yes. could you please take it a bit slower for me. start by explaining why a prime is useful at this stage of the problem.

    6. Re:Who stands a better chance? by numatrix · · Score: 2, Informative

      A good example of a computer proving a hypothesis, with a great deal of human help, of course, is the map coloring problem. The current best-case proof that the minimum number of colors required to color any map is four utilizes a brute-force approach where the solution space is broken down into a finite (but large) number of possibilities that the computer can then attack individually.

    7. Re:Who stands a better chance? by Anonymous Coward · · Score: 0

      RTFA(rticle) ;) It states there there have been quite a few theorems that hold for more calculations than a computer could ever do, but then fail somewhere WAY down the line. Sorry, but you need cold hard mathematical proof. Einstein once said something along the lines that "Infinite experiments cannot prove me right, while a singular one experiment can prove me wrong."

    8. Re:Who stands a better chance? by Anonvmous+Coward · · Score: 0

      I wouldn't call what the parent poster said 'trolling'. I think he makes a good point. Why not use a brute force approach to attempt to prove it wrong?

      However, the human element does have an advantage: if there is a pattern there, a human is more likely to recognize it.

    9. Re:Who stands a better chance? by mindstrm · · Score: 1

      Seems like a neat experiment.. but....

      one can quite easily envision a map such that 4 colors is not adequate.

      As long as one region has more than 3 others touching it, 4 colors is not adequate.

      If you mean any current geopolitical map of the earth, depicting officially recognized countries, sure, maybe 4 is enough.

    10. Re:Who stands a better chance? by rupe · · Score: 1

      notwithstanding my other post, numerical evidence of a non-critical-line zero would rapidly lead to an analytic proof. anyway my point was that computing proofs arent (usually) acceptable, 4-color theorem perhaps an exception.

    11. Re:Who stands a better chance? by frankie · · Score: 3, Informative

      With current technology [...] it is impossible for a computer to prove it.

      No. It has been theoretically possible for computers to solve mathematical proofs ever since the first Turing-esque computers (the only missing element being "infinite" storage capacity) were built. And if a proof of Riemann requires more than a terabyte of statements and reasoning, then it's also beyond the capabilities of human mathematicians.

      I know that somebody is researching some theorem-proving capable AI, but it seems that they didn't succeed yet in proving whether it can exist or not

      They can exist, and people are working on them.

    12. Re:Who stands a better chance? by Anonymous Coward · · Score: 0

      the map has to be able to be represented as a graph with none of the edges crossing (can't remember the name for that at the moment).

    13. Re:Who stands a better chance? by Anonymous Coward · · Score: 0

      You are being a bit rude, seeing as you are basically agreeing with the comment you replied to...

  3. Eureka! by Ass-Gas-Istan · · Score: 4, Funny

    I have discovered a truly remarkable proof which this post is too small to contain.

    1. Re:Eureka! by Anonymous Coward · · Score: 0

      Heh, that Fermat was such a weenie.

      Goober

    2. Re:Eureka! by Nightpaw · · Score: 4, Funny

      It was that fucking lameness filter, wasn't it?

    3. Re:Eureka! by SnapShot · · Score: 0, Offtopic

      I have discovered the proof which I will happily post when my karma gets to 50 ;-)

      --
      Waltz, nymph, for quick jigs vex Bud.
    4. Re:Eureka! by SnapShot · · Score: 0, Offtopic

      Assuming, of course, I get back from my vacation cruise...

      --
      Waltz, nymph, for quick jigs vex Bud.
    5. Re:Eureka! by Anonymous Coward · · Score: 0

      I bet a lot of people don't get the refernce to Fermat's conjecture.

    6. Re:Eureka! by PlaysByEar · · Score: 1

      No, his post got through

    7. Re:Eureka! by Anonymous Coward · · Score: 0

      Not to mention the Archimedes reference in the subject.

    8. Re:Eureka! by good-n-nappy · · Score: 1

      Hmmm, sig seeming less witty now. I'll have to scavenge from this riemann fellow.

      --
      Never underestimate the power of fiber.
    9. Re:Eureka! by khuber · · Score: 1
      I bet a lot of people don't get the refernce to Fermat's conjecture.

      Maybe if they are illiterate or have been raised by wolves.

      Since I've seen the same stupid joke many times, like whenever a discussion about mathematics comes up, I'd say too many people are aware of the reference.

      Come on people, get some new material!

      -Kevin

  4. Forget bigger numbers, how about smaller words? by Mr+Guy · · Score: 4, Interesting

    Can someone explain exactly what this is and what it means in very small words?

    My understanding of the article is that:

    A) You can't predict prime numbers.
    B) That guy predicted prime numbers.
    C) Alot of money goes to whoever proves how the hell he predicted prime numbers.
    Ca)If we know how he predicted them we can crack old codes and make new ones?

    1. Re:Forget bigger numbers, how about smaller words? by k2enemy · · Score: 1

      he didn't predict prime numbers, he predicted the distribution of prime numbers.

    2. Re:Forget bigger numbers, how about smaller words? by rupe · · Score: 2, Interesting

      sort of avoiding your question (which you could answer using google) but ...

      with these sort of mathematical questions, a proof really means understanding the question. The question really is just so many words ("where are the zeroes on the critical line?") but the reason a proof is important is that it tells you why the question was worth asking in the first place.

      Phrasing the question in english just doesnt get the point across.... thats what makes mathematics so incredible. take the time to read up on it, even if you dont feel so confident with the maths, it is well worth it.

    3. Re:Forget bigger numbers, how about smaller words? by rupe · · Score: 1

      just so many words ("where are the zeroes on the critical line?")

      of course that should be "are the zeroes on the critical line".
      Preview, dammit, preview!

    4. Re:Forget bigger numbers, how about smaller words? by Brane · · Score: 1, Redundant
      You can read about the Riemann Hypothesis and the Zeta Function at MathWorld.

      However, for more details, you would have to look it up in a book on number theory or something like that.

    5. Re:Forget bigger numbers, how about smaller words? by uncoveror · · Score: 1, Flamebait

      Another great challenge would be to express the value of Pi absolutely using a mixed number, rather than a decimal. For a simpler challenge, check this out.

      --
      The Uncoveror: It's the real news.
    6. Re:Forget bigger numbers, how about smaller words? by DChristensen · · Score: 1

      Simple, really! Just take the limit as n goes to infinity of:

      first n digits of pi
      --------------------
      10 ^ (n-1)

      Next!

      --

      --
      Mac OS X--Unix without the assholes^Whassles.

    7. Re:Forget bigger numbers, how about smaller words? by markmoss · · Score: 4, Informative

      A) You can't predict prime numbers.
      B) That guy predicted prime numbers

      Riemann discovered a function that reasonably well matches the number of primes found within long intervals of numbers. It can't find primes per se, it just predicts how many you'll find between 'm' and 'n'. And it's no help for factoring a product of two primes, so it won't crack codes.

      Of course, winning the prize (by taking Riemann's work a few steps further) might happen to suggest a method for factoring a product of primes, but it's more likely it will be of interest only to those few mathematicians that can remember what Riemann's hypothesis was in the first place. (I used to know but no longer remember, and that d!@#d article didn't give an equation or otherwise say anything really useful.)

    8. Re:Forget bigger numbers, how about smaller words? by dillon_rinker · · Score: 3, Informative

      Almost...

      A) You can't predict prime numbers
      B) That guy came up with a formula that SEEMS to predict prime numbers
      C) A lot of money goes to whoever proves that the formula REALLY DOES predict prime numbers

      Just because a formula SEEMS to work for every number you try doesn't mean that it REALLy DOES work for all numbers. The classic example

      All numbers are less than 43 billion.

      I call this "The Rinker Hypothesis"

      Is it true? It seems to be..I tried 1, 2 & 3 and it worked. I tried every number up to one million and it worked. In fact, I tested the hypothesis for every number up to one billion and it was true for all those numbers. This example is rather trivial and silly, but it demonstrates the point: simply because a mathematical hypothesis (aka a conjecture) is true for every number you try doesn't mean that it's true for ALL NUMBERS.

      Riemann's hypothesis seems true for every number they try, but they haven't proved that it's true for ALL NUMBERS.

    9. Re:Forget bigger numbers, how about smaller words? by Ashtangi · · Score: 1
      I'm an engineer, so I don't really know math I just use it a bit, but isn't expressing Pi in this way how we go about solving for it's digits? IE, c = 2 * pi * r, so, pi = c/(2r) = c/d. So, draw a circle.
      • Measure circumference exactly,
      • then measure diameter exactly.
      You can now express pi as a mixed number. I suppose that step 1 (measuring c) presents a bit of a challenge. But this is what I always set out to do when trying to figure out how to solve pi out to 100 digits (never got there). If this is the wrong track, how else would it be done?
    10. Re:Forget bigger numbers, how about smaller words? by ALoverOfPeace · · Score: 1

      Is that second puzzle supposed to be hard? The hotel manager has $26, the maid has $1, and each guy has $1. 26+1+1*3=30. Do people really have trouble solving something like that?

    11. Re:Forget bigger numbers, how about smaller words? by jafiwam · · Score: 0

      Riemann discovered a function that reasonably well matches the number of primes found within long intervals of numbers. It can't find primes per se, it just predicts how many you'll find between 'm' and 'n'. And it's no help for factoring a product of two primes, so it won't crack codes.

      When I saw this description, I instantly thought ROM!

      Isn't one of the ideas behind hard drive and ROM memory seeking that you start by randomly dividing the thing in half or parts, searching systematically through that section, in the hopes you'll find what you want. If it does not work, just divide the remaining space in half again and search.

      Over time, the end result would be you reduce the time spent searching, because much of the time you guess right and get the data you need.

      Could this be used in a similar way to help locate primes exactly?

      It seems to me, that if you could say the number of primes between 'm' and 'n', all you gotta do is keep moving m and n around and keep count of where and how many. Then use statistics to narrow down where the primes are within a small enough area that the brute-force methods of finding them become effective.

      Or did I eat too much beef jerky again.

    12. Re:Forget bigger numbers, how about smaller words? by markmoss · · Score: 2

      I think that
      (1) It's an "on the average" relationship, not an exact relationship - that is, if it says there are 100 primes in a long interval it may be off by a few percent, but if it says there's 1 prime in a short interval it may be off by +/- 1. So it's no good for the bisection search.

      (2) The Zeta function is not that easy to compute anyhow.

    13. Re:Forget bigger numbers, how about smaller words? by Anonymous Coward · · Score: 0

      WTF was that post about?

      I think you've been exposed to mind altering substances.

    14. Re:Forget bigger numbers, how about smaller words? by mrdlinux · · Score: 2

      Perhaps you should be thinking in terms of "rational" and "irrational" numbers rather than ambiguous terms like "mixed number" and "decimal". Then you might realize how ludicrous it sounds to say: "Another great challenge would be to express the value of Pi absolutely using a rational number, rather than an irrational number." Given that the value of Pi is an irrational number, that statement doesn't even make sense!

      I am assuming basic knowledge of the difference between rational and irrational numbers however. Rational basically means "can be expressed as a ratio". Irrational is the opposite.

      Oh, and that Uncoveror puzzle is a rather tired old trick question that relies on the mind mixing up balances. $9 + $9 + $9 is $27 and the extra dollar for the maid is subtracted, not added, giving a total amount paid to the clerk of $26.

      --
      Those who do not know the past are doomed to reimplement it, poorly.
    15. Re:Forget bigger numbers, how about smaller words? by macdaddy357 · · Score: 1

      That one throws off people who are confused by trick wording, such as the reporters who thought they had been scammed. That story pissed me off! I wanted to read more about those siamese triplet piglets!

      --
      How ya like dat?
    16. Re:Forget bigger numbers, how about smaller words? by Fuzzy_Logician · · Score: 1

      Yes, but we find that usually we don't have to go out to 43 billion to disprove something. Fermat's last theorem was taken out pretty far by computer and it was proven, in time. Whether its true or not i don't think is the question. Whether it CAN be proven is the question, e.g. the three body problem.

    17. Re:Forget bigger numbers, how about smaller words? by Impy+the+Impiuos+Imp · · Score: 1

      I believe a mixed number (we really mean a rational number here) where at least one of the numbers was irrational is irrational.

      I mean, trivially 6.28.../2 is also PI.

      --
      (-1: Post disagrees with my already-settled worldview) is not a valid mod option.
    18. Re:Forget bigger numbers, how about smaller words? by samwhite_y · · Score: 2, Insightful

      Well -- having been in this business myself, I'll try to explain the relevancy of this problem. In Fourier analysis, the problem is usually to take a look at data, apply a transform and look at the underlying harmonics of the data (this works best on sound or light because the harmonics correspond to actual physical properties such as "pitch" or "frequency"). For example such techniques can be used to clean up images by removing the "noise" type frequencies in the data. A similar technique can be applied to numeric entities such as prime numbers. Ideas such as this produce something called the Zeta function which can capture various statistical properties of prime numbers (statistical properties of the entire infinite series of prime numbers). The "zeros" of the Zeta function (I'll avoid explaining what I mean by this) capture some of the statistical properties of primes in the way Fourier transforms explain light and sound. The Riemann hypothesis comes down in essense to claiming that prime numbers never behave too statistically perverse (the equivalent in Fourier transform data of saying that the harmonics are not too skewed -- the "sound" never "gangs" up on certain frequency areas). Although the mathematics can seem a bit obscure to those outside the field, it is probably one of the more profound questions out there. As a comparison, Fermat's last theorem (when evaluated purely for its mathematical significance) is merely a curiousity and was proved as a minor consequence of proving more important theorems in elliptic curves, which themselves are only stepping stones towards another really large unproved mathematical question. For the record, the question is: "Are all elliptic curves modular?" -- which is way more obscure than the Riemann Hypothesis and I consider to be the number one potentially solvable mathematical question that has ever been posed. It is a really cool problem.

    19. Re:Forget bigger numbers, how about smaller words? by tolan's+my+name · · Score: 1

      since Pi is trancendental you may be there a while....

  5. post score -1: Totals: redundant (1) by potcrackpot · · Score: 0, Offtopic
    We did a related story on hard math problems two years ago

    Who is responsible for this? I ask you, slashdot just never seems to have any decent stories anymore, just keeps recycling stuff over and over... ;-)

  6. How long is a piece of string? by Anonymous Coward · · Score: 0

    n cm
    And what is n cm?
    the length of the piece of string

  7. Here it is in small words by drew_kime · · Score: 1, Informative

    He wrote a function called the "zeta function." Any number, when fed into this equation, will yield a result somewhere on a plane. For some reason, primes always plot along one of the axes. No one can figure out why.

    --
    Nope, no sig
    1. Re:Here it is in small words by NASAKnight · · Score: 5, Informative

      Wrong. Primes do not always plot along one of the axes. Zeroes to the function are always (well, that's the hypothesis) of the form 1/2 + bi. This means they lie on a line parallel to the imaginary axis.

      --
      Fault loves the past, worry loves the future, but content enjoys the present.
    2. Re:Here it is in small words by skroz · · Score: 2

      Well that doesn't make sense... EVERY point lies on a line parallel to an axis. In fact, for each axis there exists a line parallel to that axis that passes through your point.

      And they say _I_ suck at math.

      ;)

      --
      -- Minds are like parachutes... they work best when open.
    3. Re:Here it is in small words by EllisDees · · Score: 2, Redundant

      EVERY point lies on a line parallel to an axis

      They don't all fall on the *same* line, though.

      --
      -- Give me ambiguity or give me something else!
    4. Re:Here it is in small words by p3d0 · · Score: 2

      Yes, but they don't all lie on the same line.

      --
      Patrick Doyle
      I mod down every jackass who puts his moderation policy in his sig. Oh, wait a sec....
    5. Re:Here it is in small words by cshor · · Score: 1

      He wrote a function called the "zeta function." Any number, when fed into this equation, will yield a result somewhere on a plane. For some reason, primes always plot along one of the axes. No one can figure out why.

      How is this a Score:5 Informative when it is wrong? The reply, however, is correct. Too bad I can't moderate today..

    6. Re:Here it is in small words by Florian+Weimer · · Score: 5, Informative

      He wrote a function called the "zeta function."

      The function had already been discussed by Euler.

      For some reason, primes always plot along one of the axes. No one can figure out why.

      Actually, that's easy. Primes (at least over the integers) are real numbers, and the zeta function maps real numbers greater than one to real numbers, which is evident from the definition as a Dirichlet series.

      Quite a few proofs in analytical number theory rely on the fact that in certain areas on the right side of the line {z : Re z = 1/2} contain no zeroes of the zeta function. So far, mathematicians have tried to carefully choose these areas in order to get good results (so that you can still use them efficiently, but you can also prove that no zeroes lie in it). If we knew that no such zeroes exist at all (the Riemann Hypothesis), we could avoid all these rather technical details and theorems would improve considerably as well (for example, the error term in the Prime Number Theorem).

    7. Re:Here it is in small words by Anonymous Coward · · Score: 0


      The point isn't to mod down wrong answers but rather mod up Interesting discussions. Maybe the post wasn't Informative but it is an Interesting discussion.

    8. Re:Here it is in small words by Hydrogenoid · · Score: 1

      And you say that in a thread about Riemann ?
      How dare you ignore non-euclidian geometries !

  8. Attacks on the Riemann hypothesis? by Anonymous Coward · · Score: 0

    I mean, they're just cheap noodles. No reason to attack them. They are very popular with poor college students and geeks, and .... oh, wait...

  9. Rainman Hypothesis? by gatekeep · · Score: 2

    For a second there I thought that said 'Rainman Hypothesis.' Somethine to do with counting cards maybe?

    1. Re:Rainman Hypothesis? by Anonymous Coward · · Score: 0

      It's the Ramen hypothesis. It's a mystery how all those little wavy noodles line up but remain entangled.

  10. Re:Sad news ... Stephen King dead at 54 by Anonymous Coward · · Score: 0

    I will believe it as soon as I see some sort of news link. You hear all kinds of crap on the radio, fm/am, anymore (mmmm XM radio yummy) that until I see a news link from a reputable source I won't believe it.

    Besides he needs to finish the Dark Tower series before he can die. :)

    J

  11. Re:Sad news ... Stephen King dead at 54 by GETerry · · Score: 0

    Can you say, AC Troll?

    Fuck Off!!

    --
    Why did I even bother?? (my sig sucks, but it's better than yours!!)
  12. Log in blues? by BoBaBrain · · Score: 1, Informative

    As ever with the NYT, log in with:

    User : nospamnospam
    Password : nospamnospam

    --
    I am a Karma Library.
    1. Re:Log in blues? by haa...jesus+christ · · Score: 1

      for the love of christ, the times does not spam people! there is an obnoxious and incestuous ignorance around here that really has to stop.

    2. Re:Log in blues? by Reckless+Visionary · · Score: 0, Troll

      Is this some sort of assertion that the New York Times uses your email address to spam you? Because that's really ridiculous, I registered over 2 (3?) years ago, and I've never received an email I didn't specifically request from them.

      --
      I think I'll stop here.
    3. Re:Log in blues? by ImaLamer · · Score: 2

      Yeah, I'm sure they didn't give it out either!

      Wake up kids...

      And don't bother reading the "privacy policy" anymore... sites just do things anyways.

    4. Re:Log in blues? by Reckless+Visionary · · Score: 1
      While that's an impressive, though a bit sad, display of vigilence, one cause of that particular email address being used is through the use of New York Times forums (though I doubt you did that), which, as the privacy policy states:

      Members who post a message in our Forums make their e-mail address available to others through a feature of our Forums software, which could result in unsolicited e-mail from other subscribers or parties.

      But seeing your method, I believe I'll undertake the same in order to confirm over some period. If the New York Times did in fact share your email address, TRUSTe and BBBonline would probably like to know about it. Thanks for the decent methodology.

      --
      I think I'll stop here.
    5. Re:Log in blues? by Tackhead · · Score: 2
      > But seeing your method, I believe I'll undertake the same in order to confirm over some period. If the New York Times did in fact share your email address, TRUSTe and BBBonline would probably like to know about it. Thanks for the decent methodology.

      TRUSTe doing something about a privacy violation?

      Score that (+1, Funny)

    6. Re:Log in blues? by skroz · · Score: 2

      I agree, and have come to the conclusion by a similar method. Whenever I register on a website, I use an e-mail address of "domainname@mydomain.com" Not only does this tell me who is spamming me, but also who has sold my addresses to whom (or who has allowed it to be pilfered.) The nytimes address had to be pointed to the bitbucket about a year ago.

      --
      -- Minds are like parachutes... they work best when open.
    7. Re:Log in blues? by Anonymous Coward · · Score: 0

      for the love of christ, the times does not spam people!

      1. You are wrong
      2. Yes they do (they sell addresses to spammers).
      3. I have proof.
      4. You are a moron.
      5. Everybody hates you.

    8. Re:Log in blues? by haa...jesus+christ · · Score: 1

      In response to you, cockmaster: 1. I'm not 2. If they sell addresses to spammers, why don't I get spammed? 3. Then prove it. 4. If I'm a moron, and I'm your daddy, what does that make you? 5. True, everybody does hate me. But at least I don't have to have sex with my hand, or some kind of synthetic material. Cockmaster.

      god i love slashdot.

  13. Proofs delicate? by micromoog · · Score: 2, Interesting
    But mathematical proofs are extremely delicate structures that can vanish at the merest touch.

    Wha-wha? I was under the impression that proofs are rock-solid demonstrations of a particular fact given a set of well-defined mathematical laws . . .

    1. Re:Proofs delicate? by discstickers · · Score: 4, Insightful

      When they are completed, yes they are rock-solid. But in development, one tiny, almost insignificant error can throw off the whole thing.

      Think about it in terms of spacecraft. A couple of vehicles were perfect and landed on Mars. One had a small defect, it wasn't complete (meters and miles were mixed up). It was lost.

      --
      I have a shitty sig!
    2. Re:Proofs delicate? by p3d0 · · Score: 1

      I don't get your sig. What's so remarkable about that uptime report? I don't see it.

      --
      Patrick Doyle
      I mod down every jackass who puts his moderation policy in his sig. Oh, wait a sec....
    3. Re:Proofs delicate? by hoss10 · · Score: 1

      Theorems are delicate.
      Theorys are rock solid.

    4. Re:Proofs delicate? by Welpa · · Score: 1

      >Theorys are rock solid

      Spelling is shaky.

    5. Re:Proofs delicate? by Anonymous Coward · · Score: 0

      You've got that backwards.

    6. Re:Proofs delicate? by Anonymous Coward · · Score: 0

      Why is your computer only up for 32 days? Are you running Linux or something?

    7. Re:Proofs delicate? by WEFUNK · · Score: 1

      IANAM, but as I understand it:

      In math, a theorem is a single proven statement, while a theory is a set of statements or principles used to describe an overall system or branch of mathematics. Specifically (in math at least) a theory is a set of related theorems.

      Alternatively, "theorem" is used to describe a statement that must be proven, in contrast to a "problem", which must be solved.

      --
      My next sig will be ready soon, but friends can beat the rush!
    8. Re:Proofs delicate? by Zordak · · Score: 2

      Obviously, he is a previous Windows 9x user, so uptimes of 32 minutes were impressive. In that light, 32 days seems like an eternity. Although, honestly, I don't see what the big deal is about uptime for non-server boxes. I have no problem turning off my computer at work every evening. It's just burning power needlessly. I set my BIOS to start up every morning before I come to work, so when I get here it's already booted. (Sorry, I know this is offtopic, but I'm an engineer, not a mathemetician, so I have only a fundamental grasp of what all these mathematicians are talking about).

      --

      Today's Sesame Street was brought to you by the number e.
    9. Re:Proofs delicate? by RackinFrackin · · Score: 1

      IAAM, and I agree with your explanation, with one nitpick:

      Specifically (in math at least) a theory is a set of related theorems.

      I would say that a mathematical theory (ie graph theory, number theory, etc) encompasses not only the theorems, but also other related things such as definitions, axioms, conjectures, unsolved problems in the area, etc.

    10. Re:Proofs delicate? by Anonymous Coward · · Score: 0

      Bad analogies. Macroscopic, manufactured physical objects are never perfect, and their functionality is based on being within some tolerance and with sufficient redundancy that they will probably work reliably.

    11. Re:Proofs delicate? by discstickers · · Score: 1

      I think thats a good uptime for a heavily used laptop.

      --
      I have a shitty sig!
  14. Re:bad news for Science? by Anonymous Coward · · Score: 0

    With highly visible scientists like our own PhysicsGenius, SIGFPE, and others here on Slashdot, along with this site's tendency towards science and mathematics, I doubt that anyone will be losing faith in science any time soon.

    That said, biologists have a long way to go in getting themselves to the stature of mathematicians and physicists. Those groups deal with laws and pure theories. Biologists can't even prove evolution to a good enough degree to refute intelligent design theory. If you follow the physics, I don't see how you could believe anything else, there's simply too much beauty and "intelligence" for this all to have happened by chance.

  15. Perhaps too far... by Maran · · Score: 1

    "We did a related story on hard math problems two years ago."

    I know various people complain when Slashdot re-posts stories, and it's good to see you're taking note and warning us, but that's going a little too far back.

    Maran

    1. Re:Perhaps too far... by Anonymous Coward · · Score: 0

      Proving once again, you can't please everyone.

  16. Why so much money? by Aliks · · Score: 1

    Things have changed since my day. It used to be that anyone who was capable of a serious attempt on the Riemann hypothesis would get to work because the problem needed solving and the kudos would be immense. Any monetary reward would be incidental. I suppose a million dollars will attract mathematicians who are today working on other topics. Presumably the Clay Institute feels that Riemann has to compete hard against other avenues of research. Or maybe they are targetting all the rich quants who were just laid off On Wall Street.

    1. Re:Why so much money? by arkanes · · Score: 2

      Man, you must be old, because people have been offering rewards for proofs for hundreds of years.

    2. Re:Why so much money? by Aliks · · Score: 1

      True rewards have been around since the dawn of maths, but these have mostly been from rich sponsors paying what amounted to the living expenses of the successful mathematician.

      My days were in the 70s and I think the richest prizes were like the Booker prize, £20,000 ($30,000)Hardly the same league as a million green 'uns.

      That's not counting salaried positions which are sometimes awarded as prizes

    3. Re:Why so much money? by drc500free · · Score: 1

      methinks that maybe they are trying to spur the next generation of kids to seriously look into studying mathematics, which is seen by many as being dry and impracticle compared to engineering. That million dollar reward buys a lot of publicity.

    4. Re:Why so much money? by Eminor · · Score: 2, Funny

      Or maybe they are targetting all the rich quants who were just laid off On Wall Street.


      You'd think they would target people who are good at math.

    5. Re:Why so much money? by bofkentucky · · Score: 1

      What is sad is that a child would have a better chance of proving or disproving the theorem in question as opposed to signing a professional sports contract worth 1 million dollars&lt/doctor>, but which one do more kids attempt.

      --
      09f911029d74e35bd84156c5635688c0
    6. Re:Why so much money? by t · · Score: 2

      Your logic is seriously faulty. The Riemann Hypothesis may never be proved whereas there is a non-zero quantity of >=$1M contracts floating around at all times.

    7. Re:Why so much money? by bofkentucky · · Score: 1

      I think the point I was trying to make is that the pursuit of proving the Riemann Hypothesis, could generate better pay and a more fruitful life for a youngster instead of trying to get that pro sports contract. Whats a math Ph. D. worth these days average in the US? I'd gamble somewhere around $100,000 a year, but please comment if I'm off by a lot. Even a BS in a science + MA in education starts a person out at $28,000/yr just to teach high school kids around here. Thats not a bad living to start out with (Comes to about 13.50/hr to start, which will beat McDonalds any day) plus 2 months of vacation a year. looking at a top out pay grade for a local school district, 70-80 grand/yr are possible if you end up in an administrative role, and we are talking about a rural school district in KY. I'm gambling that in other places pay matches Cost-of-living variations.

      --
      09f911029d74e35bd84156c5635688c0
    8. Re:Why so much money? by Anonymous Coward · · Score: 0

      Whats a math Ph. D. worth these days average in the US? I'd gamble somewhere around $100,000 a year, but please comment if I'm off by a lot.

      A cursory glance at Google shows you're probably off by about a factor of 2:

      Google cache of Georgia Tech grads' starting salary offers

      University of Maryland professors' salaries (math is under CMPS)

  17. But it's easy to prove... by bearnol · · Score: 3, Funny

    http://www.bearnol.pwp.blueyonder.co.uk/Math/riema nn.htm

  18. Re:Anonymous posting is terrorism by Anonymous Coward · · Score: 0


    I'll be in New York City this weekend. Meet me in front of the Museum of Modern Art at 3:00 PM this Saturday. I'll be wearing olive nylon hiking shorts and a tan t-shirt if it's warm, if it's raining I'll have on jeans and a red pullover. I'll be holding a pack of Lucky Strikes in my hand. Just walk up to me and say "I'm from slashdot." I'll fucking smash your mouth in right then and there. Then I'll take you up to the burrito place on the corner, buy you a burrito, and then punch you in the stomach and watch it fly all over the street. I'll beat you so bad your innards will turn to liquid, and drain out of your bunghole. I'll make you cry right in the center of the biggest city in the world, you little half-man.

    Time to put up or shut up, punk. MoMA, 3:00, Saturday. Be there.

  19. Could you get a bit more arrogant please? by A+nonymous+Coward · · Score: 0, Flamebait

    What an attitude! You are so full of yourself that all you have really done is prove that you don't know jack.

    If you can't explain something in ordinary words to a layman, then you really don't understand it. It isn't until you teach something that you really begin to understand it.

    1. Re:Could you get a bit more arrogant please? by rupe · · Score: 1

      not my intention at all, just trying to convey thoughts that might help or encourage someone to understand it. I've spent a few years studying the zeta function (not my usual area of mathematics) and i have found it an amazing if difficult field of study, but i think if you want to understand it "as a layman" its not going to be of interest to you.

      i disagree with your statement that if you cant teach something then you dont really understand it; not everything worth knowing comes from reading a slashdot post.

    2. Re:Could you get a bit more arrogant please? by njj · · Score: 5, Informative

      If you can't explain something in ordinary words to a layman, then you really don't understand it.

      I'm about halfway through writing up my PhD thesis on some applications of homological algebra to knot theory and low-dimensional geometric topology (provisional title liber rerum dementiae, but it'll probably end up being called something more mathematically appropriate).

      In principle, yes, I could explain the details of my research to a suitably motivated layman. But I suspect it would take rather a long time.

      You see, and this really isn't meant to sound arrogant, supercilious, or dismissive, university-level mathematics is pretty damned difficult, and the details of most cutting-edge research really doesn't make sense until you've spent several years learning the background (the mindset, the language, the fundamental concepts).

      My current area of research is essentially the applications of homological algebra to knot theory and low-dimensional geometric topology. To explain this to a non-mathematician, I'd first have to teach them a lot of background stuff (group theory, a bit of stuff about rings and modules, point set topology, basic algebraic topology (the fundamental group, (co)homology theory), some geometric topology (basic course in knot theory, some stuff about 3-manifolds), a bit of category theory, and some homological algebra (broad overview of the (co)homology theory of groups and algebras)).

      It's taken me nearly nine years (3-year BA, 1-year MSc specialising in topology and knot theory, plus nearly five years doing a (part-time) PhD) to get to this point myself. If I were a bit cleverer (or didn't have a `proper' job as well) I might have been able to shave a couple of years off that.

      My friend Steve has a physics degree. I managed, in ten minutes one evening, with much handwaving, to give him some idea of what my thesis is all about. It helped that he knew what a group was already though. But for me to explain it fully to him would probably necessitate him doing at least one mathematics degree first. And that's not really something I'd wish on one of my friends :)

      Now this really isn't meant in an arrogant way, and I hope you won't read it like that, but Euclid was right: There is no royal road to geometry.

      I can have a go at explaining the Riemann hypothesis, though. To fully understand what it's about and why it's so damned difficult you'll need to do an advanced course in complex analysis (which isn't my field either).

      A complex number is a sort of two-dimensional number, which you can regard as a point in a plane (the `complex plane' or `argand diagram'). You add them together coordinate-wise, and you multiply them together in a weird manner which involves something which behaves like a `square root of -1' (engineers also like to think of it as a sort of 90-degree phase-shift operator, I'm told).

      There's a particular function (`Riemann's zeta function') defined on the complex plane (it takes one complex number as input and returns one complex number). For some complex numbers (`the zeros of the function'), the value of this function is zero.

      The `trivial' zeros occur at the points -2, -4, -6, ... on the horizontal axis.

      The `non-trivial' zeros (that is, all the other points for which zeta is zero) all seem to occur on the line parallel to the vertical axis that intersects the horizontal axis at +0.5. Indeed, nobody's ever found one which doesn't.

      The Riemann Hypothesis is that *all* the non-trivial zeros lie on this line. It's known to be true for the first (large number which temporarily escapes me), but it turns out to be phenomenally difficult to prove that it's true in every case.

      Now that's the basic idea, but it doesn't (and I can't - it's not my field) explain *why* it's so difficult that some of the greatest minds (Hardy, Littlewood, Ramanujan, etc) of the past 150 years have failed to prove it, and why the Clay institute are willing to pay a million dollars to someone who can.

      - nicholas (we don't just sit around doing big sums, you know :)

    3. Re:Could you get a bit more arrogant please? by Anonymous Coward · · Score: 0

      Thanks, this was a great help in understanding the subject. In essence, I believe you basically told the same as others have done in this thread, but this one I understood.

    4. Re:Could you get a bit more arrogant please? by rupe · · Score: 1

      yes, a very clear description, kudos.

      one of the things about the riemann hypothesis is that even to understand the problem requires a lot of study. compare that to fermats last theorem which is accessible to any high school graduate (well, most high schools...)...

      but the fact that it is *really hard* makes it such worthwhile study.

    5. Re:Could you get a bit more arrogant please? by AndrewHowe · · Score: 2

      You can't say "... it turns out to be phenomenally difficult to prove ..."!
      It happens that no-one has managed it yet.
      If someone does manage it, perhaps it will seem simple.
      Even if it doesn't, will it be possible to prove that it is the simplest possible proof?

    6. Re:Could you get a bit more arrogant please? by Jerf · · Score: 2

      To condense njj's excellent post on the topic, if you can explain a concept to a layman in such a way that they actually understand it, then virtually by definition, the concept was not advanced, as it did not require extensive pre-education.

      However, advanced concepts exist. Therefore, there exist concepts which by definition can not be adequately explained to a layman.

      In fact, sir, the arrogance is yours. You are arrogant in assuming that it's possible for a layman, i.e., you, to understand everything, and that if you don't understand it, the fault must lie with the explanation.

      There are things which are hard. Deal with it. (This arrogance is regrettably quite popular.)

    7. Re:Could you get a bit more arrogant please? by gammoth · · Score: 2, Interesting

      Thanks. Great explanation.

      Could you elaborate and tie this in with the number of primes between m and n?

    8. Re:Could you get a bit more arrogant please? by Anonymous Coward · · Score: 0

      >Now that's the basic idea, but it doesn't (and I can't - it's not my field) explain *why* it's so difficult that some of the greatest minds (Hardy, Littlewood, Ramanujan, etc) of the past 150 years have failed to prove it, and why the Clay institute are willing to pay a million dollars to someone would...

      Why? Because the same minds can't explain the obvious order of the prime numbers!

    9. Re:Could you get a bit more arrogant please? by tolan's+my+name · · Score: 2

      Even if it doesn't, will it be possible to prove that it is the simplest possible proof?

      yes, or at least you could find the simplest proof in finite time

      [as a proof it would have to be constructable in a finite number of steps from 1st order logic and the axioms of set theory. Given N, the number of steps the proof took, there is a finite set s(N-1) of all statements taking less than N steps, these could be exausted in finite time by a computer and examined to see if any where proofs of the theorem.]

    10. Re:Could you get a bit more arrogant please? by njj · · Score: 2, Insightful

      Thanks. Great explanation.

      Very kind of you to say, thanks.

      Could you elaborate and tie this in with the number of primes between m and n?

      I'm a little less confident about this, but here goes...

      As I understand it (and bear in mind that I've not done any complex analysis for several years, and number theory has never really been my forte) sometime during the 19th century Gauss noticed that the distribution of primes was approximated pretty well by a function he called the `logarithmic integral'.

      Li(x) is defined as the integral from 0 to x of (1/t) dt. And apparently the number of primes below x (usually denoted pi(x)) is pretty well approximated by Li(x).

      Now this is where I start to lose track of things.
      As I understand it, it was proved at the beginning of the 20th century that the validity of the Riemann hypothesis is equivalent to the assertion that the deviation of Li(x) from the actual value of pi(x) is of the order of sqrt(x)*ln(x).

      If I remember correctly, some work of the three great British mathematicians Hardy, Littlewood, and Hardy-Littlewood showed that pi(x) actually oscillates around Li(x) infinitely many times (although it really doesn't do it very quickly - the first value of x for which the graphs cross is very big indeed).

      qv: the Clay Institute's page
      and Chris Caldwell's page for better explanations.

      As to whether there's a relatively simple proof out there, I don't know. My (non-specialist) suspicion is that there isn't, because some really clever people have tried to find one for a century and a half and failed. I'd be interested and impressed to be proved wrong on this, though.

      Andrew Wiles' celebrated proof of Fermat's Last Theorem (if you haven't done so, read Simon Singh's book on the subject, and if possible watch the BBC Horizon documentary - the transcript is available) was pretty complicated and, I'm told (algebraic geometry isn't my field either - there's an awful lot of diverse mathematics out there) introduced some genuinely new ideas and methods.

      The general feeling is that if there were a simple proof of either Fermat or Riemann (or, for that matter, the Goldbach or Poincare Conjectures) then someone would have found it by now - some really top brains have worked on all of these over the years (including several Fields medallists, FRSes, and the like).

      (There's a guy who posts regularly to sci.math who reckons he's got a simple proof of Fermat which doesn't resort to all that scary stuff about elliptic curves or modular forms. The consensus seems to be that he's a nutter, though - his `proofs' contain obvious flaws which he refuses to acknowledge, claiming instead the existence of an enormous academic conspiracy against his work.)

      It's also often the case (and this was true for the Fermat theorem) that proofs of such intractible problems, even those which are subtly flawed, introduce new ideas and methods of attack.

      This is why otherwise sensible mathematicians have a go at these problems - even if they don't manage to solve them, the chances are that the attempt will inspire them to find new methods or potentially important partial results. Even had Wiles' original (flawed) proof turned out to be irrepairable, it was a pretty major piece of work which introduced some important new ideas which could well be useful in solving related problems.

      My guess (as an interested non-specialist) is that while a proof of RH would be complicated and elegant, it would also involve some new twist or idea. As for who might do it, my money would be on Prof Louis de Branges of Purdue University - he demolished the (similarly intractible) Bieberbach Conjecture in the 1980s and thus seems to know what he's doing. Or it might be someone else entirely, someone who's spent seven years locked in their attic (as Wiles did).

      nicholas

    11. Re:Could you get a bit more arrogant please? by Steve+Franklin · · Score: 1

      What I don't quite understand, beyond the obvious cryptological uses, is what's so important about a "set" of numbers made up exclusively of integers that are not subject to even division by an integer other than themselves. From my admittedly nonmathematical perspective, you have simply elevated to the level of mathematical entity something that amounts to the refuse from a series of simple arithmetical operations, i.e., dividing a series of numbers by a series of smaller numbers and seeing which ones always have a remainder.

      For the life of me I can't see how this could be a fundamental building block of mathematics any more than twiddling ones thumbs could be a building block of physics. The reason it's so difficult to prove anything related to prime numbers is that they really aren't fundamental. You might as well try to "prove" something related to the manhole covers the driver in front of you manages to avoid.

      --
      Hic iacet Arthurus, rex quondam rexque futurus.
    12. Re:Could you get a bit more arrogant please? by JohnPM · · Score: 1

      Well, primes are very special for lots of reasons. For example, from an information theory point of view, primes provide a way to encode an arbitrary sequence of numbers into another single number. How? Each number has a unique factorisation into primes. For example 20 = 2^2 x 3^0 x 5^1 x 7^0 x ... and so on for all the primes. So the sequence 2,0,1,0,0,... uniquely maps to the number 20. In this way you can map any sequence of numbers to the corresponding product of primes.

      In the C programming language the corresponding concept is the struct which lets you wrap up several values into one. So primes are at least as fundamental to number theory as the struct is to programming.

      Also, the news-for-nerds crowd only has to look to cryptography to see how important primes are.

      --
      Karma police, I've given all I can, it's not enough, I've given all I can, but we're still on the payroll.
  20. But no one would care about that by drew_kime · · Score: 3

    The mathematician stands a better chance of proving the hypothesis, but the NSA supercomputer stands a better chance of refuting the hyposthesis.

    If a computer disproves it by finding a prime that happens to map wrong on the zeta theorem, mathemeticians will still want to know why this one didn't work, when all the others have.

    BTW You have also determined a relative probability -- "better chance" -- of something that may be undefined. If the theorem is in fact true, then a computer's chance of disproving it is exactly equal to a mathemetician's chances: zero.

    --
    Nope, no sig
  21. Prove This by LordYUK · · Score: 0, Redundant

    I'm still waiting for someone to prove this: Step One: Steal Underpants Step Two: ... Step Three: Profit. When they can prove that, THEN I'll be impressed. :)

    --
    This is my sig. Its pathetic.
    1. Re:Prove This by CaffeineAddict2001 · · Score: 1, Offtopic

      I hear in japan step 2 is equal to "Soil Underpants"

  22. Prove this (revised) by LordYUK · · Score: 1, Offtopic

    I'm still waiting for someone to prove this:
    Step One: Steal Underpants
    Step Two: ...
    Step Three: Profit.
    When they can prove that, THEN I'll be impressed. :)

    --
    This is my sig. Its pathetic.
    1. Re:Prove this (revised) by rupe · · Score: 1

      move to japan -- no problem.

  23. When I finsh my Linux Xbox port by Anonymous Coward · · Score: 2, Funny
    After I finish my Linux Xbox port, I'll solve the Riemann Hypothesis. That will give me:
    $200,000 + $1,000,000 = $1,200,000
    I'll be well on my way to my second million!
  24. Other things anyone who really knows can do.... by DohDamit · · Score: 3, Funny

    Explain sight to the blind.
    Explain sound to the deaf.
    Explain intuitive leaps of any kind.

    Not every concept maps to a clean explanation in a few simple words. That's why we have the different words. True, most concepts can be mapped somewhat to common language, but come on...give the guy a fucking break. We're talking about advanced mathematics.

    Get off YOUR high horse, bubby.

    1. Re:Other things anyone who really knows can do.... by Anonymous Coward · · Score: 0

      So - you don't understand it either?

  25. A proof that is worth millions to MAN kind by mustangdavis · · Score: 2, Funny
    Here is a proof that has eluded many men throughout their life time.
    Keep in mind this proof looks much better if you can actually use the square root symbol

    The problem:

    Prove that women are all evil.

    (With written proof, men don't have to worry about women arguing this fact anymore ... just show them the paper. This will end debates that have been going on for centuries)


    The proof:

    Given that:
    • Time = money (we all know this)
    • Women = time * money (another well known fact)
    • Money = sqrt(evil) (after all, money is the root of all evil)


    Proceede with the proof:
    1. Women = money * money (substitution)
    2. Women = money^2 (restating #1)
    3. Women = ( sqrt(evil) )^2 (substitution)
    4. Women = evil
    5. Q.E.D.


    See what an undergrad in Mathematics, an undergrad in C.S., and a Master's in C.S. gets you .... the ability to prove what you already know to be true!! What a waste of time!!! And that time cost me money!! So I got screwed twice!!! (and not by women in this case) I suppose this proof would also apply to college as well as women (since college = time * money). In fact, I just proved another well known fact .... college = women!!! And since college = women, it follows that college = evil as well. Wow, I never proved this much good stuff while in school! Practical theory!!!!

    Seriously, I wish someone could prove that P=NP. I hated graduate Algorithms! This would have eliminated a portion of my least favorite topic in that course (NP and NP-completeness). If this world is not truely hell, someone will prove that and share it to help prevent the suffering of innocent C.S. graduate students.

    1. Re:A proof that is worth millions to MAN kind by Anonymous Coward · · Score: 0

      Actually woman=time AND money.

      I know coz I was one.

    2. Re:A proof that is worth millions to MAN kind by Eminor · · Score: 1

      If this world is not truely hell, someone will prove that and share it to help prevent the suffering of innocent C.S. graduate students.

      You do that in Graduate School? Up here in Canada that is second year undergrad material.

    3. Re:A proof that is worth millions to MAN kind by chialea · · Score: 2

      Believe it or not, there are things in CS Theory (and algorithms in specific) which are a bit too complex for most 2nd year undergraduates (or indeed many graduate students) to fully grasp. Abstract algebra is not often taught to first-year undergraduates, and it's rather helpful in this context. Research continues. It happens.

      Lea

    4. Re:A proof that is worth millions to MAN kind by Lictor · · Score: 3, Informative

      >You do that in Graduate School? Up here in Canada that is second year undergrad material.

      If your school is CIPS (Canadian Information Processing Society) accredited... which just about every University CS program is... I would be somewhat suspicious of this claim.

      You may be confusing "Analysis of Algorithms" with "Complexity Theory" which are different (though of course, related) things. Yes, most programmes give an introduction to P vs. NP in second year, but I would be surprised if you are doing serious complexity theory simply because a 2nd year CS undergrad just doesn't have the mathematical tools to do this yet (not to mention that with the CIPS cirriculum requirements.. there isn't anywhere to *put* courses to aquire said background).

      That being said: Prove me wrong. What school are you at, and are they hiring? ;)

  26. Let's not be too hasty by rabiteman · · Score: 1

    While I admit that it's certainly possible that Riemann's Hypothesis may, God willing, be proven or disproven, isn't it also possible that it cannot be either proven or disproven under the applicable mathematical system? Gödel's Theorem means that that's a possibility, doesn't it? Not everything has to necessarily be true or untrue...

    --
    Oh cruel fate, to be thusly boned! Ask not for whom the bone bones; it bones for thee. -Bender

    1. Re:Let's not be too hasty by PenguiN42 · · Score: 4, Informative

      First off, not being able to prove or disprove something doesn't mean it's not true or untrue, just that one can't prove it either way. Incompleteness specficially means that there are true statements in the system that can't be proven or derived in the system. It doesn't mean that "not everything has to necessarily be true or untrue."

      Secondly, iirc, Gödel showed that sufficiently complex systems have to either be inconsistant or incomplete using a very specific paradox ... the equivalent of "this statement is unprovable" (if you prove it's true, you've contradicted yourself. if you can't prove it's true, then it's true, but you're not able to prove it so it's incomplete). The overwhelming majority of mathematics is complete and consistant, and there's no reason to expect it not to be and give up prematurely.

      Finally, who's being "hasty"? What exactly are you suggesting? That they give up the search for a proof because there's a tiny chance that it may be unprovable? Why doesn't the entire field of theoretical math just stop right now, then?

      --
      The following sentence is true. The preceding sentence was false.
    2. Re:Let's not be too hasty by physicalpsyche · · Score: 1

      parodixacal as it is, that's the story of mathematics, it's either solidly proven, or incomplete

    3. Re:Let's not be too hasty by pekka_v · · Score: 1

      To my understanding Gödel proved by example that any system containing at least the Peano axioms (natural numbers) is incomplete. As this is true for basically all mathematics, the previous comment obviosly applies here. We know that we do have mathematical theorems that cannot be proven to be true or false. We do not know which theorems would be such beforehand; to my understanding there is no reason for Riemann's hypothesis to be provable. Anybody know of any categarization system that would help to deduce whether a theorem is provable or not? BTW: There was (is?) actually a group called constructivists that tried to do without Peano axioms (they disargeed with complete induction). To my understanding they did not get much done...

    4. Re:Let's not be too hasty by Impy+the+Impiuos+Imp · · Score: 1

      Refresh my memory. There were things known to be true or false (though whether true or false was not known) and that were proven that could not be proven one way or the other.

      I believe it's claimed there are things humans can prove true or false (some tiling issue) that a Turing machine cannot. This would show trivially that reality cannot be accurately simulated by a Turing machine. Moreover, it would demonstrate specifically that human consciousness and/or the human mind are one such construct.

      --
      (-1: Post disagrees with my already-settled worldview) is not a valid mod option.
    5. Re:Let's not be too hasty by pekka_v · · Score: 1

      It is as you said that there are claims i) known to be true ii) known to be false iii) known to be not provable true or false (altough these might be true or false) and also finally claims iv) for which we do not know yet to which of the first three categories the claim would belong to. However to my understanding Gödel's theorem is not at least directly connected algorithmic theory (abstract machines etc).

      Saddly I'm not an expert on Turing machines or AI theory (as considering whether a machine can be built to mimick human mind; I can only believe that this might be possible, but however not in the foreseeable future). BTW: a mathematician called Yiannis Moschovakis has proposed an alternative for the abstract machine approach (Mathematics Unlimited 2001).

    6. Re:Let's not be too hasty by Anonymous Coward · · Score: 0

      I would say something being unprovable *does* means it's neither true nor false... in the current system.

      When people say something is true but unproveable, what they mean is that if you add some extra structure, then a proof appears. Of course, it is possible that some different extra structure would create a disproof.

      There are the contrived Goedelian unprovables, and then there are simpler things, such as independent axioms.

      Eg Euclid's fifth postulate (parallel lines never meet), is unprovable (neither true nor false) in the axiom system created by his first four postulates (one line between two points yada yada). You can add some extra structure to make it true (on a plane), or a different extra structure to make it false (on a sphere).

      This all relies on my definition of true being
      "A statement is true relative to a given set of axioms if there exists a logically correct proof of it assuming only those axioms, and those axioms of prepositional logic."

      Many people can find this an unsatisfactory definition of truth, but I've never known what they've meant.

      The nastiest kind of statements are not only unproveable, but whether they're unproveable or not is unproveable, so you never know when to give up. I'd be impressed if someone could contrive one of these.

  27. ZetaGrid by c.emmertfoster · · Score: 5, Informative

    Apparently there's a distributed computing project called ZetaGrid which has calculated the first 50 billion zeros out ... if you're bored of SETI@Home, this might be a nice change of pace.

    Riemann Hypothesis
    Riemann Zeta Function
    Also, there's some rather technical details on the subject, from Stephen Wolfram's (A New Kind of Science) pet site.

    --
    We can neither love nor pity nor forgive. If you make a slip in handling us you die!
    1. Re:ZetaGrid by Mr.+McGibby · · Score: 1

      Please note: At the moment all downloadable software and the source code is only available at the intranet site of IBM Deutschland Entwicklung GmbH. As soon as it will be accessible on the internet for all, I will mention it at this site.

      Except that you can't participate unless you're on their internal network.

      --
      Mad Software: Rantings on Developing So
  28. Comment removed by account_deleted · · Score: 4, Interesting

    Comment removed based on user account deletion

  29. I am confident... by Rocky · · Score: 3, Funny

    ...that these proofs will not be solved using conventional methods, but they will eventually be solved using SMALL PROGRAMS with SIMPLE RULES. These rules can be run on a simple computer using my program, Mathematica. Easy!

    Either that, or you can solve them by buying REAL ESTATE with NO MONEY DOWN! or by placing SMALL ADS in NEWSPAPERS with your own 900 NUMBER!!!!!

    --
    "I'm an old-fashioned type of guy. I worship the Sun and Moon as gods. And fear them."
  30. I am an idiot. Soy estupido. by mindstrm · · Score: 2, Troll

    Please ignore me. I haven't had my coffee yet. I don't know what I'm saying.

    I am totally wrong.

  31. A million dollars is a drop in the bucket... by ClarkEvans · · Score: 1

    Hardly a blip on the radar screen... now, if it were in the billions we could finally have a mathematician in the Forbes 400 ... that would be signficiant. A million dollars is puny; hardly worth the time. Hell, even Lotto winners get more money. Picking random numbers in a lotter must be more important.

  32. a pedant writes by chegosaurus · · Score: 1

    Love of money is the root of evil. Introducing evil breaks the proof.

    1. Re:a pedant writes by chegosaurus · · Score: 1

      Other pedants may spot the deliberate mistake. ;-)

  33. Good intro... by ImaLamer · · Score: 5, Funny

    "that God -- with whom he waged a very personal war -- would not let Hardy die with such glory."

    That has to be the funniest things I've read, today.

    Is it me or does it seem that all "hard" mathematicians are either at war with God or trying to "refute"/"prove"/divide/discover/humiliate him/her/it/Taco?

    1. Re:Good intro... by rupe · · Score: 1

      it is funny. i'm not sure if Hardy was actually a religous guy, i guess he was having a dig at all the guys who die claiming to have proven something and thus cant be completely refuted -- witness Fermat, who almost every professional mathematician is certain did not prove his last theorem and almost every amateur mathematician is certain did and that the proof can easily be replicated in their margin...

    2. Re:Good intro... by sensui · · Score: 1

      I buy Erdos' view on this. God owns a book of proofs. We just try to figure out what's on his book. And then we enter this bizarre competition with God. Whenever we prove something, we don't get any points.

    3. Re:Good intro... by 3am · · Score: 1

      you're wrong.

      Erdos had 2 separate ideas:
      1. The idea of a 'book proof'. He seemed to like the idea that God had a book containing all perfect proofs. Whenever he saw an extremely elegant and powerful proof, he referred to it as a 'book proof' as a compliment.

      2. Erdos had a totally unrelated idea that we lived our lives in competition with the Devil. When you do something bad, he gets 1 point. When you do something good, you get 0 points. I think he said the goal of the game was to 'keep the devil's score down'. This was totally unrelated to math.

      He was the perfect example of eccentricity. His life was interesting, and I'd encourage you to read about him, but don't spread half truths.

      --

      A: None. The Universe spins the bulb, and the Zen master merely stays out of the way.
    4. Re:Good intro... by metlin · · Score: 2

      It's said that Hardy died a happy man, very happy that none of his pure math was ever used by applied mathematicians.

      He's said to have gloated over the fact that atleast for quite sometime into the future, applied mathematicians would leave the realm research done by pure mathematicians alone. :-)

  34. You can't stop these attacks by capt.Hij · · Score: 5, Funny
    The problem is that these mathematical terrorists form small cells (usually located near institutions of "higher education") which are extremely difficult to penetrate. It usually requires connections made early during college and 4-5 years after that. Some people have been known to take much longer.

    Even if you are able to get into a cell it can be extremely difficult to stay in and keep your sanity. Many people who do get in just sort of drift off from society and are all but lost. Those few that make it often end up working alone, late at night in the back of dimly lit coffee houses.

    There is simply no way to stop someone who is willing to make such sacrifices.

  35. Besides which by Anonymous Coward · · Score: 0

    Whether it was strictly-speaking accurate, it was simpler and more understandable, and basicaly got across the idea of the theorem.

    1. Re:Besides which by Anonymous Coward · · Score: 0

      "Cats are made of cheese" is also not, strictly speaking, accurate, is simpler and more understandable than the correct statement, and conveys about as much information about the hypothesis.

    2. Re:Besides which by Anonymous Coward · · Score: 0

      Ahh yes...

      However, the statement, "Cats are made of cheese", though may be Interesting and may convey about as much information about the hypothesis as the OP's comment, is quite off topic.

    3. Re:Besides which by Anonymous Coward · · Score: 0

      Ah, I see!

      It should have been "The Riemann Hypothesis states that cats are made of cheese."

      Thank you for your assistance.

  36. Here's some background info... by RobinH · · Score: 2, Redundant

    ... on the Riemann Hypothesis:

    Riemann Hypothesis

    --
    "I have never let my schooling interfere with my education." - Mark Twain
  37. karma whore by evangellydonut · · Score: 1

    Here's a brief explaination of the Zeta function given by mathworld...

  38. Sounds like a job for!.... by Budgreen · · Score: 0

    a super computer to play with for awhile...

    get ascii white in on it and even the earth simulator, if anything can prove/refute this it could be that massive thing (it can simulate the earth right? haha) it could be interesting tho.

    --
    The greatest right given is the right to be wrong...
    1. Re:Sounds like a job for!.... by jafiwam · · Score: 1

      If it can simulate the earth, then maybe they would be kind enough to email me where I left my fucking car keys.

  39. Re:Godel by Dr.+Molf · · Score: 1

    Actually, I was just about to post with the same idea (consequence of Godel's incompleteness theorum.)

    When people were trying to solve Fermat's Last Theorem (essentially proving the grander Taniyama-Shimura Conjecture), I thought that people worried that Godel's incompleteness theorem could have applied and thus no solution was possible. (Simon Singh's book "Fermat's Engima" gave this impression.)

    Likewise, my understanding is that Godel applies to any axiomatic system. Since our number theory is built with a finite number of axioms, it should apply.

    --
    indeed..
  40. Since when... by Anonymous Coward · · Score: 0

    does Dave Sim post to /.?

  41. Amazing new result from geometry by SIGFPE · · Score: 1
    Slashdot, news for nerds.



    Researchers at a leading US university have made an astounding discovery. They have found that the square length of the hypotenuse of a right angled triangle triangle can be found by adding the squares of the hypotenuses of the other two sides.


    Dr. P Thagoras explains: "we've experimented with many kinds of right angled triangle it it seems to hold in all situations." Prof. E Clid is enthusiastic about the applications "for example a builder can predict the length of the diagonal of a plot of land withput actually measuring it. We can run the software to compute it from the sides on something as small as a laptop. A builder could easily have one of these on the actual building site."


    Of course the discovery is not without skeptics. "They haven't tested every triangle", says Dr. P Appus, professor of post-modern sociology, a researcher who studies scientists themselves. "These researchers have only picked those triangles that fir the pattern. It's a kind of unconscious Freudian repression where triangles that don't fit are collaboratively eliminated from the field of view in a reactionary social construct".


    But Thagoras isn't disheartened. He believes gis result might hold even for really big triangles. "I think you could use this when urban planning. I bet it'd hold for triangles miles across".


    A bold claim, and only time will tell whether these claims will hold. But don't expect to see builder wielding those laptops any time soon!

    --
    -- SIGFPE
    1. Re:Amazing new result from geometry by rjniland · · Score: 1

      re: Pythagorean Theorem humor

      > "I think you could use this when urban
      > planning. I bet it'd hold for triangles
      > miles across".

      Actually, that's where it starts to break down
      in practical use, due to the curvature of the
      earth. The theorem is for PLANE geometry, and
      large eart area problems are SOLID geometry.

      See:
      http://mathworld.wolfram.com/PythagoreanTh eorem.ht ml
      for more than you wanted to know about the PT.

  42. OK then by w.p.richardson · · Score: 1
    sqrt(women)=money
    --

    Curb CO2 emissions: Kill yourself today!

  43. Those Damn terrorists... by Anonymous Coward · · Score: 1, Funny

    Now we have to worry about "potential attacks on the Riemann hypothesis" during the holidays...

    1. Re:Those Damn terrorists... by Anonymous Coward · · Score: 0

      Don't you mean theorists?

  44. It has been solved. by Decimal · · Score: 0, Redundant

    I have discovered a truly remarkable proof of the Riemann Hypothesis...

    But this margin is too small to contain it.

    --

    Remember "Bring 'em on"? *sigh
  45. Some more math humor . . . by Anonymous Coward · · Score: 2, Funny

    Once upon a time (1/t), pretty little Polly Nomial was strolling across a field of vectors when she came to the edge of a singularly large matrix.

    Now Polly was convergent and her mother had made it an absolute condition that she must never enter such an array without her brackets on. Polly, however, who had changed her variables that morning and was feeling particularly badly behaved, ignored this condition on the grounds that it was insufficient, and made her way in amongst the complex elements.

    Rows and columns enveloped her on all sides. Tangents approached her surface. She became tensor and tensor. Suddenly two branches of a hyperbola touched her at a single point. She oscillated violently, lost all sense of direction, and went completely divergent. As she reached a turning point she tripped over a square root that was protruding from the erf, and she plunged headlong down a steep gradient. When she was differentiated once more, she found herself, apparently alone, in a non-Euclidean space.

    She was being watched, however. That smooth operator, Curly Pi, was lurking inner product. As he numerically analyzed her, his eyes devoured her curvilinear coordinates, and a singular expression crossed his face. Was she still convergent, he wondered. He decided to integrate improperly at once.

    Hearing a common fraction behind her, Polly rotated and saw Curly approaching her with his power series expanding. She could see by his degenerate conic that he was up to no good.

    "What a symmetric little polynomial you are," he said. "I can see that your angles have lots of secs."

    "Oh sir," she protested, "keep away from me. I haven't got my brackets on."

    "Calm yourself, my dear", said our suave operator. "Your fears are purely imaginary."

    "I, i," she thought. "Perhaps he's homogeneous."

    "What order are you?" the brute demanded.

    "Seventeen," replied Polly.

    "I suppose you've never been operated on?"

    "Of course not," Polly cried indignantly. "I'm absolutely convergent."

    "Come, come," said Curly. "Let's go off to a decimal place, and I'll take you to the limit!"

    "Never!" gasped Polly.

    "Abscissa!" he swore, using the vilest oath he knew. His patience was gone. Coshing her over the head with a log until she was powerless, Curly removed her discontinuities. He stared at her significant places and began smoothing her points of inflection. Poor Polly. She felt his hand tending to her asymptotic limit. Her convergence would soon be gone forever.

    There was no mercy, for Curly was a heavyside operator. Curly's radius squared itself. Polly's loci quivered. He integrated by parts. He integrated by partial fractions. After he cofactored, he performed Runge-Kutta on her. The complex beast even went all the way around and did a contour integration. Curly went on operating until he satisfied her hypothesis, then he exponentiated and became completely orthogonal.

    When Polly got home that night her mother noticed that she was no longer piecewise continuous, but had been truncated in several places. As the months went by, Polly's denominator increased monotonically. Finally she went to l'Hospital and generated a small but pathological function which left little surds all over the place and drove Polly to deviation.

    The moral of the story is, "If you want to keep your expressions convergent, never allow them a single degree of freedom."

    1. Re:Some more math humor . . . by bplipschitz · · Score: 1

      Give credit where credit is due--that's from the Journal of Irreproducible Results.

      --bpl

  46. hard problem my ass... by ebbeatty · · Score: 0

    One can clearly see that the answer is 42.
    Power Corrupts, But Absolute Power is Kinda Neat!

    --
    roads!, where we're going we don't need roads...
  47. odd by Anonymous Coward · · Score: 0

    How is it you buffoons can remember what stories
    you ran two years ago, but don't seem to recall
    what stories you ran last week?

    Do us all a favor and .. i dunno .. use your
    imagination .. just stop plaguing the world.

  48. Re:Godel by grouchomarxist · · Score: 1

    Number theory isn't axiomatic. I've never heard of any axioms for number theory except for Peano-style axioms for simple arithmetic. However, they aren't really used for number theory.

    Gödel's theorem applies to axiomatic systems of a certain* complexity. For simple axiomatic systems Gödel's theorem doesn't apply.

    * I don't think anyone has proven how complex things have to be for Gödel's theorem to apply.

  49. Re:Godel by grouchomarxist · · Score: 1

    OK. I need to correct myself. There are axioms of number theory, but they really aren't used by number theorists. They are mostly of interest to set theoreticians and logicians (like Gödel). I have two number theory books on my shelf and neither of them have a list of axioms.

  50. Why is this a troll? by Anonymous Coward · · Score: 0

    Why is this a troll? It was a poor attempt at humor but it was no worse than the original Eureka post. The Eureka poster said that he/she had a proof but there wasn't enough space to write. The above AC said that Slashdot actually gives you more than enough space, so there are no restrictions. Of course, he doesn't have a proof, and *that's* the joke.

    I'd love to see the look on Fermat's face if were challenged to show us his proof. Did Fermat actually have a proof or was he just playing with us because he could never solve the problem and thought no-one else did?

    Anyway, I doubt anyone would find it funny now. Trying to analyze humor is like trying to disect a frog. The stuff you're disecting dies in the process.

    1. Re:Why is this a troll? by Buck2 · · Score: 1

      Daddy, why do people get angry?
      Because.

      Daddy, why did that guy do that?
      Because.

      Daddy, why do you always say, "The system sucks"?
      Because.

      Daddy, why do you work so hard?
      Because.

      Daddy, can something be funny even if you don't laugh?
      Yes.

      Daddy, how come some people think something's funny and then other people don't?
      Because.

      Why is this a troll?
      I think this is going to be a new signature.

      --

      As my father lik@(munch munch)... ....
    2. Re:Why is this a troll? by Anonymous Coward · · Score: 0

      > Daddy, how come some people think something's
      > funny and then other people don't?
      > Because.
      >
      > Why is this a troll?
      > I think this is going to be a new signature

      Yes but there's a difference. If something is not funny, it's not automatically a troll. Otherwise, half of the attempts at humor around here would be trolls.

    3. Re:Why is this a troll? by Buck2 · · Score: 1

      Wow, you're dense.

      Fucking brown dwarf if you ASK ME!

      --

      As my father lik@(munch munch)... ....
    4. Re:Why is this a troll? by hplasm · · Score: 1

      It just ate my gruff billy-goat.

      --
      ...and he grinned, like a fox eating shit out of a wire brush.
  51. harmony by oliverthered · · Score: 3, Interesting

    Well reading thought the article, they seem to miss? a few things.

    Of course primes have a generally log distribution, because every prime you find provides a factor later on down the line so the primes become more sparse.

    Then there's the atoms thing, sfaik shells/energy levels are basically harmonic and a harmonic is more-or-less the opposite of a prime.

    since harmonics and the increasing sparseness of primes could be taken as identical you're going to get the same distribution patterns out.

    here goes

    primes v harmonics

    2 is prime and a harmonic root
    3 is prime and a discord (root)
    4 is non prime, and the second octave of the first root
    5 is prime and a discord (root)
    6 is non prime, and cord of the first and second roots
    7 is prime and a discord (root)
    8 is non prime, and third octive of the first root
    9 is non prime, and first octave of the second root
    etc....

    --
    thank God the internet isn't a human right.
  52. ANKOS to the rescue! by gcooke · · Score: 2, Interesting

    I'm only on chapter 4 of Wolfram's opus 'A New Kind of Science' but reading about the Riemann Hypothesis just screams out connections with Wolfram's work. ANKOS is littered with these odd little diagrams of cellular automata, many of which exhibit prime number relationships.

    1. Re:ANKOS to the rescue! by pekka_v · · Score: 1

      I read about Wolfram's book in Wired. I got the impression he's gone a bit over the top however. The article talked about a lot of things that supposedly were "new inventions" but mostly seemed to be old news (e.g. complex things arise from simple dynamical systems etc.) and then proceeded to Wolfram admitting that he could deduce the "rule of the universe" in the near future...

      So has he done anything that could be used in mathematics or is the book just full of such speculations? It would be rather suprising to see CA used to solve the Riemann Hypothesis...
    2. Re:ANKOS to the rescue! by Impy+the+Impiuos+Imp · · Score: 1

      Yes a lot of the book is a bit over the top.

      However, it's a good idea that the rules of quantum mechanics, etc. might "fall out" as mathematical derivatives from some simple set of rules.

      So, a pure mathematician might get the Nobel prize (for physics) for pure mathematical work after all.

      Now, another interesting question: said work might be apriori or not...

      --
      (-1: Post disagrees with my already-settled worldview) is not a valid mod option.
    3. Re:ANKOS to the rescue! by pekka_v · · Score: 1

      Yep, apparently he's proposing Dynamical systems theory ('Chaos theory') and CA as his own ideas which is obviously not true. E.g. Poincare discovered 'complexity' in similar simple dynamical systems some 100 years ago. Somebody collected a set of ANKOS reviews here. Incidentally the idea that world would consist also out of CA's is actually also not originally Wolfram's (I think I have even read a scifi story based on this idea).

    4. Re:ANKOS to the rescue! by gcooke · · Score: 1

      In his defense, Wolfram doesn't actually take credit for all the things he appears to be taking credit for -- the Notes section (almost as large as the main body of the book) explains the history of CA, chaos theory, etc. and the connections he's making into them. I haven't yet found an idea in the first four chapters that Wolfram claims is his own that he -doesn't- then explain the history of in the Notes. Its an annoying habit that he tries to explain away as "a writing style intended to stress the importance of rather dull and vague mathematical ideas" (my paraphrase...I don't have the book in front of me). Wolfram is very much engrossed in his own discovery process but, while annoying, it doesn't invalidate the work (at least, not for me).

    5. Re:ANKOS to the rescue! by pekka_v · · Score: 1

      Ok, I read that his work should include some original work that would be important for CA field. Hopefully everybody will be able to make out what is to be credited to Mr. Wolfram. The Rule of the Universe -part in the Wired article however is something I can only chuckle about. Hope he get's it done ;)

  53. Re:Could you get........ PLEASE MOD THAT UP!! by Anonymous Coward · · Score: 0

    That was an absolutely brilliant explanation. I have degrees in Economics, so I have background in mathematics, but I know basically nothing about number theory. Nonetheless, I understood your explanation of Reimann. You are going to be a good prof (of course, you'd probably prefer if I told you that you're going to be published in .
    A

  54. Re:Godel by pekka_v · · Score: 1

    If you look at the page you specified: "Number theory is a theory about the integers, a set which we call Z where..." Obviosly to represent integers you first need the Peano axioms to get the natural numbers. Therefore Gödel's Incompleteness Theorem applies (you only need the Peano axioms).

  55. Moderators, Come hither and award by bill_mcgonigle · · Score: 1

    Best post on the thread so far...

    Now that's the basic idea, but it doesn't explain *why* it's so difficult that some of the greatest minds of the past 150 years have failed to prove it, and why the Clay institute are willing to pay a million dollars to someone who can.

    Is it considered likely that our (our, as in people smarter than me) current understanding of mathematics is inadequate to explain this? Would the proof necessarily change our models? Or is it more likely that everyone is missing something obvious?

    --
    My God, it's Full of Source!
    OUTSIDE_IP=$(dig +short my.ip @outsideip.net)
    1. Re:Moderators, Come hither and award by Anonymous Coward · · Score: 0

      Might just be long-winded, eh ... but mathematic assertions MAY be true, but NOT provable with a current set of asumptions.

  56. Re:G�del by grouchomarxist · · Score: 1

    In my original post I was making two comments. My second comment was a reply to Dr. Molf's comment that "Godel applies to any axiomatic system". My comment was that Gödel's theorem only applies to axiom systems of a certain level of complexity.

    My original point is that number theoreticians don't use axioms and don't use formal systems to get their results. Unless you can prove mathematicians are Turing machines then Gödel's result doesn't apply.

  57. Re:G�del by pekka_v · · Score: 1

    I am sorry to downplay you but apparently you do not have a strong background in math and maybe some knowledge in algorithm theory? In short: Gödel's theorem applies to all axiomatic systems containing Peano axioms. The system that number theoreticians study contains the Peano axioms (obviously as it is a theory of numbers). Therefore the Gödel theorem applies as considering the Riemann hypothesis.

    You'll find the Peano axioms here. The most important thing about the Peano axioms is that they state the existence of natural numbers {1,2,3,...} (note the axioms give out an infinite number of such objects). So no Peano axioms => no theory of numbers...

    See also Some Theorems Derivable from Peano's Axioms. It should help to understand what signigicance these axioms have. Also, all mathematics is axiomatic. For mathematicians if a claim is not based a axiomatic system then it is just speculation...
  58. Re:G�del by pekka_v · · Score: 1

    Better place to look for Peano axioms is here. It should give the Axiom of Induction in a more sensible manner.

  59. The Riemann Hypothesis/RSA connection by Anonymous Coward · · Score: 0

    To the best of my knowledge, there still isn't a primality test which is provably polynomial without any additional hypotheses; all of them require the Extended Riemann Hypothesis, which is a statement about versions of the zeta-function, known as L-functions, over other number fields and in particular elliptic L-functions. There are actually some ties to Wiles' proof of Fermat's Last Theorem here too, but I won't claim to understand them, much less be able to explain them. It seems unlikely to me that any proof of the (base) RH could be expanded to a proof of the ERH, but they're often lumped together.

    Even if the ERH were proved it would be more of a theoretical breakthrough than a practical one; it wouldn't make primality testing any faster, only allow us to prove that (versions of) the current primality tests are 'fast' in some suitable sense. Still, it's a convenient way of linking this admittedly fairly obscure mathematics to something people are likely to have a little more practical knowledge of.

  60. Re:Could you get........ PLEASE MOD THAT UP!! by Anonymous Coward · · Score: 0

    I recall a handfull of economics students in calc 185 or whatever at U-Mich, but that was solely so that, theoretically, for one brief moment in their life they would understand the derivation of the continuously compounded interest formula. That's not really a background in mathematics as far as this is concerned.

    Ohhh...if only I wasn't so lazy to fake up a quick login ID for NYT.

  61. Re:G�del by grouchomarxist · · Score: 1

    I'd like to believe I have a good background in mathematics. I'm not a practising mathematician, but I have a degree in mathematics and I specialized in set theory, but I'll let you be the judge.

    Gödel's theorem applies to formal axiomatic systems which contain the Peano axioms, but mathematicians in practice don't limit themselves to these axioms or the rules of derivation.

    Note that while Peano's axioms might be used as the basis of some presentations of number theory, number theory existed long before Peano's axioms which are only about 100 years old.

    While you can of course get valuable results from Peano's axioms those results were also available before Peano. All mathematics is not axiomatic. Geometry is the only branch of mathematics with a long history of axiomatization. The rest of mathematics has existed without axiomatization until the 19th century or so. It is only because contradictions were found in mathematics that mathematicians started developing axioms and working out more explicit rules of derivation.

    My view is that although we have axioms, they are only mathematical tools, not the foundations of mathematics. Mathematicians developed the axioms in order to provide a foundation, but with Gödel's results it appears that axiom systems can not provide a complete foundation.

  62. Re:G�del by pekka_v · · Score: 1

    I do actually practice mathematics (research and also application to practice) so maybe I'm a step ahead here. I would say that your view of mathematics (as a partially non-axiomatic science) is flawed in a quite a common way (for example for people in engineering, physics and computer science). I hope you will read my lengthy comments below.

    It is true that a lot of early mathematics was not first developed based on a set of axioms. You refer to axiomatization that was started by Hilbert; what you in some way fail to see is reason for the the need of axiomatization (alltough you point out contradictions etc.). Mathematics not based on axioms (or this actually means: based on wrong axioms; axiom = some basic assumption) is just speculation and can lend to wrong results (some examples below). Number theory however can be and fortunately is based on axioms; they are not the tools but instead the basis on which number theory is built (logically, not in terms of development time-line). Alltough a lot of number theory was developed before complete axiomatization (actually these basic axioms are really intuitive so it's not easy to go wrong), number theory is still an axiomatic science and the Gödel result applies. If it were not so (that number theory can be based on axioms), number theory would not be the 'queen of mathematics' but just a lot of worthless speculation. E.g. (as you might know) propability theory was considered just as play before it was axiomatized (your typical text book in propability theory usually forgets a rigid axiomatization and just goes on to display things in an intuitive manner; ok for text book but not for research work).

    Also, obviously you can use basic axioms such as Peano's without your knowledge of doing so. But if you were to choose a wrong set of axioms you might end up with wrong results. Let us propose for example an axiom: there exists a largest natural number. We can then easily go on to prove that '1' is this number (work it out, if you will).

    There's actually a quite famous case in the 19th century where a famed mathematician called Frege started his work on set theory. He chose a set of axioms which is now known as 'naive set theory' as it is flawed. Frege however did not understand this and proceeded to work on the naive set theory for some dozen years. When his work was finally published an other famous mathematician (philosopher, logician) Bernard Russell wrote to Frege and pointed out that his set of axioms is flawed. Frege was despaired as now the major body of his life's work might be worhtless. (It turned out that many parts of his work were usable but some major conclusions were wrong; As I remember Frege stopped publishing for several years because of this).

    So the point that I'm trying to carry out here is that if a theory is based on wrong assumptions it might be worthless and therefore axiomatization is integral for mathematics. The problem is to choose the right axioms, however even now we sometimes do not know if we have chosen correctly (e.g. Axiom of Choice). Somebody pointed out that mathematics could be seen as an empirical science; it is a science where one empirically tries out different thoughts and chooses the ones that are correct.

  63. as long as we are making the stupid jokes... by jethro200 · · Score: 1
    One day, two atoms were walking down the street.

    One said to the other, "Hey, Bill, I haven't seen our friend Joe for a while. I wonder what he is up to."

    Just then, Joe ran up to his two atom friends, and declared, "Oh no! Hey - you have to help me!! I've lost an electron!!"

    "Are you sure?" Bill asked.

    "Yes," Joe answered, "I'm positive!"

  64. Value of a million dollars. by jimbolaya · · Score: 1
    that million dollars won't be worth much if it takes as long as that Last Theorem by Fermat to solve.

    Okie doke, forgive me if I'm missing something here, but is Fermat's Last Theorem the same as the conjecture mentioned in the article? The one that took Dr. Andrew Wiles seven years to solve? If so, why would $1 million not be worth much in 7 years?

    There's two ways to look at this. The first is, how much money do I expect to make in the next seven years? I calculated mine, assuming I continue to get the same percent pay raise for each of the next seven years, and let's just say, I won't have made my first million for a few years after that unless we get another dot-com boom or some other such aberation.

    The other way is, how much will a million dollars in today's money be worth seven years from now? Assuming the inflation rate for the next seven years matches that of the previous seven years, it'll be worth approximately $850,000 (see this inflation calculator).

    So, why will $1 million dollars be a paltry sum in seven years?

    --

    There ain't no rules here; we're trying to accomplish something.

    1. Re:Value of a million dollars. by God!+Awful · · Score: 2


      Okie doke, forgive me if I'm missing something here, but is Fermat's Last Theorem the same as the conjecture mentioned in the article? The one that took Dr. Andrew Wiles seven years to solve?

      You're missing the point. Fermat's Last Theorem was created in 1630 and solved in 1993 (363 years later). The Riemann hypothesis was composed in 1859, so at that rate it won't be solved until 2222. $1M may not be worth much in 220 years.

      Andrew Wiles may have spent seven years of dedicated time on Fermat's Last Theorem, but this doesn't mean that the conjecture itself was solved in seven years. Huge leaps in mathematical theory needed to take place before Wiles could realize his proof. Anyway, Wiles didn't prove FLT so much as he proved the Taniyama-Shimura-Weil conjecture, which was of interest because someone else had already proved that FLT would follow from TSW.

      TSW conjectures that "all semistable elliptic curves with rational coefficients are modular". This statement would probably have sounded like gibberish to Fermat, so it really trivializes the problem to claim that the conjecture was solved in seven years. Whole branches of mathematics had to be invented before FLT could be proved.

      -a

    2. Re:Value of a million dollars. by Anonymous Coward · · Score: 0

      Yeah, It took seven years of work by Wiles, but Fermat died in the mid-to-late 17th c.; Riemann died in the mid-to-late 19th century. If the two problems take similar ammounts of time to solve, the million dollars will be worth approximately 2 Terran Federation Credits on award.

  65. Re:G�del by grouchomarxist · · Score: 1

    I think your conclusions are problematic. If you believe everything that is done without axioms is "worthless speculation" and yet that we still don't know if we've chosen all the correct axioms, then all mathematics based on these axioms is potentially worthless (in your words).

    However, I don't believe that. I believe you can have valuable mathematics without axioms. Think about what would happen if a contraction was found in these axioms, would mathematicians throw out all their work? No, they would develop a new set of axioms. The rest of mathematics stays much the same.

    I'm not saying that axioms should be ignored. Again I'm just saying that they are tools, not the foundations of mathematics.

    I'm very familiar with the work of Frege and Russell. It is only through studying them that I've come to my conclusions. I originally agreed with them that mathematics requires axioms, but the process of developing the axioms makes me conclude that axioms are not foundations. Instead I think axioms (+ definitions, etc.) serve as tools for clarification, clearing up the kind of confusion that lead to contradictions in 19th century calculus.

    Back to my original point, the reason I don't think Gödel's result applies is that I don't think mathematicians are bound by finite and formal rules of deduction (that is, like a Turing machine). I don't think mathematicians just go around making stuff up either, just that I believe that mathematics is more than just a set of axioms and rules of deduction.

    I think your mentioning of mathematics as an empirical science shows that we might not be disagreeing that much. When you do an experiment in physics we are using observation of the world as a guide to show we're right or wrong. What do we use as a guide for mathematics? I'm not suggesting here that there is some sort of mathematical reality, I'm just suggesting our guide is the existing mathematics and that the goal of axioms is to provide a clarification for what we already have, but might not be clear about.

    As for number theory being the 'queen of mathematics' I think it would still be so with or without axioms - it would remain a field that is central and beautiful to the rest of mathematics.

  66. This hasn't been done. That's why it's a Theorem by Anonymous Coward · · Score: 0

    If some university did do this, then all attempts to resale old mathbooks would fail as everyone switched the Pythagorean Theorem to the Pythagorean Proof, thus doing inestimable harm to the pocketbooks of mathmatics students.

  67. Regarding the Clay Math Institute "Business Model" by xerofud · · Score: 1

    Is anyone sufficiently familiar with tax law to make a comment about the tax benefits that could accrue to the founder of this non-profit organization by structuring a "gift" to the mathematical community in the form of several $1M prizes for solving some of the hardest problems in all of mathematics, most of which are very unlikely to be solved in any of our lifetimes?

    In particular, is Landon Clay free to spend some of the interest on the millions he has supposedly "donated" to math through these prizes in any way that he pleases, so long as a fraction of the interest is spent on some tenuous connection to "promoting mathematics". (Check out the link on the CMI webpage to the Clay-sponsored yacht cruise in the Boston Harbor.)

    Rumor has it that the president of the Clay Math Institute was fired by the Harvard Math Department for spending too much time shaking Clay down for umpteen millions, and not enough time doing research. Can anyone provide a confirmation of this rumor? Furthermore, after being "dismissed" from the Harvard Mathematics Department, the president of CMI mysteriously popped up across the river at Boston University. Does anyone know how much the Clay Math Institute has donated to Boston University in the process?

    Finally, more to the point of the Riemann Hypothesis, which we all want to see solved, what are folks' opinions about whether a $1M prize on the problem is likely do more to decrease the likelihood that a solution is found sooner than later, given that the money will create less incentives for researchers to share their insights and conferences or publish partial results in journals?

    Personally I think the prizes smell too much of Clay's past career in the actively-managed mutual fund business, where it's all about out-performing the index for that bonus at the end of the year. Perhaps the first bit of math that Clay should learn (he supposedly dropped out of Harvard himself and never learned anything beyond high-school algebra) is a little statistics, which would show how an active manager's "ability" to beat the index has more to do with luck than business acumen. (Read the famous book A Random Walk Down Wall Street, or check out the site www.indexfunds.com). Then maybe he might realize the right place to "donate" his money is in the form of a refund to investors who got jipped by the front-end 5% loads they paid supposedly for Clay's investment genius. Clay's fund specializes in tax-managed investments, so I guess we can be sure that those skills for dodging the watchful eye of the IRS sure came in handy when setting up his retirement tax shelter ... a.k.a the Clay Math Institute.

    Anyway, I'm starting to ramble now ...

  68. Re:G�del by pekka_v · · Score: 2, Interesting

    Yes! The first part in your response about the axioms is what I meant. Choosing different axioms yeilds different theory (and possibly rubbish); for example the Axiom of Choice is necessary for basically all modern analysis, but you can have a lot of classical analysis without it. It is a requirement for measure theory (a measure cannot be constructed without it). Still the Axiom of Choice allows for some very non-intuitive results: for example you can break the unit sphere (3d) into finitely many (however immeasuralbe) pieces and then proceed to construct two unit spheres out of those (Banach-Tarski Decomposition). The axiom itself is however very intuitive and is part of established mathematics (from 1920s on I think). One can only wonder... Anyway excellent page here. Includes comment by Jerry Bona: The Axiom of Choice is obviously true; the Well Ordering Principle is obviously false; and who can tell about Zorn's Lemma? (the three are equivalent). Luckily the mathematics we now have seems to portray nature rather well, so I think we can rest assured.

    You still fail to understand the meaning of axioms. Let's forget the name 'axiom' and talk about just assumptions. For example you might implicitly use some basic assumption when calculating 2+2=4 (at least, you apparently are calculating in Z, not in Z_2 for example). You see, every time you try to set up some proposal or theorem you need to assume something. Without assuming some underlaying construct what is there to deduce (based on nothing)? The reason we talk about 'axioms' is because we wish to emphasize the importance of these basic assumptions. You should go to some mathematician you respect and discuss the matter with him, if cannot convey it over here.

    The point however is indisputable: all mathematics is logically based on some set of axioms (or assumptions, if you will). These assumptions need to be correct for the mathematics to be correct. The actual process of axiomatization has got nothing to do with this; here you are mixing history with mathematical constructs to prove something. In mathematics, the most important thing is to completely understand what you are doing. It may be your intuition that is guiding you: intuition is necessary but can just as easily lead you to wrong theorems. Only by complete understanding and carefull verifiying should you be confident on your results. This is however very difficult; recently a friend of mine had to 'cancel' several of his published articles, because he was using an established ten year old result that was proven to be wrong. So mathematics (remember the 'empirical' point) is not unerring.

    With your deduction about Gödel Incompleteness theorem you are also mixing things; namely mathematical constructs and mathematicians themselves. As with mathematics (and with all kinds of logic), if you choose a set of assumptions which is allready conflicting within itself you can prove anything. This will have nothing to do with nature however. So, the Gödel Incompleteness (GI) result applies because of the following first-order logic: GI applies to all mathematical constructs which include at least the Peano axioms AND Number Theory as a mathematical construct includes Peano axioms => GI applies to number theory. It couldn't get more simple! (hope I got my assumptions right...)

    As to Number Theory being the 'Queen of Mathematics'; this is the general opinion. I myself do think that Complex Analysis is the most beautiful part of mathematics (eloquent proofs, non-intuitive results (at first), all accessible to a first or second year student). Anyway I've allways disliked purely discrete things (such as integers). I don't study complex analysis by the way; I've done research on Markov operators (stochastics stuff) and now I'm back to basic applied stuff (cutting and packing; you even get to see actual results!).

  69. Re:G�del by Welpa · · Score: 1
    Well, well. So many words...

    The Riemann Hypothesis (RH) is either true or false. If it is false if and only if there is a counterexample. It is the mathematician's job to show if it true or false.

    RH is not on the same plane as the Axiom of Choice, which is independent of the standard (ZF) axioms of set theory. This means that there are set theories (mathematical objects) with the Axiom of Choice true and others with it false. However, there is only one set of complex numbers (or the natural numbers).

    The complex numbers or the natural numbers are mathematical objects. Godel's (second?) incompleteness theorem says only that we will never be able to come up with finitely many (actually, recursively enumerable) axioms that will have the natural numbers or the complex numbers as their only model. This is a failure of first-order logic, not of complex number theory or number theory.

  70. Simple proof not simply proven by twisty · · Score: 2
    You can't say "... it turns out to be phenomenally difficult to prove ..."!

    Actually, he is quite correct that it continues to be difficult to prove. Even if the proof can be contained in a statement that's Einteinianly simple (E=m_0c^2), the road to reach that proof has still proven to be phenomenally difficult.

    I've been trying to publish my proof of Goldbach's conjecture, and it's just 12 pages long. (I'm serious.) I'm discovering a lot of barriers in Academia to getting heard. But as simple as the result sounds, the road to get there took weeks for direction and years for refinement... And I doubt it could be attained by someone who weren't a multidisciplinary scientist-and-artist, becuase the problem-solving required both the logic and the thinking-outside-the-box to deconstruct known methods into untried ones.

    1. Re:Simple proof not simply proven by AndrewHowe · · Score: 2

      Not really. It continues to be unproven. You can't talk about how difficult it is to prove, except to say that so far, it has been impossible!
      If someone disproves it, we will be able to say that it was always impossible to prove, or if you like, infinitely difficult.
      If someone proves it, the difficulty of arriving at the proof will become known (subjectively) to the prover.
      Until then, the difficulty of arriving at the proof is simply unknown.

  71. Re:G�del by pekka_v · · Score: 1

    Yes, I totally agree. Should you read my comment and the thread carefully (yes, a lot of text...) you'll see that the AoC was presented just as an example for an axiom and how the axioms affect mathematics. The discussion was about whether math can be done without basing it on some formalized assumptions or axioms. Obviosly you can do something just based on your gut feeling, but you will not know whether your work is worth anything, agree?

    Also you were pointing out that if ZF is ok, then it is so still if AoC is included. Still the beginning of the previous centure saw a lot of discussion whether AoC should be included as one get's some apparently unreasonable results. The point being two-fold: 1) do we get contradictions because of AoC 2) do we get just an abstract mathematical construct or then again something that really can be used (analysis being closer to applications at that time; now of course almost all math is applied). To my mind mathematics as a whole should always bear in mind that it's primarily purpose is to aid other sciences, not to do art for art's sake.
  72. Re:G�del by Welpa · · Score: 1

    Although I know that Platonism (art for art's sake) is regarded as naive, I suspect that a lot of pure mathematicians are Platonists at heart. I don't know if it is such a bad thing.

    Most mathematical advances at the theoretical level (starting at the concept of zero and then the negative integers) have been considered "way too abstract" at some time or another. Time and time again, the rest of science catches up and finds use for these things.

    Just to continue the timeline, consider complex numbers (electrical engineering) and group theory (chemistry). Even things that were considered abstract nonsense even a few years ago are now finding application (for example 2-category theory in physics). So I'm more of the opinion that we should let mathematicians do whatever they find interesting, it's worked up to now and I think that it will continue to do so.

    As for the AoC, I think that most mathematicians don't consider it right or wrong, natural or unnatural. As Hilbert famously once said, "It's not mathematics, it's theology". But they are happy to use it if it will help them prove theorems in their mathematical world which consists of real things like the natural or the complex numbers. To most mathematicians, questions like the validitity of the continuum hypothesis are simply not interesting. I'm a computer scientist, but I do have some knowledge of maths departments. How many set theorists do you know of? I have never met one.

  73. Re:G�del by pekka_v · · Score: 2, Interesting

    Ok, I'll try to give out a dummy proof for Gödel's Incompleteness theorem (the whole thing is apparently about 30 pages, I'll admit I haven't read the whole thing; I've read a partial proof in Russel's and Norwig's 'Artificial Intelligence'). This should clear things out a little bit and give insight to the discussion.

    We'll start with the observation that in number theory we have names for all the natural numbers. This is seen as follows: let's say we have the successor function S and a single constant 0; then let S(0) denote 1, S(S(0)) denote 2 etc. By induction we have names for all the natural numbers.

    Gödel also included the following function symbols: +, * and Exp and also the usual set of logical connectives and qualifiers in first-order logic. It is now obvious that that the set of sentences we can write in this language can be enumerated (order the symbols in alphabetical order, then do the same with sentences of lenght 1, then with 2 and so on). We can therefore number any sentence a with a unique natural number #a (the Gödel number). Therefore: Number theory contains a name for each of it's own sentences!!! In the same way we can number each possible proof P with a Gödel number G(P) because a proof is a finite sequence of sentences.

    Then let us assume that we have an arbitrary set A of true statements about natural numbers. Because A can be named by a given set of integers we propose that it is possible to write the following sentence in our language: a(j,A) =

    All i for which i is not the Gödel number of a proof of the sentence whose Gödel number is j, where the proof uses only premises in A.

    Furthermore, let r be the sentence r(#r,A) i.e. a sentence that states its own unprovability from A. Can such a sentence exist for all A? Don't ask me, but apparently Gödel would have said that the answer is yes.

    The rest is rather simple alltough rather ingenious. We need to prove that r is true. We'll go with reductio ad absurdum: Let's first suppose that r is provable from A (that r actually is false statement! remember that r was stating it's unprovability from A). But this would mean that we have a false statement provable from A. Therefore A cannot consist of only true sentences. This is a contradiction since according to our premises A consists of only true sentences! Therefore r must not be provable from A which is exactly what r claims.

    So from the above (assuming that we believe the sentence r can be constructed) we have seen that for any set A of true sentences in number theory we have statements that cannot be proven from A. As a special case we can choose A = axioms of the number theory. Hence number theory containts statements that cannot be proven!

    Feel free to complain about the inaccuracies in the above; all I can do is to suggest you get Gödel's proof into your hands. Anyway to my mind (if I do not miss any subtleties) the above goes on to establish that we can never prove all the theorems of mathematics within any given system of axioms (as the above problem appears allready with the natural numbers). This is apparently why Hilbert was pissed about Gödel's proof.

  74. Re:G�del by Welpa · · Score: 1

    What you say is true. However it refers to proofs given a particular set of axioms. Godels sentence
    is not provable in the system but it is true. He proved it. Outside the system. In the unlikely case that ZF+AoC is not enough to prove Riemanns Hypothesis, mathematicians will step outside that formal system. In fact, if this is the case, we should get some more set theorists real soon. :)

    I personally like the Turing proof of Godels theorem. The set of all theorems is recursively enumerable, but the set of all true statements about the natural numbers is not. The latter is a reduction from the complement of the halting problem, using computation histories of turing machines. It's really cool, the details can be found in Kozen's "Automata and Computability" which by the way is an excellent textbook on introductury computability theory.

  75. Re:G�del / AoC by pekka_v · · Score: 1

    Your points are absolutely true and I agree. However if all the mathematicians would go and claim that: "We don't care about your stupid applications; we're doing this for our own fun! Go stuff you apps!" the rather quick implication would be that the guys with the applications would take their money and and put it somewhere else (in computer science?).

    The point is that let's say Wiles has just proven Fermat's last theorem and a guy comes up and says: 'that's neat, I think I can use this in my device'. Then Wiles should go: 'Very interesting. Can I help you with that?'. Actually, however unpropable the above would be I hope/think Wiles would respond just so. So I think we should continue developing math as we do but never forget that the final reason is not to do it just for the heck of it. Maybe we should even venture so far as to look for applications after creating something totally new? Anyway, I think you would be in your right to say that this it not a problem today.

    As considering AoC I'm a believer. That's propably because I did some research on stochastics at the university (markov operators; the asymptotic properties thereof) and you will not get anywhere without Measure and Integration theory which is actually the basis for the whole thing. In my mind most of the stuff that follows from AoC seems to be natural (barring the unit ball problem but that can be explained too...).

    I don't think I've ever met anybody claiming to study set theory per se (those guys are all dead by now?). Some guys however studied areas that to my understanding were closely related to set theory. Nothing I would understand however...

  76. Re:G�del by pekka_v · · Score: 1

    Ok maybe you will clarify this for me (remember stochastics and analysis not in-depth computational/CA/related theory ok)? If we add axioms to Peano axioms and use maybe a higher order logic the Gödel theorem will still hold, true? So if we are working just based on a set of axioms needed for Riemann Hypothesis we do not yet know that a proof exists, do we? I would say that it is likely that we will someday find a proof, but to my understanding as of yet there is not any proof that such a proof actually exists (we'll actually if we had that we would be done :> ). What would it mean to study Riemann hypothesis outside the system? To start from scratch? And could we still claim to be studying the Riemann hypothesis?

  77. Your post is inconsistent. by benjamindees · · Score: 1
    Incompleteness specficially means that there are true statements in the system that can't be proven or derived in the system.

    uh, yeah, this would seem reasonable, until it's logical consequence emerges:
    if you can't prove it's true, then it's true

    Incompleteness doesn't require unprovable statements to be "true", only unprovable.

    --
    "I assumed blithely that there were no elves out there in the darkness"
    1. Re:Your post is inconsistent. by skywire · · Score: 1

      So if I said that some yellow flowers are roses, the poster would try to prove me wrong like so:

      uh, yeah, this would seem reasonable, until its logical consequence emerges:
      all roses are yellow

      --
      Those who would give up essential liberty to purchase a little temporary safety, deserve neither liberty nor safety.
  78. Proof of Riemann's Hypothesis and Fermat's Theorem by Anonymous Coward · · Score: 0

    See http://zetafunctions.coolissues.com/zeta.htm and http://fermat.coolissues.com/fermat.htm

  79. Re:G�del by grouchomarxist · · Score: 1

    The Peano axioms admit models other than the standard model (interpretation) of number theory. When Gödel's theorem states that there are "true but unprovable" propositions what that means is that there are propositions that are true in the standard model, but unprovable from the axioms. So one interpretation of Gödel's incompleteness theorem is that any set of axioms will fail to include number theory while excluding other models. There will always be alternative models.

    One conclusion that could be drawn here is to say that the structure of the integers is not uniquely captured by a finite set of axioms.

    I don't think it is indisputable that all mathematics is based on axioms, because outside of geometry the use of axioms is a late 19th century development of mathematics. Are you saying that before that people weren't doing mathematics but something else? Euler and Riemann did their number theory without axioms.

    [By axiom I'm talking about a proposition statable using first-order logic (+ symbols etc). The term "assumption" is to me a bit more vague.]

    History is important. The way things are now are due to certain historical developments. In the future mathematics might be different.

  80. Minor corrections by Scott+Carnahan · · Score: 2, Informative

    Li(x) is defined as the integral from 0 to x of (1/t) dt. And apparently the number of primes below x (usually denoted pi(x)) is pretty well approximated by Li(x).

    Not quite: note the obvious initial logarithmic divergence. Informally, you can just change the integrand from what you had to dt/(log t), but you really ought to work around the singularity at 1. Some people change the bounds of integration to start at 2 to avoid this. It simply shifts the function by a small constant (about 1.05)

    I'm a bit surprised no one here has mentioned Pierre Deligne's 1974 proof of the Weil conjectures, in particular the analogue of RH for smooth projective varieties over finite fields (for which he was awarded a Fields medal in 1978). This is perhaps the strongest "evidence" for the original hypothesis (unless you find the brute force calculation convincing), and it has other interesting consequences, for example the resolution of Ramanujan's tau conjecture (ref: Hartshorne's Algebraic Geometry).

    There is a nice discussion of potential avenues of attack on the Riemann Hypothesis at the end of chapter 5 in Patterson's text on the Zeta Function (Cambridge Studies 14), including some vague ideas on why a purely analytic strategy is not likely to be successful.

    --
    "Your notation sucks!" -- Serge Lang (1927-2005)
  81. Primes are important. by Kjella · · Score: 2

    Theoretically in the sense that it's useful for many other theorems. Quite a few things are based on numbers having a unique (down to the order) factorization as a product of primes. That proof is reasonably simple, and we can easily find pseudoprimes (which for most intents and purposes are fine) and that covers what we mostly need. The Riemann hypothesis is more of purely theoretical and cryptological interest though.

    --
    Live today, because you never know what tomorrow brings