Helping prove this notation for Big-O(n!)

cs.stackexchange https://cs.stackexchange.com/questions/113211

  •  05-11-2019
  •  | 
  •  

Question

enter image description here

Hello, I was wondering if anyone can help me prove the right part of this double equation. I know the left one is possible due tolog(n!) = Θ(nlogn). Any help is much appreciated.

No correct solution

Licensed under: CC-BY-SA with attribution
Not affiliated with cs.stackexchange
scroll top