Search results
Jump to navigation
Jump to search
- {{r|Euclid's lemma}} {{r|Euclid}}2 KB (262 words) - 19:07, 11 January 2010
- {{r|Euclid's Elements}}1 KB (186 words) - 17:23, 11 January 2010
- A result about unique factorization appeared in book IX of [[Euclid]]'s [[Euclid's Elements|Elements]]. However, it did not apply to all whole numbers, but ...and proof this property to [[Carl Friedrich Gauss]] about 2000 years after Euclid. A precise statement and proof may be found on the "advanced" subpage.3 KB (479 words) - 12:12, 9 April 2008
- {{r|Euclid's lemma}}2 KB (247 words) - 17:28, 11 January 2010
- ...the study and teaching of mathematics in the West. Also in other fields [[Euclid]]'s work led the way. The philosopher [[Baruch Spinoza|Spinoza]] wrote his {{Image|Euclids parallel axiom.png|right|250px|Euclid's parallel axiom. In the upper figure the angles α and β are equ8 KB (1,314 words) - 11:25, 13 January 2020
- {{r|Euclid}}566 bytes (74 words) - 16:25, 11 January 2010
- {{r|Euclid}}618 bytes (80 words) - 16:24, 11 January 2010
- {{r|Euclid}}645 bytes (81 words) - 07:45, 8 January 2010
- {{r|Euclid}}639 bytes (84 words) - 17:14, 11 January 2010
- ...first described by [[Euclid]] more than two thousand years ago in his ''[[Euclid's Elements|The Elements]]'' ...artesian coordinates]], to describe points in the plane and in space. In Euclid's geometry there is no origin, all points are equal.9 KB (1,403 words) - 02:22, 14 October 2013
- ...jor street surveyed, [[Euclid Avenue]], was named for the Greek geometer [[Euclid]]. Cleaveland and his crew of surveyors departed after completing their wo2 KB (374 words) - 10:32, 28 June 2023
- ...Suppose it is desired to find the smallest common multiple of 63 and 77. Euclid's algorithm tells us that the greatest common divisor of 63 and 77 is 7. T6 KB (743 words) - 18:42, 2 July 2009
- ...e plane and the geometry are named after the ancient-Greek mathematician [[Euclid]].1 KB (163 words) - 15:47, 25 November 2008
- ...algorithm''', named after the ancient Greek geometer and number-theorist [[Euclid]], is an [[algorithm]] for finding the [[greatest common divisor]] (gcd) of ..., rather than only the remainders, in the divisions we did while executing Euclid's algorithm, we can find ''x'' and ''y''. Here is how:7 KB (962 words) - 12:05, 3 May 2016
- [[Euclid]] states it — somewhat disguised — in his ''[[Elements]]'' as h Since this statement is much less natural or evident than Euclid's other axioms and postulates,5 KB (852 words) - 05:23, 17 April 2010
- ...factors of a number are large, the algorithm above may be inefficient. [[Euclid's algorithm]] does not involve prime factorizations and runs fast in such c4 KB (570 words) - 18:05, 1 July 2009
- T. Heath, A history of Greek mathematics, Vol. I: From Thales to Euclid, Dover, New York, 1981.1 KB (157 words) - 00:48, 1 January 2009
- ...hing between [[axiom]]s (and postulates), definitions, and [[theorem]]s. [[Euclid]], a Greek mathematician living in [[Alexandria]] about 300 BC wrote a 13-v2 KB (232 words) - 03:09, 8 March 2024
- {{r|Euclid}}2 KB (247 words) - 06:00, 7 November 2010
- ...'s elements]]; it greatly rearranged and simplified the propositions of [[Euclid]]'s classical work. Legendre's ''Elements of Geometry'' was to become the6 KB (854 words) - 09:52, 24 July 2011