- #1
scorpion4377
- 9
- 0
Hey. I'm self studying my way through an algorithms book, and one of the questions at the end of a section is to prove that [itex] log(n!) \in \Theta (n log(n))[/itex]. I wrote up what I believe is a valid proof. However, I don't have much experience writing formal proofs (and even less experience with having my proofs corrected by professionals), so it could very well be invalid/lingered with errors. Can somebody take a quick look at it and comment on any mistakes that may exist? Can you comment on my style? Any advice would be appreciated.
Here is my write-up. I apologize for not using the built-in equation editor.
http://i.imgur.com/iyAto.png
Here is my write-up. I apologize for not using the built-in equation editor.
http://i.imgur.com/iyAto.png