The lack of handling root functions in hp prime

[Thomas Klemm]

(12-22-2018 06:01 PM)parisse Wrote:  simplify(sqrt(x+y+2*sqrt(x*y))|x>0, y>0):
It looks simple, because *you* know how to do the simplification, but it is hard to have an algorithm that can solve that: you have to compute with algebraic extensions of Q[x,y].

WolframAlpha returns for Simplify[Sqrt[x + y + 2 Sqrt[x y]]]:

Quote:piecewise | sqrt(x) + sqrt(y) | -π/2<arg(sqrt(x) + sqrt(y))<=π/2
-sqrt(x) - sqrt(y) | (otherwise)

Quote:It's slow on a desktop, therefore it won't work on the Prime.

It doesn't feel much slower than simpler examples.
However I don't know how much it takes to also render the 3D plot and the Contour plot.

Cheers
Thomas