This is the extend version of my previous post Let $\alpha = \sqrt{2}+\sqrt{3}$. Find polynomial $r(x)$ such that $r(\alpha)=\sqrt{2}$. which I post due to find some standard process of obtaining polynomials.
And from @Hagen von Eitzen, I see the standard technique for this type of problem is compute the powers of $\alpha$ and linear combinations.
Based on this setup can we construct, $r(\alpha) = \sqrt{n}$, where $n\neq 2,3$?
It seems for $r(x) \in \mathbb{Q}[x]$, at least in the case of $n=p$, for prime $p$. this seems impossible. but I have no idea of writing formal mathematical proof.
For $r(\alpha) = \sqrt{3}$, from $\alpha^3 - 11 \alpha = -2\sqrt{3}$. I can deduce $r(x) = -\frac{1}{2} x^3 + \frac{11}{2} x$.
and for $r(\alpha) = \sqrt{6}$, from $\alpha^4 - \frac{49}{5} \alpha^2 = \frac{2}{5} \sqrt{6}$, I have $r(x) = \frac{5}{2} x^4 - 98x^2 $.. [In this case I guess we have to extend the degree of $r(x)$. ]
Is trial and error is the best ways to solving this kinds of problem?
I mean, Is there any formal way to find polynomial $r(x) \in \mathbb{Q}[x]$, with no degree assumption such that $r(\alpha) = \sqrt{n}$, where $n\neq 2,3$?
So $\sqrt n = C\sqrt m$.
If $m$ has a prime factor other than $2,3$ this is clearly impossible.
So this is only possible if $m = 1, 2,3,6$ and those are all possibleby your method described..
– fleablood Sep 03 '19 at 16:01