ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let g(k)g(k) be the least positive integer such that for every pair of integers satisfying g(k)<a1<a2g(k)<a_1<a_2, there is a prime power pk≤ga1,a2p^k\le g_{a_1,a_2} of the form pk=a1x+a2yp^k=a_1x+a_2y with x,y∈Z≥0x,y\in\mathbb Z_{\ge 0}. Growth conjecture for g(k)g(k). For every given real number M>0M>0, one has

g(k)>Mkg(k)>M^k

for all sufficiently large kk. The conjecture concerns the asymptotic growth of the threshold beyond which every two-generator Frobenius problem contains a representable kkth prime power; the text supplies 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 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.