No products in the cart.

What is euclid division of lemma …

CBSE, JEE, NEET, CUET

CBSE, JEE, NEET, CUET

Question Bank, Mock Tests, Exam Papers

NCERT Solutions, Sample Papers, Notes, Videos

What is euclid division of lemma and algorithm
  • 3 answers

Yogita Ingle 5 years, 7 months ago

According to Euclid’s Division Lemma if we have two positive integers a and b, then there exist unique integers q and r which satisfies the condition a = bq + r where 0 ≤ r ≤ b.

The basis of the Euclidean division algorithm is Euclid’s division lemma. To calculate the Highest Common Factor (HCF) of two positive integers a and b we use Euclid’s division algorithm. HCF is the largest number which exactly divides two or more positive integers. By exactly we mean that on dividing both the integers a and b the remainder is zero.

Arjun Kashyap 5 years, 7 months ago

I don't know

Himalya Attri 5 years, 7 months ago

Nothing
https://examin8.com Test

Related Questions

Find the nature of quadratic equation x^2 +x -5 =0
  • 0 answers
X-y=5
  • 1 answers
(A + B )²
  • 1 answers
Venu Gopal has twice
  • 0 answers
Prove that root 8 is an irration number
  • 2 answers
sin60° cos 30°+ cos60° sin 30°
  • 2 answers

myCBSEguide App

myCBSEguide

Trusted by 1 Crore+ Students

Test Generator

Test Generator

Create papers online. It's FREE.

CUET Mock Tests

CUET Mock Tests

75,000+ questions to practice only on myCBSEguide app

Download myCBSEguide App