![]() |
#1
|
|||
|
|||
![]()
I understand that for the case m(N) = 2^N, we can show that this is true. But how do we prove it when m(N) < 2^N? It seems like every single theorem is giving me an upper bound. Any hints would be super appreciated.
|
Thread Tools | |
Display Modes | |
|
|