Search results

Page title matches

• Totient function
  In [[number theory]], the '''totient function''' or '''Euler's φ function''' of a [[positive integer]] ''n'', denoted &p The totient function is [[multiplicative function|multiplicative]] and may be evaluated as
  1 KB (224 words) - 17:35, 21 November 2008
• Totient function/Definition
  112 bytes (18 words) - 17:47, 29 October 2008
• Totient function/Bibliography
  363 bytes (54 words) - 17:31, 21 November 2008
• Totient function/Related Articles
  853 bytes (136 words) - 15:14, 2 December 2008
• Jordan's totient function/Definition
  A generalisation of Euler's totient function.
  81 bytes (9 words) - 16:08, 29 October 2008
• Euler's totient function/Definition
  111 bytes (17 words) - 15:15, 2 December 2008
• Jordan's totient function
  ...k'' + 1)-tuple together with ''n''. This is a generalisation of Euler's [[totient function]], which is ''J''₁. Jordan's totient function is [[multiplicative function|multiplicative]] and may be evaluated as
  1 KB (181 words) - 16:05, 29 October 2008
• Euler's totient function
  #REDIRECT [[Totient function]]
  30 bytes (3 words) - 17:46, 29 October 2008

Page text matches

• Euler's totient function
  #REDIRECT [[Totient function]]
  30 bytes (3 words) - 17:46, 29 October 2008
• Phi function
  #REDIRECT [[Totient function]]
  30 bytes (3 words) - 17:26, 21 November 2008
• Jordan's totient function/Definition
  A generalisation of Euler's totient function.
  81 bytes (9 words) - 16:08, 29 October 2008
• Coprime/Related Articles
  {{r|Jordan's totient function}} {{r|Totient function}}
  649 bytes (85 words) - 15:41, 11 January 2010
• Arithmetic function
  * [[Euler]]'s [[totient function]] * [[Jordan's totient function]]
  1 KB (159 words) - 06:03, 15 June 2009
• Jordan's totient function
  ...k'' + 1)-tuple together with ''n''. This is a generalisation of Euler's [[totient function]], which is ''J''₁. Jordan's totient function is [[multiplicative function|multiplicative]] and may be evaluated as
  1 KB (181 words) - 16:05, 29 October 2008
• Totient function
  In [[number theory]], the '''totient function''' or '''Euler's φ function''' of a [[positive integer]] ''n'', denoted &p The totient function is [[multiplicative function|multiplicative]] and may be evaluated as
  1 KB (224 words) - 17:35, 21 November 2008
• Number theory/Related Articles
  {{r|Jordan's totient function}} {{r|Totient function}}
  2 KB (262 words) - 19:07, 11 January 2010
• Dirichlet character/Related Articles
  {{r|Totient function}}
  321 bytes (41 words) - 05:50, 15 June 2009
• Arithmetic function/Related Articles
  {{r|Totient function}} {{r|Jordan's totient function}}
  1 KB (179 words) - 06:02, 15 June 2009
• Oxford University Press/Related Articles
  {{r|Totient function}}
  1 KB (187 words) - 19:18, 11 January 2010
• Lambda function
  The value of λ(''n'') always divides the value of [[Euler's totient function]] φ(''n''): they are equal if and only if ''n'' has a [[primitive root]].
  796 bytes (127 words) - 15:10, 2 December 2008
• Average order of an arithmetic function
  * The average order of &phi;(''n'')), [[Euler's totient function]] of ''n'', is <math> \frac{6}{\pi^2} n</math>;
  2 KB (254 words) - 08:27, 19 December 2011
• Lambda function/Related Articles
  {{r|Euler's totient function}}
  884 bytes (140 words) - 15:13, 2 December 2008
• Dirichlet character
  ...e multiplicative group is finite of order φ(''N''), where φ is the Euler [[totient function]], the values of χ are all [[root of unity|roots of unity]]. We extend χ
  2 KB (335 words) - 06:03, 15 June 2009
• Order (group theory)/Related Articles
  {{r|Totient function}}
  594 bytes (76 words) - 19:15, 11 January 2010
• Cyclotomic polynomial
  The degree of <math>\Phi_n(X)</math> is given by the Euler [[totient function]] <math>\phi(n)</math>.
  1 KB (206 words) - 14:55, 11 December 2008
• Primitive root
  ...[[generator]], having an [[order (group theory)|order]] equal to [[Euler's totient function]] φ(''n''). Another way of saying that ''n'' has a primitive root is that
  2 KB (338 words) - 16:43, 6 February 2009
• RSA algorithm
  ...stinct primes p, q and the product N = pq. Take p-1 and q-1 and find the [[totient function]] of N, the product T = (p-1)(q-1). Alternately, find the least common mult
  7 KB (1,171 words) - 05:48, 8 April 2024