On a conjecture of Deaconescu
Number Theory
2022-06-22 v1
Abstract
In 2000 Deaconescu raised a question whether there exists a composite for which , where is Euler's function and is Schemmel's totient function. In this paper we prove that any such is odd, squarefree and has at least seven distinct prime factors. We also prove that any such with exactly distinct prime divisors is necessarily less than .
Keywords
Cite
@article{arxiv.2206.10355,
title = {On a conjecture of Deaconescu},
author = {Elchin Hasanalizade},
journal= {arXiv preprint arXiv:2206.10355},
year = {2022}
}
Comments
4 pages