Prime factorization - C
doing cond?false:true is very odd to see and very much prone to mistakes in writing or reading. It's better to use negation in the condition:

bool isEvenlyDivide(int compositeNumber, int number){
  return (compositeNumber % number) == 0;
}


You can reduce the number of checks you do by using the knowledge that you only need to check prime factors up to the square root of wholeNumber, all but one prime is odd:

if(isEvenlyDivide(wholeNumber, 2)){
  return false;
}
for(int isItFactor = 3; isItFactor*isItFactor &lt;= wholeNumber; isItFactor+=2)
    if(isEvenlyDivide(wholeNumber, isItFactor)){
      return false;
    }
}


That can also be used for findNextPrime, speaking of recursion isn't the best way to describe looping until you find something instead prefer an explicit loop:

int findNextPrime(int primeNumber){

    int number = primeNumber+1;
    if(isEvenlyDivide(primeNumber, 2)){
      number ++;
    }
    while(!isPrime(number)){
        number+=2;
    }
    return number;
}


When looping over all primes you can make use of the previous primes you have found to skip the non-primes. This can be done using the for example sieve of Eratosthenes.