Related papers: The Median Largest Prime Factor

Let $\varepsilon >0$. Let $f$ be a Steinhaus or Rademacher random multiplicative function. We prove that we have almost surely, as $x \to +\infty$, $$ \sum_{n \leqslant x} f(n) \ll \sqrt{x} (\log_2 x)^{\frac{3}{4}+ \varepsilon}. $$

Let $a>1$ be an integer. Denote by $l_a(n)$ the multiplicative order of $a$ modulo integer $n\geq 1$. We prove that there is a positive constant $\delta$ such that if $x^{1-\delta}\log^3 x = o(y)$, then $$ \frac1y \sum_{a<y} \frac1x…

Let $D<0$ be a fundamental discriminant and $h(D)$ be the class number of $\mathbb{Q}(\sqrt{D})$. Let $R(X,D)$ be the number of classes of the binary quadratic forms of discriminant $D$ which represent a prime number in the interval…

Let $s$ be a fixed positive integer constant, $\varepsilon$ be a fixed small positive number. Then, provided that a prime $p$ is large enough, we prove that for any set $\{{\mathcal M}\subseteq \mathbb F_p^*$ of size $|{\mathcal M}|=…

In this article, we give an asymptotic bound for the exponential sum of the M\"obius function $\sum_{n \le x} \mu(n) e(\alpha n)$ for a fixed irrational number $\alpha\in\mathbb{R}$. This exponential sum was originally studied by Davenport…

Given Mikhlin-H\"ormander multipliers $m_i$, $i=1,..., N$, with uniform estimates we prove an optimal $\sqrt{\log(N+1)}$ bound in $L^p$ for the maximal function $\sup_i|\cF^{-1}[m_i\hat f]|$ and related bounds for maximal functions…

We prove the infinitude of shifted primes $p-1$ without prime factors above $p^{0.2844}$. This refines $p^{0.2961}$ from Baker and Harman in 1998. Consequently, we obtain an improved lower bound on the the distribution of Carmichael…

The primorial $p\#$ of a prime $p$ is the product of all primes $q\le p$. Let pr$(n)$ denote the largest prime $p$ with $p\# \mid \phi(n)$, where $\phi$ is Euler's totient function. We show that the normal order of pr$(n)$ is $\log\log…

We estimate the local laws of the distribution of the middle prime factor of an integer, defined according to multiplicity or not. An asymptotic estimate with effective remainder is provided for a wide range of values. In particular this…

In this paper, we develop a novel analytic method to prove the prime number theorem in de la Vall\'ee Poussin's form: $$ \pi(x)=\operatorname{li}(x)+\mathcal O(xe^{-c\sqrt{\log x}}) $$ Instead of performing asymptotic expansion on Chebyshev…

We establish the optimal order of Malliavin-type remainders in the asymptotic density approximation formula for Beurling generalized integers. Given $\alpha\in (0,1]$ and $c>0$ (with $c\leq 1$ if $\alpha=1$), a generalized number system is…

We estimate from below the lower density of the set of prime numbers p such that p-1 has a prime factor of size at least p^c, where c lies in between 1/4 and 1/2. We also establish upper and lower bounds on the counting function of the set…

Let $f(n)$ be the number of distinct exponents in the prime factorization of the natural number $n$. We prove some results about the distribution of $f(n)$. In particular, for any positive integer $k$, we obtain that $$ \#\{n \leq x : f(n)…

For $(M,a)=1$, put \begin{equation*} G(X;M,a)=\sup_{p^\prime_n\leq X}(p^\prime_{n+1}-p^\prime_n), \end{equation*} where $p^\prime_n$ denotes the $n$-th prime that is congruent to $a\pmod{M}$. We show that for any positive $C$, provided $X$…

Two topics of the number theory are discussed in this paper. First, we prove that given each natural number $x\geq10^{3}$, we have \[ |{\rm Li}(x)-\pi(x)|\leq c\sqrt{x}\log x\texttt{ and } \pi(x)={\rm Li}(x)+O(\sqrt{x}\log x) \] where $c$…

Let $\alpha$ be a real number such that $1< \alpha <2$ and let $x_0=x_0(\alpha)$ be a {\rm(}unique{\rm)} positive solution of the equation $$ x^{\alpha-1} -\frac{\pi}{e^2\sqrt{3}}x +1=0. $$ Then we prove that for each positive integer…

For $a/q\in\mathbb{Q}$ the Estermann function is defined as $D(s,a/q):=\sum_{n\geq1}d(n)n^{-s}\operatorname{e}(n\frac aq)$ if $\Re(s)>1$ and by meromorphic continuation otherwise. For $q$ prime, we compute the moments of $D(s,a/q)$ at the…

Let $S(n)$ denote the least primary factor in the primary decomposition of the multiplicative group $M_n = (\Bbb Z/n\Bbb Z)^\times$. We give an asymptotic formula, with order of magnitude $x/(\log x)^{1/2}$, for the counting function of…

We prove that the primes below $x$ are, on average, equidistributed in arithmetic progressions to smooth moduli of size up to $x^{1/2+1/40-\epsilon}$. The exponent of distribution $\tfrac{1}{2} + \tfrac{1}{40}$ improves on a result of…

Let $x\geq 1$ be a large integer, and let $\mu:\mathbb{N}\longrightarrow\{-1,0,1\}$ be the Mobius function. This article proposes an effective asymptotic result for the autocorrelation function $\sum_{n \leq x} \mu(n) \mu(n+t) =O\left(…