The Picard Maneuver@lemmy.world to Programmer Humor@lemmy.ml · 1 year agoConveniently enter your phone number with a single inputlemmy.worldimagemessage-square46fedilinkarrow-up11.05Karrow-down124
arrow-up11.02Karrow-down1imageConveniently enter your phone number with a single inputlemmy.worldThe Picard Maneuver@lemmy.world to Programmer Humor@lemmy.ml · 1 year agomessage-square46fedilink
minus-squaredeadbeef79000@lemmy.nzlinkfedilinkarrow-up7·1 year agoThat one was my favourite. Especially when it makes someone stop and think about it. Hang on… would that work? An infinite, non repeating sequence of digits? Yeah, that would contain all possible sequences of arbitrary length.
minus-squarezqwzzle@lemmy.calinkfedilinkEnglisharrow-up6·1 year agoFound it https://i.imgur.com/rh0mDnK.gifv there is a discussion about this https://math.stackexchange.com/questions/3495590/proof-of-the-existence-of-all-phone-numbers-in-pi Apparently all combinations of 10 digits appear in the first 241641121048 digits of pi.
That one was my favourite.
Especially when it makes someone stop and think about it.
Found it https://i.imgur.com/rh0mDnK.gifv there is a discussion about this https://math.stackexchange.com/questions/3495590/proof-of-the-existence-of-all-phone-numbers-in-pi
Apparently all combinations of 10 digits appear in the first 241641121048 digits of pi.