Euclidean Algorithm problem about the third segment [on hold]

Given two uneven segments a and b, prove that if the segment c is obtained by the Euclidean Algorithm, it is the greatest common measure between a and b.

=================

=================

=================