How to define a list that contains all primes less than x?

Question

how can I define my own list in which I have all primes less than x?

Prime @ Range @ PrimePi @ x. See e.g. this question What is so special about Prime? to get an idea about possible limitations of this approach. — Artes, May 07 '14 at 17:21
Or Cases[Range@x, _?PrimeQ] But Artes version is much faster :) — Öskå, May 07 '14 at 17:25
@Öskå A possible alternative would be the NextPrime function see e.g. Why does iterating Prime in reverse order require much more time? for completing the method above. — Artes, May 07 '14 at 17:28
I would recommend also a closer look at this question Is there a way to use functions like Prime within Solve? — Artes, May 07 '14 at 17:57
@Öskå I suggest you can do it. I have seen recently such a question but haven't found it yet. — Artes, May 07 '14 at 21:16

score 4 · Answer 1 · edited Apr 13 '17 at 12:55

4

Prime @ Range @ PrimePi @ x. See e.g. this question What is so special about Prime? to get an idea about possible limitations of this approach.

Application of what is being said:

primeInf[x_] := Prime @ Range @ PrimePi @ x
primeInf@20

{2, 3, 5, 7, 11, 13, 17, 19}

edited Apr 13 '17 at 12:55

Community

answered May 08 '14 at 18:18

Öskå

1 Answers1