Preview Workflow

The CIM Courses system will be down temporarily undergoing routine maintenance.

Viewing: MATH 3120 : Elementary Number Theory

Last approved: Mon, 08 May 2017 08:02:35 GMT

Last edit: Thu, 13 Apr 2017 01:21:45 GMT

Catalog Pages referencing this course
Columbian College of Arts and Sciences
Mathematics (MATH)
MATH
3120
Elementary Number Theory
Elementary Number Theory
Fall 2017
3
Course Type
Lecture
Default Grading Method
Letter Grade

No
No
MATH 2971 or MATH 2971W
Corequisites

35

Frequency of Offering

Term(s) Offered

Are there Course Equivalents?
No
 
No
Fee Type


No


Divisibility of integers, prime numbers, greatest common divisor, the Euclidean algorithm, congruence, the Chinese remainder theorem, number theoretic functions, Möbius inversion, Euler’s phi function, and applications to cryptography and primality testing.
As a result of completing this course, students will be able to: (1) devise proofs of a wide range of number-theoretic results, (2) more effectively assess the validity or invalidity of arguments, (3) apply basic computational skills, such as using the Euclidean algorithm to solve linear Diophantine equations.

Course Attribute
CCAS - GCR: Q & L

candaceg (Tue, 25 Oct 2016 15:24:33 GMT): Rollback: Hello Chair, I made some changes to your syllabus including adding updated University policies to the last page. Please add the follow elements and re-upload your syllabus: prerequisites, amount of time spent out of class, and a weekly schedule. I have attached a syllabus template and explanation for determining amount of time spent out of class for your convenience. Thanks.
Key: 5751