The Weird and The Wonderful

mav.northwind wrote:

1 is not a prime number, by definition.

dbrenth wrote:

The first 10000 prime numbers[^]

Giorgi Dalakishvili wrote:

Ask him to write a function that returns weather or not a given number is even

PIEBALDconsult wrote:

Wouldn't this be a good Friday programming quiz?

int Primes[]={2,3,5,7,...,113};
int size=sizeof(Primes[])/sizeof(Primes[0]);
int i=0;
while (i<size)
{
  if (num==Primes[i]) return true;
}
return false;

int Primes[]={2,3,5,7,...,113};
int size=sizeof(Primes[])/sizeof(Primes[0]);
int i=0;
while (i<size)
{
  if (num==Primes[i]) return true;
}
return false;

int primes[] = {2,3,5,...133};
const int* end = primes + sizeof(primes)/sizeof(int);
return (std::find(primes, end, num) != end);

bool IsPrime(int i)
{
  if (i<2)
    return false;
  if (i == 2)
    return true;
  if (i%2 == 1)
    // All odd numbers are prime:
    // 3 ... prime
    // 5 ... prime
    // 7 ... prime
    // 9 ... measuring fault
    // 11... prime
    // 13... prime
    // and so on...
    return true;
  else
    return false;
}