You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
Grant Montgomery c5ba4a276a update readme 11 months ago Update '' 1 year ago I think I figured out how to generate odds from unused orders, but I need to impliment it. Put unused orders into a 2d array, and pairs reflected across the center sum to 0 mod n 2 years ago update readme 11 months ago Removed Updated for output formatting 1 year ago changed test to run up to n=512 1 year ago

A Constant Sum Partition is an arrangement of a group of numbers 0-n into smaller sub-groups. To be constant-sum, each of these sub-groups must have the same sum modulo n. For odd numbers this constant sum must equal 0 when multiplied by the number of groups, p, modulo n. For the case when n is even, each grouping must have a constant sum that totals to n/2 when multiplied by the number of groupings, modulo n.

This repository contains the code for a python program written to test rapidly create constant sum partitions. Given a number, the program will output a constant-sum partition for each possible combination of constant-sum and number of groupings. This program was written to solve for the case when each grouping has an even number of members.

This is a test line