2
$\begingroup$

Given the natural numbers bbb...b (n digits equal to b) and bbbb...b(m digits equal to b), show that the greatest common divisor of these numbers is bbb ... b (M digits equal to b, where M is the greatest common divisor of n and m).

  • 0
    This is essentially a duplicate of the question linked in my answer.2010-11-16

1 Answers 1