Math 567 -- Elementary Number Theory: Difference between revisions
No edit summary |
No edit summary |
||
| Line 13: | Line 13: | ||
Topics include some subset of, but are not limited to: Divisibility, the Euclidean algorithm and the GCD, linear Diophantine equations, prime numbers and uniqueness of factorization. Congruences, Chinese remainder theorem, Fermat's "little" theorem, Wilson's theorem, Euler's theorem and totient function, the RSA cryptosystem. Number-theoretic functions, multiplicative functions, Möbius inversion. Primitive roots and indices. Quadratic reciprocity and the Legendre symbol. Perfect numbers, Mersenne primes, Fermat primes. Pythagorean triples, Special cases of Fermat's "last" theorem. Fibonacci numbers. Continued fractions. Distribution of primes, discussion of prime number theorem. Primality testing and factoring algorithms. | Topics include some subset of, but are not limited to: Divisibility, the Euclidean algorithm and the GCD, linear Diophantine equations, prime numbers and uniqueness of factorization. Congruences, Chinese remainder theorem, Fermat's "little" theorem, Wilson's theorem, Euler's theorem and totient function, the RSA cryptosystem. Number-theoretic functions, multiplicative functions, Möbius inversion. Primitive roots and indices. Quadratic reciprocity and the Legendre symbol. Perfect numbers, Mersenne primes, Fermat primes. Pythagorean triples, Special cases of Fermat's "last" theorem. Fibonacci numbers. Continued fractions. Distribution of primes, discussion of prime number theorem. Primality testing and factoring algorithms. | ||
''' | |||
Course Policies:''' Homework will be due on Fridays. It can be turned in late only with ''advance'' permission from your grader. | '''Course Policies:''' Homework will be due on Fridays. It can be turned in late only with ''advance'' permission from your grader. | ||
'''Grading:''' The grade in Math 567 will be composed of 40% homework, 20% each of three in-class midterms. ''There will be no final exam in Math 567''. | '''Grading:''' The grade in Math 567 will be composed of 40% homework, 20% each of three in-class midterms. ''There will be no final exam in Math 567''. | ||
Revision as of 03:57, 27 August 2010
MATH 567
Elementary Number Theory
MWF 1:20-2:10, Van Vleck B119 Professor: Jordan Ellenberg (ellenber@math.wisc.edu)
Grader: Silas Johnson (sjohnson@math.wisc.edu)
Math 567 is a course in elementary number theory, aimed at undergraduates majoring in math or other quantitative disciplines. A general familiarity with abstract algebra at the level of Math 541 will be assumed, but students who haven't taken 541 are welcome to attend if they're willing to play a little catchup. We will be using William Stein's new (and cheap) textbook Elementary Number Theory: Primes, Congruences, and Secrets, which emphasizes computational approaches to the subject. If you don't need a physical copy of the book, it is available as a free legal .pdf. We will be using the (free, public-domain) mathematical software SAGE, developed largely by Stein, as an integral component of our coursework.
Topics include some subset of, but are not limited to: Divisibility, the Euclidean algorithm and the GCD, linear Diophantine equations, prime numbers and uniqueness of factorization. Congruences, Chinese remainder theorem, Fermat's "little" theorem, Wilson's theorem, Euler's theorem and totient function, the RSA cryptosystem. Number-theoretic functions, multiplicative functions, Möbius inversion. Primitive roots and indices. Quadratic reciprocity and the Legendre symbol. Perfect numbers, Mersenne primes, Fermat primes. Pythagorean triples, Special cases of Fermat's "last" theorem. Fibonacci numbers. Continued fractions. Distribution of primes, discussion of prime number theorem. Primality testing and factoring algorithms.
Course Policies: Homework will be due on Fridays. It can be turned in late only with advance permission from your grader.
Grading: The grade in Math 567 will be composed of 40% homework, 20% each of three in-class midterms. There will be no final exam in Math 567.
Syllabus: to come.
Homework: to come.