Euclidean
Reputation
436
Next privilege 500 Rep.
Access review queues
 Nov22 accepted Expected number of cluster of cars Nov22 revised Expected number of cluster of cars deleted 1 character in body Nov22 asked Expected number of cluster of cars Jul2 awarded Curious Apr24 awarded Yearling Dec9 awarded Popular Question Nov16 revised How to differentiate Complex Fluid Potential added 172 characters in body Nov16 accepted How to differentiate Complex Fluid Potential Nov15 asked How to differentiate Complex Fluid Potential Sep29 awarded Citizen Patrol Sep29 revised Combinatorics and Inversion Sequences mathjax and display Sep29 suggested approved edit on Combinatorics and Inversion Sequences Apr25 comment Checking $f_n(x) = \frac{nx}{n+1}$ for uniform convergence You have calculated the supremum wrong. It will be $\infty$, not n. Clearly $|x|$ is not bounded in $\mathbb R$, so how could $|x|/(n+1)$ be bounded. Apr24 accepted $n!>n^m$ for $n\ge?$ Apr24 comment $n!>n^m$ for $n\ge?$ Induction on what? I think I should use the fact that $log( n!)> n$, for $n \ge 4$. Apr24 asked $n!>n^m$ for $n\ge?$ Mar26 awarded Yearling Mar25 awarded Altruist Mar25 revised Prove the inequality $\left(\frac n{n-1}\right)^{n-1}(\frac1n\sum_{i=1}^na^2_i)+(\frac1n\sum_{i=1}^nb_i)^2\ge\prod_{i=1}^n(a^2_i+b^2_i)^{\frac1n}$ Just some minor corrections, on the formatting Mar25 comment Prove the inequality $\left(\frac n{n-1}\right)^{n-1}(\frac1n\sum_{i=1}^na^2_i)+(\frac1n\sum_{i=1}^nb_i)^2\ge\prod_{i=1}^n(a^2_i+b^2_i)^{\frac1n}$ I don't think you should use induction on this.