Math, asked by 10633601, 10 months ago

Use Euclid division algorithm to find the HCF of question number 1135 and 225

Answers

Answered by sonisiddharth751

Answer:

♛┈⛧┈┈•༶❁❁❁❀❁❁❁༶•┈┈⛧┈♛

[tex\huge\blue{\underline{Hello\: mate}}[/tex]

$\mathfrak{\huge{\underline{\underline{\pink{answer:-}}}}}$

$<body bgcolor= black><Marquee direction= "up"><font color = red >$

1135 ➡️225 × 5 + 10

225 ➡️10 × 22 + 5

10 ➡️ 5 × 2 +0

hence HCF ⏩ 5☑️

$<Marquee> ✿follow me✿</Marquee>$

♛┈⛧┈┈•༶❁❁❁❀❁❁❁༶•┈┈⛧┈♛

Answered by Anonymous

⠀⠀Euclid Division Algorithm

Let a and b be any two positive integers.

Then there exist two unique whole numbers q and r such that

⇴ $\textsf{a = bq+r ,\quad 0 $\leq$ r < b}$

Here , a is called the dividend , b is called the divisor , q is called the quotient and r is called remainder.

$\rule{150}{1}$

$\underline{\bigstar\:\boldsymbol{According\:to\:the\:Question :}}$

$:\implies\sf 1135=225\times5+10\\ {\qquad \qquad \:\:\:\swarrow \qquad \:\:\:\swarrow}\\:\implies\sf 225\:=\:10 \times 22 + 5\\{\qquad \qquad \:\:\:\swarrow \qquad \:\:\:\swarrow}\\:\implies\sf \:10\:=\:\boxed{\textsf{\textbf5}} \times 2 + 0$

⠀

$\therefore\:\underline{\textsf{Hence, HCF of 1135 \& 225 is \textbf{5}}}.$

Previous Question

Next Question