EUCLID'S DIVISION LEMMA


  • Euclid's division lemma: Given positive integers a and b, there exist unique integers q and r satisfying a = bq + r, 0 <= r < b.
  • Euclid's division algorithm is a technique to compute the highest common factor ( HCF ) of two given positive integers. 
  • A lemma is a proven statement used for proving another statement.

Comments

Popular posts from this blog

DOT PUZZLE ( CONNECT ALL THE DOTS WITHOUT LIFTING THE PEN AND WITH ONLY FOUR STRAIGHT LINES WITHOUT ANY OVERLAP )

EULER TRAIL PUZZLE