.


- 3


begin

m := a; n := b

end

else

begin

m := b; n := a

end;

k := p + m

until k mod n = 0

end;

2- ( ).

Procedure nok1(a, b : integer; var

k : integer);

var

n : integer;

begin

n := a*b;

repeat

c := a mod b;

a := b; b := c

until b = 0;

k := n div a

end;

10. .

1-

 

Procedure everyone_divisor(n : integer);

var

i : integer;

begin

writeln(' ', n);

for i := 1 to n div 2 do

if n mod i = 0 then write(i, ' ');

writeln(n)

end;

 

2-

 

Procedure everyone_divisor(n : integer);

var

i : integer;

begin

writeln(' ', n);

for i := 1 to trunc(sqrt(n)) do

if n mod i = 0 then write(i, ' ', n div i, ' ')

end;

11. , :

Procedure number_division(n : integer; var k : integer);

var

d : integer;

begin

k := 0;

for d := 1 to n div 2 do

if n mod d = 0 then k := k + 1;

k := k + 1

end;

12. :

Procedure probleme_number(n : integer);

var

i : integer;

begin

while n mod 2 = 0 do

begin

write(2, ' ');

n := n div 2

end;

i := 3;

while i <= n do

if n mod i = 0 then




- -  - -  - -