Introduction to Number Theory for computer sciences
Quote of the course:
"The obvious mathematical breakthrough would be
development
of an easy way to factor large prime numbers."
Bill Gates, The Road Ahead,
Viking, Penguin (1995)
Announcements:
Syllabus (
Syllabus
in Hebrew)
Recommended book: J. LeVeque, Fundamentals of Number Theory; Open University book on Number Theory (D. Burton, Elementary Number Theory),
and zillions of other books in Elementary Number Theory, including a nice book from the Open University (in Hebrew: library number 11-01 ברט.תו).
From History of Number Theory:
Fermat , Euler , Legendre , Lagrange , Gauss , Jacobi , Chebyshev , Riemann .
Online notes:
Notes by W. Stein (approach based on computations with PARI, very extensive and computationally oriented)
Home assignments:
Solutions to home
Problems.
89-256 (CS, Fall semester): Thursday, 9-12.
Solution
of
the 2013a exam.
Schedule:
MATERIALS FROM PAST YEARS.
Solution
of
the 2014a exam.
Solution
of
the 2012a exam.
Pre-exam problems.
Exam 2007a,
Solutions.
Exam 2005a,
Solutions.