scientific article; zbMATH DE number 1112753
The author discusses the properties of the composite number-theoretic function \(s[\varphi (n)]\), where \(s(n)\) denotes the sum of divisors of \(n\), and \(\varphi(n)\) denotes the Euler function. He proves \[ s \left[\varphi \left(\prod^h_{i=1} p_i \right) \right] \geq\prod^k_{i=1} p_i, \quad \text{for } k=1,2,3, \] and poses the conjecture that this inequality holds for every \(k\geq 1\). If this conjecture is correct, then \(s[\varphi (n)]\geq n\) for every odd natural number \(n\). For the equation \(s[\varphi(n)] =n\), the author finds out five odd solutions: \(\prod^k_{i=0} F_i\), \(k= 0,1,2,3,4\), \((F_i\) being the first five Fermat primes) and two even solutions: \(2^2\mu_3\), \(2^3 \mu_2\mu_5\) \((\mu_2= 3,\;\mu_3=7\), \(\mu_5=31\) being the first three Mersenne primes).
- On the functions φ(n) and σ(n)
- On composite integers \(n\) for which \(\varphi(n)\mid n-1\)
- scientific article; zbMATH DE number 3966173
- scientific article; zbMATH DE number 3124875
- On composite n for which φ(n) | n -1
- Publication:3029063
- scientific article; zbMATH DE number 3111207
- scientific article; zbMATH DE number 3797826
- Über die zahlentheoretische Funktion ω(n)
- Composite integers n for which (n) n-1
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4374375)
