Search results

Page title matches

• Coprime
  In [[arithmetic]], two integers are '''coprime''' if they have no common factor greater than one. ...ments of the ring which divide both of them are [[unit]]s. Two ideals are coprime if the smallest ideal that contains them both is the ring itself.
  388 bytes (64 words) - 02:27, 30 October 2008
• Coprime/Definition
  124 bytes (17 words) - 02:26, 30 October 2008
• Coprime/Related Articles
  Auto-populated based on [[Special:WhatLinksHere/Coprime]]. Needs checking by a human.
  649 bytes (85 words) - 15:41, 11 January 2010

Page text matches

• Coprime
  In [[arithmetic]], two integers are '''coprime''' if they have no common factor greater than one. ...ments of the ring which divide both of them are [[unit]]s. Two ideals are coprime if the smallest ideal that contains them both is the ring itself.
  388 bytes (64 words) - 02:27, 30 October 2008
• Totient function/Definition
  The number of integers less than or equal to and coprime to a given integer.
  112 bytes (18 words) - 17:47, 29 October 2008
• Euler's totient function/Definition
  The number of positive integers in the set {1,...,n} which are coprime to n
  111 bytes (17 words) - 15:15, 2 December 2008
• Carmichael number/Definition
  ...''a''^{''c''−1} ≡ 1 (mod ''c'') for all ''a'' that are coprime with ''c''.
  165 bytes (25 words) - 16:56, 26 July 2008
• Totient function
  ...to be the number of positive integers in the set {1,...,''n''} which are [[coprime]] to ''n''. This function was studied by [[Leonhard Euler]] around 1730.<r The integers in the set {1,...,''n''} which are coprime to ''n'' represent the multiplicative group modulo ''n'' and hence the toti
  1 KB (224 words) - 17:35, 21 November 2008
• Fermat pseudoprime/Definition
  ...hat ''a''^{q &minus; 1}&equiv; 1 (mod ''q'') for any ''a'' that is coprime with ''q'' and ''a'' is between 2 and ''q-2''
  195 bytes (32 words) - 17:02, 6 June 2009
• Chinese remainder theorem
  Let <math> n_1, \ldots, n_t </math> be [[coprime|pairwise relatively prime]] positive integers, and set <math>n = n_1 n_2 \c The Theorem for a system of ''t'' congruences to coprime moduli can be proved by [[mathematical induction]] on ''t'', using the theo
  3 KB (535 words) - 15:02, 22 November 2008
• ABC conjecture
  Suppose now that the equation <math>A + B + C = 0</math> holds for coprime integers <math>A,B,C</math>. The conjecture asserts that for every <math>\ ...cture in 1998. Assume as before that <math>A + B + C = 0</math> holds for coprime integers <math>A,B,C</math>. Let <math>N</math> be the radical of <math>AB
  2 KB (301 words) - 13:18, 13 January 2013
• Primitive root/Related Articles
  {{r|Coprime}}
  520 bytes (68 words) - 19:43, 11 January 2010
• Dirichlet character
  ...ive integers by defining χ(''n'') to be χ(''n'' mod ''N'') when ''n'' is [[coprime]] to ''N'', and to be zero when ''n'' has a factor in common with ''N''. T ...' χ₀ is derived from the trivial character which is 1 one ''n'' coprime to ''N'' and zero otherwise.
  2 KB (335 words) - 06:03, 15 June 2009
• Coprime/Related Articles
  Auto-populated based on [[Special:WhatLinksHere/Coprime]]. Needs checking by a human.
  649 bytes (85 words) - 15:41, 11 January 2010
• Number of divisors function
  It is a [[multiplicative function]], that is ''m'' and ''n'' are coprime then <math>d(mn) = d(m) d(n)</math>.
  720 bytes (123 words) - 04:26, 1 November 2013
• Rational number/Related Articles
  {{r|Coprime}}
  1 KB (169 words) - 19:54, 11 January 2010
• Sum-of-divisors function
  It is a [[multiplicative function]], that is ''m'' and ''n'' are coprime then <math>\sigma(mn) = \sigma(m)\sigma(n)</math>.
  1 KB (172 words) - 04:53, 1 November 2013
• Sylow subgroup
  ...'n'' of a finite group ''G'', so that <math>n = p^s t</math>, with ''t'' [[coprime]] to ''p''
  1 KB (176 words) - 13:55, 7 February 2009
• Arithmetic function
  ...cative''' if <math>a(mn) = a(m) a(n)</math> whenever ''m'' and ''n'' are [[coprime]].
  1 KB (159 words) - 06:03, 15 June 2009
• P-adic metric
  ...uely in the form <math>p^n.r/s</math> where ''r'' and ''s'' are integers [[coprime]] to ''p'' and ''n'' is an integer. We define the ''p''-adic valuation <ma
  1 KB (168 words) - 12:39, 4 January 2009
• Root of unity
  ...-th roots with those numbers of the form exp(2πi.''r''/''n'') with ''r'' [[coprime]] to ''n''. However, the concept of root of unity makes sense in other con
  1 KB (197 words) - 22:01, 7 February 2009
• Euler pseudoprime
  ...1}{2}} \equiv \left( -1\right) \pmod n</math> for every base ''a'' that is coprime to ''c''. Every absolute Euler pseudoprime is also a [[Carmichael number]].
  1 KB (188 words) - 21:54, 19 February 2010
• Modulus (algebraic number theory)
  :<math> K_{\mathbf{m}} = \left\lbrace a/b \in K \mid a,b \in R,~ ab ~\mbox{coprime to}~ \mathbf{m}_\mbox{fin} \right\rbrace ,</math> ...ideal group ''I''^'''m''' to be the subgroup generated by ideals coprime to '''m'''_fin. The '''ray class group''' modulo '''m''' is the
  4 KB (561 words) - 20:25, 5 December 2008