id: 05251374
dt: j
an: 2008a.00504
au: Burton, Benjamin A.
ti: Informatics Olympiads: Approaching mathematics through code.
so: Math. Compet. 20, No. 2, 29-51 (2007).
py: 2007
pu: AMT Publishing, Australian Mathematics Trust, University of Canberra,
Canberra
la: EN
cc: Q90 B60 U40 N70
ut: student competitions; informatics competitions; programming skills;
mathematical competitions; computer programming; Pascalâ€™s triangle;
case analysis and simplification; combinatorics; complexity theory;
constructive proofs; cryptanalysis; difference sequences; induction and
invariants; game theory; geometry; graph theory; optimization;
recurrence relations; discrete mathematics; polygon game; history of
informatics education
ci:
li:
ab: Summary: Many readers are familiar with the International Mathematical
Olympiad (IMO), a pinnacle in the yearly calendar of mathematics
competitions. Here we introduce its cousin in computer science, the
International Olympiad in Informatics (IOI). In this paper we take the
reader on a brief tour of the IOI, paying particular attention to its
relationships with traditional mathematics competitions. We begin in
Section 1 with the structure of a typical IOI problem, including an
outline of the mathematical ideas that lie behind such problems. For
illustration, two problems are worked through in detail in Section 2.
In Section 3 we compare the different ways in which mathematics and
informatics contests encourage students to think mathematically.
Section 4 closes with suggestions for students and teachers who wish to
become involved in the IOI.
rv: