Related papers: The Error Term In The Primes Counting Function
In previous work, the author has extended the concept of regular and irregular primes to the setting of arbitrary totally real number fields k_{0}, using the values of the zeta function \zeta_{k_{0}} at negative integers as our ``higher…
Motivated by the study of the summatory $k$-free indicator and totient functions in the classical setting, we investigate their function field analogues. First, we derive an expression for the error terms of the summatory functions in terms…
For the model problem of the heat equation discretized by an implicit Euler method in time and a conforming finite element method in space, we prove the efficiency of a posteriori error estimators with respect to the energy norm of the…
We remove logarithmic factors in error term estimates in asymptotic formulas for the number of solutions of a class of additive congruences modulo a prime number.
In this paper, we establish new bounds for classical prime-counting functions. All of our bounds are explicit and assume the Riemann Hypothesis. First, we prove that $|\psi(x) - x|$ and $|\vartheta(x) - x|$ are bounded from above by…
We use short divisor sums to approximate prime tuples and moments for primes in short intervals. By connecting these results to classical moment problems we are able to prove that a positive proportion of consecutive primes are within a…
The goal of this article is to study the discrepancy of the distribution of arithmetic sequences in arithmetic progressions. We will fix a sequence $\A=\{\a(n)\}_{n\geq 1}$ of non-negative real numbers in a certain class of arithmetic…
We investigate the probability that a random odd composite number passes a random Fermat primality test, improving on earlier estimates in moderate ranges. For example, with random numbers to $2^{200}$, our results improve on prior…
We study the logarithm of the least common multiple of the sequence of integers given by $1^2+1, 2^2+1,..., n^2+1$. Using a result of Homma on the distribution of roots of quadratic polynomials modulo primes we calculate the error term for…
These expository lectures focus on the distribution of zeros of the Riemann zeta function. The topics include the prime number theorem, the Riemann hypothesis, mean value theorems, and random matrix models.
We obtain for the Kempner series (i.e. harmonic series where certain digits are excluded from all denominators, for example the digit 9 in base 10) new representations as geometrically convergent series. The coefficients for these…
We look at upper bounds for the count of certain primes related to the Fermat numbers $F_n=2^{2^n}+1$ called elite primes. We first note an oversight in a result of Krizek, Luca and Somer and give the corrected, slightly weaker upper bound.…
n this paper, we state several conjectures regarding distribution of primes and of pairs of primes represented by irreducible homogeneous polynomial in two variables $f(a,b)$. We formulate conjectures with respect to the slope $t=b/a$ for…
Assuming a uniform $q$-variant of the prime $k$-tuple conjecture, we compute moments of the number of primes in arithmetic progressions to a large modulus $q$ as the residue classes vary. Consequently, depending on the size of $\varphi(q)$,…
In this paper, we introduced the theory of the sieve function transformation. Using the principle of sieve function transformation, we improved sieve method, and obtained the difference range of similar sieve function values. For this, we…
There are two basic number sequences which play a major role in the prime number distribution. The first Number Sequence SQ1 contains all prime numbers of the form 6n+5 and the second Number Sequence SQ2 contains all prime numbers of the…
Sums over inverse s-th powers of semiprimes and k-almost primes are transformed into sums over products of powers of ordinary prime zeta functions. Multinomial coefficients known from the cycle decomposition of permutation groups play the…
We establish an error term in the Sato-Tate theorem of Birch. That is, for $p$ prime, $q=p^r$ we show that $\#\{ (a,b) \in \mathbb{F}_q^2 : \theta_{a,b}\in I\} =\mu_{ST}(I)q^2 + O_r(q^{7/4})$ for any interval $I\subseteq[0,\pi]$ where for…
We establish rigorous error bounds for prime counting using a truncated Gaussian (TG) kernel in the explicit formula framework. Our main theorem proves that the approximation error remains globally below 1/2 for all sufficiently large…
In this paper, we make some conjectures on prime numbers that are sharper than those found in the current literature. First we describe our studies on Legendre's Conjecture which is still unsolved. Next, we show that Brocard's Conjecture…