This engine basically detects if the number is prime or composite, or neither of them. I was inspired to do this when I was doing some kind of stupid question with large prime numbers. If you wish to know how it worked, take a look inside the project. PS the larger the prime number, the larger amount of time is used to check the number. And that's why TurboWarp exists (suggested): https://turbowarp.org/819184319
Given an input number n, check whether it is divisible by any prime number between 2 and √n. If yes, then n is composite. Otherwise, it is prime. This method is what we call a trial decision. This is a quick method I found in Wikipedia to check for the primality of a number. Link: https://en.wikipedia.org/wiki/Primality_test#:~:text=The%20simplest%20primality%20test%20is%20trial%20division%3A%20given%20an%20input%20number%2C%20n%2C%20check%20whether%20it%20is%20evenly%20divisible%20by%20any%20prime%20number%20between%202%20and%20%E2%88%9An%20(i.e.%20that%20the%20division%20leaves%20no%20remainder).%20If%20so%2C%20then%20n%20is%20composite.%20Otherwise%2C%20it%20is%20prime. I have spent about an hour doing the explanation inside this project, hope you will understand, for those who actually bothered to roam around the scripts. Everything is made by me in TurboWarp, credit if used btw. (I don't think this can be used on something anyways)
