Pandigital and penholodigital prime digit-sum conjecture
Statement
For a base- integer , let denote the sum of its base- digits. A pandigital prime (respectively, penholodigital prime) is a prime whose base- representation contains every digit (respectively, every nonzero digit ) at least once.
Pandigital and penholodigital prime digit-sum conjecture. For , the smallest pandigital prime or penholodigital prime satisfies if is of the form , and satisfies otherwise.
The preceding theorems establish corresponding lower bounds, with the stronger bound in bases of the form . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.