ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let s≥3s\ge 3. Let aka_k, where k∈[s]k\in [s], be positive integers such that (a1,a2,…,as)=1(a_1,a_2,\ldots,a_s)=1. Then Ss,s−2m(a1,a2,…,as)S_{s,s-2}^m(a_1,a_2,\ldots,a_s) denotes the set of positive integers satisfying the paper's restricted Frobenius representation conditions. Coprime-coefficients conjecture. There exists a computable constant c=c(a1,a2,…,as)c=c(a_1,a_2,\ldots,a_s) such that every positive integer at least equal to cc belongs to the set Ss,s−2m(a1,a2,…,as)S_{s,s-2}^m(a_1,a_2,\ldots,a_s). The conjecture asks whether the paper's result remains valid when the assumption (a1,a2,…,as−1)=1(a_1,a_2,\ldots,a_{s-1})=1 is weakened to (a1,a2,…,as)=1(a_1,a_2,\ldots,a_s)=1; the source presents this as an open problem and offers 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.