ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let the tetration base aa be greater than 11. Let len⁡(a)∈N−{0}\operatorname{len}(a) \in \mathbb{N}-\{0\} satisfy

10len⁡(a)−1≤a<10len⁡(a),10^{\operatorname{len}(a)-1} \leq a < 10^{\operatorname{len}(a)},

so that len⁡(a)\operatorname{len}(a) is the number of digits of aa. For a≢{0,3,7}(mod10)a \not\equiv \{0,3,7\} \pmod {10}, the congruence speed V(a,b)V(a,b) stabilizes at V(a)V(a) whenever

b≥len⁡(a)+2.b \geq \operatorname{len}(a)+2.

Congruence speed stabilization conjecture. If a≢{0,3,7}(mod10)a \not\equiv \{0,3,7\} \pmod {10} and b≥len⁡(a)+2b \geq \operatorname{len}(a)+2, then V(a,b)=V(a)V(a,b)=V(a). This gives a sufficient tetration height for stabilization of the congruence speed.

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.