Prove that the indicated languages are not regular without using the pumping lemma. (Proofs using the pumping lemma will receive credit if they are completely correct; they will not be eligible for partial credit.)

Problem 39. {0"1" ged(m, n) = 1}