Related papers: Restricted Sum Formula of Alternating Euler Sums

We shall given a new effectively computable upper bound of odd perfect numbers whose Euler factors are powers of fixed exponent, improving our old result in T. Yamada, Colloq. Math. 103 (2005), 303--307.

For a fixed unit vector a=(a_1,a_2,...,a_n) in S^{n-1}, i.e. sum_{i=1}^n a_i^2=1, we consider the 2^n sign vectors epsilon=(epsilon_1,epsilon_2,...,epsilon_n) in {-1,1}^n and the corresponding scalar products a.epsilon=sum_{i=1}^n a_i…

Dating back to Euler, in classical analysis and number theory, the Hurwitz zeta function $$ \zeta(z,q)=\sum_{n=0}^{\infty}\frac{1}{(n+q)^{z}}, $$ the Riemann zeta function $\zeta(z)$, the generalized Stieltjes constants $\gamma_k(q)$, the…

We use recently obtained bounds for sums of Kloosterman sums to bound the sum $\sum_{-D\leq d\leq D} \int_{-D}^D |\zeta(1/2+it,\lambda^d)|^4| \sum_{0<|\mu|^2\leq M} A(\mu)\lambda^d((\mu)) |\mu|^{-2it}|^2 {\rm d}t$, where $\lambda^d$ is the…

The Euler--Maclaurin (EM) summation formula is used in many theoretical studies and numerical calculations. It approximates the sum $\sum_{k=0}^{n-1} f(k)$ of values of a function $f$ by a linear combination of a corresponding integral of…

Recently, Bordell\'{e}s, Dai, Heyman, Pan and Shparlinski in \cite{Igor} considered a partial sum involving the Euler totient function and the integer parts $\lfloor x/n\rfloor$ function. Among other things, they obtained reasonably tight…

We consider finite iterated generalized harmonic sums weighted by the binomial $\binom{2k}{k}$ in numerators and denominators. A large class of these functions emerges in the calculation of massive Feynman diagrams with local operator…

We present several sequences involving harmonic numbers and the central binomial coefficients. The calculational technique is consists of a special summation method that allows, based on proper two-valued integer functions, to calculate…

For k <= n, let E(2n,k) be the sum of all multiple zeta values with even arguments whose weight is 2n and whose depth is k. Of course E(2n,1) is the value of the Riemann zeta function at 2n, and it is well known that E(2n,2) = (3/4)E(2n,1).…

We investigate the approximation for computing the sum $a_1+...+a_n$ with an input of a list of nonnegative elements $a_1,..., a_n$. If all elements are in the range $[0,1]$, there is a randomized algorithm that can compute an…

In this series we examine the calculation of the $2k$th moment and shifted moments of the Riemann zeta-function on the critical line using long Dirichlet polynomials and divisor correlations. The present paper is concerned with the precise…

A generating function is given for the number, $E(l,k)$, of irreducible $k$-fold Euler sums, with all possible alternations of sign, and exponents summing to $l$. Its form is remarkably simple: $\sum_n E(k+2n,k) x^n = \sum_{d|k}\mu(d)…

We prove weighted versions of the 2D Restriction Conjecture for the unit sphere in $\mathbb{R}^2$. Our results involve the weight functions $(1+|x|)^\alpha(1+|y|)^\beta$ and $(1+|x|+|y|)^\gamma$ with $\alpha,\beta,\gamma\geq 0$.

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…

We give asymptotics for shifted convolutions of the form $$\sum_{n < X} \frac{\sigma_{2u}(n,\chi)\sigma_{2v}(n+k,\psi)}{n^{u+v}}$$ for nonzero complex numbers $u,v$ and nontrivial Dirichlet characters $\chi,\psi$. We use the technique of…

The alternating-runs polynomial enumerates alternating runs in the symmetric group. There are three formulae for the number of permutations, $R_{n,k}$ in $\mathfrak{S}_n$ with $k$ alternating runs, but all of them are complicated. We show…

Professor Georges Rhin considers a nonzero algebraic integer $\a$ with conjugates $\a_1=\a, \ldots, \a_d$ and asks what can be said about $\d \sum_{ | \a_i | >1} | \a_i |$, that we denote ${\rm{R}}(\a)$. If $\a$ is supposed to be a totally…

The aim of this article is to define some new families of the special numbers. These numbers provide some further motivation for computation of combinatorial sums involving binomial coefficients and the Euler kind numbers of negative order.…

We represent the Euler alternating series (sometimes called the "Dirichlet eta function"), and generally $(b^s-b)\zeta(s)/b^s$ for $b>1$ an integer, in the half-plane $\Re s>0$, via series dominated by geometric series, with arbitrarily…

The Erd\H{o}s discrepancy problem, now a theorem by T. Tao, asks whether every sequence with values plus or minus one has unbounded discrepancy along all homogeneous arithmetic progressions. We establish weighted variants of this problem,…