reserve a,b,c,k,m,n for Nat;
reserve p for Prime;

theorem
  32 satisfies_Sierpinski_problem_76b
  proof
    let x be Nat;
    assume 10*32 < x < 10*(32+1);
    then 320 < x < 329+1;
    then 320+1 <= x <= 329 by NAT_1:13;
    then x = 321 or ... or x = 329;
    hence thesis by XPRIMES0:321,322,323,324,325,326,327,328,329;
  end;
