Date: 4 Oct 1984 09:51 EDT (Thu)
From:: Walter Hamscher
To: bboard@MIT-MC
Subject: GSL sponsored Theorem Proving Contest

               DATE: Friday, 5 October, 12 noon
               PLACE: 3rd Floor Playroom
               HOST: Reid Simmons

          REAGAN vs. MONDALE THEOREM PROVING CONTEST

To help the scientific community better assess this year's
presidential candidates, GSL (in conjunction with the Laboratory
for Computer Research and Analysis of Politics) proudly presents
the first Presidential Theorem Proving Contest.  The candidates
will have 10 minutes to prepare their proofs, 10 minutes to
present, and then 5 minutes to criticise their opponents' proofs.
A pseudorandom number generator will be used to determine the
order of presentation.  The candidates will be asked to
prove the following theorem:

* Let (a + a + a ...) be a conditionally convergent series.
        1   2   3
  Show by construction that there exists a rearrangement of
  the a  such that 
       i
            lim      (a + ... a ) = 0.
          n -> inf     1       n

Note:
  To increase public interest in this contest, the theorem
  will actually be phrased in the following way:

  Let (deficit    + deficit    + deficit    ...) be a
              1980         1981         1982

  series with both positive and negative terms.
  Rearrange the terms so that:

            lim      (deficit    + ... deficit    ) = $ 0.00
         year -> inf         1980             year