well, not the general issue, but finding roots of polynomials.
These programs tend to have difficulty when there are multiple roots.
e.g. (x-3)^2.
But we can remove multiple roots and count them by using sqfr.
It is a feature of computer algebra that we seem to have neglected.
Anyone willing to muck around with this? Maybe for bfallroots?
RJF