The only problem with this is that once again you are you are using trial and error to find the first number less than seven divisable into 16. Can this be determined.

Also,Can your initial work be applied to a more complex initial statement;

102+n/21-2n - Once again finding the first n at which a whole number is produced. I'd presume 102+n is required to be multiplied by 2

This is an example of a Diophantine equation, of the form:

(a-bz) + n(1+z) = 0

Where a, b are given and n, z are integers. I checked the Wolfram site and apparently there is a solution for linear Diophantine equations with 2 variables. I'll post the example when I get back from my meeting, but here's the link to the algorithm:

Originally posted by PBE6 This is an example of a Diophantine equation, of the form:

(a-bz) + n(1+z) = 0

Where a, b are given and n, z are integers. I checked the Wolfram site and apparently there is a solution for linear Diophantine equations with 2 variables. I'll post the example when I get back from my meeting, but here's the link to the algorithm: