Related papers: On the Lehmer's problem involving Euler's totient …

Assume that $ y < N$ are integers, and that $ (b,y) =1$. Define an average along the primes in a progression of diameter $ y$, given by integer $ (b,y)=1 $. \begin{align*} A_{N,y,b} := \frac{\phi (y)}{N} \sum _{\substack{n <N\\n\equiv…

We find an interesting relationship between the golden ratio, the Moebius function, the Euler totient function and the natural logarithm - central players in the theory of numbers. A number of identities involving the golden ratio and its…

The appearance of primes in a family of linear recurrence sequences labelled by a positive integer $n$ is considered. The terms of each sequence correspond to a particular class of Lehmer numbers, or (viewing them as polynomials in $n$)…

Two inequalities involving the Euler totient function and the sum of the $k$-th powers of the divisors of balancing numbers are explored.

In the first paper under this title (1977), the first author utilized a duality identity between the largest and smallest prime factors involving the Moebius function, to establish the following result as a consequence of the Prime Number…

We show that for integers $n$, whose ratios of consecutive divisors are bounded above by an arbitrary constant, the normal order of the number of prime factors is $C \log \log n$, where $C=(1-e^{-\gamma})^{-1} = 2.280...$ and $\gamma$ is…

For $x>0$ let $\pi(x)$ denote the number of primes not exceeding $x$. For integers $a$ and $m>0$, we determine when there is an integer $n>1$ with $\pi(n)=(n+a)/m$. In particular, we show that for any integers $m>2$ and $a\le\lceil…

We deduce an asymptotic formula with error term for the sum $\sum_{n_1,\ldots,n_k \le x} f([n_1,\ldots, n_k])$, where $[n_1,\ldots, n_k]$ stands for the least common multiple of the positive integers $n_1,\ldots, n_k$ ($k\ge 2$) and $f$…

We solve Lehmer's problem for a class of polynomials arising from Hermitian matrices over the Eisenstein and Gaussian integers, that is, we show that all such polynomials have Mahler measure at least Lehmer's number \tau_0 = 1.17628... .

Determining whether a given integer is prime or composite is a basic task in number theory. We present a primality test based on quantum order finding and the converse of Fermat's theorem. For an integer $N$, the test tries to find an…

A nonempty finite set of positive integers A is relatively prime if gcd(A) = 1 and it is relatively prime to n if gcd(A [ fng) = 1. The number of nonempty subsets of A which are relatively prime to n is \Phi(A, n) and the number of such…

We develop a unified density-based framework for primality, coprimality, and prime pairs, and introduce an intrinsic normalized model for prime gaps constrained by the Prime Number Theorem. Within this setting, a structural tension between…

A set of integers is \emph{primitive} if it does not contain an element dividing another. Denote by $f(n)$ the number of maximum-size primitive subsets of $\{1,\ldots, 2n\}$. We prove that the limit $\alpha=\lim_{n\rightarrow…

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,…

In this paper a new integral for the remainder of $\pi(x)$ is obtained. It is proved that there is an infinite set of the formulae containing miscellaneous parts of this integral.

We develop a new closed-form arithmetic and recursive formula for the partition function and a generalization of Andrews' smallest parts (spt) function. Using the inclusion-exclusion principle, we additionally develop a formula for the…

In this note we study numerically the combinatorics of curves and geodesics on the torus with one boundary component. A potential computational difficulty is avoided by counting inside specific orbits of the mapping class group up to a…

Two centuries ago, Sophie Germain began to work on her grand plan to prove the theorem of Fermat, the famous conjecture that $x^n + y^n = z^n$ is impossible for nonzero integral values of $x$, $y$, and $z$, when $n > 2$. At that time, this…

Let \sigma(n) be the sum of divisors of a positive integer n. Robin's theorem states that the Riemann hypothesis is equivalent to the inequality \sigma(n)<e^\gamma n\log\log n for all n>5040 (\gamma is Euler's constant). It is a natural…

In this article we present applications of smooth numbers to the unconditional derandomization of some well-known integer factoring algorithms. We begin with Pollard's $p-1$ algorithm, which finds in random polynomial time the prime…