Am 10.05.2012 19:42, schrieb smichr:
Does anybody know if the following sorts of constraints can be solved to
give the subsets of nonnegative integers that satisfy them:
i+j=2
k+l=4
m+n=3
i*k+l+m=3
j*k+l+n=8
This seems related to Diophantine equations.
Wikipedia has a bit to say about these - the article isn't deep but may
provide keywords for a websearch.
--
You received this message because you are subscribed to the Google Groups
"sympy" group.
To post to this group, send email to sympy@googlegroups.com.
To unsubscribe from this group, send email to
sympy+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/sympy?hl=en.
