• Fargeol@lemmy.world
    link
    fedilink
    English
    arrow-up
    56
    ·
    2 days ago

    Theorem - All numbers are interesting

    Demonstration:

    • 0 is interesting
    • if n is interesting, n+1 is either interesting or not interesting.
      – If n+1 is not interesting, we take interest in it as it it the smallest non-interesting number.
    • Therefore, n+1 is interesting

    By induction, all numbers are interesting

    • CompassRed@discuss.tchncs.de
      link
      fedilink
      English
      arrow-up
      5
      ·
      edit-2
      2 days ago

      My favorite version of this proof:

      Let S be the subset of natural numbers that are not interesting. Suppose by way of contradiction that S is inhabited. Then by the well ordering principle of natural numbers, there is a least such element, s in S. In virtue of being the least non interesting number, s is in fact interesting. Hence s is not in S. Since s is in S and not in S, we have derived a contradiction. Therefore our assumption that S is inhabited must be false. Thus S is empty and there are no non interesting numbers.

    • Match!!@pawb.social
      link
      fedilink
      English
      arrow-up
      2
      ·
      2 days ago

      What about 31? That’s the smallest non-interesting number so if we take that as the first n, then every n+1 is either interesting or the second-smallest non-interesting number, and the second smallest non-interesting number is still not interesting.

    • AnarchoEngineer@lemmy.dbzer0.com
      link
      fedilink
      English
      arrow-up
      9
      ·
      1 day ago

      True, You can only induce natural numbers from this.

      However, you could extend it to the positive reals by saying [0,1) is a small number. And building induction on all of those.

      You could cover negative and even complex numbers if “small” is a reference to magnitude of a vector, but that is a slippery slope…

      In a very not rigorous way, you can cover combinations of ordinal numbers and even non-numbers if you treat them as orthogonal “unit vectors” and the composite “number” as a vector in an infinite vector space which again allows you to specify smallness as a reference to magnitude like we did for the complex numbers.

      If you multiply two not really numbers, just count the product as a new dimension for the vector. Same with exponentiation. Same with non math shit like a cow or the color orange. Count all unique things as a unique dimension to a vector then by our little vector magnitude hack, everything is a small number, even things that aren’t numbers. QED.


      This proof is a joke, broken in many ways, but the most interesting is the question of if you can actually have a vector with an uncountably infinite (or higher ordinals) of dimensions and what the hell that even means.

    • BodilessGaze@sh.itjust.works
      link
      fedilink
      English
      arrow-up
      5
      ·
      edit-2
      1 day ago

      Sure you can. Proof:

      0 is a number.

      If n is a number, n+1 is also a number.

      Therefore, by mathematical induction, we can induce all numbers.

  • hperrin
    link
    fedilink
    English
    arrow-up
    14
    ·
    2 days ago

    I mean, yeah. Compared to infinity, the number of particles in the universe is essentially zero.

      • hperrin
        link
        fedilink
        English
        arrow-up
        3
        ·
        2 days ago

        Even if it is infinite, that still pales in comparison to infinity. Infinity is weird.

        • very_well_lost@lemmy.world
          link
          fedilink
          English
          arrow-up
          5
          ·
          2 days ago

          True. If the universe is infinite, the number of particles would only be a lowly countable Infinity. How pathetic!

        • Kühlschrank@lemmy.world
          link
          fedilink
          English
          arrow-up
          1
          ·
          2 days ago

          It blew my mind when someone explained to me how some sets of infinity numbers can be infinite yet still technically larger than other sets, like the set of all numbers vs. the set of all odd numbers.

          • Fleur_@aussie.zone
            link
            fedilink
            English
            arrow-up
            1
            ·
            edit-2
            1 day ago

            Yes that’s right, but I’d like to clarify that if we’re talking about whole numbers then my understanding is that the set of all whole numbers is the same “size” as the set of all odd numbers. The quick and dirty way to think about it is you could theoretically make a list of all the odd numbers and all the whole numbers and assign each whole number to an odd number at a 1-1 ratio

            The reason the set of all numbers is “bigger” is because of things like fractions and irrational numbers. Try assigning an odd number to every decimal. You can’t even make a list of all the decimals. There is no non-zero interval between which a finite amount of decimals exist.