Related papers: On Some Finite Sums with Factorials
In this paper we study recurrences concerning the combinatorial sum $[n,r]_m=\sum_{k\equiv r (mod m)}\binom {n}{k}$ and the alternate sum $\sum_{k\equiv r (mod m)}(-1)^{(k-r)/m}\binom{n}{k}$, where m>0, $n\ge 0$ and r are integers. For…
In this note we prove results of the following types. Let be given distinct complex numbers $z_j$ satisfying the conditions $|z_j| = 1, z_j \not= 1$ for $j=1,..., n$ and for every $z_j$ there exists an $ i$ such that $z_i = \bar{z_j}. $…
For Dirichlet characters $\chi$ mod $k$ where $k\geq 3$, we here give a computable formula for evaluating the mean square sums $\sum\limits_{\substack{\chi \text{ mod }k\\\chi(-1)=(-1)^r}}|L(r,\chi)|^2$ for any positive integer $r\geq 3$.…
Let $G$ be an additive finite abelian group of order $n$, and let $S$ be a sequence of $n+k$ elements in $G$, where $k\geq 1$. Suppose that $S$ contains $t$ distinct elements. Let $\sum_n(S)$ denote the set that consists of all elements in…
F. Luca proved for any fixed rational number $\alpha>0$ that the Diophantine equations of the form $\alpha\,m!=f(n!)$, where $f$ is either the Euler function or the divisor sum function or the function counting the number of divisors, have…
The purpose of this note is to report on the discovery of the primes of the form $p=1+n!\sum n$, for some natural numbers $n>0$. The number of digits in the prime p are approximately equal to $\lfloor log_{10}(1+n!\sum n)\rceil+1$.
The main result of this paper is the following: for all $b \in \mathbb Z$ there exists $k=k(b)$ such that \[ \max \{ |A^{(k)}|, |(A+u)^{(k)}| \} \geq |A|^b, \] for any finite $A \subset \mathbb Q$ and any non-zero $u \in \mathbb Q$. Here,…
A sharp asymptotic formula for the sum of reciprocals of $\pi(n)$ is derived, where $\pi(x)$ is the number of primes not exceeding $x$. This result improves the previous results of De Koninck--Ivi\'c and L. Panaitopol.
Let $(a_n)_{n\geq 0}$ be an arbitrary sequence and $(a_{\lfloor n/k \rfloor})_{n\geq 0}$ its dual floor sequence. We study infinite series and finite generalized binomial sums involving $(a_{\lfloor n/k \rfloor})_{n\geq 0}$. As applications…
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…
The finite n-th polylogarithm li_n(z) in Z/p[z] is defined as the sum on k from 1 to p-1 of z^k/k^n. We state and prove the following theorem. Let Li_k:C_p to C_p be the p-adic polylogarithms defined by Coleman. Then a certain linear…
The main aim of this paper is to prove that the double inequality \frac{(k-1)!}{\Bigl\{x+\Bigl[\frac{(k-1)!}{|\psi^{(k)}(1)|}\Bigr]^{1/k}\Bigr\}^k}…
We investigate various properties of p-adic differential equations which have as a solution an analytic function of the form $F_k (x) = \sum_{n\geq 0} n! P_k (n) x^n$, where $P_k (n) = n^k + C_{k-1} n^{k-1} + ...+ C_0$ is a polynomial in n…
The generalized summation of divergent trigonometric series, namely by method of $\sigma_k(r,a)$-factors is considered in this paper. It is proved that such summation of Fourier series of periodical function $f(t)$ results in the…
We are interested in finding an explicit estimate to the binomial sum $Q_n(x)=\sum_{k=0}^{n} k! {n\choose k}^2 (-x)^{k}$ at $x=1$ for $n=0,1,2,\ldots$. Despite of its own interest the polynomial $Q_n(x)$ is important as the denominator in…
In this paper, we consider universal sums of generalized polygonal numbers. Fixing $m\in\mathbb{N}_{\geq 3}$, we show two finiteness theorems for universal sums of generalized polygonal numbers whose inputs have a restricted number $L$ of…
By applying the Newton-Gregory expansion to the polynomial associated with the sum of powers of integers $S_k(n) = 1^k + 2^k + \cdots + n^k$, we derive a couple of infinite families of explicit formulas for $S_k(n)$. One of the families…
A sequence of rational numbers as a generalization of the sequence of Bernoulli numbers is introduced. Sums of products involving the terms of this generalized sequence are then obtained using an application of the Fa\`a di Bruno's formula.…
We show that explicit forms for certain polynomials~$\psi^{(a)}_m(n)$ with the property \[ \psi^{(a+1)}_m(n) = \sum_{\nu=1}^n \psi_m^{(a)}(\nu) \] can be found (here, $a,m,n\in\mathbb{N}_0$). We use these polynomials as a basis to express…
A new general and unified method of summation, which is both regular and consistent, is invented. It is based on the idea concerning a way of integers reordering. The resulting theory includes a number of explicit and closed form summation…