reserve n,k,b for Nat, i for Integer;

theorem Th66:
  59 divides n iff 59 divides
  value(mid(digits(n,10),2,len(digits(n,10))),10) + 6*digits(n,10).0
  proof
    reconsider p=59 as Prime by Th28;
    A1: 10*6 - 1 = p*1;
    p,10 are_coprime by EULER_1:2;
    hence thesis by Th38,A1;
  end;
