%p3.tex: 
%begin macros
\baselineskip=14pt
\parskip=10pt
\magnification=\magstephalf
\parindent=0pt
\overfullrule=0in
\def\frac#1#2{{#1 \over #2}}
\def\g{\bigtriangledown}
\def\S{\cal S}
\nopagenumbers
%end macros
 

\centerline
{
\bf Attendance Quiz \# 3 for Dr. Z.'s Number Theory 
}
\bigskip
{\bf NAME:} (print!) $\underline
{\quad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad}$
\bigskip
{\bf E-MAIL ADDRESS:} (print!) 
$\underline
{\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad}$
\bigskip


{\bf 1.} List all the 1-2 walks from $0$ to $5$. Count them and make sure that you get $f_5=F_6$.

\bigskip\bigskip\bigskip\bigskip\bigskip\bigskip
\bigskip\bigskip\bigskip\bigskip\bigskip\bigskip
\bigskip\bigskip\bigskip\bigskip\bigskip\bigskip

{\bf 2.} Use the combinatorial model 
(in terms of paths) to prove that for every positive integer $n$,
$$
F_{2n+1}=F_{n+1}^2+ F_{n}^2 \quad .
$$


\end





