this post was submitted on 03 Aug 2023
618 points (97.4% liked)

No Stupid Questions

35931 readers
913 users here now

No such thing. Ask away!

!nostupidquestions is a community dedicated to being helpful and answering each others' questions on various topics.

The rules for posting and commenting, besides the rules defined here for lemmy.world, are as follows:

Rules (interactive)


Rule 1- All posts must be legitimate questions. All post titles must include a question.

All posts must be legitimate questions, and all post titles must include a question. Questions that are joke or trolling questions, memes, song lyrics as title, etc. are not allowed here. See Rule 6 for all exceptions.



Rule 2- Your question subject cannot be illegal or NSFW material.

Your question subject cannot be illegal or NSFW material. You will be warned first, banned second.



Rule 3- Do not seek mental, medical and professional help here.

Do not seek mental, medical and professional help here. Breaking this rule will not get you or your post removed, but it will put you at risk, and possibly in danger.



Rule 4- No self promotion or upvote-farming of any kind.

That's it.



Rule 5- No baiting or sealioning or promoting an agenda.

Questions which, instead of being of an innocuous nature, are specifically intended (based on reports and in the opinion of our crack moderation team) to bait users into ideological wars on charged political topics will be removed and the authors warned - or banned - depending on severity.



Rule 6- Regarding META posts and joke questions.

Provided it is about the community itself, you may post non-question posts using the [META] tag on your post title.

On fridays, you are allowed to post meme and troll questions, on the condition that it's in text format only, and conforms with our other rules. These posts MUST include the [NSQ Friday] tag in their title.

If you post a serious question on friday and are looking only for legitimate answers, then please include the [Serious] tag on your post. Irrelevant replies will then be removed by moderators.



Rule 7- You can't intentionally annoy, mock, or harass other members.

If you intentionally annoy, mock, harass, or discriminate against any individual member, you will be removed.

Likewise, if you are a member, sympathiser or a resemblant of a movement that is known to largely hate, mock, discriminate against, and/or want to take lives of a group of people, and you were provably vocal about your hate, then you will be banned on sight.



Rule 8- All comments should try to stay relevant to their parent content.



Rule 9- Reposts from other platforms are not allowed.

Let everyone have their own content.



Rule 10- Majority of bots aren't allowed to participate here.



Credits

Our breathtaking icon was bestowed upon us by @Cevilia!

The greatest banner of all time: by @TheOneWithTheHair!

founded 1 year ago
MODERATORS
 

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) > 10^10^10^10^10^10^10^10^10^10^10^10^10^10^10 (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:

you are viewing a single comment's thread
view the rest of the comments
[–] [email protected] 162 points 1 year ago (1 children)

There are more ways to arrange a deck of 52 cards than there are atoms on Earth.

52 Factorial

I feel this one is quite well known, but it's still pretty cool.

[–] [email protected] 79 points 1 year ago (2 children)

An extension of that is that every time you shuffle a deck of cards there's a high probability that that particular arrangement has never been seen in the history of mankind.

[–] [email protected] 30 points 1 year ago (1 children)

With the caveat that it's not the first shuffle of a new deck. Since card decks come out of the factory in the same order, the probability that the first shuffle will result in an order that has been seen before is a little higher than on a deck that has already been shuffled.

[–] [email protected] 10 points 1 year ago* (last edited 1 year ago) (1 children)

Since a deck of cards can only be shuffled a finite number of times before they get all fucked up, the probability of deck arrangements is probably a long tail distribution

[–] [email protected] 5 points 1 year ago

The most efficient way is not to shuffle them but to lay them all on a table, shift them around, and stack them again in arbitrary order.

[–] [email protected] 10 points 1 year ago (1 children)

assuming a perfect mechanical shuffle, I think the odds are near zero. humans don't shuffle perfectly though!

[–] [email protected] 3 points 1 year ago* (last edited 1 year ago) (2 children)

perfect mechanical shuffle

What's perfect in this context? It's maybe a little counterintuitive because I'd think a perfect mechanical shuffle would be perfectly deterministic (assuming no mechanical failure of the device) so that it would be repeatable. Like, you would give it a seed number (about 67 digits evidently) and the mechanism would perform a series of interleaves completely determined by the seed. Then if you wanted a random order you would give the machine a true random seed (from your wall of lava lamps or whatever) and you'd get a deck with an order that is very likely to never have been seen before. And if you wanted to play a game with that particular deck order again you'd just put the same seed into the machine.

[–] [email protected] 2 points 1 year ago

Perfect is the sense that you have perfect randomness. Like the Fisher-Yates shuffle.

[–] [email protected] 1 points 1 year ago

In order to have a machine that can "pick" any possible shuffle by index (that's all a seed really is, a partial index into the space of random numbers), you'd need a seed 223 bits long.

But you wouldn't want perfect mechanical shuffles though because 8 perfect riffles will loop the deck back to it's original order! The minor inaccuracies are what makes actual shuffling work.

I'd probably have the machine do it all electronically and then sort the physical deck to match, not sure you could control the entropy in a reliable way with actual paper cards otherwise.