Rsa, Miller Rabin, Prime Numbers, Algorithms, Cryptography.
it’s prime is to search for factors. If we don’t find any then n must be prime. How far do we have to search?. Supposing n is not prime, let’s have p stand for the smallest prime factor of n. Ether n = p² or n has a larger prime factor q. Therefore, p² is less than or equal to n. So, to find a