Greatest Common Divisor in pair of cycles

128 Views Asked by At

In this answer, the author says each block of $n\times m$ elements is split into $\gcd(m,n)$ distinct cycles. This seems nontrivial, how is this proven?

1

There are 1 best solutions below

2
On BEST ANSWER

HINT: $$ \gcd(m,n)=\dfrac{m\times n}{\operatorname{lcm}(m, n)} $$