-
MathType
-
Wiris Quizzes
-
Learning Lemur
-
CalcMe
-
MathPlayer
-
Store FAQ
-
VPAT for the electronic documentation
-
MathFlow
-
BF FAQ
Phi Euler
Reading time: 1minEuler's totient function counts the positive integers up to a given integer n that are relatively prime to n. Formally, it can be defined as the number of integers k in the range 1≤k≤n for which gcd(n,k)=1. Euler's product formula states
For a prime number p and for an integer k, this expression reduces to
Syntax
phi_euler(Integer)
Description
Given an integer n, returns φ(n).
