1. The problem statement, all variables and given/known data Prove (n choose k) ≤ ((en)/k)^k by induction on k. 2. Relevant equations I can't of anything that's awfully relevant besides the general steps of induction. 3. The attempt at a solution So I found it true for the k=1 case which was easy enough. Then assumed true the k case. And now have to prove the k+1 case. So after working on the problem for awhile, I arrived at ((n-k)/(k+1)) * (n choose k) ≤ ((en)/k)^k * ((n-k)/(k+1)) but from here I'm stuck and not sure how to deconstruct the (n choose k) into something workable, let alone construct (n choose k+1). any help would be greatly appreciated.