I recently came across the following problem:
If $C_n=\frac{1}{n+1}\binom{2n}{n}$ is the $n$-th catalan number, then prove that for all $n\ge 17$: $$ C_n>3^n $$ How the induction step works is quite clear, but the base case troubles me (I want to do it by hand):
If we cancel down the appearing fraction, it comes down to proving: $$ 2\cdot5\cdot11\cdot19\cdot23\cdot29\cdot31>3^{16} $$ I tired to bound the numbers on the right hand side by powers of three, but nothing seemed to work. Then I thought maybe it isn't feasible in a reasonable amount of time and got the following result:
Even if we take the inequality to the power of $1000$ and find the optimal integer bounds $(2\cdot5\cdot11)^{1000}>3^{4278}$, $(19\cdot23)^{1000}>3^{5534}$ and $(29\cdot31)^{1000}>3^{6190}$ we only obtain $2\cdot5\cdot11\cdot19\cdot23\cdot29\cdot31>3^{16.002}$.
So it seems indeed that it isn't feasible. However, can you think of a way to prove it; maybe using starlings approximation?
How about this one? $$ \frac{11.23}{3^5}\frac{2.5}{3^2}\frac{29}{3^3}\frac{31}{3^3}\frac{19}{3^2} > 3 $$ To prove that: $$ A = \frac{11.23}{3^5}\frac{2.5}{3^2}\frac{29}{3^3}\frac{31}{3^3}\frac{19}{3^2} = (1+\frac{10}{3^5})(1+\frac{1}{3^2})(1+\frac{2}{3^3})(1+\frac{4}{3^3})(2+\frac{1}{3^2}) $$ and $$ (1+\frac{10}{3^5})(1+\frac{1}{3^2})= 1+\frac{10}{3^5}+\frac{1}{3^2}+\frac{10}{3^7}>1+\frac{10}{3^5}+\frac{1}{3^2}+\frac{9}{3^7}=1+\frac{38}{3^5} $$ also $$ (1+\frac{2}{3^3})(1+\frac{4}{3^3})=1+\frac{6}{3^3}+\frac{8}{3^6}>1+\frac{2}{3^2}+\frac{6}{3^6}=1+\frac{56}{3^5} $$ so replacing we get $$ A > (1+\frac{38}{3^5})(1+\frac{56}{3^5})(2+\frac{1}{3^2}) = (1+\frac{94}{3^5}+\frac{38.56}{3^{10}})(2+\frac{1}{3^2}) > (1+\frac{94}{3^5}+\frac{38.54}{3^{10}})(2+\frac{1}{3^2}) = (1+\frac{94}{3^5}+\frac{38.2}{3^{7}})(2+\frac{1}{3^2}) > (1+\frac{94}{3^5}+\frac{25}{3^{6}})(2+\frac{1}{3^2}) = (1+\frac{307}{3^6})(2+\frac{1}{3^2})= 2 + \frac{307.2}{3^6}+\frac{1}{3^2}+\frac{307}{3^8} > 2 + \frac{307.2}{3^6}+\frac{1}{3^2}+\frac{306}{3^8} = 3 $$ Done