Take the 2-minute tour ×
Mathematica Stack Exchange is a question and answer site for users of Mathematica. It's 100% free, no registration required.

My Mathematica code runs slowly

MinimalPolynomial[Sqrt[2] + Sqrt[3]+ Sqrt[5]+ Sqrt[7]+ Sqrt[11]+ Sqrt[13], x]

runs slowly, but the Maple version

evala(Norm(convert(x-(sqrt(2)+sqrt(3)+sqrt(5)+sqrt(7)+sqrt(11)+sqrt(13)), RootOf)));

runs quite fast Is there a faster way do this in Mathematica?

share|improve this question
What is the answer in maple? –  Apple Mar 29 '14 at 15:21

1 Answer 1

share|improve this answer
This will not in general give the minimal polynomial. Try it on sqrt(2)+sqrt(3)+sqrt(6) which clearly has a min poly of degree no larger than 4 since it lies in Q(sqrt(2),sqrt(3)). But GroebnerBasis[{x1+x2+x3-x, x1^2-2, x2^2-3, x3^2-6}, x, {x1,x2,x3}] gives a poly of degree 8. –  Daniel Lichtblau May 5 '14 at 14:58

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.