Talk:Count in factors: Difference between revisions
Content added Content deleted
(→duplicate task?: new section) |
|||
Line 10: | Line 10: | ||
: It'd make it neater, algorithmically, but then it defies the simplistic concept of counting. I could rationalize, too, that having the troublesome case of <math>1</math>-is-not-prime, is normal for the problem at hand, and helps expose workarounds and idiomatic approaches for special cases. Really, though, it comes down to the fact that when I count to ten, I start at one. --[[User:Short Circuit|Michael Mol]] 20:02, 27 December 2010 (UTC) |
: It'd make it neater, algorithmically, but then it defies the simplistic concept of counting. I could rationalize, too, that having the troublesome case of <math>1</math>-is-not-prime, is normal for the problem at hand, and helps expose workarounds and idiomatic approaches for special cases. Really, though, it comes down to the fact that when I count to ten, I start at one. --[[User:Short Circuit|Michael Mol]] 20:02, 27 December 2010 (UTC) |
||
:: Ok, well.. technically speaking, the list of prime factors for 1 is the empty list. But I suppose representing that might look odd to some people. --[[User:Rdm|Rdm]] 23:58, 27 December 2010 (UTC) |
:: Ok, well.. technically speaking, the list of prime factors for 1 is the empty list. But I suppose representing that might look odd to some people. --[[User:Rdm|Rdm]] 23:58, 27 December 2010 (UTC) |
||
== duplicate task? == |
|||
What's different to just calling [[Prime decomposition]] in a loop? Is this really worth a separate task? --[[User:Oenone|Oenone]] 09:09, 19 April 2011 (UTC) |
Revision as of 09:09, 19 April 2011
It'd be best to include the "factor" function, and note where it came from. --Michael Mol 21:23, 23 December 2010 (UTC)
Draft/Non-draft
While I don't see any problems, or have any complaints with peoples' implementations, I want to hold off until Jan 1st before un-drafting; there are a few languages and participants I usually see, but I don't see their solutions yet. --Michael Mol 18:17, 24 December 2010 (UTC)
- What can I say? Christmas is when good food and drink take precedence over coding… –Donal Fellows 21:00, 24 December 2010 (UTC)
- Hey, I'm not complaining! Enjoy the holidays! :) --Michael Mol 21:20, 24 December 2010 (UTC)
Perhaps rather than having a special rule for 1, the count should start from 2? --Rdm 19:16, 27 December 2010 (UTC)
- It'd make it neater, algorithmically, but then it defies the simplistic concept of counting. I could rationalize, too, that having the troublesome case of -is-not-prime, is normal for the problem at hand, and helps expose workarounds and idiomatic approaches for special cases. Really, though, it comes down to the fact that when I count to ten, I start at one. --Michael Mol 20:02, 27 December 2010 (UTC)
- Ok, well.. technically speaking, the list of prime factors for 1 is the empty list. But I suppose representing that might look odd to some people. --Rdm 23:58, 27 December 2010 (UTC)
duplicate task?
What's different to just calling Prime decomposition in a loop? Is this really worth a separate task? --Oenone 09:09, 19 April 2011 (UTC)