On Tue, May 31, 2011 at 11:36 PM, Rachel-Mikel ArceJaeger <[email protected]> wrote: > Isn't one of the unsolved millenium prize problems one that includes the > ability to find all of the prime numbers? I'm not sure if your program is > possible if the input number is large. > But to check if a number x is an int, just do this: > x == int(x) >
That would've been pretty change, since the amount of prime number is infinite. And we've known that it is infinite for hundreds of years. http://en.wikipedia.org/wiki/Millennium_Prize_Problems _______________________________________________ Tutor maillist - [email protected] To unsubscribe or change subscription options: http://mail.python.org/mailman/listinfo/tutor
