AMIN WITNO WEB
PHILADELPHIA UNIVERSITY



HOME
COURSES
NOTES
EXAMS
RÉSUMÉ

NUMBER THEORY COURSE PAGE

MATH 250313 — NUMBER THEORY

Description
Course Syllabus (Fall 2015, pdf)
An introductory course in elementary number theory, covering topics in divisibility, prime numbers, congruences, primitive roots, quadratic residues, and the RSA algorithm of cryptography.

Textbook
Theory of Numbers (April 2008, pbk)
Published by BookSurge, this affordable book may be purchased online from Amazon.com. The first six chapters, which pretty much span the entire course, can be downloaded for free as pdf files following the above link.

Lecture Notes
The Primitive Root Theorem (April 2012, pdf)
Notes for the supplementary lecture on the proof of the theorem.

Programming Notes
Trial Division To Twelve Digits (December 2011, html)
A JavaScript factorization program for integers up to one trillion, using trial division by prime numbers from 2 to 999,983.

Online Resources
Number Theory Web (ext)
A starting point for all number theory interests.

Sample Exams
Copies of past exams are available from the archive whose links are provided below. All problems are posted without solution and are intended for practice purposes only.
Exam 1 Exam 2 Final
F-2015/16
S-2014/15
F-2014/15
S-2013/14
F-2013/14
S-2012/13
F-2012/13
S-2011/12
F-2011/12
S-2010/11
S-2009/10
S-2007/08
F-2007/08
S-2006/07
F-2005/06
F-2015/16
S-2014/15
F-2014/15
S-2013/14
F-2013/14
S-2012/13
F-2012/13
S-2011/12
F-2011/12
S-2010/11
S-2009/10
S-2007/08
F-2007/08
S-2006/07
F-2005/06
F-2015/16
S-2014/15
F-2014/15
S-2013/14
F-2013/14
S-2012/13
F-2012/13
S-2011/12
F-2011/12
S-2010/11
S-2009/10
S-2007/08
F-2007/08
S-2006/07
F-2005/06

MATH 250472 — COMPUTATIONAL NUMBER THEORY

Description
Course Syllabus (Fall 2010, pdf)
A survey on the two main research topics in computational number theory: factorization and primality proving. Subtopics include the RSA cryptosystem, Fermat factorization, Pollard rho and p-1 methods, quadratic sieve, continued fraction method, Fermat, Euler and strong pseudoprimes, Lucas, Pocklington and Pepin tests, Fermat numbers, and Mersenne primes.

Recommended Textbook
Theory of Numbers (April 2008, pbk)
Scroll up to Math 313 to see book description.

Lecture Notes
Computational Number Theory (January 2011, pdf)
Notes for the course, to be used primarily as a review study guide.

Programming Notes
Testing Primes To Nine Quadrillion (January 2012, html)
JavaScript primality testing algorithm based on the Miller-Rabin test.

Online Resources
ECM Factorization (ext)
Java applet for factoring large numbers via the elliptic curve method.

Sample Exams
Copies of past exams are available from the archive whose links are provided below. All problems are posted without solution and are intended for practice purposes only.
Exam 1 Exam 2 Final
XXX
F-2010/11
XXX
F-2009/10
S-2008/09
S-2007/08
F-2007/08
F-2006/07
F-2011/12
F-2010/11
S-2009/10
F-2009/10
S-2008/09
S-2007/08
F-2007/08
F-2006/07
F-2011/12
F-2010/11
S-2009/10
F-2009/10
S-2008/09
S-2007/08
F-2007/08
F-2006/07

Copyright © 2002–2017 Amin Witno
This page belongs to the personal folder of Amin Witno and does not necessarily represent the philosophy and values of Philadelphia University or the Department of Basic Sciences in particular.