ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Write a positive integer nn in base 33 as n=d1d2…dmn=d_1d_2\ldots d_m, with digits di∈{0,1,2}d_i\in\{0,1,2\}, and let cn(n)cn(n) denote its comma-number. The notation dmd1d_md_1 denotes the two-digit base-33 number formed from the last and first digits. Ternary comma-number conjecture. In base 33, cn(n)cn(n) is dmd1d_md_1, except for the following cases:

ncn(n)correction1 2i 1 (i≥1)12+11 2i j 2 (i≥0, j=0,1,2)22+12 or 2221+1 or −12i 1 (i≥0)11−12i j 2 (i≥0, j=0,1,2)21−12i 11 (i≥0)does not existnone\begin{array}{|c|c|c|} \hline n & cn(n) & \text{correction}\\ \hline 1\,2^i\,1\ (i\geq 1) & 12 & +1\\ 1\,2^i\,j\,2\ (i\geq 0,\ j=0,1,2) & 22 & +1\\ 2\ \text{or}\ 22 & 21 & +1\ \text{or}\ -1\\ 2^i\,1\ (i\geq 0) & 11 & -1\\ 2^i\,j\,2\ (i\geq 0,\ j=0,1,2) & 21 & -1\\ 2^i\,11\ (i\geq 0) & \text{does not exist} & \text{none}\\ \hline \end{array}

Here the correction is the amount added to the base-33 number dmd1d_md_1. The rule is presented as a precise empirical description of the ternary comma-number function; the authors state that they do not give a formal proof.

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.