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

Commit id: 72c927926ef1a374fbc7c7d0fd92cf00a6352fd2

deletions | additions      

       

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