Euclid's lemma/Related Articles: Difference between revisions
Jump to navigation
Jump to search
imported>Daniel Mietchen m (Robot: Creating Related Articles subpage) |
No edit summary |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Line 1: | Line 1: | ||
{{subpages}} | <noinclude>{{subpages}}</noinclude> | ||
==Parent topics== | ==Parent topics== | ||
| Line 19: | Line 19: | ||
{{r|Prime number}} | {{r|Prime number}} | ||
{{Bot-created_related_article_subpage}} | |||
<!-- Remove the section above after copying links to the other sections. --> | <!-- Remove the section above after copying links to the other sections. --> | ||
==Articles related by keyphrases (Bot populated)== | |||
{{r|Euclidean algorithm}} | |||
{{r|Unique factorization}} | |||
Latest revision as of 06:00, 14 August 2024
- See also changes related to Euclid's lemma, or pages that link to Euclid's lemma or to this page or whose text contains "Euclid's lemma".
Parent topics
Subtopics
Bot-suggested topics
Auto-populated based on Special:WhatLinksHere/Euclid's lemma. Needs checking by a human.
- Euclid [r]: (ca. 325 BC - ca. 265 BC) Alexandrian mathematician and known as the father of geometry. [e]
- Integer [r]: The positive natural numbers (1, 2, 3, …), their negatives (−1, −2, −3, ...) and the number zero. [e]
- Multiplication [r]: The binary mathematical operation of scaling one number or quantity by another (multiplying). [e]
- Prime number [r]: A number that can be evenly divided by exactly two positive whole numbers, namely one and itself. [e]
- Euclidean algorithm [r]: Algorithm for finding the greatest common divisor of two integers [e]
- Unique factorization [r]: Every positive integer can be expressed as a product of prime numbers in essentially only one way. [e]