Subpandigital and subpenholodigital prime digit-sum conjecture
Statement
For a base- integer , let denote the sum of its base- digits. A subpandigital prime (respectively, subpenholodigital prime) is a prime whose base- representation contains each digit (respectively, each digit ) at least once, while omitting (respectively, omitting both and ).
Subpandigital and subpenholodigital prime digit-sum conjecture. For , the smallest subpandigital prime or smallest subpenholodigital prime satisfies for of the form , and satisfies otherwise.
The preceding theorems provide lower bounds and improve them for bases of the form . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.