P*******b
发帖数: 1001 | 1 Given a deck of nCards unique cards, cut the deck iCut cards from top and pe
rform a perfect shuffle. A perfect shuffle begins by putting down the bottom
card from the top portion of the deck followed by the bottom card from the
bottom portion of the deck followed by the next card from the top portion, e
tc., alternating cards until one portion is used up. The remaining cards go
on top. The problem is to find the number of perfect shuffles required to re
turn the deck to its original order. Your |
P*******b
发帖数: 1001 | 2 没人感兴趣？
pe
bottom
the
e
go
re
【在 P*******b 的大作中提到】
: Given a deck of nCards unique cards, cut the deck iCut cards from top and pe
: rform a perfect shuffle. A perfect shuffle begins by putting down the bottom
: card from the top portion of the deck followed by the bottom card from the
: bottom portion of the deck followed by the next card from the top portion, e
: tc., alternating cards until one portion is used up. The remaining cards go
: on top. The problem is to find the number of perfect shuffles required to re
: turn the deck to its original order. Your
|
s*****t
发帖数: 737 | 3 请问后续的shuffle是可以自己定 iCut吗?还是说每次都是随机的?
pe
bottom
the
e
go
re
【在 P*******b 的大作中提到】
: Given a deck of nCards unique cards, cut the deck iCut cards from top and pe
: rform a perfect shuffle. A perfect shuffle begins by putting down the bottom
: card from the top portion of the deck followed by the bottom card from the
: bottom portion of the deck followed by the next card from the top portion, e
: tc., alternating cards until one portion is used up. The remaining cards go
: on top. The problem is to find the number of perfect shuffles required to re
: turn the deck to its original order. Your
|
i***1
发帖数: 95 | |
P*******b
发帖数: 1001 | 5 我感觉iCut不是每次都是随机
【在 s*****t 的大作中提到】
: 请问后续的shuffle是可以自己定 iCut吗?还是说每次都是随机的?
:
: pe
: bottom
: the
: e
: go
: re
|
s*****t
发帖数: 737 | 6 Okay, it seems to me that
just keep cutting the same iCuts and then shuffle the cards
finally, you will get the original deck.
Just I could not get the number of times of shuffle and could not prove it.
I suspect it is a ring problem, needs abstract algebra to solve it.
【在 P*******b 的大作中提到】
: 我感觉iCut不是每次都是随机
|
h**k
发帖数: 3368 | 7 看不懂，能给个例子么？
pe
bottom
the
e
go
re
【在 P*******b 的大作中提到】
: Given a deck of nCards unique cards, cut the deck iCut cards from top and pe
: rform a perfect shuffle. A perfect shuffle begins by putting down the bottom
: card from the top portion of the deck followed by the bottom card from the
: bottom portion of the deck followed by the next card from the top portion, e
: tc., alternating cards until one portion is used up. The remaining cards go
: on top. The problem is to find the number of perfect shuffles required to re
: turn the deck to its original order. Your
|
