Related papers: A Non-Sieving Application of the Euler Zeta Functi…
We derive new infinite series involving Fibonacci numbers and Riemann zeta numbers. The calculations are facilitated by evaluating linear combinations of polygamma functions of the same order at certain arguments.
We define the e\~ne product for the multiplicative group of polynomials and formal power series with coefficients on a commutative ring and unitary constant coefficient. This defines a commutative ring structure where multiplication is the…
We use the definition of a star (or Moyal or twisted) product to give a phasespace definition of the $\zeta$-function. This allows us to derive new closed expressions for the coefficients of the heat kernel in an asymptotic expansion for…
This translation has been published in Stephen Hawking (ed.), "God Created the Integers", published in 2007 by Running Press. There may have been some changes to the final published version and this copy. This is a translation from the…
In the paper, 2 explicit formulas for the Euler numbers of the second kind are obtained. Based on those formulas a exponential generating function is deduced. Using the generating function some well-known and new identities for the Euler…
In this Ph.D. dissertation (2018, Emory University) we prove theorems at the intersection of the additive and multiplicative branches of number theory, bringing together ideas from partition theory, $q$-series, algebra, modular forms and…
We develop a formal group--theoretic framework for the Riemann zeta function by treating its Euler product as an element of the multiplicative formal group $\widehat{\mathbb{G}}_m$ and its logarithm as the associated formal group logarithm.…
A formula for the Hurwitz zeta function at the positive integers $k$, $\zeta(k,b)$, is created by solving the real and the imaginary parts separately and then combining them. A few different formulae for the Hurwitz zeta function are known…
The values of the Riemann zeta function at odd positive integers, $\zeta(2n+1)$, are shown to admit a representation proportional to the finite-part of the divergent integral $\int_0^{\infty} t^{-2n-1} \operatorname{csch}t\,\mathrm{d}t$.…
We unify in a large class of additive functions the results obtained in the first part of this work. The proof rests on series involving the Riemann zeta function and certain sums of primes which may have their own interest.
In this document, prime numbers are related as functions over time, mimicking the Sieve of Eratosthenes. For this purpose, the mathematical representation is a uni-dimentional time line depicting the number line for positive natural numbers…
We identify a partition-theoretic generalization of Riemann zeta function and the equally positive integer-indexed harmonic sums at infinity, to obtain the generating function and the integral representations of the latter. The special…
We show that for a non-positive value of the first variable,Hurwitz zeta function becomes a polynomial in the second variable. We show this, using 'integration approach', instead of 'power series approach', which we had resorted to, in our…
We prove that the error in the prime number theorem can be quantitatively improved beyond the Riemann Hypothesis bound by using versions of Montgomery's conjecture for the pair correlation of zeros of the Riemann zeta-function which are…
Suppose $p$ is a prime, $t$ is a positive integer, and $f\!\in\!\mathbb{Z}[x]$ is a univariate polynomial of degree $d$ with coefficients of absolute value $<\!p^t$. We show that for any fixed $t$, we can compute the number of roots in…
Because of its relation to the distribution of prime numbers, the Riemann zeta function {\zeta} (s) is one of the most important functions in mathematics. The zeta function is defined by the following formula for any complex number s with…
When investigating the distribution of the Euler totient function, one encounters sets of primes P where if p is in P then r is in P for all r|(p-1). While it is easy to construct finite sets of such primes, the only infinite set known is…
In many simple integral domains, such as $\mathbb{Z}$ or $\mathbb{Z}[i]$, there is a straightforward procedure to determine if an element is prime by simply reducing to a direct check of finitely many potential divisors. Despite the fact…
We introduce and consider a certain probability question involving elementary number theory and the likelihood that a fixed prime will appear in a certain recursively defined factorization of an integer. We derive several convergent…
For a commutative ring $R$, a polynomial $f\in R[x]$ is called separable if $R[x]/f$ is a separable $R$-algebra. We derive formulae for the number of separable polynomials when $R = \mathbb{Z}/n$, extending a result of L. Carlitz. For…