I don’t think you can do it without using a loop. The function is very efficient.
well if you looked at it I said I’m in school and didn’t test speed at all
besides what if you want the first 1,000 prime numbers
wouldn’t looping through every odd number take a while
I just typed in 1000 and it took half a second.
ok, my main point is I made the post because I couldn’t test yet
I wouldn’t know that info
I’ll mark this as a solution since loops are clearly fastest for this case
Unfortunately any implementation would get progressively slower