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:

    • Caboose12000@lemmy.world
      4·
      1 year ago

      maybe this will make more sense when I watch the veritasium video, but I don’t have time to do that until the weekend. How is 3x+1 unprovable? won’t all odd numbers multiplied by 3 still be odd? and won’t adding 1 to an odd number always make it even? and aren’t all even numbers by definition divisible by 2? I’m struggling to see how there could be any uncertainty in this

      • Jerkface@lemmy.ml
        5·
        1 year ago

        Just after going through a few examples in my head, the difficulty becomes somewhat more apparent. let’s start with 3. This is odd, so 3(3)+1 = 10. 10 is even so we have 10/2=5.

        By this point my intuition tells me that we don’t have a very obvious pattern that we can use to decide whether the function will output 4, 2, or 1 by recursively applying the function to its own output, other than the fact that every other number that we try appears to result in this pattern. We could possibly reduce the problem to whether we can guess that the function will eventually output a power of 2, but that doesn’t sound to me like it makes things much easier.

        If I had no idea whether a proof existed, I would guess that it may, but that it is non-trivial. Or at least my college math courses did not prepare me to find one. Since it looks like plenty of professional mathematicians have struggled with it, I have no doubt that if a proof exists it is non-trivial.

      • mipadaitu@lemmy.world
        2·
        1 year ago

        The unproven part is that it eventually will reach 1, not that it’s not possible to do the computation. Someone may find a number loop that doesn’t eventually reach 1.