PURE MATHEMATICS SEMINAR ON TUESDAY THE 17TH MAY 2005
Published on the 17 May 2005
In this lecture, I give combinatorial proofs of all of your favorite theorems from number theory, including Fermat's little theorem
Wilson's theorem
Lucas' Theorem for finding {n choose k} (mod p)
Fibonacci numbers, including gcd(F_m, F_n) = F_{gcd(m,n)}
Lucas numbers, including L_p = 1 (mod p)
Continued fraction identities
Every prime p = 4m+1 is the unique sum of squares
...
and more!
Enquiries to Catherine Greenhill, 9385 7105, csg@unsw.edu.au