Euler's totient function

The first thousand values of φ(n). The points on the top line represent φ(p) when p is a prime number, which is p − 1.[1]

In number theory, Euler's totient function counts the positive integers up to a given integer $n$ that are relatively prime to $n$ . It is written using the Greek letter phi as $φ(n)$ or $ϕ(n)$ , and may also be called Euler's phi function. It can be defined more formally as the number of integers $k$ in the range $1 \leq k \leq n$ for which the greatest common divisor $gcd(n, k) = 1$ ; The integers $k$ of this form are sometimes referred to as totatives of n.

单词	Euler Phi Function
释义	Euler Phi Function 英语百科 Euler's totient function In number theory, Euler's totient function counts the positive integers up to a given integer $n$ that are relatively prime to $n$ . It is written using the Greek letter phi as $φ(n)$ or $ϕ(n)$ , and may also be called Euler's phi function. It can be defined more formally as the number of integers $k$ in the range $1 \leq k \leq n$ for which the greatest common divisor $gcd(n, k) = 1$ ; The integers $k$ of this form are sometimes referred to as totatives of n.
随便看	Kanners Syndrome Kanner Syndrome Kanni Kannigyi kannikar Kanniyakumari Kanniyākumāri Kanno Kannod Kannon Kannonkoski Kannur Kannus Kannuskoski kanny Kannya Kano Kanochol kano cloth kanogo Kanoite Kanoko kanokogi Kanokonlit kanokonol

Euler Phi Function

Euler's totient function