Show that $\sqrt{2} + 2 \sqrt{3} + 2 \sqrt{5} + \sqrt{7} < 12$ I've found this inequality, it seems cute:
$$\sqrt{2} + 2 \sqrt{3} + 2 \sqrt{5} + \sqrt{7} < 12$$
Note: It checks with a calculator.  I am also interested in some methods that work for more general sum of radicals.
Thank you for your interest!
$\bf{Added:}$  I found this inequality by some random search. Note that all of the coefficients on LHS are positive, this can be an advantage. In the method of @heropup, one wants to check that a certain integer $N$ ( here $N=12$) is larger than a totally real algebraic number $\alpha$ that is  larger than all the other conjugates $\alpha_j$.  Say its minimal polynomial is $f(x)$.   Then we need to show that $N>$ all of the roots of $f(x)$. Note that the roots of all derivatives of $f$ are also between the largest and the smallest of $\alpha_j$'s. The above inequality is equivalent to $f(N)$, $f'(N)$, $f''(N)$, $\ldots > 0$.  With Taylor's formula, this is equivalent to:   the polynomial $f(N+t)$ has all of the coefficients positive in $t$. This is an automated check that can be done instantly after we found $f(x)$.
This method does not work if $\alpha$ is not the largest ( or smallest) of all its conjugates. But there is a way to "make it the larges" using a transformation $x \mapsto 1/(a-x)$. I will leave out the details.
There was a previous question on this site about finding a general method for comparing arbitrary real algebraic numbers.  That seems like a quite involved problem.  It is easy to compare with $0$ a real algebraic number $\alpha$  with all its other conjugates non-real.  The test is simple
$\alpha> 0$ if and only if $N(\alpha) > 0$, where $N(\cdot)$ is the norm. In particular this applies to cubic fields with discriminant $<0$.   The general problem of comparing with $0$ an algebraic number $\alpha$  is simple if $\alpha$ is the $k$-th smallest ( or largest) root of an irreducible polynomial.  Indeed, one needs to see how many positive/negative roots does the polynomial have , something that can be decided ( in principle).  This is harder if one is given an expression involving several real algebraics. Even if we can find an equation whose root is the given expression, it could be harder to decide the order rank of the roots.  So this seems like a difficult problem. But perhaps it is solved somewhere in the literature.
One other approach of @Parcly Taxel: simply gets rid of all the roots, little by little, something that I thought not possible just by counting.  That is interesting!  I am not fully convinced that it is so for an arbitrary number of roots as I was assured by Parcly... tempting to through another challenge to see how that works, what is the logic there...
Another approach, of @Luke Collins, and @Claude Leibovici uses the approximation of square roots with their convergents. It turns out that the convergents are easy to form, since the continued fractions are periodic ( and in this case, quite simple).
Summing up: some methods are ingenious and algebraic, other use some the minimal polynomial, other use continued fractions and convergents.  Perhaps I should mention that there are other way to approximate roots. Parcly seems to prefer power series.  I like Newton's method. Claude Leibovici might like Pade approximants too.
I've learned a lot from All the answers! Thank you very much to All the contributors!
 A: As you suggested (in response to my original answer below), you can take better and better convergents of the individual square roots and get an upper-bound that way. This will certainly be easier by hand, since they are periodic. For example,
\begin{align*}
\sqrt 2 &= 1 + \frac{1}{1+\sqrt 2} \\[3pt]
&= 1 + \frac1{2+\frac{1}{1+\sqrt 2}}\\[3pt]
&= 1 + \frac{1}{2+ \frac{1}{2+\cdots}} \\[3pt] 
& < 1 + \frac1{2+\frac1{2+\frac1{2+\frac1{2+\frac12}}}} &&\text{( $<$ since odd convergent)}\\ &= \frac{99}{70}.
\end{align*}
@Claude Leibovici seems to have done this in his answer.
Indeed, using this idea, you get
\begin{align*}
\sqrt{2}+2 \sqrt{3}+2 \sqrt{5}+\sqrt{7} &<\frac{99}{70}+2\left(\frac{97}{56}\right)+2\left(\frac{161}{72}\right)+\frac{127}{48}\\[3pt]&=\frac{60\,463}{5040} <\frac{60\,480}{5040} = 12.
\end{align*}

Original answer: I don't know if you'd like this, but you could argue that the convergents of a continued fraction alternate above/below their limit, and the first few convergents of your number are $$11, 12, \frac{3155}{263},\frac{9477}{790}$$
so $\sqrt2+2\sqrt3+2\sqrt5+\sqrt7<\frac{9477}{790}<12$.
(Recall the first few convergents of $n$ are $$\lfloor n\rfloor, \lfloor n\rfloor +\frac{1}{\left\lfloor \frac{1}{n-\lfloor
   n\rfloor }\right\rfloor }, \lfloor n\rfloor +\frac{1}{\left\lfloor \frac{1}{n-\lfloor
   n\rfloor }\right\rfloor +\frac{1}{\left\lfloor
   \frac{1}{\frac{1}{n-\lfloor n\rfloor }-\left\lfloor
   \frac{1}{n-\lfloor n\rfloor }\right\rfloor }\right\rfloor }}, \text{etc.},$$
a calculator is handy to help with computing these).
A: We'll use the Newton recurrence
$$x \mapsto f_a(x) = \frac{1}{2}(x + \frac{a}{x})$$
to approximate $\sqrt{a}$. Note that for all $x> 0$, we have $f_a(x)\ge \sqrt{a}$, and if $x> \sqrt{a}$, then $x > f_a(x)> \sqrt{a}$. Moreover, the convergence of the sequence $(f^n_a(x))_n$ towards $\sqrt{a}$ is fast.
So we'll approximate LHS $\sqrt{2} + 2 \sqrt{3} + 2 \sqrt{5} + \sqrt{7}$ from above with
$$f_2^3(2) + 2 f_3^2(2) + 2 f_5^2(2) + f_7^2(2)= \frac{577}{408} + 2 \cdot \frac{97}{56} + 2 \cdot \frac{161}{72} + \frac{233}{88}= \frac{565415}{47124} < 12 $$
One advantage of this method is that the fact that  upper bound is automatic. In fact this upper bound will work for radicals of any order $n$ (   by the Newton's tangent method the iteration function for the equation $x^n - a= 0 $ is $f_{a, n}(x) = \frac{1}{n} ( (n-1) x + \frac{a}{x^{n-1}})$
Note that any inequality with radicals can be written in the form
$$\sum \frac{c_i}{\sqrt{a_i}} > \sum c'_j \sqrt{a'_j}$$
or even for radicals of higher orders, and the same idea could work in principle.
A: Using rational numbers
$$\sqrt 2=\frac{99}{70}\qquad \sqrt 3=\frac{97}{56}\qquad \sqrt 5=\frac{161}{72}\qquad \sqrt 7=\frac{127}{48}$$
$$\frac{99}{70}+2\times\frac{97}{56}+2\times\frac{161}{72}+\frac{127}{48}=\frac{60463}{5040}$$
I used my phone for the rhs.
$$60463 < 12 \times 5040=60480$$
Pure luck !
A: Alternative solution:
We have
\begin{align*}
 (\sqrt 3 + \sqrt 5)^2
 &= 8 + 2\sqrt{15}\\
 &= 8 + 2\sqrt{16} - 2(\sqrt{16} - \sqrt{15})\\
 &= 16 - 2\cdot \frac{16 - 15}{\sqrt{16} + \sqrt{15}}\\
 &< 16 - 2\cdot \frac{16 - 15}{\sqrt{16} + \sqrt{16}}\\
 &= \frac{63}{4}
\end{align*}
which results in $\sqrt 3 + \sqrt 5 < \frac32 \sqrt 7$
and $2\sqrt 3 + 2\sqrt 5 < 3\sqrt 7$.
We have
$$\sqrt 2 + 2\sqrt 3 + 2\sqrt 5 + \sqrt 7 
< \sqrt 2 + 4\sqrt 7 < 12$$
where we use $12^2 - (\sqrt 2 + 4\sqrt 7)^2
= 144 - (114 + 8\sqrt{14}) = 2(15 - 4\sqrt{14}) > 0$
(using $15^2 > 16\times 14$).
We are done.
A: Rewrite the LHS as
$$\frac43\sqrt{1+\frac18}+4\sqrt{1-\frac14}+4\sqrt{1+\frac14}+\frac83\sqrt{1-\frac1{64}}$$
and use the binomial series to derive upper bounds for each term. For the series corresponding to $2\sqrt3$ and $\sqrt7$ every partial sum is an upper bound since all terms after the zeroth are negative. For the other two series only the partial sums up to odd-indexed terms (even number of terms total) form valid upper bounds since those series alternate and odd-indexed terms are positive.
Taking four terms (up to index $3$) for the first three series and just two (up to index $1$) for the $\sqrt7$ series yields an upper bound of
$$\frac{8689}{2^{11}×3}+\frac{887}{2^8}+\frac{1145}{2^8}+\frac{127}{2^4×3}<12$$
where the denominators have been factorised to emphasise the relative ease of doing this by hand.
A: While extremely tedious to do by hand calculation, a general approach would be to compute the minimal polynomial of $\mathbb Q[\sqrt{2} + 2\sqrt{3} + 2\sqrt{5} + \sqrt{7}]$, which is
$$f(x) = x^{16}-328 x^{14}+38396 x^{12}-2060088 x^{10}+54775910 x^8-726131832 x^6+4479958076 x^4-10024901512 x^2+489692641.$$
Then evaluating $f(12) = 22250268794209 > 0$ proves the inequality.
A: Hint : Using Cauchy Schwarz inequality we have :
$$\left(\sqrt{2}+\sqrt{12}+\sqrt{20}+\sqrt{7}\right)^2<\left(\left(\sqrt{2}+\sqrt{20}\right)^{2}+\left(\sqrt{12}+\sqrt{7}\right)^{2}\right)2<144$$
Hint for the end after MartinR comment we have :
$$\left(\sqrt{7}+\sqrt{12}\right)^{2}-\frac{112}{3}<0$$
Bonus inequality :
For $0<x\leq 1$ we have :
$$x^{\frac{2}{9}}\left(\sqrt{2}+\sqrt{12}+\sqrt{20}+\sqrt{7}\right)< 6+\frac{1}{2}\left(\sqrt{1+e^{\frac{2}{4}x}}+2\sqrt{1+e^{\frac{3}{4}x}}+2\sqrt{1+e^{\frac{5}{4}x}}+\sqrt{1+e^{\frac{7}{4}x}}\right)<12$$
