On Frobenius problem with restrictions on common divisors of coefficients

Abstract

Let m,s,t are positive integers with t≤ s-2 and a1,a2,…,as are positive integers such that (a1,a2,…,as-1)=1. In the paper we prove that every sufficiently large positive integer can be written in the form a1μ1+a2μ2+…+asμm, where positive integers μ1,μ2,…,μs have no common divisor being m-th power of a positive integer greater than 1 but each t of the values of μ1,μ2,…,μn have a common divisor being m-th power of a positive integer greater than 1. Moreover, we show that every sufficiently large positive integer can be written as a sum of positive integers μ1,μ2,…,μn with no common divisor being m-th power of a positive integer greater than 1 but each s-1 of the values of μ1,μ2,…,μs have a common divisor being m-th power of a positive integer greater than 1.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…