AbstractThe alternate Sylvester sums are Tm(a,b)=∑n∈NR(−1)nnm, where a and b are coprime, positive integers, and NR is the Frobenius set associated with a and b. In this note, we study the generating functions, recurrences and explicit expressions of the alternate Sylvester sums. It can be found that the results are closely related to the Bernoulli polynomials, the Euler polynomials, and the (alternate) power sums over the natural numbers
We give a new identity involving Bernoulli polynomials and combinatorial numbers. This provides, in ...
Let $a_1,a_2,\dots,a_k$ be positive integers with $\gcd(a_1,a_2,\dots,a_k)=1$. Frobenius number is t...
We present here a further investigation for the classical Frobenius-Euler polynomials. By making use...
AbstractIn 1853 Sylvester introduced a family of double-sum expressions for two finite sets of indet...
AbstractIn the Frobenius problem with two variables, one is given two positive integers a and b that...
Abstract. We observe that the classical Faulhaber’s theorem on sums of odd powers also holds for an ...
AbstractWe observe that the classical Faulhaber’s theorem on sums of odd powers also holds for an ar...
AbstractIn 1853, Sylvester introduced a family of double sum expressions for two finite sets of inde...
J. J. Sylvester has announced formulas expressing the subresultants (or the successive polynomial re...
AbstractIn the Frobenius problem with two variables, one is given two positive integers a and b that...
AbstractSylvester has announced formulas expressing the subresultants (or the successive polynomial ...
AbstractSylvester double sums, introduced first by Sylvester (see Sylvester (1840, 1853)), are symme...
Abstract The main purpose of this paper is, using the generating function methods and summation tran...
We give a new identity involving Bernoulli polynomials and combinatorial numbers. This provides, in ...
We give a new identity involving Bernoulli polynomials and combinatorial numbers. This provides, in ...
We give a new identity involving Bernoulli polynomials and combinatorial numbers. This provides, in ...
Let $a_1,a_2,\dots,a_k$ be positive integers with $\gcd(a_1,a_2,\dots,a_k)=1$. Frobenius number is t...
We present here a further investigation for the classical Frobenius-Euler polynomials. By making use...
AbstractIn 1853 Sylvester introduced a family of double-sum expressions for two finite sets of indet...
AbstractIn the Frobenius problem with two variables, one is given two positive integers a and b that...
Abstract. We observe that the classical Faulhaber’s theorem on sums of odd powers also holds for an ...
AbstractWe observe that the classical Faulhaber’s theorem on sums of odd powers also holds for an ar...
AbstractIn 1853, Sylvester introduced a family of double sum expressions for two finite sets of inde...
J. J. Sylvester has announced formulas expressing the subresultants (or the successive polynomial re...
AbstractIn the Frobenius problem with two variables, one is given two positive integers a and b that...
AbstractSylvester has announced formulas expressing the subresultants (or the successive polynomial ...
AbstractSylvester double sums, introduced first by Sylvester (see Sylvester (1840, 1853)), are symme...
Abstract The main purpose of this paper is, using the generating function methods and summation tran...
We give a new identity involving Bernoulli polynomials and combinatorial numbers. This provides, in ...
We give a new identity involving Bernoulli polynomials and combinatorial numbers. This provides, in ...
We give a new identity involving Bernoulli polynomials and combinatorial numbers. This provides, in ...
Let $a_1,a_2,\dots,a_k$ be positive integers with $\gcd(a_1,a_2,\dots,a_k)=1$. Frobenius number is t...
We present here a further investigation for the classical Frobenius-Euler polynomials. By making use...
DOI
Add to ORKG