相关论文: Factorials as sums
Recently Dritschel proves that any positive multivariate Laurent polynomial can be factorized into a sum of square magnitudes of polynomials. We first give another proof of the Dritschel theorem. Our proof is based on the univariate matrix…
In the paper, the author elementarily unifies and generalizes eight identities involving the functions $\frac{\pm1}{e^{\pm t}-1}$ and their derivatives. By one of these identities, the author establishes two explicit formulae for computing…
Although in general there is no meaningful concept of factorization in fields, that in free associative algebras (over a commutative field) can be extended to their respective free field (universal field of fractions) on the level of…
For any given finite abelian group, we give factorizations of the group determinant in the group algebra of any subgroup. The factorizations are an extension of Dedekind's theorem. The extension leads to a generalization of Dedekind's…
We discuss the formal aspects of the factorial polynomials and of the associated series. We develop the theory using the formalism of quasi-monomials and prove the usefulness of the method for the solutions of nontrivial difference…
In this paper, we first present combinatorial proofs of a kind of expansions of the Eulerian polynomials of types A and B, and then we introduce Stirling permutations of the second kind. In particular, we count Stirling permutations of the…
In this note, we propose simple summations for primes, which involve two finite nested sums and Bernoulli numbers. The summations can also be expressed in terms of Bernoulli polynomials.
We show that every sufficiently large integer is a sum of a prime and two almost prime squares, and also a sum of a smooth number and two almost prime squares. The number of such representations is of the expected order of magnitude. We…
We present a proof given by Euler in his paper {\it ``De serierum determinatione seu nova methodus inveniendi terminos generales serierum"} \cite{E189} (E189:``On the determination of series or a new method of finding the general terms of…
We study an alternating sum involving factorials and Stirling numbers of the first kind. We give an exponential generating function for these numbers and show they are nonnegative and enumerate the number of increasing trees on $n$ vertices…
We introduce a new factorial function which agrees with the usual Euler gamma function at both the positive integers and at all half-integers, but which is also entire. We describe the basic features of this function.
The Euler-Maclaurin summation formula is generalized to a modified form by expanding the periodic Bernoulli polynomials as its Fourier series and taking cuts, which includes both the Euler-Maclaurin summation formula and the Poission…
We prove several new variants of the Lambert series factorization theorem established in the first article "Generating special arithmetic functions by Lambert series factorizations" by Merca and Schmidt (2017). Several characteristic…
Factorial series played a major role in Stirling's classic book "Methodus Differentialis" (1730), but now only a few specialists still use them. This article wants to show that this neglect is unjustified, and that factorial series are…
In this note we show a simple formula for the coefficients of the polynomial associated with the sums of powers of the terms of an arbitrary arithmetic progression. This formula consists of a double sum involving only ordinary binomial…
The main object of this paper is to find closed form expressions for finite and infinite sums that are weighted by $\omega(n)$, where $\omega(n)$ is the number of distinct prime factors of $n$. We then derive general convergence criteria…
Every natural number greater than two may be written as the sum of a prime and a square-free number. We establish several generalisations of this, by placing divisibility conditions on the square-free number.
We present a slightly more general version of Boole's additive formula for factorials as a simple consequence of Lagrange's Interpolating Polynomial theorem.
We generalize recent matrix-based factorization theorems for Lambert series generating functions generating the coefficients $(f \ast 1)(n)$ for some arithmetic function $f$. Our new factorization theorems provide analogs to these…
By simple elementary method,we obtain with ease,a highly simple expression for the remainder term of the divisor problem and use it to obtain an Euler-Maclaurin analogue of summation involving divisor function.We also obtain a relation…