🚀 go-pugleaf

Here is the LaTeX text of the English Version of 34th IMO problems.
Assumes A4 standard paper. Please enjoy it.

This is the text which I made after the contest. In the contest typesetted
version prepared by the organizing committee was used.

Naomasa MARUYAMA (Deputy leader of IMO34 Japan Team)

\documentstyle[12pt]{article}

%% A4 Page style by Hideki ISOZAKI (isozaki@ntt-20.ntt.junet)

\oddsidemargin -0.54cm \evensidemargin -0.54cm
\topmargin -2cm \headheight 1pc \headsep 2pc
\footheight 1pc \footskip 2pc
\textheight 60pc \textwidth 40pc \columnsep 2pc \columnseprule 0pt

\renewcommand{\thefootnote}{\fnsymbol{footnote}}

\title{34th International Mathematical Olympiad\footnotemark \\
       Istanbul, 1993}

\footnotetext{Original copyright \copyright 1993 by IMO93 Problem Committee}
\footnotetext{This {\LaTeX} version
  is made by Mathematical Olympiad Foundation of Japan}
\footnotetext{Copyright \copyright 1993 by Mathematical Olympiad
  Foundation of Japan}
\date{}
\author{}
\pagestyle{empty}
\begin{document}
\maketitle\thispagestyle{empty}
%\maketitle
\newcommand{\IND}{\hspace*{3cm}}

Version: {\bf English} \hfill July 18, 1993\\

\begin{Large}
\begin{center}
{\bf FIRST DAY}
\end{center}
\end{Large}

\begin{itemize}
\item[1.] Let $f(x)=x^n+5x^{n-1}+3$ where $n>1$ is an integer. \\
      Prove that $f(x)$ cannot be expressed as the product of two polynomials,
      each of which has all its coefficients integers and degree at least 1.

\item[2.] Let D be a point inside the acute-angled triangle ABC such that
      \begin{description}
        \item \IND ${\rm \angle{ADB} = \angle{ACB} + 90^\circ }$
      \end{description}
      and
      \begin{description}
        \item \IND ${\rm AC \cdot BD = AD \cdot BC }$.
      \end{description}
      \begin{description}
        \item[(a)] Calculate the value of the ratio
              ${\rm \frac{AB \cdot CD}{AC \cdot BD} }$.
        \item[(b)] Prove that the tangents at C to the circumcircles
              of the triangles ACD and BCD are perpendicular.
      \end{description}

\item[3.] On an infinite chessboard, a game is played as follows.  \\
      At the start, $n^2$ pieces are arranged on the chessboard in an
      $n \times n$ block of adjoining squares, one piece in each square.
      A move in the game is a jump in a horizontal or vertical direction
      over an adjacent occupied square to an unoccupied square immediately
      beyond. The piece which has been jumped over is then removed. \\
      Find those values of $n$ for which the game can end with only one
      piece remaining on the board.

\end{itemize}

\begin{flushleft}
Each question is worth 7 points. \\
Time allowed is 4 1/2 hours.
\end{flushleft}

\newpage

Version: {\bf English} \hfill July 19, 1993 \\

\begin{Large}
\begin{center}
{\bf SECOND DAY}
\end{center}
\end{Large}

\begin{itemize}

\item[4.] For three points P,Q,R in the plane, we define $m({\rm PQR})$ 
      to be the minimum of the lengths of the altitudes of the triangle
      PQR (where $m({\rm PQR})=0$ when P,Q,R are collinear). \\
      Let A,B,C be given points in the plane. Prove that, for any point X
      in the plane,
      \begin{description}
        \item \IND $m({\rm ABC}) \leq m({\rm ABX}) + m({\rm AXC}) + m({\rm XBC})$.
      \end{description}

\item[5.] Let ${\bf N}=\{1,2,3,\cdots\}$.  \\
      Determine whether or not there exists a function
      $f: {\bf N}\rightarrow {\bf N}$ such that \\ \\
      \IND \begin{tabular}{lrcll}
             & $f(1)$    & $=$ & $2$,     &                         \\
             & $f(f(n))$ & $=$ & $f(n)+n$ & for all $n \in {\bf N}$ \\
         and &    $f(n)$ & $<$ & $f(n+1)$ & for all $n \in {\bf N}$. \\
           \end{tabular}

\item[6.] Let $n>1$ be an integer. There are $n$ lamps $L_0,L_1,\cdots,L_{n-1}$
      arranged in a circle. Each lamp is either ON or OFF. A sequence of steps
      $S_0,S_1,\cdots,S_i,\cdots$ is carried out. Step $S_j$ affects the
      state of $L_j$ only (leaving the state of all other lamps unaltered)
      as follows:
      \begin{description}
        \item \hspace*{1em} if $L_{j-1}$ is ON, $S_j$ changes the state of $L_j$ from
           ON to OFF or from OFF to ON;
        \item \hspace*{1em} if $L_{j-1}$ is OFF, $S_j$ leaves the state of $L_j$ unchanged.
      \end{description}
      The lamps are labelled mod n, that is,
      \begin{description}
        \item \IND $L_{-1}=L_{n-1},L_0=L_n,L_1=L_{n+1}$, etc. .
      \end{description}
      Initially all lamps are ON. Show that
      \begin{itemize}
      \item[(a)] there is a positive integer $M(n)$ such that after $M(n)$
            steps all the lamps are ON again;
      \item[(b)] if $n$ has the form $2^k$ then all the lamps are ON after
            $n^2-1$ steps;
      \item[(c)] if $n$ has the form $2^k+1$ then all the lamps are ON after
            $n^2-n+1$ steps.
      \end{itemize}
\end{itemize}

\begin{flushleft}
Each question is worth 7 points. \\
Time allowed is 4 1/2 hours.
\end{flushleft}

\end{document}

--
1993$@G/(J08$@7n(J12$@F|(J($@LZ(J)
--------
$@4];3D>>;!w(J$@E}7W?tM}8&5f=j(J
maruyama@ism.ac.jp