
theorem
  2593 is prime
proof
  now
    2593 = 2*1296 + 1; hence not 2 divides 2593 by NAT_4:9;
    2593 = 3*864 + 1; hence not 3 divides 2593 by NAT_4:9;
    2593 = 5*518 + 3; hence not 5 divides 2593 by NAT_4:9;
    2593 = 7*370 + 3; hence not 7 divides 2593 by NAT_4:9;
    2593 = 11*235 + 8; hence not 11 divides 2593 by NAT_4:9;
    2593 = 13*199 + 6; hence not 13 divides 2593 by NAT_4:9;
    2593 = 17*152 + 9; hence not 17 divides 2593 by NAT_4:9;
    2593 = 19*136 + 9; hence not 19 divides 2593 by NAT_4:9;
    2593 = 23*112 + 17; hence not 23 divides 2593 by NAT_4:9;
    2593 = 29*89 + 12; hence not 29 divides 2593 by NAT_4:9;
    2593 = 31*83 + 20; hence not 31 divides 2593 by NAT_4:9;
    2593 = 37*70 + 3; hence not 37 divides 2593 by NAT_4:9;
    2593 = 41*63 + 10; hence not 41 divides 2593 by NAT_4:9;
    2593 = 43*60 + 13; hence not 43 divides 2593 by NAT_4:9;
    2593 = 47*55 + 8; hence not 47 divides 2593 by NAT_4:9;
  end;
  then for n being Element of NAT st 1 < n & n*n <= 2593 & n is prime
  holds not n divides 2593 by XPRIMET1:30;
  hence thesis by NAT_4:14;
end;
