Week 1

Monday 6/11

Tuesday 6/12

Wednesday 6/13

Thursday 6/14

Session 1, 8:30-9:30

ST Numbers
1-4, Brute force Induction

ST Numbers
5-6, Algebraic numbers

ST Numbers
6-7, Recursion formulas

ST Numbers
8, Continued fractions

Break, 9:30-9:40

Session 2, 9:40-10:45

Number Theory 1
Divisibility and congruences Prime numbers

Number Theory 2
Euclidean algorithm

Number Theory 3
Modular powers, Fermat test

Number Theory 4

Powers and Roots mod m

Break, 10:45-11:00

Session 3, 11:00-12:00

Problem Session

Problem Session

Problem Session

Problem Session

Lunch, 12:00-1:00

Colloquium

Peter Alfeld
Hotel Infinity

Domingo Toledo

Peter Trapa

David Dobson

Lab, 2:00-4:00

unix, emacs, python
Brute force search, Eratosthenes' sieve

Euclidean algorithm
ax + by = c

Modular powers
Fermat's test

Finding large primes
Testing Fermat's test