HCF of A and B divides all ____ of a and b
Answers
What would you like to ask?
10th
Maths
Real Numbers
Euclid's Division Lemma
According to Euclid's divis...
MATHS
avatar
Asked on December 30, 2019 by
Sruthii Dhamodharan
According to Euclid's division algorithm, using Euclid's division lemma for any two positive integers a and b with a>b enables us to find the
MEDIUM
Share
Study later
ANSWER
According to Euclid's division lemma,
For each pair of positive integers a and b, we can find unique integers q and r satisfying the relation
a=bq+r,0≤r≤b
If r=0 then q will be HCF of a and 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.
hey mate here is your answer
HCF of A and B divides all multiples of a and b
hope it may help you
PLZ MARK ME THE BRAINLIEST!!!