
theorem
  3371 is prime
proof
  now
    3371 = 2*1685 + 1; hence not 2 divides 3371 by NAT_4:9;
    3371 = 3*1123 + 2; hence not 3 divides 3371 by NAT_4:9;
    3371 = 5*674 + 1; hence not 5 divides 3371 by NAT_4:9;
    3371 = 7*481 + 4; hence not 7 divides 3371 by NAT_4:9;
    3371 = 11*306 + 5; hence not 11 divides 3371 by NAT_4:9;
    3371 = 13*259 + 4; hence not 13 divides 3371 by NAT_4:9;
    3371 = 17*198 + 5; hence not 17 divides 3371 by NAT_4:9;
    3371 = 19*177 + 8; hence not 19 divides 3371 by NAT_4:9;
    3371 = 23*146 + 13; hence not 23 divides 3371 by NAT_4:9;
    3371 = 29*116 + 7; hence not 29 divides 3371 by NAT_4:9;
    3371 = 31*108 + 23; hence not 31 divides 3371 by NAT_4:9;
    3371 = 37*91 + 4; hence not 37 divides 3371 by NAT_4:9;
    3371 = 41*82 + 9; hence not 41 divides 3371 by NAT_4:9;
    3371 = 43*78 + 17; hence not 43 divides 3371 by NAT_4:9;
    3371 = 47*71 + 34; hence not 47 divides 3371 by NAT_4:9;
    3371 = 53*63 + 32; hence not 53 divides 3371 by NAT_4:9;
  end;
  then for n being Element of NAT st 1 < n & n*n <= 3371 & n is prime
  holds not n divides 3371 by XPRIMET1:32;
  hence thesis by NAT_4:14;
end;
