Euclidean algorithm/Related Articles: Difference between revisions
Jump to navigation
Jump to search
imported>Daniel Mietchen m (Robot: Creating Related Articles subpage) |
imported>Daniel Mietchen m (Robot: encapsulating subpages template in noinclude tag) |
||
| Line 1: | Line 1: | ||
{{subpages}} | <noinclude>{{subpages}}</noinclude> | ||
==Parent topics== | ==Parent topics== | ||
Revision as of 16:45, 11 September 2009
- See also changes related to Euclidean algorithm, or pages that link to Euclidean algorithm or to this page or whose text contains "Euclidean algorithm".
Parent topics
Subtopics
Bot-suggested topics
Auto-populated based on Special:WhatLinksHere/Euclidean algorithm. Needs checking by a human.
- Algorithm [r]: A sequence of steps used to solve a problem. [e]
- Chinese remainder theorem [r]: Theorem that if the integers m1, m2, …, mn are relatively prime in pairs and if b1, b2, …, bn are integers, then there exists an integer that is congruent to bi modulo mi for i=1,2, …, n. [e]
- Diophantine equation [r]: Equation in which the unknowns are required to be integers. [e]
- Euclid [r]: (ca. 325 BC - ca. 265 BC) Alexandrian mathematician and known as the father of geometry. [e]
- Greatest common divisor [r]: The largest positive natural number which divides evenly all numbers given. [e]
- Integer [r]: The positive natural numbers (1, 2, 3, …), their negatives (−1, −2, −3, ...) and the number zero. [e]
- Least common multiple [r]: The smallest integer which is divided evenly by all given numbers. [e]
- Natural number [r]: An element of 1, 2, 3, 4, ..., often also including 0. [e]
- Prime number [r]: A number that can be evenly divided by exactly two positive whole numbers, namely one and itself. [e]