This Project, when a version is clicked and after all the lists have been emptied, will test to see if a number is a prime number or not. Prime Numbers go on the left list and non-prime numbers go in the right list. The middle list was critical for logging the results of every calculation for a given number; so the code could later test the results, and see if the number was prime or not. The way the program tests for prime numbers involves testing to see if a given equation will result in an answer with a decimal point. If every number in the Results log has a decimal point, the number is prime. If there are any whole numbers in the list, the number is not prime. The program will then delete all results except for the last result (It is impossible for a number to have a factor one less than itself, and it provides all possible factors to be replaced with the word Prime), and if the remaining entry is a whole number, than the Number being tested is not prime (the program will evidently stop earlier than that since there will be other instances of a whole number way before the end of the list). If the remaining entry is the word Prime, then the number is prime, of course. The numbers are then added to their corresponding lists, the program resets crucial data, increases the tested number by one, and repeats the whole process. As the numbers get higher, the program takes longer to determine if the number is prime or not. I am currently working to find a solution to this problem and make the program faster.
My own idea, figured out everything myself. ---------------------------------October 27th, 2018------------------------ *VERSION 2.0 RELEASED. -INSANELY faster -Removes the need of... a)Results list b)Many variables c)Manually adding 1 and 2 to their designed lists (and all other manual inputting) d)15 different modules of code to speed up result collection (2.1 adds them back) -Calculates all non primes at a constant rate; up until the thousands does the same with prime numbers -Relies on the round function (exploits the mechanic of rounding changing the results- if the result stays the same, the result is a whole number, making the number prime- if it changes, its a decimal, so the code tries for more results to ensure the number is truly prime)
