Let $f(x)=(x-a_1)(x-a_2)\cdots(x-a_m)$ and $g(x)=(x-a_{m+1})(x-a_{m+2})\cdots(x-a_n)$, where $m,n \in \mathbb{N}$, $m < n$, $a_i \in F$, $F$ is a field of characteristic zero (for example, $k \in \{\mathbb{R},\mathbb{C}\}$). Let $\lambda,\mu \in F$.
How to compute the subresultants of $f(x)-\lambda$ and $g(x)-\mu$?
If, for example, $m=2$ and $n=4$, then I have succeeded to compute it using $a,b,c,d$:
subresultants [(x-a)(x-b) -\lambda, (x-c)(x-d) - \mu].
But it seems that beyond $a,b,c,d,e$ it is not possible? Or just because I have written $f,g$ (which probably denotes functions). Writing the $a_i$'s does not work.
Thank you very much!
a[1],a[2], ... the same way it treats undefined constants likea,b, .... For example, the expressionProduct[ x-a[j] , {j, 1, m} ]will generate the general monic degree-$m$ polynomial $(x-a_1)(x-a_2)\cdots(x-a_m)$. – Greg Martin Dec 29 '18 at 19:53Subresultants[(x-a)*(x-b)*(x-c)-\lambda,(x-d)*(x-e)*(x-f)-\mu,x]. – achille hui Dec 29 '18 at 19:55Subresultants[Product[x-a[i],{i,1,2}]-\lambda,Product[x-b[j],{j,1,3}]-\mu,x]. Replacing upper bound of $i$ by $3$ doesn't work. Replacing upper bound of $j$ to $4$ work and to $5$ doesn't work. It looks like an arbitrary limit WA imposed on its online computational capacity. In order words, a hint to suggest you to use Mathematica instead. – achille hui Dec 29 '18 at 20:15{i,1,3}and{j,1,5}simultaneously took about 20 seconds on my laptop. So I agree with you—probably an imposed limit of WA. – Greg Martin Dec 30 '18 at 21:09