Number theory

Question

0

153

4

Let $m=\underbrace{22222222}_{\text{8 digits}}$ and $n=\underbrace{444444444}_{\text{9 digits}}$ .

What is gcd (m,n)?

Guest Mar 13, 2023

Guest · Answer 1 · 2023-03-13T04:34:52

0

By the Euclidean Algorithm, gcd(m,n) = 22.

Guest Mar 13, 2023

0

i think you mean 2 instead of 22

Guest Mar 15, 2023

0

ya the answer is 2

Guest Mar 17, 2023