.


5


, .

4. [n, m].

: [n, m], m , , .

.

,

repeat ... until ...

(p := n), , p - m (until p = m).

:

p := n;

repeat

....

p := p + 1

until

p = m;

"" , . , .

, :

if p = 2 then write(p:4 , ' ')

else if p = 3

then write(p:4, ' ')

else if p mod 2 <> 0

then

begin

i := 3; k := 0;

repeat

if p mod

i = 0 then k := k + 1;

i := i + 2

until i > p

div 2;

if k = 0 then