Fix typo in first Euler problem exercise

[snicklepickles]

There may be a possible typo in the exercise description and solution comments. From the Project Euler problem statement:

If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23. Find the sum of all the multiples of 3 or 5 below 1000.

Doesn't this mean we are summing the numbers that are divisible by 3 or 5, and filtering out the ones that are not? This also appears consistent with the logic in the provided solutions:

const filtered = filter(
  (x) => x % 3 === 0 || x % 5 === 0,
  take(n - 1, naturals)
);