What concepts or facts do you know from math that is mind blowing, awesome, or simply fascinating?

Here are some I would like to share:

  • Gödel’s incompleteness theorems: There are some problems in math so difficult that it can never be solved no matter how much time you put into it.
  • Halting problem: It is impossible to write a program that can figure out whether or not any input program loops forever or finishes running. (Undecidablity)

The Busy Beaver function

Now this is the mind blowing one. What is the largest non-infinite number you know? Graham’s Number? TREE(3)? TREE(TREE(3))? This one will beat it easily.

  • The Busy Beaver function produces the fastest growing number that is theoretically possible. These numbers are so large we don’t even know if you can compute the function to get the value even with an infinitely powerful PC.
  • In fact, just the mere act of being able to compute the value would mean solving the hardest problems in mathematics.
  • Σ(1) = 1
  • Σ(4) = 13
  • Σ(6) > 101010101010101010101010101010 (10s are stacked on each other)
  • Σ(17) > Graham’s Number
  • Σ(27) If you can compute this function the Goldbach conjecture is false.
  • Σ(744) If you can compute this function the Riemann hypothesis is false.

Sources:

  • Gogo Sempai@programming.dev
    100·
    1 year ago

    Goldbach’s Conjecture: Every even natural number > 2 is a sum of 2 prime numbers. Eg: 8=5+3, 20=13+7.

    https://en.m.wikipedia.org/wiki/Goldbach’s_conjecture

    Such a simple construct right? Notice the word “conjecture”. The above has been verified till 4x10^18 numbers BUT no one has been able to prove it mathematically till date! It’s one of the best known unsolved problems in mathematics.

    • madcaesar@lemmy.world
      42·
      1 year ago

      How can you prove something in math when numbers are infinite? That number you gave if it works up to there we can call it proven no? I’m not sure I understand

      • Barack_Embalmer@lemmy.world
        14·
        1 year ago

        There are many structures of proof. A simple one might be to prove a statement is true for all cases, by simply examining each case and demonstrating it, but as you point out this won’t be useful for proving statements about infinite cases.

        Instead you could assume, for the sake of argument, that the statement is false, and show how this leads to a logical inconsistency, which is called proof by contradiction. For example, Georg Cantor used a proof by contradiction to demonstrate that the set of Natural Numbers (1,2,3,4…) are smaller than the set of Real Numbers (which includes the Naturals and all decimal numbers like pi and 69.6969696969…), and so there exist different “sizes” of infinity!

        For a method explicitly concerned with proofs about infinite numbers of things, you can try Proof by Mathematical Induction. It’s a bit tricky to describe…

        • First demonstrate that a statement is true in some 1st base case.
        • Then demonstrate that if it holds true for the abstract Nth case, then it necessarily holds true for the (N+1)th case (by doing some clever rearranging of algebra terms or something)
        • Therefore since it holds true for the 1th case, it must hold true for the (1+1)th case = the 2th case. And since it holds true for the 2th case it must hold true for the (2+1)=3th case. And so on ad infinitum.

        Wikipedia says:

        Mathematical induction can be informally illustrated by reference to the sequential effect of falling dominoes.

        Bear in mind, in formal terms a “proof” is simply a list of true statements, that begin with axioms (which are true by default) and rules of inference that show how each line is derived from the line above.

        • HappySquid@feddit.ch
          1·
          1 year ago

          Just to add to this. Another way could be to find a specific construction. If you could for example find an algorithm that given any even integer returns two primes that add up to it and you showed this algorithm always works. Then that would be a proof of the Goldbach conjecture.

      • Gogo Sempai@programming.dev
        4·
        1 year ago

        As you said, we have infinite numbers so the fact that something works till 4x10^18 doesn’t prove that it will work for all numbers. It will take only one counterexample to disprove this conjecture, even if it is found at 10^100. Because then we wouldn’t be able to say that “all” even numbers > 2 are a sum of 2 prime numbers.

        So mathematicians strive for general proofs. You start with something like: Let n be any even number > 2. Now using the known axioms of mathematics, you need to prove that for every n, there always exists two prime numbers p,q such that n=p+q.

        Would recommend watching the following short and simple video on the Pythagoras theorem, it’d make it perfectly clear how proofs work in mathematics. You know the theorem right? For any right angled triangle, the square of the hypotenuse is equal to the sum of squares of both the sides. Now we can verify this for billions of different right angled triangles but it wouldn’t make it a theorem. It is a theorem because we have proved it mathematically for the general case using other known axioms of mathematics.

        https://youtu.be/YompsDlEdtc