HP Prime complex division problem in CAS

[parisse]

Well, can you give more precision on these polynomials? I'd like to test them with proot.
My own experience is that above degree about 200 or 300, polynomials (with random coefficients) require advanced algorithms (like implemented in PARI-GP) or multi-precision floats, matrix algorithms don't work anymore in double precision. This can happen with much lower degrees for some bad conditonned polynomials, like pcoeff(range(20)).