function isPrime(X: LongInt): boolean; {проверка числа на простоту}
var i, mborder: integer;
Begin
isPrime:=false;
if x<2 then Exit;
if not odd(x) and (x<>2) { проверяем на чётность }
then exit;
i:=3;
mborder := trunc(sqrt(x));
while i <= mborder do { проверяем только нечётные }
begin
if x mod i = 0 then Exit;
inc(i,2);
end;
isPrime:=true;
End;
var m : longint;
flag:boolean;
begin
repeat
WriteLn('Введите простое число m:');
ReadLn(m);
flag := isPrime(m);
if Not flag then WriteLn('Неверно. Число ',m,' составное!');
until flag;
repeat
inc(m);
until isPrime(m);
WriteLn('следующее простое число: ',m);
//readln;
end.
ZnVuY3Rpb24gaXNQcmltZShYOiBMb25nSW50KTogYm9vbGVhbjsge9C/0YDQvtCy0LXRgNC60LAg0YfQuNGB0LvQsCDQvdCwINC/0YDQvtGB0YLQvtGC0YN9CnZhciBpLCBtYm9yZGVyOiBpbnRlZ2VyOwpCZWdpbgogICAgIGlzUHJpbWU6PWZhbHNlOwogICAgIGlmIHg8MiB0aGVuIEV4aXQ7CiAgICAgaWYgbm90IG9kZCh4KSBhbmQgKHg8PjIpIHsg0L/RgNC+0LLQtdGA0Y/QtdC8INC90LAg0YfRkdGC0L3QvtGB0YLRjCAgfQogICAgICAgICAgdGhlbiBleGl0OwogICAgIGk6PTM7CiAgICAgbWJvcmRlciA6PSB0cnVuYyhzcXJ0KHgpKTsKICAgICB3aGlsZSBpIDw9IG1ib3JkZXIgIGRvIHsg0L/RgNC+0LLQtdGA0Y/QtdC8INGC0L7Qu9GM0LrQviDQvdC10YfRkdGC0L3Ri9C1IH0KICAgICBiZWdpbgogICAgICAgICAgaWYgeCBtb2QgaSA9IDAgdGhlbiBFeGl0OwogICAgICAgICAgaW5jKGksMik7CiAgICAgZW5kOwogICAgIGlzUHJpbWU6PXRydWU7CkVuZDsKCgp2YXIgbSA6IGxvbmdpbnQ7CiAgZmxhZzpib29sZWFuOwpiZWdpbgogICByZXBlYXQKICAgICAgV3JpdGVMbign0JLQstC10LTQuNGC0LUg0L/RgNC+0YHRgtC+0LUg0YfQuNGB0LvQviBtOicpOwogICAgICBSZWFkTG4obSk7CiAgICAgIGZsYWcgOj0gaXNQcmltZShtKTsKICAgICAgaWYgTm90IGZsYWcgdGhlbiBXcml0ZUxuKCfQndC10LLQtdGA0L3Qvi4g0KfQuNGB0LvQviAnLG0sJyDRgdC+0YHRgtCw0LLQvdC+0LUhJyk7CiAgIHVudGlsIGZsYWc7CiAgIHJlcGVhdAogICAgIGluYyhtKTsKICAgdW50aWwgaXNQcmltZShtKTsKICAgV3JpdGVMbign0YHQu9C10LTRg9GO0YnQtdC1INC/0YDQvtGB0YLQvtC1INGH0LjRgdC70L46ICcsbSk7CiAgIC8vcmVhZGxuOwplbmQuCg==