public static MultisetTree FindPrimeSummations(int num) { List <int> primes = FindPrimesBelow(num); int kCardinality = num / 2; MultisetTree tree = new MultisetTree(primes, kCardinality, num); return(tree); }
public static MultisetTree FindSummations(int num) { List <int> numsBelow = new List <int>(); for (int i = 1; i < num; i++) { numsBelow.Add(i); } int kCardinality = numsBelow.Count; MultisetTree tree = new MultisetTree(numsBelow, kCardinality, num); return(tree); }