Hi everyone,

I need some help in the following task:

I am writing a Pascal program that will

1). find the first 100 prime numbers and store them in an array.

2). give a choice to the user, who will choose which number base the prime numbers will be displayed in (I have to validate this entry, so only valid choices may be made). Then display the prime numbers in the requested base (base 10-decimal, base 2-binary, base 8-octal or base 16-hex).

3). quit the program when the option to quit is chosen.

The thing is that I managed to do only the first part of the program and I don't know how to continue the two other parts. If anyone is willing to help me, I would be grateful...Thank you in advance.

The first part of the program that I managed to do is the following:

```
Program Prime_Numbers;
uses crt;
Var
limit: longint;
p: array[1..52441] of boolean;
i, n : longint;
c:integer;
Begin
clrscr;
limit:= 52441; {search limit}
{assume all numbers are prime at first}
for n:=2 to limit do p[n]:= true;
{eliminate multiples of each pair}
for n:= 2 to Round(SQRT(limit)) do
IF p[n] Then
BEGIN
i := 0;
REPEAT
p[n * n + I * n] := false;
i := I + 1;
Until
n *n+i*n > limit;
End;
c:= 0;
for n:= 2 to limit Do
if p[n] And (c<100) Then
Begin
WriteLn(n);
c:=c+1;
end;
Readln;
End.
```

*Edited 3 Years Ago by happygeek*: fixed formatting