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

theorem Th84:
  101 divides n iff 101 divides
  value(mid(digits(n,10),2,len(digits(n,10))),10) - 10*digits(n,10).0
  proof
    reconsider p=101 as Prime by Th36;
    A1: 10*10 + 1 = p*1;
    p,10 are_coprime by EULER_1:2;
    hence thesis by Th37,A1;
  end;
