How many ways can you arrange a deck of cards Yannay Khaikin

Pick a card, any card.

Actually, just pick up all of them and take a look.

This standard 52-card deck has been used for centuries.

Everyday, thousands just like it

are shuffled in casinos all over the world,

the order rearranged each time.

And yet, every time you pick up a well-shuffled deck

like this one,

you are almost certainly holding

an arrangement of cards

that has never before existed in all of history.

How can this be?

The answer lies in how many different arrangements

of 52 cards, or any objects, are possible.

Now, 52 may not seem like such a high number,

but let’s start with an even smaller one.

Say we have four people trying to sit

in four numbered chairs.

How many ways can they be seated?

To start off, any of the four people can sit

in the first chair.

One this choice is made,

only three people remain standing.

After the second person sits down,

only two people are left as candidates

for the third chair.

And after the third person has sat down,

the last person standing has no choice

but to sit in the fourth chair.

If we manually write out all the possible arrangements,

or permutations,

it turns out that there are 24 ways

that four people can be seated into four chairs,

but when dealing with larger numbers,

this can take quite a while.

So let’s see if there’s a quicker way.

Going from the beginning again,

you can see that each of the four initial choices

for the first chair

leads to three more possible choices for the second chair,

and each of those choices

leads to two more for the third chair.

So instead of counting each final scenario individually,

we can multiply the number of choices for each chair:

four times three times two times one

to achieve the same result of 24.

An interesting pattern emerges.

We start with the number of objects we’re arranging,

four in this case,

and multiply it by consecutively smaller integers

until we reach one.

This is an exciting discovery.

So exciting that mathematicians have chosen

to symbolize this kind of calculation,

known as a factorial,

with an exclamation mark.

As a general rule, the factorial of any positive integer

is calculated as the product

of that same integer

and all smaller integers down to one.

In our simple example,

the number of ways four people

can be arranged into chairs

is written as four factorial,

which equals 24.

So let’s go back to our deck.

Just as there were four factorial ways

of arranging four people,

there are 52 factorial ways

of arranging 52 cards.

Fortunately, we don’t have to calculate this by hand.

Just enter the function into a calculator,

and it will show you that the number of

possible arrangements is

8.07 x 10^67,

or roughly eight followed by 67 zeros.

Just how big is this number?

Well, if a new permutation of 52 cards

were written out every second

starting 13.8 billion years ago,

when the Big Bang is thought to have occurred,

the writing would still be continuing today

and for millions of years to come.

In fact, there are more possible

ways to arrange this simple deck of cards

than there are atoms on Earth.

So the next time it’s your turn to shuffle,

take a moment to remember

that you’re holding something that

may have never before existed

and may never exist again.

选择一张牌,任何一张牌。

其实,只要把它们都捡起来看看。

这个标准的 52 张牌已经使用了几个世纪。

每天,成千上万的人像它一样

在世界各地的赌场中洗牌

,每次都重新排列顺序。

然而,每次你拿起这样一副洗好的牌时

几乎可以肯定你手里拿着

一整套历史上从未有过的牌。

怎么会这样?

答案

在于 52 张卡片或任何物体有多少种不同的排列方式是可能的。

现在,52 可能看起来不是一个很高的数字,

但让我们从一个更小的数字开始。

假设我们有四个人试图

坐在四张编号的椅子上。

他们可以坐多少种方式?

首先,四个人中的任何一个都可以

坐在第一把椅子上。

一做出这个选择,就

只剩下三个人还站着。

第二人坐下后,第三任主席

的人选就只剩下两人

了。

而在第三个人坐下之后

,最后一个站着的人也

只好坐到了第四把椅子上。

如果我们手动写出所有可能的安排

或排列

,结果是有 24 种方法

可以让四个人坐在四张椅子上,

但是当处理更大的数字时,

这可能需要相当长的时间。

所以让我们看看是否有更快的方法。

再次从头开始,

您可以看到第一把椅子的四个初始选择

中的每一个都会

导致第二把椅子的另外三个可能的选择,

而这些选择中的每一个都会

导致第三把椅子的另外两个选择。

因此,

我们可以将每把椅子的选择数量相乘,而不是单独计算每个最终场景:

四乘以三乘

以二乘以得到相同的结果 24。

出现了一个有趣的模式。

我们从要排列的对象的数量开始,

在这种情况下为 4,

然后将其乘以连续更小的整数,

直到达到 1。

这是一个令人兴奋的发现。

如此令人兴奋的是,数学家们选择用感叹号

来表示这种

被称为阶乘的计算

作为一般规则,任何正整数的阶乘

计算为

同一整数

和所有较小整数的乘积,直到 1。

在我们的简单示例中,

可以将四个人安排到椅子

上的方式的数量写为四阶乘

,等于 24。

所以让我们回到我们的甲板上。

正如

排列四个人的四种

阶乘方式一样,排列 52 张卡片的阶乘方式也有 52 种

幸运的是,我们不必手动计算。

只需将函数输入计算器

,它会显示

可能的排列数为

8.07 x 10^67,

或大约 8 个后跟 67 个零。

这个数字到底有多大?

好吧,如果从 138 亿年前开始每秒写出 52 张卡片的新排列

当时人们认为大爆炸已经发生,

那么今天

和未来数百万年的书写仍将继续。

事实上,

排列这种简单的一副纸牌的可能方法

比地球上的原子还要多。

所以下次轮到你洗牌的时候,

花点时间

记住你拿着的东西

可能以前从未存在过

,也可能永远不会再存在。