function sumPrimes(num) {
	let acc = 0;
	// loop through all numbers up to and including the given one and 
	// check if they are primes. If so, sum them up
	for (let n = 2; n <= num; n++) {
		if (isPrime(n)) {
			acc += n;
		}
	}
	return acc;
}
// The provided number may not be a prime.
The provided number may not be a prime.
The provided number may not be a prime .
function sumPrimes(num) {
	let acc = 0;
	for (let n = 2; n <= num; n++) {
		if (isPrime(n)) {
			acc += n;
		}
	}
	return acc;
}
function sumPrimes ( num ) { let acc = 0 ; for ( let n = 2 ; n <= num ; n ++ ) { if ( isPrime ( n ) ) { acc += n ; } } return acc ; }
The provided number may not be a prime.
The provided number may not be a prime .
// loop through all numbers up to and including the given one and  // check if they are primes. If so, sum them up