CBSE Class 10 Maths Euclid's Division Lemma and Algorithm
Q.
Use Euclid’s division algorithm to find the HCF of 196 and 38220.
Q.
Use Euclid’s division algorithm to find the HCF of 135 and 225.
Q.
Euclid’s division lemma states that for two positive integers a and b, there exists unique integers q and r such that a = bq + r, where r must satisfy
Next Videos
- If the HCF of 408 and 1032 is expressible in the form 1032m-408×5, find m.
- if r=0,then what is the relationship between a,b and q in a=bq+r of euclid division lemma
- find hcf of72and 108divisions lemma
- the sum of squares of two consecutive multiples of 7 is 637. Find the multiples
- 135 and 225 is dout
- Show that any positive odd integer is of the form 3m,3m+1or3m+2 where m is some integer
- What is division algorithm
- prime factor of 176
- What is algorithm?
- irrational
Kindly Sign up for a personalised experience
- Ask Study Doubts
- Sample Papers
- Past Year Papers
- Textbook Solutions
Sign Up
Verify mobile number
Enter the OTP sent to your number
Change