English
Related papers

Related papers: Inequalities involving the primorial counting func…

200 papers

A nonempty subset A of {1,2,...,n} is called primitive if gcd(A)=1. Let f(n) and f_k(n) denote, respectively, the number of primitive subsets and the number of primitive subsets of cardinality k of {1,2,...,n}. Recursion formulas and…

Number Theory · Mathematics 2007-09-17 Melvyn B. Nathanson

Suppose $k\geqslant3$ is an integer. Let $\tau_k(n)$ be the number of ways $n$ can be written as a product of $k$ fixed factors. For any fixed integer $r\geqslant2$, we have the asymptotic formula \begin{equation*}…

Number Theory · Mathematics 2024-11-12 Zhen Guo , Xin Li

For n=1,2,3,... let p_n be the n-th prime. We mainly show that p_n>n+sum_{k=1}^n p_k/k for all n>124, and sum_{k=1}^n kp_k<n^2p_n/3 for all n>30.

Number Theory · Mathematics 2012-09-20 Zhi-Wei Sun

In this note, we mainly show the analogue of one of Alladi's formulas over $\mathbb{Q}$ with respect to the Dirichlet convolutions involving the M\"{o}bius function $\mu(n)$, which is related to the natural densities of sets of primes by…

Number Theory · Mathematics 2020-07-17 Biao Wang

Let $A(s) = \sum_n a_n n^{-s}$ be a Dirichlet series admitting meromorphic continuation to the complex plane. Assume we know the location of the poles of $A(s)$ with $|\Im s| \leq T$, and their residues, for some large constant $T$. It is…

Number Theory · Mathematics 2025-12-18 Andrés Chirre , Harald Andrés Helfgott

A unitary divisor $c$ of a positive integer $n$ is a positive divisor of $n$ that is relatively prime to $\displaystyle{\frac{n}{c}}$. For any integer $k$, the function $\sigma_k^*$ is a multiplicative arithmetic function defined so that…

Number Theory · Mathematics 2014-12-11 Colin Defant

In this paper we study the variance of the Euler totient function (normalized to $\varphi(n)/n$) in the integers $\mathbb{Z}$ and in the polynomial ring $\mathbb{F}_q[T]$ over a finite field $\mathbb{F}_q$. It turns out that in…

Number Theory · Mathematics 2017-06-14 Tom van Overbeeke

When $k>1$ and $n$ is the product of the smallest $k$ primes, the $(k+1)$-st smallest prime is the least divisor exceeding $1$ of $n^{n^n}-1$. This variant of Euclid's prime generator is discussed with some of its cousins.

Number Theory · Mathematics 2024-08-14 Trevor D. Wooley

It is shown that the counting function of n Boolean variables can be implemented with the formulae of size O(n^3.06) over the basis of all 2-input Boolean functions and of size O(n^4.54) over the standard basis. The same bounds follow for…

Data Structures and Algorithms · Computer Science 2012-08-21 Igor S. Sergeev

Let $\mu(n)$ be the M\"{o}bius function and $e(\alpha)=e^{2\pi i\alpha}$. In this paper, we study upper bounds of the classical sum $$S(x,\alpha):=\sum_{1\leq n\leq x}\mu(n)e(\alpha n).$$ We can improve some classical results of Baker and…

Number Theory · Mathematics 2022-12-13 Wei Zhang

In this work, we studied various properties of arithmetic function $\tilde{\varphi}$, where $\tilde{\varphi}(n)=|\{m\in \mathbb{N} | 1\le m\le n, (m,n)=1, \mbox{$m$ is not a prime}\}|.$

General Mathematics · Mathematics 2019-07-24 Abhijit A J , A. Satyanarayana Reddy

In this paper, we obtain bounds on the $L^1$ norm of the sum $\sum_{n\le x}\tau(n) e(\alpha n)$ where $\tau(n)$ is the divisor function.

Number Theory · Mathematics 2017-04-21 D. A. Goldston , M. Pandey

Consider the real numbers $$ \ell_{n,k} = \ln\left( \tfrac{3}{2}\,k+\sqrt{\left(\tfrac{3}{2}\,k \right)^2 + 3\,n} \right) $$ and the intervals $\mathcal{L}_{n,k} = \left]\ell_{n,k}-\ln 3,\ell_{n,k}\right]$. For all $n \geq 1$, define $$…

Number Theory · Mathematics 2023-05-03 José Manuel Rodríguez Caballero

Let $n,k\in\mathbb{N}$ and let $p_{n}$ denote the $n$th prime number. We define $p_{n}^{(k)}$ recursively as $p_{n}^{(1)}:=p_{n}$ and $p_{n}^{(k)}=p_{p_{n}^{(k-1)}}$, that is, $p_{n}^{(k)}$ is the $p_{n}^{(k-1)}$th prime. In this note we…

Number Theory · Mathematics 2022-01-06 Błażej Żmija

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

Given a multiplicative function $f$, we let $S(x,f)=\sum_{n\leq x}f(n)$ be the associated partial sum. In this note, we show that lower bounds on partial sums of divisor-bounded functions result in lower bounds on the partial sums…

Number Theory · Mathematics 2024-05-02 Claire Frechette , Mathilde Gerbelli-Gauthier , Alia Hamieh , Naomi Tanabe

The convex hull of the subgraph of the prime counting function $x\rightarrow \pi(x)$ is a convex set, bounded from above by a graph of some piecewise affine function $x\rightarrow \epsilon(x)$. The vertices of this function form an infinite…

Number Theory · Mathematics 2014-08-18 Edward Tutaj

Theorem 1 Let F:N-->R stand for any function which a) $F$ monotonically weakly increases; b) $F$ tends to infinity; and c) such that $q/F(q)$ tends to infinity. Let Z_F(q) equal the number of divisors of q less than sqrt{F(q)} minus the…

Number Theory · Mathematics 2008-10-09 David V. Feldman

We study generalizations of some results of Jean-Louis Nicolas regarding the relation between small values of Euler's function $\varphi(n)$ and the Riemann Hypothesis. Among other things, we prove that for $1\leq q\leq 10$ and for $q=12,…

Number Theory · Mathematics 2018-10-30 Amir Akbary , Forrest J. Francis

We prove that the ratio of the Newman sum over numbers multiple of a fixed integer which is not multiple of 3 and the Newman sum over numbers multiple of a fixed integer divisible by 3 is o(1) when the upper limit of summing tends to…

Number Theory · Mathematics 2008-08-20 Vladimir Shevelev