We study the set D of positive integers d for which the equation $ϕ(a)-ϕ(b)=d$ has infinitely many solution pairs (a,b), where $ϕ$ is Euler's totient function. We show that the minumum of D is at most 154, exhibit a specific A so that every multiple of A is in D, and show that any progression a mod d with 4|a and 4|d, contains infinitely many elements of D. We also show that the Generalized Elliott-Halberstam Conjecture, as defined in [6], implies that D equals the set of all positive, even integers.
We find an interesting relationship between the golden ratio, the Moebius function, the Euler totient function and the natural logarithm - central players in the theory of numbers. A number of identities involving the golden ratio and its reciprocal are proved, including an expression for the base of the natural logarithm. The theorem and corollaries highlight a connection between the golden ratio and the factorization of integers that is not obvious; and display a sort of inverse relationship between the Moebius function and Euler totient function.
We discuss recent advances on weak forms of the Prime $k$-tuple Conjecture, and its role in proving new estimates for the existence of small gaps between primes and the existence of large gaps between primes.
We study the value-distribution of Dirichlet polynomials on the critical line $\Re(s)=\tfrac{1}{2}$. As a consequence, we prove a corollary on small consecutive gaps between zeros of the Riemann zeta function. We also examine the distribution of zeros under the so-called alternative hypothesis and present a new approach to the problem of gaps between the zeros.
We prove that there exist infinitely many consecutive zeros of the Riemann zeta-function on the critical line whose gaps are greater than $3.18$ times the average spacing. Using a modification of our method, we also show that there are even larger gaps between the multiple zeros of the zeta function on the critical line (if such zeros exist).
We study the first occurrences of gaps between primes in the arithmetic progression (P): $r$, $r+q$, $r+2q$, $r+3q,\ldots,$ where $q$ and $r$ are coprime integers, $q>r\ge1$. The growth trend and distribution of the first-occurrence gap sizes are similar to those of maximal gaps between primes in (P). The histograms of first-occurrence gap sizes, after appropriate rescaling, are well approximated by the Gumbel extreme value distribution. Computations suggest that first-occurrence gaps are much more numerous than maximal gaps: there are $O(\log^2 x)$ first-occurrence gaps between primes in (P) …
We derive heuristically formula for the $k$--moments $M_k(x)$ of the gaps between consecutive primes$<x $ represented directly by $x$$π(x)$ --- the number of primes up to: $M_k(x)= Γ(k+1)x^k/π^{k-1}(x)+\mathcal{O}(x)$, We illustrate obtained results by computer data.
Let $r \ge 2$ be an integer. We adapt the Maynard-Tao sieve to produce the asymptotically best-known bounded gaps between products of $r$ distinct primes. Our result applies to positive-density subsets of the primes that satisfy certain equidistribution conditions. This improves on the work of Thorne and Sono.
In 1931, Van der Corput showed that if for each positive integer $s$, the sequence $\{x_{n+s}-x_n\}$ is uniformly distributed (mod 1), then the sequence $x_n$ is uniformly distributed (mod 1). The converse of above result is surprisingly not true. The distribution of consecutive gaps of an equidistributed sequence has been studied widely in the literature. In this paper, we have studied the distribution of gaps between one or more equidistributed sequences. Under certain conditions, we could study the distribution effectively. As applications, we study the equidistribution of gaps between eige…
We survey some past conditional results on the distribution of large differences between consecutive primes and examine how the Hardy-Littlewood prime k-tuples conjecture can be applied to this question.
In this paper, we apply the method of Maynard and Tao to the set of products of two distinct primes (E2-numbers). We obtain several results on the distribution of E2-numbers and primes. Among others, the result of Goldston, Pintz, Yildirim and Graham on small gaps between m consecutive E2-numbers is improved.
Let $K$ be a quadratic number field and $ζ_K(s)$ be the associated Dedekind zeta-function. We show that there are infinitely many normalized gaps between consecutive zeros of $ζ_K(s)$ on the critical line which are greater than $2.866$ times the average spacing.
We show that there exists pairs of consecutive primes less than $x$ whose difference is larger than $t(1+o(1))(\log{x})(\log\log{x})(\log\log\log\log{x})(\log\log\log{x})^{-2}$ for any fixed $t$. Our proof works by incorporating recent progress in sieve methods related to small gaps between primes into the Erdos-Rankin construction. This answers a well-known question of Erdos.
We derive heuristically approximate formulas for the negative $k$--moments $M_{-k}(x)$ of the gaps between consecutive primes$<x $ represented directly by $π(x)$ --- the number of primes up to $x$. In particular we propose an analytical formula for the sum of reciprocals of gaps between consecutive primes $<x : ~ M_{-1}(x)\sim \frac{π^2(x)}{x-2π(x)}\log\Big(\frac{x}{2π(x)}\Big) \sim x \log \log(x)/\log^2(x)$. We illustrate obtained results by the enormous computer data up to $x=4\times 10^{18}$.
We show assuming RH that phenomena concerning pairs of zeros established $via$ pair correlations occur with positive density (with at most a slight adjustment of the constants). Also, while a double zero is commonly considered to be a close pair, we consider the difference between two $distinct$ zeros.
Suppose that $1<c<9/8$. For any $m\geq 1$, there exist infinitely many $n$ such that $$ \{[n^c],\ [(n+1)^c],\ \ldots,\ [(n+k_0)^c]\} $$ contains at least $m+1$ primes, if $k_0$ is sufficiently large (only depending on $m$).
In this note, we prove Selberg's announced result on $r$-gaps between zeros of the Riemann zeta-function $ζ$. Our proof uses a result on variations of $\argζ$ by Tsang based on Selberg's method. The same result with explicit constants under the Riemann Hypothesis has been obtained by Conrey and Turnage-Butterbaugh using a different method. We explain how to obtain explicit constants under the Riemann Hypothesis using our approach which is based on Selberg's and Tsang's arguments.
Baker, Harman, and Pintz showed that a weak form of the Prime Number Theorem holds in intervals of the form $[x-x^{0.525},x]$ for large $x$. In this paper, we extend a result of Maynard and Tao concerning small gaps between primes to intervals of this length. More precisely, we prove that for any $δ\in [0.525,1]$ there exist positive integers $k,d$ such that for sufficiently large $x$, the interval $[x-x^δ,x]$ contains $\gg_{k} \frac{x^δ}{(\log x)^k}$ pairs of consecutive primes differing by at most $d$. This confirms a speculation of Maynard that results on small gaps between primes can be re…
We make explicit an argument of Heath-Brown concerning large and small gaps between nontrivial zeroes of the Riemann zeta-function, $ζ(s)$. In particular, we provide the first unconditional results on gaps (large and small) which hold for a positive proportion of zeroes. To do this we prove explicit bounds on the second and fourth power moments of $S(t+h)-S(t)$, where $S(t)$ denotes the argument of $ζ(s)$ on the critical line and $h \ll 1 / \log T$. We also use these moments to prove explicit results on the density of the nontrivial zeroes of $ζ(s)$ of a given multiplicity.
For $s=3,4$, we prove the existence of arbitrarily long sequences of consecutive integers none of which is a sum of $s$ nonnegative $s$-th powers. More generally, we study the existence of gaps between the values $\leq N$ of diagonal forms of degree $s$ in $s$ variables with positive integer coefficients. We find: (1) gaps of size $O\left(\frac{\sqrt {\log N}}{(\log \log N)^2}\right)$ when $s=3$; (2) gaps of size $O\left(\frac{\log\log\log N}{\log\log\log\log N}\right)$ if $s=4$ and the form, up to permutation of the variables, is not equal to $a (c_1x_1)^4+b (c_2 x_2)^4+4 a (c_3x_3)^4+4b(c_4x…
Suppose $a^2 (a^2 + 1)$ divides $b^2 (b^2 + 1)$ with $b > a$. In this paper, we improve a previous result and prove a gap principle, without any additional assumptions, namely $b \gg a (\log a)^{1/8} / (\log \log a)^{12}$. We also obtain $b \gg_εa^{15/14 - ε}$ under the abc conjecture.
