Question

how to get 98 and 256
LCM in euclids division lemma​

Answer 1

Answer:

Step-by-step explanation:

According to Euclid's Division Lemma if we have two positive integers a and b, then there exist unique integers q and r which satisfies the condition a = bq + r where 0 ≤ r ≤ b. The basis of the Euclidean division algorithm is Euclid's division lemma.

Plz mark as brainliest

I will follow u