Here's something to develop

[NotLKH]

Lets say you have a group of numbers, all distinct.

They are represented by an equation, lets say G = C1+C2+C3...+Cn

Such that G is a group of N integer elements such that there sum is mTargVal.
The N elements are distinct, ie... each one of them is not equal to any other of them.

Lets say that the smallest element in the group G = mCellLow,
and the largest element is mCellHigh.

For Example, lets say that N = 6
and mCellLow = 0
and mCellHigh = 18
and mTargVal = 16

1. Determine a fucntion that tightens the limits...mCellLow and mCellHigh
2. Determine a function that returns what values MUST BE USED in this range.

In the example that I gave to you, you will see that:

If 5 of the numbers are 0 1 2 3 4, {The smallest set of N-1 numbers available} that the maximal mCellHigh really could be is 6.

This is because if you add the N-1 lowest possible values together, you have created the most minimal sum that N-1 of those elements can add to.

Which, if you then subtract from the targvl, you see that the most maximal value of a c could be only 6.

So the real range that mCellLow and mCellHigh could be is 0 and 6.

Using this as an example, and any others that you can think of, I am certain you can acheive #1.


Now, Number 2 is a bit more complex, however, when all is said and done, it is a very simple function.

Try by hand the following example:

Using 5 distinct numbers, 3 <= Cn <= 18
and those 5 numbers add to 27

What numbers MUST be used?
{BTW, this examples solution has tightened the C Limits}

{I will provide more examples in the morning, but the answer to this is:

You Are Required to use numbers in the range : 3 <= C <= 9
3 Numbers Ascending {Inclusive} from 3 { 3 -> 5 }
To Add To 27
When you must use 5 Numbers GTE 3 and LTE 9
Once and only once

}