ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let H2mH_{2m} be the 2m2mth harmonic number, and let FG(n,m)F^{\mathbf{G}}(n,m) denote the expected number of correct guesses made by the strategy G\mathbf{G} for a deck of nn cards subjected to an mm-shelf shuffle. Assume that n/mn/m is not too small. FDH optimality conjecture. The strategy G\mathbf{G} discussed by FDH should be optimal in a high-probability case, and its expected number of correct guesses satisfies

FG(n,m)≈n2mH2m=n2m∑k=12m1k.F^{\mathbf{G}}(n,m)\approx\frac{n}{2m}H_{2m}=\frac{n}{2m}\sum_{k=1}^{2m}\frac{1}{k}.

The source motivates this as a generalization of the one-shelf result and notes its applicability when the ratio of cards to shelves is not too small, but the meaning of “high-probability case” and the approximation are not made precise in the supplied statement.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.