I'm solving recurrence relations for a k-SAT algorithm, and have run
up against an apparent limit in solve. I'm running:
solutions = solve([x^3 - x^2 - x - 1 == 0], x, solution_dict=True)
solutions = solve([x^4 - x^3 - x^2 - x - 1 == 0], x,
solution_dict=True)
solutions = solve([x^5 - x^4 - x^3 - x^2 - x - 1 == 0], x,
solution_dict=True)
...
The first 2 of these work (for 3-SAT, 4-SAT) but the third returns
[{0: x^5 - x^4 - x^3 - x^2 - x - 1}]
which I presume means it has reached the limit of the solver. There
is a stunt that reduces the terms but increases the order .. this for
order 5 for example.
solutions = solve([x^5*(2 - x) == 1], x, solution_dict=True)
Is there another method approach I could take? I'd like to reach 6 at
least. My homework depends on it! :)
Thanks,
-- Owen
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support+unsubscr...@googlegroups.com
For more options, visit this group at
http://groups.google.com/group/sage-support
URL: http://www.sagemath.org
