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 pandigital prime (respectively, penholodigital prime) is a prime whose base-bb representation contains every digit 0,1,…,b−10,1,\ldots,b-1 (respectively, every nonzero digit 1,…,b−11,\ldots,b-1) at least once.

Pandigital and penholodigital prime digit-sum conjecture. For b>3b>3, the smallest pandigital prime or penholodigital prime nn satisfies sb(n)=b(b−1)/2+2s_b(n)=b(b-1)/2+2 if bb is of the form 4k+34k+3, and satisfies sb(n)=b(b−1)/2+1s_b(n)=b(b-1)/2+1 otherwise.

The preceding theorems establish corresponding lower bounds, with the stronger bound in bases of the form 4k+34k+3. Numerical experiments are cited as evidence, but the conjecture is not resolved in the supplied text.

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.