
theorem
  4649 is prime
proof
  now
    4649 = 2*2324 + 1; hence not 2 divides 4649 by NAT_4:9;
    4649 = 3*1549 + 2; hence not 3 divides 4649 by NAT_4:9;
    4649 = 5*929 + 4; hence not 5 divides 4649 by NAT_4:9;
    4649 = 7*664 + 1; hence not 7 divides 4649 by NAT_4:9;
    4649 = 11*422 + 7; hence not 11 divides 4649 by NAT_4:9;
    4649 = 13*357 + 8; hence not 13 divides 4649 by NAT_4:9;
    4649 = 17*273 + 8; hence not 17 divides 4649 by NAT_4:9;
    4649 = 19*244 + 13; hence not 19 divides 4649 by NAT_4:9;
    4649 = 23*202 + 3; hence not 23 divides 4649 by NAT_4:9;
    4649 = 29*160 + 9; hence not 29 divides 4649 by NAT_4:9;
    4649 = 31*149 + 30; hence not 31 divides 4649 by NAT_4:9;
    4649 = 37*125 + 24; hence not 37 divides 4649 by NAT_4:9;
    4649 = 41*113 + 16; hence not 41 divides 4649 by NAT_4:9;
    4649 = 43*108 + 5; hence not 43 divides 4649 by NAT_4:9;
    4649 = 47*98 + 43; hence not 47 divides 4649 by NAT_4:9;
    4649 = 53*87 + 38; hence not 53 divides 4649 by NAT_4:9;
    4649 = 59*78 + 47; hence not 59 divides 4649 by NAT_4:9;
    4649 = 61*76 + 13; hence not 61 divides 4649 by NAT_4:9;
    4649 = 67*69 + 26; hence not 67 divides 4649 by NAT_4:9;
  end;
  then for n being Element of NAT st 1 < n & n*n <= 4649 & n is prime
  holds not n divides 4649 by XPRIMET1:38;
  hence thesis by NAT_4:14;
end;
