English
Related papers

Related papers: An improved upper bound for the distribution of it…

200 papers

We prove that when $f$ is a Rademacher random multiplicative function for any $\epsilon>0$, then $\sum_{n \leqslant x}\frac{f(n)}{\sqrt{n}} \ll (\log\log(x))^{3/4+\epsilon}$ for almost all $f$. We also show that there exist arbitrarily…

Number Theory · Mathematics 2026-02-04 Christopher Atherfold

Motivated by studies in accelerator physics this paper computes the asymptotic behavior of the series $\displaystyle \sum_{k=1}^N \varphi(k) I_N\left(\frac{1}{k}\right)$, where $\varphi(k)$ is Euler's Totient function and $\displaystyle…

Number Theory · Mathematics 2014-07-30 R. Tomas

The discrete Fourier transform of the greatest common divisor is a multiplicative function, if taken with respect to the same order of the primitive root of unity, which is a well known fact. As such, the transform can be expressed in the…

Number Theory · Mathematics 2014-10-09 L. J. Holleboom

Let $n$ be a positive integer and $G(n)$ denote the number of non-isomorphic finite groups of order $n$. It is well-known that $G(n) = 1$ if and only if $(n,\phi(n)) = 1$, where $\phi(n)$ and $(a, b)$ denote the Euler's totient function and…

Group Theory · Mathematics 2017-05-22 A. R. Ashrafi , E. Haghi

We obtain a new upper bound for $\sum_{h\le H}\Delta_k(N,h)$ for $1\le H\le N$, $k\in \N$, $k\ge3$, where $\Delta_k(N,h)$ is the (expected) error term in the asymptotic formula for $\sum_{N < n\le2N}d_k(n)d_k(n+h)$, and $d_k(n)$ is the…

Number Theory · Mathematics 2011-11-29 Aleksandar Ivic , Jie Wu

New bounds on the number of similar or directly similar copies of a pattern within a finite subset of the line or the plane are proved. The number of equilateral triangles whose vertices all lie within an $n$-point subset of the plane is…

Combinatorics · Mathematics 2016-11-22 Bernardo Abrego , Silvia Fernandez-Merchant , Daniel J. Katz , Levon Kolesnikov

Starting with an infinite set of non linear Equations for the Li-Keiper coefficients, we first specify a lower bound emerging from the infinite set and give a characterization of it. Then, we propose a possible new upper and lower bound for…

General Mathematics · Mathematics 2020-12-16 Merlini Danilo , Sala Massimo , Sala Nicoletta

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…

Number Theory · Mathematics 2020-10-21 Paul Pollack , Carl Pomerance

We obtain almost sure bounds for the weighted sum $\sum_{n \leq t} \frac{f(n)}{\sqrt{n}}$, where $f(n)$ is a Steinhaus random multiplicative function. Specifically, we obtain the bounds predicted by exponentiating the law of the iterated…

Number Theory · Mathematics 2025-11-10 Seth Hardy

The main goal of this paper is to provide a group theoretical generalization of the well-known Euler's totient function. This determines an interesting class of finite groups.

Group Theory · Mathematics 2016-04-19 Marius Tarnauceanu

Assuming the Riemann Hypothesis, we obtain an upper bound for the 2k-th moment of the derivative of the Riemann zeta-function averaged over the non-trivial zeros of $\zeta(s)$ for every positive integer k. Our bounds are nearly as sharp as…

Number Theory · Mathematics 2021-08-09 Micah B. Milinovich

Let $r(k)$ denote the maximum number of edges in a $k$-uniform intersecting family with covering number $k$. Erd\H{o}s and Lov\'asz proved that $ \lfloor k! (e-1) \rfloor \leq r(k) \leq k^k.$ Frankl, Ota, and Tokushige improved the lower…

Combinatorics · Mathematics 2016-04-19 Andrii Arman , Troy Retter

We study the number of degree $n$ number fields with discriminant bounded by $X$. In this article, we improve an upper bound due to Schmidt on the number of such fields that was previously the best known upper bound for $6 \leq n \leq 94$.

Let $D$ be an indefinite quaternion division algebra over $\mathbb{Q}$. We approach the problem of bounding the sup-norms of automorphic forms $\phi$ on $D^\times(\mathbb{A})$ that belong to irreducible automorphic representations and…

Number Theory · Mathematics 2019-10-17 Abhishek Saha

Let $K\geq 2$ be a natural number and $a_i,b_i\in\mathbb{Z}$ for $i=1,\ldots,K-1$. We use the large sieve to derive explicit upper bounds for the number of prime $k$-tuplets, i.e., for the number of primes $p\leq x$ for which all $a_ip+b_i$…

Number Theory · Mathematics 2024-09-09 Thomas Dubbe

For various compactly supported perturbations of the Laplacian in odd dimensions $n$, we prove a sharp upper bound of the resonance counting function $N(r)$ of the type $N(r) \le A_n r^n(1+o(1))$ with an explicit constant $A_n$. In a few…

Analysis of PDEs · Mathematics 2007-05-23 Plamen Stefanov

An algorithm is devised for computing $\Phi(n) = \phi(1) + \phi(2) + \cdots + \phi(n)$ in time $\widetilde{\Theta}(n^{2/3})$ and space $\widetilde{\Theta}(n^{1/3})$. The starting point is an existing algorithm based on the Dirichlet…

Number Theory · Mathematics 2025-06-10 Lucas Augustus Brown

Let $\psi_\K$ be the Chebyshev function of a number field $\K$. Under GRH we prove an explicit upper bound for $|\psi_\K(x)-x|$ in terms of the degree and the discriminant of $\K$. The new bound improves significantly on previous known…

Number Theory · Mathematics 2019-05-28 Loïc Grenié , Giuseppe Molteni

We study the distribution of solutions of equations $\sigma(n)=\sigma(n+k)$ and $\varphi(n)=\varphi(n+k)$. We give new upper bounds for these solutions.

Number Theory · Mathematics 2018-10-18 Tomohiro Yamada

By using the elementary symmetric polynomials and some results of number theory, we solve the well known problem of Lehmer on Euler's totient function. As application, we obtain a new characterization of prime numbers.

Number Theory · Mathematics 2023-12-27 Said Zriaa