6 ms·
Have any long-suspected irrational numbers turned out to be rational?
- x0x0 12y agoIn the age of computers, there will be fewer fun surprises like that. What surprises me is the euler-mascheroni constant, which shows up all over number theory and also in probability (coupon collector's problem, entropy of weibull and levy) is so difficult to work with that not only has no-one proven it transcendental, it hasn't even been proven irrational.
- mcherm 12y ago> In the age of computers, there will be fewer fun surprises like that. Really? I can't think of any way in which computers make it easier to distinguish rational from irrational numbers. What is it that I am missing?
- marcosdumay 12y agoIt's not much easier to prove it. But when you can quickly compute the first few billion digits, you can just look for repetitions and conjecture that a number is rational.
- emeraldd 12y agoThe only thing that computers add is the ability to prove that a number is not rational to a larger number of decimal places than a human working on their own could or any other technique that requires brute force calculation on a large scale.
- deleted 12y ago[deleted]
- Strilanc 12y agoIf you can compute a number's digits (i.e. approximate it), then you can see if they start repeating or not. If you compute a billion digits and they don't repeat yet, and you have no reason to expect the number to be a fraction with a huge denominator, then a good conjecture is that the number is irrational and vice versa when there is repetition. You'll be right more often than not. (Of course, like many heuristics this one is easily exploitable by an adversary trying to make you give the wrong answer. And clearly this is not a proof, just a rule of thumb where you expect to be wrong now and then but not usually.)
- GFK_of_xmaspast 12y agoGo read Kuperberg's answer where he mentions Borwein&Borwein (the one with 51 upvotes)
- mcherm 12y agoOh, that's REALLY interesting! I admit I was surprised that "Most (but not all) interesting numbers admit a polynomial-time algorithm to compute their digits." But this is a really good reason why computers would make a difference.
- michaelochurch 12y agoI can think of three cases where "irrational-looking" numbers turn out to be rational. However, they're actually mathematically trivial, not "long suspected irrational". 1. e^(i * pi) "looks" like nonsense. If you think of exponentiation as iterated multiplication, use algebra (roots) to compute rational exponents, use continuity to fill in the non-integer real values... then, still, how do you "do something" an imaginary number of times? Of course, it's actually -1. This doesn't qualify (IMO) because as soon as mathematicians understood complex exponents, this result was probably fairly obvious. 2. The infinite tower sqrt(2)^sqrt(2)^sqrt(2)^... has a finite value, which is 2. (It's the fixed point, sqrt(2)^x = x). Yet again, we have a simple (integer) value coming out of something that seems infinitely complex. However, yet again, once you make the conceptual leap necessary to evaluate such "towers", the answer is trivial. 3. Binet's formula "looks" like it should be producing irrational numbers for integer inputs, but actually produces the Fibonacci sequence. But this is just high school algebra: the problematic terms cancel and you're left with something reducing to an integer. I suspect that all of the "long suspected irrationals" like e^pi and pi^e are irrational. Almost all mathematicians, if it were an even-odds bet, would bet on them being so. (Of course, intuition can and does fail in all sorts of ways.) It's just that, for all but the simplest numbers, we don't have the tools to prove irrationality when, in fact, they are. That requires quantifying over all the integers, and we already know that some first-order statements are undecidable. The "scary" (and, in my mind, likely) possibility is that, for some of these simple-to-express real numbers, it's formally undecidable whether they are rational. More weirdly, no specific real number will ever be proven to be in the "unprovably irrational" category (since that would, by definition, constitute proof of irrationality).
- tel 12y agoI think a much better example is of the style of the highest rated answer in the thread. If you look at the wiki page [0] you see that the constant has a non-trivial relationship with a major mathematical question ("what is the behavior of the prime numbers?") and, as you compute estimations of it within your computational ability it waves above and below its true value. For things like e^i you almost cannot define the idea of complex powers without knowing the right concepts. The sqrt(2) example clearly converges toward 2 as you stack the tower. Binet's formula was arrived at via derivation from the Fibonacci recursion formula... so anyone who had it would obviously know its significance. So, to be clear, the only reason why those examples would look strange is if someone showed it to you (armed with only high school mathematics) without explanation. Or if you don't know how to estimate the solution to f^n(1), f(x) = sqrt(2)^x for n, say, in [1,10]. "Legendre's Constant" has none of those features. That said, with today's computational power deriving a sufficiently strong estimate that it "might be 1" isn't so hard. One can imagine that other slower to converge examples exist today [0] http://en.wikipedia.org/wiki/Legendre%27s_constant http://en.wikipedia.org/wiki/Legendre%27s_constant
- murbard2 12y agoOne of the reason such proofs are hard is that there is no reason for these numbers to be rational, it would be a huge coincidence. Proofs typically happen when there is a good reason for things to be a certain way.
- tel 12y agoAnd "almost all" numbers are irrational, so you sort of do need a reason to be rational.