Sylvester sums on the Frobenius set in arithmetic progression

preprint2022arXivOpen access

Abstract

Let a1,a2,…,aka_1,a_2,\dots,a_k be positive integers with gcd⁡(a1,a2,…,ak)=1\gcd(a_1,a_2,\dots,a_k)=1. The concept of the weighted sum ∑n∈NRλn\sum_{n\in{\rm NR}}λ^{n} is introduced in \cite{KZ0,KZ}, where NR=NR(a1,a2,…,ak){\rm NR}={\rm NR}(a_1,a_2,\dots,a_k) denotes the set of positive integers nonrepresentable in terms of a1,a2,…,aka_1,a_2,\dots,a_k. When λ=1λ=1, such a sum is often called Sylvester sum. The main purpose of this paper is to give explicit expressions of the Sylvester sum (λ=1λ=1) and the weighed sum (λ≠1λ\ne 1), where a1,a2,…,aka_1,a_2,\dots,a_k forms arithmetic progressions. As applications, various other cases are also considered, including weighted sums, almost arithmetic sequences, arithmetic sequences with an additional term, and geometric-like sequences. Several examples illustrate and confirm our results.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.