We discuss the summation of certain series defined by counting blocks of digits in the $B$-ary expansion of an integer. For example, if $s_2(n)$ denotes the sum of the base-2 digits of $n$, we show that $\sum_{n \geq 1} s_2(n)/(2n(2n+1)) = (γ+ \log \frac{4}π)/2$. We recover this previous result of Sondow in math.NT/0508042 and provide several generalizations.
We prove hypergeometric type summation identities for a function defined in terms of quotients of the $p$-adic gamma function by counting points on certain families of hyperelliptic curves over $\mathbb{F}_{q}$. We also find certain special values of that function.
A method is described to sum multi-dimensional arithmetic functions subject to hyperbolic summation conditions, provided that asymptotic formulae in rectangular boxes are available. In combination with the circle method, the new method is a versatile tool to count rational points on algebraic varieties defined by multi-homogeneous diagonal equations.
This study involves definitions for multiple-counting regular and summation sequences of rho. My paper introduces and proves recurrent relationships for multiple-counting sequences and shows their association with Fermat's little theorem. I also studied matrix representations and obtained generalized Binet formulas for defined sequences. As a result of multiple-counting sequence explanation, this study leads to a better understanding for distribution of composite numbers between consecutive bases.
We find summation identities and transformations for the McCarthy's $p$-adic hypergeometric series by evaluating certain Gauss sums which appear while counting points on the family $$Z_λ: x_1^d+x_2^d=dλx_1x_2^{d-1}$$ over a finite field $\mathbb{F}_p$. A. Salerno expresses the number of points over a finite field $\mathbb{F}_p$ on the family $Z_λ$ in terms of quotients of $p$-adic gamma function under the condition that $d|p-1$. In this paper, we first express the number of points over a finite field $\mathbb{F}_p$ on the family $Z_λ$ in terms of McCarthy's $p$-adic hypergeometric series for a…
We establish a central limit theorem for counting large continued fraction digits $(a_n)$, i.e. we count occurrences $\{a_n>b_n\}$, where $(b_n)$ is a sequence of positive integers. Our result improves a similar result by Philipp which additionally assumes that $b_n$ tends to infinity. Moreover, we give a refinement of the famous Borel-Bernstein Theorem for continued fractions regarding the event that the $n$-th continued fraction digit lies infinitely often between $d_n$ and $d_n(1+1/c_n)$ for given sequences $(c_n)$ and $(d_n)$. Also for these sets we obtain a central limit theorem. As an in…
We evaluate in closed form series of the type $\sum u(n) R(n)$, where $(u(n))_n$ is a strongly $B$-multiplicative sequence and $R(n)$ a (well-chosen) rational function. A typical example is: $$ \sum_{n \geq 1} (-1)^{s_2(n)} \frac{4n+1}{2n(2n+1)(2n+2)} = -\frac{1}{4} $$ where $s_2(n)$ is the sum of the binary digits of the integer $n$. Furthermore closed formulas for series involving automatic sequences that are not strongly $B$-multiplicative, such as the regular paperfolding and Golay-Shapiro-Rudin sequences, are obtained; for example, for integer $d \geq 0$: $$ \sum_{n \geq 0} \frac{v(n)}{(n…
We present a new result on counting primes $p<N=2^n$ for which $r$ (arbitrarily placed) digits in the binary expansion of $p$ are specified. Compared with earlier work of Harman and Katai, the restriction on $r$ is relaxed to $r< c\Big(\frac n{\log n}\Big)^{4/7}$. This condition results from the estimates of Gallagher and Iwaniec on zero-free regions of $L$-functions with `powerful' conductor.
A semiprime is a natural number which can be written as the product of two primes. The asymptotic behaviour of the function $π_2(x)$, the number of semiprimes less than or equal to $x$, is studied. Using a combinatorial argument, asymptotic series of $π_2(x)$ is determined, with all the terms explicitly given. An algorithm for the calculation of the constants involved in the asymptotic series is presented and the constants are computed to 20 significant digits. The errors of the partial sums of the asymptotic series are investigated. A generalization of this approach to products of $k$ primes,…
Prime number theorem asserts that (at large $x$) the prime counting function $π(x)$ is approximately the logarithmic integral $\mbox{li}(x)$. In the intermediate range, Riemann prime counting function $\mbox{Ri}^{(N)}(x)=\sum_{n=1}^N \frac{μ(n)}{n}\mbox{Li}(x^{1/n})$ deviates from $π(x)$ by the asymptotically vanishing sum $\sum_ρ\mbox{Ri}(x^ρ)$ depending on the critical zeros $ρ$ of the Riemann zeta function $ζ(s)$. We find a fit $π(x)\approx \mbox{Ri}^{(3)}[ψ(x)]$ [with three to four new exact digits compared to $\mbox{li}(x)$] by making use of the Von Mangoldt explicit formula for the Cheby…
Leonhard Euler likely developed his summation formula in 1732, and soon used it to estimate the sum of the reciprocal squares to 14 digits --- a value mathematicians had been competing to determine since Leibniz's astonishing discovery that the alternating sum of the reciprocal odd numbers is exactly $π/4$. This competition came to be known as the Basel Problem, and Euler's approximation probably spurred his spectacular solution in the same year. Subsequently he connected his summation formula to Bernoulli numbers, and applied it to many other topics, masterfully circumventing that it almost a…
We solve multiple conjectures by Byszewski and Ulas about the sum of base $b$ digits function. In order to do this, we develop general results about summations over the sum of digits function. As a corollary, we describe an unexpected new result about the Prouhet-Tarry-Escott problem. In some cases, this allows us to partition fewer than $b^N$ values into $b$ sets $\{S_1,\ldots,S_b\}$, such that $$\sum_{s\in S_1}s^k = \sum_{s\in S_2}s^k = \cdots = \sum_{s\in S_b}s^k $$ for $0\leq k \leq N-1$. The classical construction can only partition $b^N$ values such that the first $N$ powers agree. Our r…
The main aim of this paper is to study an analogue of the generalized divisor function in a number field $\mathbb{K}$, namely, $σ_{\mathbb{K},α}(n)$. The Dirichlet series associated to this function is $ζ_{\mathbb{K}}(s)ζ_{\mathbb{K}}(s-α)$. We give an expression for the Riesz sum associated to $σ_{\mathbb{K},α}(n),$ and also extend the validity of this formula by using convergence theorems. As a special case, when $\mathbb{K}=\mathbb{Q}$, the Riesz sum formula for the generalized divisor function is obtained, which, in turn, for $α=0$, gives the Vorono\"ı summation formula associated to the d…
