Anonymous user
Talk:Primality by trial division: Difference between revisions
How's that?
(so am I allowed to recurse?) |
(How's that?) |
||
Line 4:
:Why not just say "Use trial division to test each number"? --[[User:Mwn3d|Mwn3d]] 15:19, 4 February 2008 (MST)
:: Even that isn't particularly precise. Should I do trial-division by every integer 2 through n-1? Or am I allowed to factor only up to (sqrt(n)) which is obviously sufficient but introduces the added complexity of invoking a square root. So is it still the "simplest" solution? Is simplicity preferred? Actually it would be entirely sufficient to trial-factor only by all <i>prime</i> numbers up to sqrt(n) which immediately leads to a very elegant recursive implementation. Which I'm pretty sure isn't what the creator of the task had in mind ;-) but which is entirely allowed when you just say "use trial division"... [[User:Sgeier|Sgeier]] 19:21, 4 February 2008 (MST)
==new description==
I fixed up the description. I tried to be more specific, but didn't rule out recursion. If you use recursion make sure you note it and add the task to the [[:Category:Recursion|recursion category]] --[[User:Mwn3d|Mwn3d]] 19:46, 4 February 2008 (MST)
| |||