Course Description
Integers, Divisibility, Prime numbers. The Euclidean Algorithm, greatest common divisors. Linear Diophantine equations; Congruence and Chinese Remainder Theorem. Euler’s Theorem, Fermat's Theorem; Wilson's Theorem. Number theoretic functions.
Course Objectives & Outcomes
Objectives:
- Equip the student with necessary knowledge and skills to enable them to solve Diphantine equations and linear Congruencies.
- Enable the student to use special divisibility tests.
Outcomes: Upon successful completion of this course, the student will be able to:
- Prove statements and solve problems involving divisibility.
- Solve linear Diophantine equations.
- Define linear congruence and Chinese.
- Remainder Theorem.
- Apply properties of Number theoretic functions in applications.
References
1. Burton, D.M. (1998) Elementary Number Theory, The McGraw-Hill Companies, Inc. ISBN 978-0-07-338314-9
2. Rosen, K.H. (1992) Elementary Number Theory and Its Application, Addison-Wesley Publishing Company. ISBN-10: 0201119587 ,ISBN-13: 9780201119589
فوزي الذكير و معروف سمحان.( 2002) مقدمة في نظرية الأعداد, دار الخريجي للطباعة و النشر, الطبعة الثانية 3.
Course ID: MATH 406
| Credit hours | Theory | Practical | Laboratory | Lecture | Studio | Contact hours | Pre-requisite | 3 | 3 | 3 | - |
|---|
