ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let R\mathfrak{R} be the recursive map on positive integers defined by

R(m)={σ(m),if m is odd,m2,if m is even,\mathfrak{R}(m)=\begin{cases} \sigma(m),&\text{if }m\text{ is odd},\\ \frac{m}{2},&\text{if }m\text{ is even}, \end{cases}

where σ\sigma is the sum-of-divisors function. Bounded descent conjecture. There exists a constant c∈N\mathbf{c}\in\mathbb{N} such that for every n∈Nn\in\mathbb{N}, there is some 1≤k≤c1\leq k\leq\mathbf{c} satisfying

Rk(n)≤n.\mathfrak{R}^k(n)\leq n.

This is a uniform bounded-time descent property for the recursive sequence. The supplied text does not state whether it has been resolved, so it is recorded as 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.