MathOverflow will be down for maintenance for approximately 3 hours, starting Monday evening (06/24/2013) at approximately 9:00 PM Eastern time (UTC-4).
0

Is there an easy or obvious way to prove this? I need it for part of another proof.

log(2) * ... * log(n + 2) < n * log(n)?

flag
What happens when you try induction? Did you verify it for small cases? Gerhard "Ask Me About System Design" Paseman, 2011.11.08 – Gerhard Paseman Nov 9 2011 at 0:14
2 
Checking by induction has lead me to find a counter example when n = 6. Well then nvm. – Setraced Nov 9 2011 at 0:24

closed as too localized by Felipe Voloch, fedja, Will Jagy, George Lowther, David Speyer Nov 9 2011 at 0:24

Browse other questions tagged or ask your own question.