In the following $C$ program fragment, $j$, $k$, $n$ and TwoLog_n are integer variables, and $A$ is an array of integers. The variable $n$ is initialized to an integer $\geqslant 3$, and TwoLog_n is initialized to the value of $2^*\lceil \log_2(n) \rceil$
for (k = 3; k <= n; k++)
A[k] = 0;
for (k = 2; k <= TwoLog_n; k++)
for (j = k+1; j <= n; j++)
A[j] = A[j] || (j%k);
for (j = 3; j <= n; j++)
if (!A[j]) printf("%d", j);
The set of numbers printed by this program fragment is
-
$\left\{m \mid m \leq n, (\exists i)\left[m=i!\right]\right\}$
-
$\left\{m \mid m \leq n, (\exists i) \left[m=i^2\right]\right\}$
-
$\left\{m \mid m \leq n, \text{m is prime} \right\}$
-
{ }