find hch of 1558,2394 using eucilds division algorithm
Answers
Answered by
0
Let a and b be any two positive Integers .
Then there exist two unique whole numbers q and r such that
a=bq+r ,
0≤r
Now ,
start with a larger integer , that is 2024,
Apply the division lemma to 2024 and 1872,
2014=1872×1+152
1872=152×12+48
152=48×1+8
48=8×6+0
The remainder has now become zero , so our procedure stops.
Since the divisor at this stage is 8 .
∴HCF(2024,1872)=
Then there exist two unique whole numbers q and r such that
a=bq+r ,
0≤r
Now ,
start with a larger integer , that is 2024,
Apply the division lemma to 2024 and 1872,
2014=1872×1+152
1872=152×12+48
152=48×1+8
48=8×6+0
The remainder has now become zero , so our procedure stops.
Since the divisor at this stage is 8 .
∴HCF(2024,1872)=
Answered by
0
HCF is 8
Step-by-step explanation:
Hit the mark as Brainliest button below
Similar questions
Math,
1 month ago
Math,
1 month ago
Math,
2 months ago
Social Sciences,
10 months ago
Geography,
10 months ago