GitHub repository: md-muqtadir-fuad/prime-number-recognizer
Created: 2021-07-27T13:23:55Z
Description: 'L' will incremented consecutively and each 'L' will find the modulus of x. If the modulus is 'zero' for any value of 'L' then the number is NOT prime. Otherwise, if any of 'L' equals to x then the number is absolutely