Positive integer n, Euler function is less than or equal to n number coprime with n number of number of number theory. the the the φ function value formula: φ (x) = x (1-1/p1) (1-1/p2) (1-1/p3) (1-1/p4) ..... (1-1/pn ) wherein p1, p2 ...... pn all the prime factors of the x, x is not an integer of 0. φ (1) = 1 (the sole and a relatively prime number is 1 itself). (Note: The each germplasm factor only one example, 12 = 2* 2* 3 then φ of (12) = 12* (1-1/2)* (1-1/3) = 4) when n is a prime number p The k-th power, φ (n) = p ^ kp ^ (k-1) = (p-1) p ^ (k-1), because, in addition to a multiple of p, the number of other related n coprime. The Eulerian function is a multiplicative function- if the m, n are coprime, and φ (Mn) = φ (m) φ (n). The special properties: When n is odd, and φ (2n) = φ (n), proved similar to the above.

a.cpp

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．