Hi scripters! I found an interesting algorithm that you can do on a piece of paper to find any prime numbers until a given range. I wanted to know how to script it in lua.
So basically the algorithm goes like this:
you plot a table from 1 until a given number say 100.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100
Then you cancel out 1 because 1 is not a prime. Then you circle number 2 because 2 is PRIME Next you CANCEL out the Multiples of 2 Then you circle number 3 because 3 Is PRIME and then cancel the multiples of 3 then do that for 5,7 etc
eventually you'll get all the prime numbers before 100.
Can you script this in a table? a = {--values here}
or the numeric for loop?
If you guys have any other cool prime checking algorithm post them here