Mazdak Farrokhzad edited a) Problem size.tex  almost 10 years ago

Commit id: 9c02d4cb0053bbd648f3ba2d260400ef4b3c2548

deletions | additions      

       

\section{a) Problem size}  \[\floor{\log_2(ab)} \geq \floor{\log_2(a)} \[\floor{\log_2(a)}  + \floor{\log_2(b)}\] \floor{\log_2(b)} \leq \floor{\log_2(ab)}\]  The size of the problem, $n$ is:  \[n(p, k) = \floor{\log_2 p} + \floor{\log_2 k}\]