euler phi function
1Euler's phi-function — Math. the function that assigns to each integer the number of positive integers less than the given integer and relatively prime to the given integer. Also called phi function. [named after L. EULER] * * * …
2Euler's phi-function — Math. the function that assigns to each integer the number of positive integers less than the given integer and relatively prime to the given integer. Also called phi function. [named after L. EULER] …
3phi-function — /fuy fungk sheuhn/, n. Math. See Euler s phi function. * * * …
4phi-function — /fuy fungk sheuhn/, n. Math. See Euler s phi function …
5Euler's totient function — For other functions named after Euler, see List of topics named after Leonhard Euler. The first thousand values of φ(n) In number theory, the totient φ(n) of a positive integer n is defined to be the number of positive integers less than or equal …
6Phi (letter) — Phi (uppercase Φ, lowercase φ or Unicode|ϕ), pronounced [IPA|fī] in modern Greek and as [IPA|faɪ] in English, is the 21st letter of the Greek alphabet. In modern Greek, it represents [IPA|f] , a voiceless labiodental fricative. In Ancient Greek… …
7Phi — could refer to:*Phi, the Greek letter Φ,φ *The Golden ratio *Euler s totient function *Phi phenomenon *A statistical measure of association reported with the chi square test *Phi, Thai demon spirits, such as Phi Song Nang (succubi) *A function in …
8Euler's formula — This article is about Euler s formula in complex analysis. For Euler s formula in algebraic topology and polyhedral combinatorics see Euler characteristic.   Part of a series of articles on The mathematical constant e …
9Euler function — For other meanings, see List of topics named after Leonhard Euler .In mathematics, the Euler function is given by:phi(q)=prod {k=1}^infty (1 q^k).Named after Leonhard Euler, it is a prototypical example of a q series, a modular form, and provides …
10Phi-hiding assumption — The Phi Hiding assumption or Φ Hiding assumption is an assumption about the difficulty of finding small factors of φ( m ) where m is a number whose factorization is unknown, and φ is Euler s totient function. The security of many modern… …
