ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a fixed base b≥2b\geq 2, define the Nnamlerinchs constant K←b\overleftarrow{K}_b to be the smallest number greater than 11 such that every sufficiently large integer can be written as the sum of at most K←b\overleftarrow{K}_b reversed primes in base bb. Nnamlerinchs constant existence conjecture. For every b≥2b\geq 2,

K←b<∞.\overleftarrow{K}_b<\infty.

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 log⁡b\log b.

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.