You are using the new UI (Beta).Return to the original UI

This page has been automatically translated by machine translation. Please note that translations may not be entirely accurate.

keisanHigh-precision calculations for everyday life and work

Shuffle the 13 playing cards.

Author: shiroeExecutions: 12

※ This library was created by a member. This site is not responsible for its content.

Manage Bookmarks
Shuffle 13 playing cards.

Suppose you have 13 playing cards. Suits do not matter.
The deck is stacked in numerical order from the top: 1, 2, …, 13. Take this deck,
cut off p cards from the top, and move them to the bottom of the remaining stack of 13–p cards.
Let q be the number of shuffles.
This process is displayed below.

[Number of cuts] = 0 represents the initial state of the deck.
(1), (2), …, (13) represent the positions of the cards: the first, second, …, thirteenth cards from the top.
Here, there is a single, fixed cut position.
The number of operations, q, is limited to 100.
Enter a natural number between 1 and 12, inclusive, for p.
Enter a natural number between 1 and 100, inclusive, for q.
p
  (Cut positions 1–13)
q
  (Number of executions: 1–100)
Digit display setting: 10 digits. Fixed digits. Real number calculation mode.

No customer feedback for this calculation yet.