Greatest common divisor

From testwiki
Jump to navigation Jump to search

English

Template:Wikipedia

Noun

Template:En-noun

  1. Template:Lb The largest positive integer (respectively polynomial, element of a given ring) that is a divisor of each of a given set of integers (respectively polynomials, elements of a given ring).
    Template:Ux
    • 1974, John M. Peterson, Basic Concepts of Elementary Mathematics, Prindle, Weber & Schmidt, page 148,
      Euclid's algorithm is a process for finding the greatest common divisor of any two whole numbers.
    • Template:Quote-book
    • Template:Quote-book

Synonyms

Antonyms

Translations

Template:Trans-top

Template:Trans-bottom

Further reading

Template:C