Do you know of any algorithm that can solve (look for possible values) for a, b and c in the equation:
a + b + c = n
where a, b, c and n are integers and are greater than 0?
Here's a primitive approach . . .Do you know of any algorithm that can solve for in the equation:
. . . for
Suppse . . . We have 7 objects.
Place them in a row with a space between then: .
Select two of the spaces and insert "dividers".
So that: . .represents
. . .And: . .represents
Hence, there are: . possible solutions.
I'll leave it to you to list them . . .