The notion of Jordan's totient – also frequently referred to as Euler's totient function or, more formally, phi – represents a fascinating area of number theory. It essentially counts the positive integers below a given integer 'n' which are relatively prime to 'n'. To illustrate, if 'n' is 10, the numbers 1, 3, 7, and 9 are relatively prime to