Pascal program to find prime numbers (2 to 50)

program product(input, output);

uses crt;

var a,b,c,d:integer;

begin

writeln(‘Enter an integer’);

readln(a);

writeln(‘Enter an integer’);

readln(b);

c=a*b;

writeln(c)
d:=a div b;

writeln(d)

readln;
 end.