Search results
Jump to navigation
Jump to search
Page title matches
- | pagename = Greatest common divisor | abc = Greatest common divisor751 bytes (71 words) - 18:49, 29 June 2009
- 12 bytes (1 word) - 15:46, 26 September 2007
- | pagename = Divisor (ring theory) | abc = Divisor (ring theory)2 KB (211 words) - 21:55, 19 October 2008
- 89 bytes (12 words) - 17:25, 6 December 2008
- 189 bytes (26 words) - 02:55, 14 September 2009
- 12 bytes (1 word) - 22:46, 31 March 2008
- | pagename = Divisor (algebraic geometry) | abc = Divisor (algebraic geometry)2 KB (229 words) - 07:19, 15 March 2024
- 112 bytes (14 words) - 18:35, 26 June 2009
- The '''greatest common divisor''' of 60 and 72 is therefore 12. One writes "gcd(60, 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
- 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
- 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
- 147 bytes (16 words) - 07:52, 29 June 2009
Page text matches
- ...rring to relationships, so my preference is that the main page be called [[divisor]]. However the cards fall, I think one of the pages must disappear.[[User: ...titles for chapters in number theory books. <br> Moreover, I think that [[divisor]] may still serve a purpose for the elementary arithmetic meaning of "divio3 KB (449 words) - 14:19, 23 July 2009
- ''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 inclu5 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 th1 KB (200 words) - 07:54, 7 December 2008
- ...one should be renamed, to be more descriptive? How about something like "Divisor (ring theory)"?[[User:Barry R. Smith|Barry R. Smith]] 19:56, 29 March 2008 Okay, changed it to "Divisor (ring theory)"[[User:Barry R. Smith|Barry R. Smith]] 22:53, 31 March 2008 (786 bytes (124 words) - 22:53, 31 March 2008
- ...[integer]]s, ''ab'', then either ''p'' is a divisor of ''a'' or ''p'' is a divisor of ''b'' (or both). suppose that ''p'' is a divisor of ''ab'', ''p''|''ab''.2 KB (322 words) - 12:51, 18 December 2007
- ...because 2 goes into 4 two times, with nothing left over. But 2 is a not a divisor of 5, because 2 goes in 5 2.5 times. .... So if ''d'' = 5 and ''a'' = 15, then ''d''/''a'' = 3, and so ''d'' is a divisor of ''a''.3 KB (498 words) - 09:23, 26 September 2007
- ...ther with a choice of some non-trivial [[effective divisor]] on them. This divisor is called the ''polarization'' on the Abelian surface; A pair <math>(A,C)</ <math>A\to Pic^0(A)</math> by sending a point <math>a</math> to the [[divisor class]] <math>[\tau_{-a} C-C]</math>. This map is a [[group morphism]]. The2 KB (290 words) - 09:39, 13 January 2009
- == Zero being a divisor == ...ttle the article [[divisor]] and tried to explain my changes on the [[Talk:divisor]] page, but unfortunately it didn't work (there seems to be a bug preventin5 KB (824 words) - 17:13, 1 April 2007
- {{r|greatest common divisor}}209 bytes (27 words) - 05:38, 3 July 2009
- ...ere but not stated (and it is true, and is stated on the [[Greatest common divisor]] page) that the last number found before 0 is the gcd (rather than being a ...fore that the greatest common divisor of (a,b) is also the greatest common divisor of (b,c).4 KB (781 words) - 11:46, 26 September 2007
- {{r|greatest common divisor}}207 bytes (26 words) - 19:20, 23 June 2009
- | pagename = Divisor (ring theory) | abc = Divisor (ring theory)2 KB (211 words) - 21:55, 19 October 2008
- | pagename = Divisor (algebraic geometry) | abc = Divisor (algebraic geometry)2 KB (229 words) - 07:19, 15 March 2024
- ...l(K − D) = deg(D) − g + 1 (actually, I think W was used for the canonical divisor there), and only later became aware of the cohomological intepreation and p533 bytes (78 words) - 10:46, 14 November 2007
- The '''greatest common divisor''' of 60 and 72 is therefore 12. One writes "gcd(60, 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
- {{r|Greatest common divisor}}618 bytes (80 words) - 16:24, 11 January 2010
- {{r|Greatest common divisor}}574 bytes (75 words) - 21:21, 11 January 2010
- {{r|Divisor (ring theory)}}675 bytes (89 words) - 17:28, 11 January 2010
- ...) or τ(''n'') or σ<sub>0</sub>(''n''), is the number of positive integer [[divisor]]s of the number ''n''.720 bytes (123 words) - 04:26, 1 November 2013