Finding prime numbers is... difficult to say the least. Even more so when you are brute-forcing them. Basically, it's hard to write a brute-forcer for prime numbers. I brought in the is_int(x) function that I defined before to easily determine if x divided by an integer resulted in a floating-point number, which is a number including decimal places(like 2.5). Obviously, if x is less than 2, the number is not prime. Then, however, I get caught on looping through a list of numbers between 2 and x. I even forgot what this code does. Remember kids, always comment your code.
No comments:
Post a Comment