Questions   
Sort: 
 #1
avatar+118723 
+5
Jun 27, 2015
Jun 26, 2015
 #1
avatar
+5
Jun 26, 2015
 #5
avatar+26400 
0

Hallo CPhill,

 

In number theory, Euler's totient function (or Euler's phi function), denoted as φ(n) or ϕ(n), is an

arithmetic function that counts the positive integers less than or equal to n that are relatively prime to n.

(These integers are sometimes referred to as totatives of n.)

Thus, if n is a positive integer, then φ(n) is the

number of integers k in the range 1 ≤ kn for which the greatest common divisor gcd(n, k) = 1.[1][2]

 

see more... https://en.wikipedia.org/wiki/Euler%27s_totient_function

 

Jun 26, 2015

0 Online Users