ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Fix a base b≥2b\geq 2. Write every u≥1u\geq 1 uniquely as a tower of powers of bb ending in 0<ω≤10<\omega\leq 1, and let ht⁡(u)\operatorname{ht}(u) be the height of this tower. Let K(n)K(n) denote the smallest number with exactly nn generators in base bb. Generalized Kaprekar height conjecture.

(i) If b=2b=2 and n≥2n\geq 2, then

ht⁡(K(n))=⌈log⁡2(n)⌉+3.\operatorname{ht}(K(n))=\left\lceil\log_2(n)\right\rceil+3.

(ii) If b=3b=3 and n≥3n\geq 3, then

ht⁡(K(n))=⌈log⁡2(n/5)⌉+4.\operatorname{ht}(K(n))=\left\lceil\log_2(n/5)\right\rceil+4.

(iii) If b≥4b\geq 4 is even and n≥2n\geq 2, then

ht⁡(K(n))=⌈log⁡2(n)⌉+2.\operatorname{ht}(K(n))=\left\lceil\log_2(n)\right\rceil+2.

(iv) If b≥5b\geq 5 is odd and n≥2n\geq 2, then

ht⁡(K(n))=⌈log⁡2(n)⌉+1.\operatorname{ht}(K(n))=\left\lceil\log_2(n)\right\rceil+1.

The conjecture is motivated by computed tables and describes the rapid growth of K(n)K(n) through exponential-tower height. The source offers computational evidence but no proof of these formulas.

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.