DesignCAD User Forum
General DesignCAD Topics => Totally OffTopic => Topic started by: samdavo on December 09, 2015, 03:01:18 PM

We have a mathematician in Aus name of Adam Spencer. He recently wrote a book, World of Numbers.
Here's an example,
What are the chances of a shuffled pack being the same as one that happened in the past?
The number of permutations of a pack of cards (well shuffled) is so massive that, to cover every one of them, you would need
a) a trillion trillion friends
b) each with a trillion trillion packs of cards
c) doing a unique shuffle 1000 times per second (edit) I suspect this should read 185  see below)
d) since the Big Bang
That's how long it takes to produce all permutations (!)
:)
Basically, you can be pretty certain that any shuffled pack has never been produced before  nor will it ever be again lol.

I don't know the numbers, but I imagine that each of us has a genetic code that has a massive (though finite) number of permutations; and again, I imagine that we are and always will be "oneoff's "  within sensible statistical chances :)

Here's another one!
Take two decks and shuffle them up good, but separately. Then get a friend to start turning over one card at a time from the top of his deck while you do the same with your deck. What are the odds that you both will turn over the exact same card at some time during this drill?
Answer: two out of three times. Try it!
Another: If you have more than 23 people in a room together, the odds are 50:50 that two of you will share the same birthday. Just not the same year.
Jim A., Tucson, AZ

Good ones Jim.
Let me tell you, back in the late 60's in the Aus Army, you only needed a handful of people in that room, lol. National Service callup was based on birthdays :)

We have a mathematician in Aus name of Adam Spencer. He recently wrote a book, World of Numbers.
Here's an example,
What are the chances of a shuffled pack being the same as one that happened in the past?
The number of permutations of a pack of cards (well shuffled) is so massive that, to cover every one of them, you would need
a) a trillion trillion friends
b) each with a trillion trillion packs of cards
c) doing a unique shuffle 1000 times per second
d) since the Big Bang
That's how long it takes to produce all permutations (!)
:)
Basically, you can be pretty certain that any shuffled pack has never been produced before  nor will it ever be again lol.
Actually I checked, and I believe that should read about 185 times per second since the Big Bang, not 1000. ( 2 cents)
That Adam Spencer, lol  told him a trillion times not to exaggerate.
Factorial 52 = 8.07 x 10^67 permutations.
Compare 13.82 billion years
x 365.25 days
x 24 x 60 x 60 seconds
x 185 times per second (we're up to 8.07 x 10^19 events since the Big Bang)
x 10^24 a trillion trillion people, each with
x 10^24 a trillion trillion packs of cards
= 8.07 x 10^67 :)

Sam,
Your solution will never work. You can't get a trillion trillion people on the Earth's surface, much less a trillion trillion trillion trillion packs of cards!
Besides, who has that many packs of cards in stock?
Phil

Lol  dead right.
PS Maybe you would be the one to ask how long it would take a computer to do that same exercise? :)
8.07E67 is a pretty big number.
PS But SciG's post (reply#2) about turning the cards is surprising yes? Two out of three times? Amazingly counterintuitive.
PS I just tried it three times with one of the kids.
First test had one match ("snap");
Second test had two matches; and
Third test also had two matches (2 cents)

Sam, Adam Spencer's calculation may be by the numbers, but who's to say it never actually happened before.
And concerning computers doing random calculations, have you ever played backgammon on a board with real dice and have you ever played on a computer. Doubles hardly come with real dice, but on a computer they come way too often. I once played a game and the computer threw doubles about 6 times back to back, at the start of the game. In fact, increasing the difficulty means the computer will throw at least 10 doubles for itself during a game.
Lar

Ahh, now you're talking  backgammon ! love it lol.
I recommend eXtreme Gammon, only costs about US $50 for the computer version, and $10 for a mini version for your iPhone (I have both). For the computer version, at the end of the game you can get a game summary, which includes the number of doubles rolled by each, and the average pip count per roll. Also analyses errors and blunders, dice action such as bad or missed doubles, and bad takes or passes  and indeed you can load up a transcript of a tournament game (played on a board or whatever) as an afterthought, and it will review each player. It even gives as percentage equity for the luck experienced by each player, and the cost of those errors to compare. Excellent value.
But back to the computer and the topic of this thread  I notice there is a measure of processor speed called "instructions per second", and the fastest computer mentioned on this Wikipedia page measures up at 10^10 MIPS (million instructions per second) , or 10^16 instructions per second.
https://en.wikipedia.org/wiki/Instructions_per_second
Hence (assuming I have read that correctly), you would need 185 rooms each running since the big bang, and each containing 10^32 such computers, to even "look at" each permutation  which I am very loosely calling one "instruction" (which is surely erring in favour of faster computer speed for this exercise), i.e.
Factorial 52 = 8.07 x 10^67 permutations.
Compare 13.82 billion years
x 365.25 days
x 24 x 60 x 60 seconds
x 185 rooms
x 10^16 times per second (we're up to 8.07 x 10^35 events since the Big Bang)
x 10^32 such computers PER ROOM
= 8.07 x 10^67 :)
(think / hope I'm right )
PS Or if you prefer, you can refer to trillions and trillions of billions etc,
Compare 13.82 billion years
x 365.25 days
x 24 x 60 x 60 seconds
x 18 rooms
x 10^16 times per second (we're up to 8.07 x 10^34 events since the Big Bang)
x 10^33 such computers PER ROOM = a billion trillion trillion computers
= 8.07 x 10^67 :)

Lol  anyone see this news today ... (speaking of playing cards) Thai police arrest a group of bridge players BLATANTLY defying the law, lol. I tell you those 80 year olds are the WORST.
... police charged the group with possessing more than 120 playing cards that were not produced by the Excise Department, in violation of Section 8 of the Playing Cards Act of 1943 ", lol
http://www.bangkokpost.com/news/crime/852112/pattayacopsbust32foreignersforplayingbridge

Hi Sam,
As a comment said: "should had played monopoly, you get a free get out of jail card".

Sam, back on computer backgammon for a sec my little free version has the option to roll real dice.

in eXtreme Gammon? , you bet ! And you can setup an imaginary position first etc. Top program.

Here's another one!
Take two decks and shuffle them up good, but separately. Then get a friend to start turning over one card at a time from the top of his deck while you do the same with your deck. What are the odds that you both will turn over the exact same card at some time during this drill?
Answer: two out of three times. Try it!
I just tried this three times, i.e. shuffled two packs and then my son and I put cards out looking for "snap(s)".
First trial, one "snap",
Second trial, two "snaps",
third trial, also two "snaps".
Worth knowing for next time I'm in the pub :)