Does it successfully reject invalid inputs, or produce an undefined[1] result? :)
[1] I say "undefined", but I think I know what it's going to be :)
(Yes, the phrase "factorising large primes" really bugs me too -- even more so because I actually recognise in myself a tendency to say it, so although wrong, it must have _some_ resonance with what it ought to mean.)
![[personal profile]](https://www.dreamwidth.org/img/silk/identity/user.png){kind=small}
(no subject)
Date: 2008-06-23 11:09 am (UTC)(no subject)
Date: 2008-06-23 11:03 pm (UTC)[1] I say "undefined", but I think I know what it's going to be :)
(Yes, the phrase "factorising large primes" really bugs me too -- even more so because I actually recognise in myself a tendency to say it, so although wrong, it must have _some_ resonance with what it ought to mean.)
(no subject)
Date: 2008-06-24 08:41 am (UTC)Too many zeroes in the price for error checking l-)
(...actually I'd quite happily spend a few weeks bashing in primality testing algorithms if there was a certain million in it. But there isn't l-)