If (N mod K) = 0 then checkbox: =False. Writeln(checkbox). While. 22; var N,k: Integer; checkbox: Boolean; begin Write('Введите число N: '); Readln(N); checkbox: =True; K: =1; while. K< N- 1do begin Inc(k,1); If(Nmod.
K)=0thencheckbox: =False; end; Writeln(checkbox); end. Решение от Newton. While. 22. Number, Test : Integer. Prime : Boolean. write('N: '). Number). Prime : = True.
Test : = 2. while (Test < = round(Number / 2)) and Prime do. Prime : = (Number mod Test) > 0.
Test : = Test + 1. Prime). end. 1. 23. While. 22; var Number,Test: Integer; Prime: Boolean; begin write('N: '); readln(Number); begin Prime: =True; Test: =2; while(Test< =round(Number/2))and. Prime do begin Prime: =(Number mod. Test)> 0; Test: =Test+1; end; end; writeln(Prime); end.
Решение. program While. N, Count : Integer. N: '). while ((Count < = round(N / 2)+1) and ((N mod Count)> 0)) do inc(Count). Count> round(N/2)). While. 22; var N,Count: Integer; begin write('N: '); readln(N); Count: =2; while((Count< =round(N/2)+1)and((Nmod. Count)> 0))doinc(Count); writeln(Count> round(N/2)); end. Другие задачи из раздела While можно посмотреть здесь.