\documentclass[11pt]{article}
\usepackage{fullpage}
\usepackage{amsmath, amsfonts}
\usepackage{geometry}

\usepackage{epsfig}%
\usepackage{graphics}%
\usepackage{enumerate}


\begin{document}

\begin{center} \Large
{\scshape 6.851 Advanced Data Structures (Spring'07)} \\[1ex]
{Prof.~Erik Demaine \quad\quad TA: Oren Weimann} \\[2ex]
\framebox{Problem 7} \quad {\em Due: Monday, Apr. 9}
\end{center}

Be sure to read the instructions on the assignments section of the
class web page.

\paragraph{\boldmath Hamming Weight via Word Packing.}~

Give a constant-time algorithm for determining the Hamming weight of
a $k$-bit string (i.e., the number of one bits it contains),
using a word RAM with word size $w \geq k (2+\lg k)$.
For full credit, your algorithm should use only a constant amount of
preprocessed space (if any).

\end{document}
