Search results

Jump to navigation Jump to search

Page title matches

  • ...aid not to be a ''proper divisor''. The number 0 is not considered to be a divisor of ''any'' integer. ...ce <math>6 \cdot 4 = 24</math>. (We stress that "6 divides 24" and "6 is a divisor of 24" mean the same thing.)
    4 KB (594 words) - 02:37, 16 May 2009
  • #REDIRECT [[Divisor (ring theory)]]
    35 bytes (4 words) - 22:51, 31 March 2008
  • 29 bytes (3 words) - 09:24, 30 July 2009
  • {{r|Divisor}} {{r|Divisor (algebraic geometry)}}
    133 bytes (17 words) - 02:37, 16 May 2009
  • 116 bytes (16 words) - 06:30, 4 September 2009
  • #REDIRECT [[Divisor (algebraic geometry)]]
    42 bytes (4 words) - 16:12, 6 December 2008
  • 12 bytes (1 word) - 09:23, 26 September 2007
  • #REDIRECT [[Divisor (algebraic geometry)]]
    42 bytes (4 words) - 15:12, 17 December 2008
  • ...)|rings]], of which the integers are the archetype, the original notion of divisor found a natural extension. Divisibility is a useful concept for the analys ...t ''x'' in ''R'' with <math> a = b x </math>. We also say that ''b'' is a divisor of ''a'', or that ''a'' is a [[multiple]] of [[b]].
    2 KB (359 words) - 18:39, 2 December 2008
  • #REDIRECT [[Divisor (ring theory)/Approval]]
    44 bytes (5 words) - 22:46, 31 March 2008
  • 855 bytes (136 words) - 14:56, 6 December 2008
  • The '''greatest common divisor''' (often abbreviated to '''gcd''', or '''g.c.d.''', ...divisor of a number cannot be larger than that number, the greatest common divisor of some numbers is a number between 1 and the smallest of the numbers inclu
    5 KB (797 words) - 04:57, 21 April 2010
  • In [[geometry]] a '''divisor''' on an [[algebraic variety]] is a formal sum (with integer coefficients) An '''effective divisor''' is a sum with non-negative integer coefficients.
    818 bytes (138 words) - 10:54, 18 February 2009
  • #REDIRECT[[greatest common divisor]]
    36 bytes (4 words) - 17:18, 14 May 2007
  • 12 bytes (1 word) - 15:46, 26 September 2007
  • 112 bytes (14 words) - 18:35, 26 June 2009
  • 12 bytes (1 word) - 22:46, 31 March 2008
  • The '''greatest common divisor''' of 60 and 72 is therefore 12. One writes "gcd(60,&nbsp;72) = 12", or si The greatest common divisor is used in reducing fractions to lowest terms, thus:
    4 KB (570 words) - 18:05, 1 July 2009
  • 189 bytes (26 words) - 02:55, 14 September 2009
  • 89 bytes (12 words) - 17:25, 6 December 2008

Page text matches

  • {{r|Divisor}} {{r|Divisor (algebraic geometry)}}
    133 bytes (17 words) - 02:37, 16 May 2009
  • ...an be expressed by stating that 2 is a divisor of 6. See the page about [[divisor]]s for more about this important relationship. ...be a multiple of another. Please see the [[divisor (ring theory)|abstract divisor]] page for further types of multiples.
    924 bytes (151 words) - 22:50, 31 March 2008
  • In [[geometry]] a '''divisor''' on an [[algebraic variety]] is a formal sum (with integer coefficients) An '''effective divisor''' is a sum with non-negative integer coefficients.
    818 bytes (138 words) - 10:54, 18 February 2009
  • Auto-populated based on [[Special:WhatLinksHere/Divisor (ring theory)]]. Needs checking by a human. {{r|Divisor (disambiguation)}}
    516 bytes (65 words) - 16:01, 11 January 2010
  • #REDIRECT [[Divisor (ring theory)]]
    35 bytes (4 words) - 22:51, 31 March 2008
  • #REDIRECT[[greatest common divisor]]
    36 bytes (4 words) - 22:44, 13 June 2007
  • #REDIRECT [[Divisor (algebraic geometry)]]
    42 bytes (4 words) - 15:12, 17 December 2008
  • #REDIRECT [[Greatest common divisor]]
    37 bytes (4 words) - 02:20, 30 October 2008
  • #REDIRECT [[Greatest common divisor]]
    37 bytes (4 words) - 02:46, 24 December 2008
  • #REDIRECT [[Divisor (algebraic geometry)]]
    42 bytes (4 words) - 16:12, 6 December 2008
  • #REDIRECT[[greatest common divisor]]
    36 bytes (4 words) - 17:18, 14 May 2007
  • #REDIRECT [[Divisor (ring theory)/Approval]]
    44 bytes (5 words) - 22:46, 31 March 2008
  • Algorithm for finding the greatest common divisor of two integers
    101 bytes (13 words) - 15:31, 20 May 2008
  • ...)|rings]], of which the integers are the archetype, the original notion of divisor found a natural extension. Divisibility is a useful concept for the analys ...t ''x'' in ''R'' with <math> a = b x </math>. We also say that ''b'' is a divisor of ''a'', or that ''a'' is a [[multiple]] of [[b]].
    2 KB (359 words) - 18:39, 2 December 2008
  • ...aid not to be a ''proper divisor''. The number 0 is not considered to be a divisor of ''any'' integer. ...ce <math>6 \cdot 4 = 24</math>. (We stress that "6 divides 24" and "6 is a divisor of 24" mean the same thing.)
    4 KB (594 words) - 02:37, 16 May 2009
  • * [http://www.positiveintegers.org The Positive Integers - divisor tables and numeral representation tools]
    224 bytes (29 words) - 08:56, 8 December 2008
  • Auto-populated based on [[Special:WhatLinksHere/Divisor (algebraic geometry)]]. Needs checking by a human. {{r|Divisor (disambiguation)}}
    473 bytes (59 words) - 16:01, 11 January 2010
  • ''d'' is a '''divisor''' or '''factor''' of ''n'', Any other divisor is called a ''proper'' divisor.
    3 KB (515 words) - 21:49, 22 July 2009
  • The '''greatest common divisor''' (often abbreviated to '''gcd''', or '''g.c.d.''', ...divisor of a number cannot be larger than that number, the greatest common divisor of some numbers is a number between 1 and the smallest of the numbers inclu
    5 KB (797 words) - 04:57, 21 April 2010
  • ...s said to be ''exact''. In any event, the remainder will be less than the divisor. For example, 13 (dividend) may be divided 4 (divisor) by repeatedly subtracting 4: 13-4 = 9, 9-4 = 5, 5-4 = 1, at which point th
    1 KB (200 words) - 07:54, 7 December 2008
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)