This course is an introduction to the beauty and power of number theory. Ideal for inservice teachers and those aspiring to take discrete mathematics or abstract algebra, it emphasizes the various proof techniques and counterexamples, and presents many unsolved problems that have been studied for centuries. Once thought to be the purest of pure mathematics, number theory has a new dimenson since the advent of modern technology: constant practical applications, including computer security checks, such as check digits in UPCs, zip codes, ISBNs, ISSNs, EANs, VINs, credit card numbers, and library book numbers, to name a few. Topics include recursion, Pascal's triangle, binomial theorem, figurate numbers, Fibonacci and Lucas numbers, Fermat numbers, division algorithm, prime and composite numbers, Euclidean algorithm, gcd, lcm, linear diophantine equations, congruences, Pollard Rho factoring method, divisibility tests, perpetual calendar, Chinese remainder theorem, Wilson's theorem, Fermat's little theorem, Euler's theorem, perfect numbers, and Mersenne numbers. Graduate-credit students are expected to write programs in a structured language such as Java. Prerequisites: precalculus and mathematical maturity; knowledge of a structured language such as Java for graduate-credit students;
placement test is recommended. (4 credits)