Related papers: On the sums Sum((4k+1)^(-n),k,-inf,+inf)
We obtain two sequences of rational numbers which converge to the Euler-Gompertz constant. Denote by <f(x)> the integral of f(x)e^{-x} from 0 to infinity. Recall that the Euler-Gompertz constant \delta is <ln(x+1)>. Main idea. Let P_n(x) be…
For various positive integers $k$, the sums of $k$th powers of the first $n$ positive integers, $S_k(n+1)=1^k+2^k+...+n^k$, have got to be some of the most popular sums in all of mathematics. In this note we prove that for each $k\ge 2 $$…
With help of $q$-congruence, we prove the divisibility of some binomial sums. For example, for any integers $\rho,n\geq 2$, $$\sum_{k=0}^{n-1}(4k+1) \binom{2k}{k}^\rho \cdot (-4)^{\rho(n-1-k)} \equiv 0\pmod{2^{\rho-2}n\binom{2n}{n}}.$$
We establish some supercongruences related to a supercongruence of Van Hamme, such as \begin{align*} \sum_{k=0}^{(p+1)/2} (-1)^k (4k-1)\frac{(-\frac{1}{2})_k^3}{k!^3} &\equiv p(-1)^{(p+1)/2}+p^3(2-E_{p-3})\pmod{p^{4}},\\…
Let $p>3$ be a prime. We prove that $$\sum_{k=0}^{p-1}\binom{2k}{k}/2^k=(-1)^{(p-1)/2}-p^2E_{p-3} (mod p^3),$$ $$\sum_{k=1}^{(p-1)/2}\binom{2k}{k}/k=(-1)^{(p+1)/2}8/3*pE_{p-3} (mod p^2),$$…
A set A=A_{k,n} in [n]\cup{0} is said to be an additive k-basis if each element in {0,1,...,kn} can be written as a k-sum of elements of A in at least one way. Seeking multiple representations as k-sums, and given any function phi(n), with…
In a recent paper the authors studied the denominators of polynomials that represent power sums by Bernoulli's formula. Here we extend our results to power sums of arithmetic progressions. In particular, we obtain a simple explicit…
The aim of this paper is to prove wordlessly the sum formula of $1^{k}+2^{k}+\ldots +n^{k}$, $k\in\{1,2,3\}$.
In this paper, we prove two conjectures of Z.-W. Sun: $$2n\binom{2n}n\big|\sum_{k=0}^{n-1}(3k+1)\binom{2k}k^3{16}^{n-1-k}\ \mbox{for}\ \mbox{all}\ n=2,3,\cdots,$$ and $$\sum_{k=0}^{(p-1)/2}\frac{3k+1}{16^k}\binom{2k}{k}^3\equiv…
Lebesgue measurable subsets A and B of parallel or identical k-dimensional affine subspaces of Euclidean n-space E^n satisfy The Product Formula for Volume: Vol_k(A)Vol_k(B) = \sum_{J \in S(n,k)} Vol_k({\pi}_J(A))Vol_k({\pi}_J(B)). Here…
Already in 1734 Euler found a short explicit formula for the value of Riemann zeta function Zeta(s) when the argument s equals a positive integer 2n where n=1,2,3,. No such formula exists for odd positive integer arguments of Zeta. The…
In this paper Euler considers the properties of the pentagonal numbers, those numbers of the form $\frac{3n^2 \pm n}{2}$. He recalls that the infinite product $(1-x)(1-x^2)(1-x^3)...$ expands into an infinite series with exponents the…
Using a polylogarithmic identity, we express the values of $\zeta$ at odd integers $2n+1$ as integrals over unit $n-$dimensional hypercubes of simple functions involving products of logarithms. We also prove a useful property of those…
For positive integers $n>k$, let $P_{n,k}(x)=\displaystyle\sum_{j=0}^k \binom{n}{j}x^j $ be the polynomial obtained by truncating the binomial expansion of $(1+x)^n$ at the $k^{th}$ stage. These polynomials arose in the investigation of…
The Euler-Maclaurin formula which relates a discrete sum with an integral, is generalised to the setting of Riemann-Stieltjes sums and integrals on stochastic processes whose paths are a.s. rectifiable, namely, continuous and with bounded…
Using Fermat's two squares theorem and properties of cyclotomic polynomials, we prove assertions about when numbers of the form $a^{n}+1$ can be expressed as the sum of two integer squares. We prove that $a^n + 1$ is the sum of two squares…
In 1960, Sierpi\'nski proved that there exist infinitely many odd positive integers $k$ such that $k\cdot 2^n+1$ is composite for all positive integers $n$. In this paper, we prove some generalizations of Sierpi\'nski's theorem with $2^n$…
Let $$ A_{m,n}(a)=\sum_{j=0}^m (-4)^j {m+j\choose 2j}\sum_{k=0}^{n-1} \sin(a+2k\pi/n) \cos^{2j}(a+2k\pi/n) $$ and $$ B_{m,n}(a)=\sum_{j=0}^m (-4)^j {m+j+1\choose 2j+1}\sum_{k=0}^{n-1} \sin(a+2k\pi/n) \cos^{2j+1}(a+2k\pi/n), $$ where $m\geq…
We establish that almost every positive integer $n$ is the sum of four cubes, two of which are at most $n^{\theta}$, as long as $\theta\geq192/869$. An asymptotic formula for the number of such representations is established when…
Rotation symmetric Boolean functions are invariant under circular translation of indices. These functions have very rich cryptographic properties and have been used in different cryptosystems. Recently, Thomas Cusick proved that exponential…