Does anyone know a general method for solving diophantine (i.e. in N) equations
with LISP? I'm particularly interested in the equation:
1*x1+2*x2+3*x3+....+n*xn = p, where xi, p (i=1..n) are integer variables and
n is an integer constant. Thank you for any suggestion you might have.
Matteo Patelmo ||||| || || ||||||
e-mail: ·······@ensta.fr || || |||| || ||
tel: 33-(1)46.34.26.91 || || || || || ||
39-(39)6900572 ||||| || || || ||||||