Changes between Initial Version and Version 1 of Ticket #18109, comment 48


Ignore:
Timestamp:
04/30/15 11:42:26 (4 years ago)
Author:
ncohen
Comment:

Legend:

Unmodified
Added
Removed
Modified
  • Ticket #18109, comment 48

    initial v1  
    55Wouldn't this happen if somebody wants, for all `n` between 10 and 1000, one instance of a partition of `n` satisfying <a specific set of constraints> ?
    66
    7 There is a (trivial) case at least which makes sense to me, i.e. for a fixed `k` find some partition of `n` into integers of size `floor(n/k)` and `ceil(n/k)`. I agree that this can be done manually without this iterator, but I expect that it can happen with more complicated set of constraints too.
     7There is a (trivial) case at least which makes sense to me, i.e. for a fixed `k` find some partition of `n` into integers between `floor(n/k)` and `ceil(n/k)`. I agree that this can be done manually without this iterator, but I expect that it can happen with more complicated set of constraints too.
    88
    99Nathann