ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a base-bb integer nn, let sb(n)s_b(n) denote the sum of its base-bb digits. A subpandigital prime (respectively, subpenholodigital prime) is a prime whose base-bb representation contains each digit 0,1,…,b−20,1,\ldots,b-2 (respectively, each digit 1,…,b−21,\ldots,b-2) at least once, while omitting b−1b-1 (respectively, omitting both 00 and b−1b-1).

Subpandigital and subpenholodigital prime digit-sum conjecture. For b>4b>4, the smallest subpandigital prime or smallest subpenholodigital prime nn satisfies sb(n)=(b−2)(b−1)/2+2s_b(n)=(b-2)(b-1)/2+2 for bb of the form 4k+34k+3, and satisfies sb(n)=(b−2)(b−1)/2+1s_b(n)=(b-2)(b-1)/2+1 otherwise.

The preceding theorems provide lower bounds and improve them for bases of the form 4k+34k+3. The conjecture is motivated by the displayed numerical table, and the supplied text gives no resolution.

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.