JK Contradance calling
L0 Contradance program
L1 Contradance program
L2 Contradance program
L3 Contradance program
L4 Contradance program
L5 Contradance program
Melrose parade, 2016
Michael Dyck's Contradance Index
Complex Vars 2017g
NT & Math Crypto 2016g
DfyQ 2015g (NO WEBPAGE)
Melrose Nemo Parade, 2015
Melrose Moon Parade, 2016
Spr2006: MAS4203 3173 Intro.Number.Theory MWF5 LIT223
Number Theory 1
May the Force be with you!
Since time-travel into the Future is now possible, you may wish to visit
the Spring 2007 webpage
of this course.
NT1 will have a continuation course, with emphasis on Mathematical Cryptography:
Number Theory 2
in Fall 2006.
- Here is the thrilling
available for your thinking and writing pleasure.
- The astonishing
has been instantiated. Accept no substitutes!
Get your copy today!
- The fabulous
- The wonderful
came into being.
- The gorgeous
persists. Get your solns posted before the O*t*h*e*r*s beat you to it!
(Sumeet already has TWO solns posted.)
- The fantastic
Extra A-Home (pdf)
is available, for those who want to work on extra stuff.
Teaching Page you will find
a wealth of useful information for students in all of my classes.
Our syllabus (text)
lists approximately what we will cover.
Other good references are Strayer's
text and Silverman's text.
A good (but challenging) text is
Niven, Zuckerman, Montgomery.
Our main textbook
Fundamentals of Number Theory
|Author: ||William J. Leveque
Aut2006: MAT4930 5662 Number Theory2 (Special Topics) MWF2 LIT239
Number Theory & Cryptography
This is a continuation of my
Number Theory 1 of
it should be accessible to anyone with an introductory course or who has
read the first few chapters of a beginning text
Elementary Number Theory by James Strayer;
A Friendly Introduction Number Theory by Joseph Silverman;
Elementary Number Theory by David Burton;
Fundamentals of Number Theory by William Leveque;
or the text by Vanden Eynden).
Our textbook is
A Computational Introduction to Number Theory and Algebra
|Author: ||Victor Shoup
||Publisher: ||Cambridge University Press
Here are links to
this book at The Publisher's site
The author has made freely available
PDF copy of his text
for those who wish to print a copy.
Among other nice features, this has a description+proof of the
Polynomial-time Deterministic Algorithm
(AKS primality test)
for testing whether a positive integer is prime.
- A review of modular arithmetic.
- The Euclidean Algorithm (the
Lightning Bolt alg).
- Euler phi function, Fermat's Little Thm. RSA Cryptosystem.
- The Chinese Remainder Thm and a brief introduction to Rings and Ring-isomorphism.
- Distribution of Primes: Chebyshev thm, Bertrand's postulate, PNT (Prime Number Thm).
- Miller-Rabin algorithm. Also, polytime testing whether N is a prime-power.
- AKS polytime primality-test algorithm.
JK Home page