void QuadraticPrimes()
{
auto a_max = 0;
auto b_max = 0;
auto n_max = 0;
for (auto a = -999; a < 1000; ++a) {
// find x based on transformed prime-generating polynomial formula here
// http://mathworld.wolfram.com/Prime-GeneratingPolynomial.html
auto x = (a - 1) / -2;
for (auto b = -999; b < 1000; ++b) {
if (x * x - x + 41 == b && CheckPrime(b)) {
auto n = 0;
while (CheckPrime(PrimePolynomial(n, a, b))) {
++n;
}
if (n > n_max) {
a_max = a;
b_max = b;
n_max = n;
}
}
} // b
} // a
std::cout << a_max << " " << b_max << " " << a_max * b_max << std::endl;
}
int main() {
int i;
printf("Enter upper bound:\n");
scanf("%d", &UpperBound);
Prime[1] = 1;
Prime[2] = 1;
for (i = 3; i <= UpperBound; i += 2) {
CheckPrime(i, Prime);
if (Prime[i]) {
printf("%d is a prime\n", i);
} /* if (Prime[i]) */
} /* for (i = 3; i <= UpperBound; i += 2) */
return 0;
} /* main() */
int main(int argc, char const *argv[])
{
int i = 0;
scanf ("%d", &N);
int* S = malloc (sizeof(int) * N);
for (i = 0; i < N; i++)
scanf("%d", &S[i]);
for (i = 0; i < N; i++)
{
if (CheckPrime(S, S[i]) == 1)
{
printf("%d ", S[i]);
}
}
return 0;
}
T FindPrimeFactor(T number)
{
return CheckPrime(number) ? number : FindPrimeFactor(GetFactor(number));
}
