Work

Solutions of d(n)=d((n)) where n has four different prime divisors

Year: 2025
Type: article
Abstract: For a positive integer n, let d(n), (n) and (n) denote the number of positive divisors of n, the Euler's phi function of n and the number of different prime divisors of n, respectively. In this paper, we focus on positive integers n such that d(n)=d((n)) and (n)=4.
Language: English
Open Access status: diamond
OpenAlex ID: W4408829597
FWCI:
Cites: 6
Cited by:
Related to: 10