ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let T1(n)T_1(n) be the first time card 11 is seen for the nnth time. Quadratic asymptotic conjecture. We have

T1(n)∼cn2T_1(n)\sim c n^2

for c≈0.85…c\approx 0.85\ldots. This is suggested by numerical experiments after the paper proves quadratic upper and lower bounds for T1(n)T_1(n), with cc constrained to lie in [1/2,1][1/2,1]. Determining this asymptotic constant remains open.

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.