Sylvester power and weighted sums on the Frobenius set in arithmetic progression (Q2133405): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / OpenAlex ID
 
Property / OpenAlex ID: W4224092906 / rank
 
Normal rank

Revision as of 23:06, 19 March 2024

scientific article
Language Label Description Also known as
English
Sylvester power and weighted sums on the Frobenius set in arithmetic progression
scientific article

    Statements

    Sylvester power and weighted sums on the Frobenius set in arithmetic progression (English)
    0 references
    0 references
    29 April 2022
    0 references
    Let \(a_1,\ldots,a_k\) be positive coprime integers. Denote by \(NR(a_1,\ldots,a_k)\) the set of positive integers without nonnegative integer representations by \(a_1,\ldots,a_k\). Suppose \(\displaystyle s_{\mu}^{(\lambda)}(a_1,\ldots,a_k)=\sum_{n\in NR(a_1,\ldots,a_k)} n^{\mu}\). Then it is proved that \[s_{\mu}^{(1)}(a_1,\ldots,a_k)=\frac{1}{\mu+1}\sum_{\kappa=0}^{\mu} \binom{\mu+1}{\kappa}B_{\kappa} a_1^{\kappa-1} \sum_{i=1}^{a_1-1} m_i^{\mu+1-\kappa} +\frac{B_{\mu+1}}{\mu+1}(a_1^{\mu+1}-1),\] where \(B_{\mu}\) are Bernoulli numbers and \(m_i\) is a least positive integer such that \(m_i\equiv i \pmod {a_1}\) and \(m_i\not\in NR(a_1,\ldots,a_k)\). Also some more complicated formulas for weighted sums \(s_{\mu}^{(\lambda)}(a,a+d,\ldots,a+(k-1)d)\) are obtained.
    0 references
    Frobenius problem
    0 references
    Frobenius numbers
    0 references
    Sylvester numbers
    0 references
    Sylvester sums
    0 references
    power sums
    0 references
    weighted sums
    0 references
    arithmetic sequences
    0 references
    0 references

    Identifiers