I’ve been stuck on this too long. I’m trying to filter `countList`

for all primes, but I’m not having any luck. I’m just having trouble finding the primes. I will write the condition that I want to pass:

- The number is greater than 1 AND none of the divisors can divide the number without a remainder.

```
function sumPrimes(num) {
var countList = (function numberList(integer) {
var array = [];
for (var i = 2; i <= integer; i++) {
array.push(i);
}
return array;
}(num));
return countList.filter(function(value) {
for (var i = 1; i < value;) {
return (value > 1) && (value % i === 0) ? value : false;
}
});
}
sumPrimes(10);
```

**Link to the challenge:**