Abstract
The modified Totient function of Carmichael λ(.) is revisited, where important properties have been highlighted. Particularly, an iterative scheme is given for calculating the λ(.) function. A comparison between the Euler ϕ and the reduced totient λ(.) functions aiming to quantify the reduction between is given.
Original language | English |
---|---|
Article number | 1800 |
Journal | Mathematics |
Volume | 9 |
Issue number | 15 |
DOIs | |
Publication status | Published - Aug 2021 |
Keywords
- Euler theorem
- Euler’s totient function
- Prime numbers