## Problem 622

**Forum rules**

As your posts will be visible to the general public you

are requested to be thoughtful in not posting anything

that might explicitly give away how to solve a particular problem.

This forum is NOT meant to discuss solution methods for a problem.

In particular don't post any code fragments or results.

Don't start begging others to give partial answers to problems

Don't ask for hints how to solve a problem

Don't start a new topic for a problem if there already exists one

Don't start begging others to give partial answers to problems

Don't ask for hints how to solve a problem

Don't start a new topic for a problem if there already exists one

See also the topics:

Don't post any spoilers

Comments, questions and clarifications about PE problems.

- Oliver1978
**Posts:**165**Joined:**Sat Nov 22, 2014 9:13 pm**Location:**Erfurt, Germany

### Problem 622

From what I gather from the problem description, the outcome of s(n) is 0 if n is odd, else some value > 0. Is this right?

49.157.5694.1125

### Re: Problem 622

From the problem description:

Let $s(n)$ be the minimum number of consecutive riffle shuffles needed to restore a deck of size $n$ to its original configuration, where $n$ is a positive even number.

So if $n$ is odd $s(n)$ is not defined.- Oliver1978
**Posts:**165**Joined:**Sat Nov 22, 2014 9:13 pm**Location:**Erfurt, Germany

### Re: Problem 622

Really interesting little problem (imho 15% is a bit low)

In the mean time I know exactly what the maximum deck size for s(n) = 60 is, or any other amount of shuffles for that matter, (No, you can't shuffle this deck by hand or even forklift ) but the decks in between are still a mistery to me.

You really could've asked for s(n)=31

In the mean time I know exactly what the maximum deck size for s(n) = 60 is, or any other amount of shuffles for that matter, (No, you can't shuffle this deck by hand or even forklift ) but the decks in between are still a mistery to me.

You really could've asked for s(n)=31