what's up /sci/ niggers!
can the knapsack problem be applied to solving diophantine equations?
https://en.wikipedia.org/wiki/Knapsack_problem
if you have a linear equation like:
Ax + By + Cz = D where A,B,C,D are integers, can it be mapped (or whatever the right term is) to the knapsack problem?
Are you thinking of linear programming?
http://www.purplemath.com/modules/linprog.htm
>>9157289
don't know. can linear programming find the exact integer solution to a linear equation with three unknowns? the examples in your link deal with equations with two unknowns, that also have additional constraints (inequalities)