|Perl Monk, Perl Meditation|
Near equal partitions.by BrowserUk (Pope)
|on Jan 14, 2011 at 04:27 UTC||Need Help??|
BrowserUk has asked for the
wisdom of the Perl Monks concerning the following question:
My brain's not working this morning.
I want to integer divide N by M such that there is the minimal difference in the size of the M integer partitions.
Eg. 10 / 3 => 4, 3, 3 not 4,4,2.
I'm sure I've done this concisely in the past, but I'm damned if I remember how or when.
My best attempt so far is:
But it feels messy to me?
Update: And ikegami's purely numerical method is hands down winner:
Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
"Science is about questioning the status quo. Questioning authority".
In the absence of evidence, opinion is indistinguishable from prejudice.