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

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