Question

Use euclid division algorithm to find hcf of 9828 and 14742

Answer 1

Here is your answer
PLZ MARK ME AS BRAINLIEST☺☺☺

Answer 2

__________________________________________________________

♦ Euclid's Division Algorithm ♦

→ Recall Euclid's Lemma : [ a = bq + r ] 

 → It says, any two natural numbers can be paired up in a Numerical Equation which involves two parameters, the remainder 'r', the quotient 'q', where, the number 'a' is the dividend and 'b' is the divisor

→ Euclid's Lemma establishes a relation between what we always did in small classes [ LONG DIVISION ^^" ]
_____________________________________________________________

→ Euclid's Algorithm :-
  → 14742 = 9828 x 1 + 4914
   →  9828 = 4914 x 2 + 0

=>   The number '4914' leaves no remainder and is the final Divisor in the Euclidean Algorithm 

=> HCF( 9828 , 14742 ) = 4914
________________________________________________________

^_^ Hope it helps [ Skip the Introduction Part if you're already done ]
                    [ the answer's way short on its own ^_^ ]