Pretty self-explanatory Faster and removes list limit here: https://turbowarp.org/687479789/fullscreen?limitless&turbo&fps=60&interpolate&stuck
I read a book with a chapter about prime numbers and a manual way to compute them. I wanted to automate this to make it much faster, and here it is. V - How it Works - V Essentially, the algorithm adds all of the numbers from 2 to the number you chose. It then picks the first number (2) and deletes all of the multiples of this number. (If x mod y = 0, y is a multiple of x) After it has done the complete list with 2, it chooses the next number on the list and deletes all of the multiples of the next number (3). It continues to do this until the length of the list doesn't change and it stops.
