Sponsored in part by the Canadian Mathematical
Society as one of its Regional Math Camps
•
Places •
Day-to-day record •
Problems •
Participants •
Sources • Photos •
Places
•
Places •
Day-to-day record •
Problems •
Participants •
Sources • Photos •
Day-to-day record
- Sunday 6 June
- Monday 7 June
- 9:30--12:15: Vašek Chvátal: problem-solving session and modular arithmetic
- Lunch: cream of broccoli or vegetable soup; chicken parmesan or tortelini sauce rose; dessert and coffee or tea
- 1:45--4:30: Nancy Acemian:
introduction to Maple
- 5:00: Julia Robinson
and Hilbert's Tenth Problem
(87 minutes)
- Tuesday 8 June
- 9:30--12:15: Vašek Chvátal: solving linear congruences by the extended Euclidean algorithm
- Lunch: cauliflower or mushroom soup; chou farci or croque monsieur; dessert and coffee or tea
- 1:45--4:30: Nancy Acemian: programming the extended Euclidean algorithm
- 5:00: I Want
To Be a Mathematician: A Conversation with Paul Halmos (44
minutes)
- Wednesday 9 June
- Thursday 10 June
- 9:30--12:15: Vašek Chvátal: problem-solving
session, divisibility tests, and modular exponentiation by
repeated squaring
- Lunch: cream of cauliflower or lima bean soup; ragout de boeuf or crepe au poulet; dessert and coffee or tea
- 1:45--4:30: Nancy Acemian: programming modular exponentiation by repeated squaring
- 5:00: The Right Spin (35 minutes)
- Friday 11 June
- 9:30--12:15: Vašek Chvátal: the RSA public-key cryptosystem; the Prime Number Theorem
- Lunch: borscht or potato and green bean soup; filet de sole or lasagne a la viande; dessert and coffee or tea
- 1:45--4:30: Vašek Chvátal: Fermat's Little
Theorem; the Miller-Rabin randomized test for primality; the Chinese Remainder Theorem
- 5:00: courtesy of
Marc-Alexandre Chan: Flatland:
The Movie (34 minutes)
- Saturday 12 June
- 9:30--12:15: Nancy Acemian: programming the courting algorithm to solve the stable marriage problem
- Lunch: cream of cauliflower or lima bean soup; crepe aux legumes et jambon or schnitzel; dessert and coffee or tea
- 1:45--4:30: courtesy of Nan Yang:
Dangerous knowledge
•
Places •
Day-to-day record •
Problems •
Participants •
Sources • Photos •
Problems
- Sunday's set
- Monday's set
- John McKay's problem: Characterize finite graphs in which
- you can label vertices by positive integers in such a way
that, for every vertex v,
the sum of the labels of the neighbours of v is twice the label of v.
Every cycle has this property: just label all vertices by the same
positive integer. What other finite graphs have it?
(For graph-theoretic terminology, see Graph
Theory with Applications by Adrian Bondy and U.S.R. Murty.)
- Thursday's problem
•
Places •
Day-to-day record •
Problems •
Participants •
Sources • Photos •
Participants
Sorted by family names in alphabetic order:
- Eric Barkhouse (Champlain)
- Yun Cao (Marianopolis)
- Marc-Alexandre Chan (Champlain)
- Tomasz Drake (Champlain)
- Howard Huang (Marianopolis)
- Samuel Laferriere (Champlain)
- Yu Wei Liu (Marianopolis)
- Dany Lyth (Champlain)
- Shahrad Rezaei (Vanier)
- Mathieu Roy (Champlain)
- Stephanie Shousha (Marianopolis)
- Hanieh Zargham (Marianopolis)
- Evan Zhou (Marianopolis)
- Lisa Yiran Zhu (Marianopolis)
and auditors
- Pegah Abrishami (Concordia)
- Laurence Petitclerc (Concordia)
- Nan Yang (Concordia)
•
Places •
Day-to-day record •
Problems •
Participants •
Sources • Photos •
Sources
- ZALA films: official site for films by George Csicsery
- The initial choices of syllabus topics
- George Pólya, How
to Solve It: A New Aspect of Mathematical Method
- René Descartes, Discourse on
the Method of rightly conducting one's reason and seeking truth in the
sciences
- Jacques Hadamard, The
Mathematician's Mind: The Psychology of Invention in the Mathematical
Field
- Paul Halmos, How to write
mathematics
- George Orwell, Politics
and the English Language
- The MacTutor History of Mathematics archive
- Paul
Erdős and his collected papers
- La
propriété, c'est le vol!
- Mariages
Stables et leurs relations avec d'autres problèmes
combinatoires
par Donald E. Knuth (Montréal: Les Presses de
l'Université de Montréal, 1976)
- The
extended Euclidean algorithm
- Euclid
and his Elements
(the Euclidean algorithm is Proposition
2 in Book VII)
- The
Four Colour Theorem
- George
Spencer-Brown and his work
on the Four Colour Theorem
- The
Unique Factorization Theorem for positive integers
(also known as 'The Fundamental Theorem of Arithmetic')
- From
Error Correcting Codes Through Sphere Packings to Simple Groups by Thomas M. Thompson
- On
Quaternions and Octonions by John Horton Conway and Derek Smith
- How
Richard Ewen Borcherds proved the monstrous moonshine conjecture
- The Fields
Medal
- A LaTeX2e Gallimaufry
by Peter Grogono
- MetaPost: A Reference Manual
by Peter Grogono
- Programs
from Peter Grogono's lecture
- The
Mandelbulb (links to videos are at the bottom of Page 1)
- Bahman Kalantari's Polynomiography
- IMDb video: porridge pulleys and Pi: two mathematical journeys
- Escher and the
Droste effect
- Robert S. Fouch, On the definability of zero to the power zero, School Science and Mathematics 53,
No. 9 (December 1953), pp. 693 -- 696
- H. E. Vaughan, The expression '00 ', Mathematics
Teacher 63 (1970), pp. 111 --112
- Computing ab mod m
- Tom Wolfe's The Right Stuff
- Mark Twain's A Connecticut Yankee in King Arthur's Court
- The gold-bug by
Edgar Allan Poe
- The
Codebreakers by David Kahn
- Simon Singh's Crypto Corner
- The Prime Pages
- The original RSA paper from 1978
- Practical aspects of the RSA algorithm
- Fermat's Little Theorem
- The
Miller-Rabin randomized primality test
-
The Chinese Remainder Theorem
- The
Mathematics of Ciphers: Number Theory and RSA Cryptography by
S.C. Coutinho
- Jon Bentley's books on programming:
-
A
conjecture of V.C. (appeared in Discrete & Computational Geometry 31 (2004), 175 -- 195)
and
its proof by Xiaomin Chen
(appeared in Discrete & Computational Geometry 35 (2006), 193 -- 199)
- Darkness Visible by
William Styron
- An Unquiet Mind by Kay Redfield Jamison
•
Places •
Day-to-day record •
Problems •
Participants •
Sources • Photos •
Photos
•
Places •
Day-to-day record •
Problems •
Participants •
Sources • Photos •
