\documentclass[12pt]{article}
\usepackage{amsmath,mathrsfs,bbm}
\usepackage{amssymb}
\textwidth=4.825in
\overfullrule=0pt
\thispagestyle{empty}
\begin{document}
\noindent
%
%
{\bf Tanya Khovanova and Joel Brewster Lewis}
%
%
\medskip
\noindent
%
%
{\bf Baron M\"{u}nchhausen Redeems Himself: Bounds for a Coin-Weighing Puzzle}
%
%
\vskip 5mm
\noindent
%
%
%
%
We investigate a coin-weighing puzzle that appeared in the 1991 Moscow
Math Olympiad. We generalize the puzzle by varying the number of
participating coins, and deduce an upper bound on the number of
weighings needed to solve the puzzle that is noticeably better than
the trivial upper bound. In particular, we show that
logarithmically-many weighings on a balance suffice.
\end{document}