theorem
  p is prime implies p |-count(n0 gcd m0) = min(p |-count n0,p |-count m0)
  by Lm1;
