Well, sort of. The program really was a program to factor arbitrary (representable) integers, and the fact that they fed it a prime first doesn't alter that.
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
Edit: No, wait, there are two mentions of the first program, to work out a factor, and I read the wrong one.
no subject
no subject
no subject
no subject
no subject
no subject
no subject
no subject
[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
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-)
no subject
Easy program to write, then... assuming that the user only inputs prime numbers... now I see the problem...
no subject