Perfect riffle shuffles
$begingroup$
Take a deck of cards (with indexed position from 1 (top) to 52 (bottom)) and perform a perfect riffle shuffle, such that the top card (1) is still on top and the bottom (52) is still on the bottom.
Amazingly, if you perform 8 such riffle shuffles you will return to where you started.
Obviously, cards 1 and 52 do not change position. Most of the cards will go through some cycle and land back where they started only after 8 riffles.
But two cards will simply swap position back and forth each shuffle.
What are they?
Bonus question:
If you throw in the two jokers, you will have 54 cards. How many riffle shuffles will it take to get this deck back to the starting positions?
cards
asked 10 hours ago
Dr XorileDr Xorile
13.8k32975
$endgroup$
add a comment |
$begingroup$
Take a deck of cards (with indexed position from 1 (top) to 52 (bottom)) and perform a perfect riffle shuffle, such that the top card (1) is still on top and the bottom (52) is still on the bottom.
Amazingly, if you perform 8 such riffle shuffles you will return to where you started.
Obviously, cards 1 and 52 do not change position. Most of the cards will go through some cycle and land back where they started only after 8 riffles.
But two cards will simply swap position back and forth each shuffle.
What are they?
Bonus question:
If you throw in the two jokers, you will have 54 cards. How many riffle shuffles will it take to get this deck back to the starting positions?
cards
asked 10 hours ago
Dr XorileDr Xorile
13.8k32975
$endgroup$
add a comment |
$begingroup$
Take a deck of cards (with indexed position from 1 (top) to 52 (bottom)) and perform a perfect riffle shuffle, such that the top card (1) is still on top and the bottom (52) is still on the bottom.
Amazingly, if you perform 8 such riffle shuffles you will return to where you started.
Obviously, cards 1 and 52 do not change position. Most of the cards will go through some cycle and land back where they started only after 8 riffles.
But two cards will simply swap position back and forth each shuffle.
What are they?
Bonus question:
If you throw in the two jokers, you will have 54 cards. How many riffle shuffles will it take to get this deck back to the starting positions?
cards
asked 10 hours ago
Dr XorileDr Xorile
13.8k32975
$endgroup$
Take a deck of cards (with indexed position from 1 (top) to 52 (bottom)) and perform a perfect riffle shuffle, such that the top card (1) is still on top and the bottom (52) is still on the bottom.
Amazingly, if you perform 8 such riffle shuffles you will return to where you started.
Obviously, cards 1 and 52 do not change position. Most of the cards will go through some cycle and land back where they started only after 8 riffles.
But two cards will simply swap position back and forth each shuffle.
What are they?
Bonus question:
If you throw in the two jokers, you will have 54 cards. How many riffle shuffles will it take to get this deck back to the starting positions?
cards
cards
asked 10 hours ago
Dr XorileDr Xorile
13.8k32975
asked 10 hours ago
Dr XorileDr Xorile
13.8k32975
asked 10 hours ago
Dr XorileDr Xorile
13.8k32975
asked 10 hours ago
Dr XorileDr Xorile
13.8k32975
asked 10 hours ago
Dr XorileDr Xorile
13.8k32975
13.8k32975
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Cards in the top half besides 1 always increase from $k$ to $2k-1$ (because it will be the first card of the $k$th pair). Cards in the bottom half besides 52 always decrease from $m$ to $2(m-26)$ (because it will be the second card of the $(m-26)$th pair). Then to return to the original position after two shuffles, the cards must swap between the halves.
If $k$ is the position of the card in the top half, then after one shuffle it will move to position $m=2k-1$. If it is now in the bottom half ($m>26$), it will move to position $2(m-26)=2(2k-1-26)=4k-54$ after the second shuffle. To have returned to its initial position, we must have $4k-54=kiff3k=54iff k=18$, so that $m=2k-1=35>26$ holds. The two cards are at positions $boxed{18text{ and }35}$.
Bonus:
It can be shown using group theory that $k$ shuffles will restore a deck of size $n$ if $n-1$ divides $2^k-1$. The sequence of least such $k$ for every $n$ is in the OEIS, which gives the answer for 54 cards as $boxed{52text{ shuffles}}$.
answered 10 hours ago
noednenoedne
7,60212160
$endgroup$
1
$begingroup$
These answers are the reason i feel guilty for not going back to continues learning.
$endgroup$
– Alex
10 hours ago
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "559"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fpuzzling.stackexchange.com%2fquestions%2f81023%2fperfect-riffle-shuffles%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Cards in the top half besides 1 always increase from $k$ to $2k-1$ (because it will be the first card of the $k$th pair). Cards in the bottom half besides 52 always decrease from $m$ to $2(m-26)$ (because it will be the second card of the $(m-26)$th pair). Then to return to the original position after two shuffles, the cards must swap between the halves.
If $k$ is the position of the card in the top half, then after one shuffle it will move to position $m=2k-1$. If it is now in the bottom half ($m>26$), it will move to position $2(m-26)=2(2k-1-26)=4k-54$ after the second shuffle. To have returned to its initial position, we must have $4k-54=kiff3k=54iff k=18$, so that $m=2k-1=35>26$ holds. The two cards are at positions $boxed{18text{ and }35}$.
Bonus:
It can be shown using group theory that $k$ shuffles will restore a deck of size $n$ if $n-1$ divides $2^k-1$. The sequence of least such $k$ for every $n$ is in the OEIS, which gives the answer for 54 cards as $boxed{52text{ shuffles}}$.
answered 10 hours ago
noednenoedne
7,60212160
$endgroup$
1
$begingroup$
These answers are the reason i feel guilty for not going back to continues learning.
$endgroup$
– Alex
10 hours ago
add a comment |
$begingroup$
Cards in the top half besides 1 always increase from $k$ to $2k-1$ (because it will be the first card of the $k$th pair). Cards in the bottom half besides 52 always decrease from $m$ to $2(m-26)$ (because it will be the second card of the $(m-26)$th pair). Then to return to the original position after two shuffles, the cards must swap between the halves.
If $k$ is the position of the card in the top half, then after one shuffle it will move to position $m=2k-1$. If it is now in the bottom half ($m>26$), it will move to position $2(m-26)=2(2k-1-26)=4k-54$ after the second shuffle. To have returned to its initial position, we must have $4k-54=kiff3k=54iff k=18$, so that $m=2k-1=35>26$ holds. The two cards are at positions $boxed{18text{ and }35}$.
Bonus:
It can be shown using group theory that $k$ shuffles will restore a deck of size $n$ if $n-1$ divides $2^k-1$. The sequence of least such $k$ for every $n$ is in the OEIS, which gives the answer for 54 cards as $boxed{52text{ shuffles}}$.
answered 10 hours ago
noednenoedne
7,60212160
$endgroup$
1
$begingroup$
These answers are the reason i feel guilty for not going back to continues learning.
$endgroup$
– Alex
10 hours ago
add a comment |
$begingroup$
Cards in the top half besides 1 always increase from $k$ to $2k-1$ (because it will be the first card of the $k$th pair). Cards in the bottom half besides 52 always decrease from $m$ to $2(m-26)$ (because it will be the second card of the $(m-26)$th pair). Then to return to the original position after two shuffles, the cards must swap between the halves.
If $k$ is the position of the card in the top half, then after one shuffle it will move to position $m=2k-1$. If it is now in the bottom half ($m>26$), it will move to position $2(m-26)=2(2k-1-26)=4k-54$ after the second shuffle. To have returned to its initial position, we must have $4k-54=kiff3k=54iff k=18$, so that $m=2k-1=35>26$ holds. The two cards are at positions $boxed{18text{ and }35}$.
Bonus:
It can be shown using group theory that $k$ shuffles will restore a deck of size $n$ if $n-1$ divides $2^k-1$. The sequence of least such $k$ for every $n$ is in the OEIS, which gives the answer for 54 cards as $boxed{52text{ shuffles}}$.
answered 10 hours ago
noednenoedne
7,60212160
$endgroup$
Cards in the top half besides 1 always increase from $k$ to $2k-1$ (because it will be the first card of the $k$th pair). Cards in the bottom half besides 52 always decrease from $m$ to $2(m-26)$ (because it will be the second card of the $(m-26)$th pair). Then to return to the original position after two shuffles, the cards must swap between the halves.
If $k$ is the position of the card in the top half, then after one shuffle it will move to position $m=2k-1$. If it is now in the bottom half ($m>26$), it will move to position $2(m-26)=2(2k-1-26)=4k-54$ after the second shuffle. To have returned to its initial position, we must have $4k-54=kiff3k=54iff k=18$, so that $m=2k-1=35>26$ holds. The two cards are at positions $boxed{18text{ and }35}$.
Bonus:
It can be shown using group theory that $k$ shuffles will restore a deck of size $n$ if $n-1$ divides $2^k-1$. The sequence of least such $k$ for every $n$ is in the OEIS, which gives the answer for 54 cards as $boxed{52text{ shuffles}}$.
answered 10 hours ago
noednenoedne
7,60212160
answered 10 hours ago
noednenoedne
7,60212160
answered 10 hours ago
noednenoedne
7,60212160
answered 10 hours ago
noednenoedne
7,60212160
7,60212160
1
$begingroup$
These answers are the reason i feel guilty for not going back to continues learning.
$endgroup$
– Alex
10 hours ago
add a comment |
1
$begingroup$
These answers are the reason i feel guilty for not going back to continues learning.
$endgroup$
– Alex
10 hours ago
1
1
$begingroup$
These answers are the reason i feel guilty for not going back to continues learning.
$endgroup$
– Alex
10 hours ago
$begingroup$
These answers are the reason i feel guilty for not going back to continues learning.
$endgroup$
– Alex
10 hours ago
add a comment |
Thanks for contributing an answer to Puzzling Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fpuzzling.stackexchange.com%2fquestions%2f81023%2fperfect-riffle-shuffles%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
