← All problems

The coprime-coefficients conjecture for restricted Frobenius representations

4 years old · traced to

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.

References
  1. Piotr Miska and Maciej Zakarczemny, “On Frobenius problem with restrictions on common divisors of coefficients”, arXiv:2209.12562 (2022).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.