Existence of the Nnamlerinchs constant
Statement
For a fixed base , define the Nnamlerinchs constant to be the smallest number greater than such that every sufficiently large integer can be written as the sum of at most reversed primes in base . Nnamlerinchs constant existence conjecture. For every ,
The paper notes that this is much weaker than the pure reversed-prime representation conjecture, but it is not known whether the constant is finite for any general base. A theorem in the paper shows that along an infinite sequence of bases the constants, when defined, have lower bounds of order .
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.