int sumPrimes(int n) { if(n < 2) return 0; else if(prime(n)) return sumPrimes(n-1) + n; else return sumPrimes(n-1); }