Can anyone show that:
log(N-1)! log(N)!
What Maddas is doing is setting up a Riemann sum for using the integers as the "break points"- that is . Since log(x) is an increasing function, you get the "lower sum" using the left endpoints of each interval and the "upper sum" using the right endpoints.