Thread: Why Errors in Prime Number Loop

Hi, I'm writing a program that finds a prime number less than 600 and tests to see if the reverse is also prime (emirp). If so it should output the number. However, the program will not run. Can you please tell me where I am going wrong?

Code:

int reverseNumber(int sourcenum);

int main ()
{
int number, counter, sum;

while(counter<600)
{
	if (isPrime(number))
	{
		sum = reverseNumber(number);
		if (isPrime(sum))
		{
			cout << sum;
			return (0);
		}
	}
	counter++;
}
return (0);
}


Logical isPrime(int integer)
{
  for (int factor = 2; factor<integer; factor++) {
    if ((integer % factor) == 0) 
      return False;
  }
  return True;
}

int reverseNumber(int sourcenum)
{
	int temp = sourcenum;
	int sum = 0;
	while (temp)
	{
		sum*=10;
		sum += temp%10;
		temp/=10;
	}
	return sum;
}