No products in the cart.

Use Euclid Division algorithm to find …

CBSE, JEE, NEET, CUET

CBSE, JEE, NEET, CUET

Question Bank, Mock Tests, Exam Papers

NCERT Solutions, Sample Papers, Notes, Videos

Use Euclid Division algorithm to find the hcf
  • 1 answers

Rakhi Rajput 5 years, 3 months ago

Let us state Euclid's division algorithm clearly. To obtain the HCF of two positive integers, say c and d, with c>d, follow the steps below: Step 1:-Aplly Euclid division lemma, to c and d ,with no. , q and r. such that c=dq+r,0<r<d. Step 2:- If r=0, d is the HCF of c and d. If r is not equal to 0, apply the division lemma to d and r. Step3:- Continue the process till the remender is zero . The divisor at this stage will be the required HCF.
https://examin8.com Test

Related Questions

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