オイラーのφ関数
1. Euler's totient functionIn number theory, Euler's totient or phi function, φ(n) is an arithmetic function that counts the number of positive integers less than or equal to n that are relatively prime to n. That is, if n is a positive integer, then φ(n) is the number of integers k in the range 1 ≤ k ≤ n for which gcd(n, k) = 1. The totient function is a multiplicative function, meaning that if two numbers m and n are relatively prime (to each other), then φ(mn) = φ(m)φ(n). For example let n = 9.
Read “Euler's totient function” on English Wikipedia
Read “オイラーのφ関数” on Japanese Wikipedia
Read “Euler's totient function” on DBpedia
Read “Euler's totient function” on English Wikipedia
Read “オイラーのφ関数” on Japanese Wikipedia
Read “Euler's totient function” on DBpedia
Discussions
Log in to talk about this word.