Grant Montgomery
c5ba4a276a

11 months ago  

constant.py  1 year ago  
orders.py  2 years ago  
readme.md  11 months ago  
sumChecker.py  1 year ago  
test.sh  1 year ago 
readme.md
A Constant Sum Partition is an arrangement of a group of numbers 0n into smaller subgroups. To be constantsum, each of these subgroups 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 constantsum partition for each possible combination of constantsum 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