> sets of three positive integers that sum to 1,000,000 That's a partition of size 3 (of 1e6). http://en.wikipedia.org/wiki/Partition_(number_theory)
On Sat, May 19, 2018 at 11:17 PM, Skip Cave <[email protected]> wrote: > The problem is to find and count all of the unique sets of three positive > integers that sum to 1,000,000. For example, one of the triples is: > > +/333332 333333 333335 > > 1000000 > > ... > ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
