Dado um número aleatório, retornar todos os números PRIMOS entre 0 e o número escolhido

primeNumbers.js

const
  range = x => y =>
    Array.from({length: y - x})
      .map((_, i) => x + i)
      
, {ceil, sqrt} = Math

, lt = y => x =>
    x < y
    
, takeWhile = pred => it => {
    let val, xs = []
    while(pred(val = it.next().value)) {
      xs.push(val)
    }
    return xs
  }
      
, some = pred => xs =>
    xs.some(pred)
    
, not = prop =>
    !prop
    
, divides = x => y =>
    x % y === 0
      
, prime = x =>
    not(some(divides(x))(range(2)(ceil(sqrt(x + 1)))))
    
, primes = function * (n) {
    let i = 2
    do { if (prime(i)) { yield i } } while (i++)
  }
  
takeWhile(lt(100))(primes())

Demais !!!!

Revision inspired by @anabastos