Mathematics Asked by ppSpp on December 23, 2021
How to check if $phi(n)$ is a perfect square?
Here, $phi$ is Euler’s totient function. That is,$phi(n)$ counts the positive integers up to a given integer $n$ that are relatively prime to $n$
for example if $n = 34$, $phi(34)=16=4times 4$.
Can we check this without calculating $phi(n)$?
Get help from others!
Recent Questions
Recent Answers
© 2024 TransWikia.com. All rights reserved. Sites we Love: PCI Database, UKBizDB, Menu Kuliner, Sharing RPP