# [Jelly][1], 3 [bytes][2]

    ÆRL

Jelly has a built-in prime counting function, `ÆC` and a prime checking function, `ÆP`, this instead uses a built-in prime generating function, `ÆR` and takes the length `L`.

I guess this is about as borderline as using prime factorisation built-ins, which would also take 3 bytes with `!Æv` (`!` factorial, `Æv` count prime factors)


  [1]: https://github.com/DennisMitchell/jelly
  [2]: https://github.com/DennisMitchell/jelly/wiki/Code-page