English
Related papers

Related papers: The Median Largest Prime Factor

200 papers

We provide examples of multiplicative functions $f$ supported on the squarefree integers, such that on primes $f(p)=\pm1$ and such that $M_f(x):=\sum_{n\leq x} f(n)=o(\sqrt{x})$. Further, by assuming the Riemann hypothesis (RH) we can go…

Number Theory · Mathematics 2019-11-22 Marco Aymone

Let $x$ be a positive integer. We give an asymptotic result for $\omega(\operatorname{lcm}(m,n))$ summed over all positive integers $m$ and $n$ with $mn \le x$. This answers an open question posed in a recent paper.

Number Theory · Mathematics 2021-01-19 Randell Heyman

We establish completely log-free bounds for exponential sums over the primes and the M\"{o}bius function. Let $0<\eta \leq 1/10$, and suppose $\alpha = a/q + \delta/x$, with $(a,q)=1$ and $|\delta| \leq x^{1/5 + \eta}/q$, and set $\delta_0…

Number Theory · Mathematics 2026-01-28 Priyamvad Srivastav

It was asked by E. Szemer\'edi if, for a finite set $A\subset\mathbb{Z}$, one can improve estimates for $\max\{|A+A|,|A\cdot A|\}$, under the constraint that all integers involved have a bounded number of prime factors -- that is, each…

Number Theory · Mathematics 2025-07-02 Brandon Hanson , Misha Rudnev , Ilya Shkredov , Dmitrii Zhelezov

In this paper we prove that inf_{|z_k| => 1} max_{v=1,...,n^2} |sum_{k=1}^n z_k^v| = sqrt n+O(n^{0.2625+epsilon}). This improves on the bound O(sqrt (n log n)) of Erdos and Renyi. In the special case of $n+1$ being a prime we have…

Number Theory · Mathematics 2007-06-28 Johan Andersson

Let $\lambda_1(n)$ denote the least invariant factor in the invariant factor decomposition of the multiplicative group $M_n = (\mathbb Z/n\mathbb Z)^\times$. We give an asymptotic formula, with order of magnitude $x/\sqrt{\log x}$, for the…

Number Theory · Mathematics 2020-02-04 Ben Chang , Greg Martin

In this paper we prove two results. The first theorem uses a paper of Kim \cite{K} to show that for fixed primes $p_1,...,p_k$, and for fixed integers $m_1,...,m_k$, with $p_i\not|m_i$, the numbers $(e_{p_1}(n),...,e_{p_k}(n))$ are…

Number Theory · Mathematics 2007-05-23 Florian Luca , Pantelimon Stanica

In this article, we investigate large prime factors of Fourier coefficients of non-CM normalized cuspidal Hecke eigenforms in short intervals. One of the new ingredients involves deriving an explicit version of Chebotarev density theorem in…

Number Theory · Mathematics 2024-05-09 Sanoli Gun , Sunil Naik

Let $\pi(x;\gamma_1,\gamma_2)$ denote the number of primes $p$ with $p\leqslant x$ and $p=\lfloor n^{1/\gamma_1}_1\rfloor=\lfloor n^{1/\gamma_2}_2\rfloor$, where $\lfloor t\rfloor$ denotes the integer part of $t\in\mathbb{R}$ and…

Number Theory · Mathematics 2023-10-02 Xiaotian Li , Wenguang Zhai , Jinjiang Li

Let $\gcd(k,j)$ denote the greatest common divisor of the integers $k$ and $j$, and let $r$ be any fixed positive integer. Define $$ M_r(x; f) := \sum_{k\leq x}\frac{1}{k^{r+1}}\sum_{j=1}^{k}j^{r}f(\gcd(j,k)) $$ for any large real number…

Number Theory · Mathematics 2020-02-28 Lisa Kaltenböck , Isao Kiuchi , Sumaia Saad Eddin , Masaaki Ueda

Let $x>1$ be a large number. This note shows that the largest prime factor of the quadratic product $\prod_{x\leq n\leq 2x}\left(n^2+1 \right)$ satisfies the relation $p \geq x^{3/2}$ as $x$ tends to infinity. This improves the current…

General Mathematics · Mathematics 2025-06-16 N. A. Carella

Given an integer $n \ge 2$, its prime factorization is expressed as $n= \prod_{i=1}^s p_i^{a_i}$. We define the function $f(n)$ as the smallest positive integer such that $f(n)!$ is divisible by $n$. The main objective of this paper is to…

Number Theory · Mathematics 2026-03-05 Mihoub Bouderbala

We provide very effective methods to convert both asymptotic and explicit numeric bounds on the prime counting function $\psi(x)$ to bounds of the same type on both $\theta(x)$ and $\pi(x)$. This follows up our previous work on $\psi(x)$ in…

Number Theory · Mathematics 2023-05-18 Andrew Fiori , Habiba Kadiri , Joshua Swidinsky

We define the discrete norm of a complex $m\times n$ matrix $A$ by $$ \|A\|_\Delta := \max_{0\ne\xi\in\{0,1\}^n} \frac{\|A\xi\|}{\|\xi\|}, $$ and show that $$ \frac c{\sqrt{\log h(A)+1}}\,\|A\| \le \|A\|_\Delta \le \|A\|, $$ where $c>0$ is…

Combinatorics · Mathematics 2014-10-23 Vsevolod F. Lev

We consider the Gaussian limit law for the distribution of the middle prime factor of an integer, defined according to multiplicity or not. We obtain an optimal bound for the speed of convergence, thereby improving on previous estimates…

Number Theory · Mathematics 2025-04-29 Jonathan Rotgé

Let $\ell\ge5$ be an odd prime and $j, s$ be positive integers. We study the distribution of the coefficients of integer and half-integral weight modular forms modulo odd positive integer $M$. As a consequence, we prove that for each…

Number Theory · Mathematics 2011-04-13 Shi-Chao Chen

We prove prime exponential sums have no better than square root cancellation on average on short intervals, in the sense that $$\frac{1}{x} \sum_{-y< n\le x} \left|\sum_{\substack{n< m \le n+y\\ 1\le m \le x}} \Lambda(m) \mathrm{e}(\alpha…

Number Theory · Mathematics 2025-09-19 Pierre-Alexandre Bazin

Let $f$ be a primitive positive definite integral binary quadratic form of discriminant $-D$ and let $\pi_f(x)$ be the number of primes up to $x$ which are represented by $f$. We prove several types of upper bounds for $\pi_f(x)$ within a…

Number Theory · Mathematics 2021-07-12 Asif Zaman

Let $X$ be a large parameter. We will first give a new estimate for the integral moments of primes in short intervals of the type $(p,p+h]$, where $p\leq X$ is a prime number and $h=\odi{X}$. Then we will apply this to prove that for every…

Number Theory · Mathematics 2013-02-14 D. Bazzanella , A. Languasco , A. Zaccagnini

The classical Mertens' formula states that $ \prod_{p\le N}\big(1-\frac1p)^{-1}\sim e^\gamma\log N, $ where the product is over all primes $p$ less than or equal to $N$, and $\gamma$ is the Euler-Mascheroni constant. By the Euler product…

Number Theory · Mathematics 2018-10-09 Ross G. Pinsky