ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let

T(x)=⌊x⌋(1+{x}),\mathcal{T}(x)=\left\lfloor x\right\rfloor\bigl(1+\{x\}\bigr),

where {x}=x−⌊x⌋\{x\}=x-\left\lfloor x\right\rfloor. For a rational number x≥2x\geq 2, define its order under T\mathcal{T} to be the least non-negative integer nn such that Tn(x)\mathcal{T}^n(x) is an integer, if such an nn exists. Finite-order conjecture. Every rational number x∈Q≥2x\in\mathbb{Q}_{\geq 2} has finite order under T\mathcal{T}. This conjecture asks whether the rational initial values in the prime-representing recursion always eventually reach an integer; the paper proves density-one results for finite-order fractions at each fixed denominator and completely characterizes the case of denominator 22, but does not resolve the conjecture in general.

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.