bool isCalypso(int n) { int pairCount=0; for (int i = 2; i <= n/2 && pairCount < 2; i++){ if (isPrime(i) && isPrime(n-i) pairCount++; } return pairCount > 1; }
var
This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)