English
Related papers

Related papers: Jacobsthal's function and a generalisation of Eule…

200 papers

Jacobsthal's function was recently generalised for the case of paired progressions. It was proven that a specific bound of this function is sufficient for the truth of Goldbach's conjecture and of the prime pairs conjecture as well. We…

Number Theory · Mathematics 2017-06-13 Mario Ziller , John F. Morack

Hal\'asz's Theorem gives an upper bound for the mean value of a multiplicative function $f$. The bound is sharp for general such $f$, and, in particular, it implies that a multiplicative function with $|f(n)|\le 1$ has either mean value…

Number Theory · Mathematics 2019-02-20 Andrew Granville , Adam J Harper , K. Soundararajan

Let s_k/t_k, k>= 0, be the convergents of the continued fraction expansion of a real number x. We investigate the sequence of Jacobi symbols (s_k/t_k), k>= 0. We show that this sequence is purely periodic with shortest possible period…

Number Theory · Mathematics 2013-03-13 Kurt Girstmair

Let $v(k)$ be the smallest integer larger than $1$ that does not occur among the denominators in any identity of the form $$ 1=\frac1{n_1}+\cdots+\frac1{n_k}, $$ where $1 \le n_1<\cdots<n_k$ are pairwise distinct integers. In their 1980…

Number Theory · Mathematics 2026-05-26 Wouter van Doorn , Quanyu Tang

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

Let $\varphi(n)$ denote the Euler totient function. In this paper, we first establish a new upper bound for $n/\varphi(n)$ involving $K(n)$, the function that counts the number of primorials not exceeding $n$. In particular, this leads to…

Number Theory · Mathematics 2024-06-07 Christian Axler

Lehmer's totient problem consists of determining the set of positive integers $n$ such that $\varphi(n)|n-1$ where $\varphi$ is Euler's totient function. In this paper we introduce the concept of $k$-Lehmer number. A $k$-Lehmer number is a…

Number Theory · Mathematics 2012-03-23 Antonio M. Oller-Marcén , José María Grau

Let $\vfi$ be Euler's function, $\ga$ be Euler's constant and $N_k$ be the product of the first $k$ primes. In this article, we consider the function $c(n) =(n/\vfi(n)-e^\ga\log\log n)\sqrt{\log n}$. Under Riemann's hypothesis, it is proved…

Number Theory · Mathematics 2012-11-06 Jean-Louis Nicolas

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

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

Denote by $p(k)$ the limit, as $n \rightarrow \infty$, of the probability that a random permutation on a set of size $n$ has an invariant set of size $k$. We give an asymptotic formula for $p(k)$, showing that it is asymptotically…

Combinatorics · Mathematics 2026-05-01 Ben Green , Mehtaab Sawhney

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

The Euler's totient function $ \varphi(n) $ counts the positive integers up to a given integer $ n$ that are relatively prime to $ n $. We solve a problem due to Lehmer that there is no composite number $ n $ such that $ \varphi(n)\mid n-1…

Number Theory · Mathematics 2019-07-02 Huan Xiao

Let $c(H)$ be the smallest value for which $e(G)/|G|\geq c(H)$ implies $H$ is a minor of $G$. We show a new upper bound on $c(H)$, which improves previous bounds for graphs with a vertex partition where some pairs of parts have many more…

Combinatorics · Mathematics 2021-10-18 Matthew Wales

The Erd\H{o}s-Ginzburg-Ziv constant of an abelian group $G$, denoted $\mathfrak{s}(G)$, is the smallest $k\in\mathbb{N}$ such that any sequence of elements of $G$ of length $k$ contains a zero-sum subsequence of length $\exp(G)$. In this…

Combinatorics · Mathematics 2023-03-13 Eric Naslund

The Smarandache function of a positive integer $n$, denoted by $S(n)$, is defined to be the smallest positive integer $j$ such that $n$ divides the factorial $j!$. In this note, we prove that for any fixed number $k > 1$, the inequality…

Number Theory · Mathematics 2020-02-11 Xiumei Li , Min Sha

A nearest neighbor representation of a Boolean function is a set of positive and negative prototypes in $R^n$ such that the function has value 1 on an input iff the closest prototype is positive. For $k$-nearest neighbor representation the…

Combinatorics · Mathematics 2020-04-07 Péter Hajnal , Zhihao Liu , György Turán

Let $\text{ac}(n,k)$ denote the smallest positive integer with the property that there exists an $n$-colouring $f$ of $\{1,\dots,\text{ac}(n,k)\}$ such that for every $k$-subset $R \subseteq \{1, \dots, n\}$ there exists an (arithmetic)…

Combinatorics · Mathematics 2018-02-12 Leonardo Alese , Stefan Lendl , Paul Tabatabai

For a function $f\colon \mathbb{N}\to\mathbb{N}$, define $N^{\times}_{f}(x)=\#\{n\leq x: n=kf(k) \mbox{ for some $k$} \}$. Let $\tau(n)=\sum_{d|n}1$ be the divisor function, $\omega(n)=\sum_{p|n}1$ be the prime divisor function, and…

Number Theory · Mathematics 2022-10-03 Mikhail R. Gabdullin , Vitalii V. Iudelevich , Florian Luca

For a finite abelian group $G$, the generalized Erd\H{o}s--Ginzburg--Ziv constant $\mathsf s_{k}(G)$ is the smallest $m$ such that a sequence of $m$ elements in $G$ always contains a $k$-element subsequence which sums to zero. If $n =…

Combinatorics · Mathematics 2021-12-03 Jared Bitz , Sarah Griffith , Xiaoyu He