For any positive integer $n$ let ϕ(n) be the Euler function of n. A positive integer $n$ is called a noncototient if the equation x-ϕ(x)=n has no solution x. In this note, we give a sufficient condition on a positive integer k such that the geometrical progression $(2^mk)_{m ≥ 1}$ consists entirely of noncototients. We then use computations to detect seven such positive integers k.
2
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
For any positive integer n let ϕ(n) and σ(n) be the Euler function of n and the sum of divisors of n, respectively. In [5], Mąkowski and Schinzel conjectured that the inequality σ(ϕ(n)) ≥ n/2 holds for all positive integers n. We show that the lower density of the set of positive integers satisfying the above inequality is at least 0.74.
5
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW