No products in the cart.

explain euclids divison lemma

CBSE, JEE, NEET, CUET

CBSE, JEE, NEET, CUET

Question Bank, Mock Tests, Exam Papers

NCERT Solutions, Sample Papers, Notes, Videos

explain euclids divison lemma
  • 2 answers

Ankit Shukla 7 years, 8 months ago

Euclid division lemma method is based on formula of Dividend = Divisor × Quotient + Remainder It is similar method to division method but in this only we use a formula given above . And finally last Divisor is our hcf .

Akshay Kumar 7 years, 8 months ago

The basis of euclidean division alogorithm is eculids divison lema. To calculate the HCF of two positive integer we use eculids division algorithm. HCF is largest no which exactly divides two or more positive integer
https://examin8.com Test

Related Questions

Venu Gopal has twice
  • 0 answers
X-y=5
  • 1 answers
Find the nature of quadratic equation x^2 +x -5 =0
  • 0 answers
(A + B )²
  • 1 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