The <i>p</i>-Numerical Semigroup of the Triple of Arithmetic Progressions

Abstract

For given positive integers a1,a2,⋯,ak with gcd(a1,a2,⋯,ak)=1, the denumerant d(n)=d(n;a1,a2,⋯,ak) is the number of nonnegative solutions (x1,x2,⋯,xk) of the linear equation a1x1+a2x2+⋯+akxk=n for a positive integer n. For a given nonnegative integer p, let Sp=Sp(a1,a2,⋯,ak) be the set of all nonnegative integer n’s such that d(n)>p. In this paper, by introducing the p-numerical semigroup, where the set N0\Sp is finite, we give explicit formulas of the p-Frobenius number, which is the maximum of the set N0\Sp, and related values for the triple of arithmetic progressions. The main aim is to determine the elements of the p-Apéry set.

Keywords

• Frobenius problem
• Frobenius numbers
• number of representations
• arithmetic progressions