ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a positive integer NN, define the right-append map by

Td(N)=10N+d,T_d(N)=10N+d,

where d∈{0,1,…,9}d\in\{0,1,\dots,9\}. A positive integer is square-free if it is not divisible by any perfect square greater than 11.

Miller et al.'s conjecture. There exists an infinite sequence of square-free integers

{N0,N1,N2,N3,… }\{N_0,N_1,N_2,N_3,\dots\}

and digits dk+1∈{0,1,…,9}d_{k+1}\in\{0,1,\dots,9\} such that

Nk+1=10Nk+dk+1N_{k+1}=10N_k+d_{k+1}

for all k≥0k\geq 0.

This asks whether one can continue a square-free walk indefinitely by successively appending decimal digits. The question was raised by Miller et al.; despite the result in the paper being previously obtained by Mirsky in 1947, the stated conjecture 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.