Kenneth is correct that the requirement for non-negative integers brings you to a Diophantine equation, which is why you don't need a third equation. Mark is correct that Euclidean Algorithm is the standard method to solve a Diophantine, although in this case, it simplifies enough to not quite require that (although you should be familiar with the Euclidean Algorithm for slightly harder problems). Either way, you really shouldn't require an excel or a computer program to solve this. Our two equations are:
x + y + z = 100
6x + 3y + .1z = 100
If we solve the first equation for z, we get
z = 100 - x - y
If we multiply the second equation by 10 (to get all integer coefficients) and substitute in z, we get
60x + 30y + 100 - x - y = 1000
59x + 29y = 900
So first, modulo 29, we have
59x ≡ 900 (mod 29)
x ≡ 1 (mod 29)
So x = 1 or 30 or 59, etc.
Considering modulo 59, we have
29 y ≡ 15 (mod 59)
Noting that 2*29 was close to 59, let's multiply both sides by 2:
58y ≡ 30 (mod 59)
-y ≡ 30 (mod 59)
y ≡ -30 ≡ 29 (mod 59)
So y ≡ 29 (mod 59)
If we try x = 1, y = 29, z = 100 - x - y = 70, we discover that
6(1) + 3(29) + .1(70) = 100
If you have any other number theory questions or would like to discuss the Euclidean Algorithm, please let me know.
Mark M.
12/22/16