Eskisehir Technical University Info Package Eskisehir Technical University Info Package
  • Info on the Institution
  • Info on Degree Programmes
  • Info for Students
  • Türkçe
About the Program Educational Objectives Key Learning Outcomes Course Structure Diagram with Credits Field Qualifications Matrix of Course& Program Qualifications Matrix of Program Outcomes&Field Qualifications
  • Faculty of Science
  • Department of Mathematics
  • Course Structure Diagram with Credits
  • Introduction to Number Theory I
  • Description
  • Description
  • Learning Outcomes
  • Course's Contribution to Prog.
  • Learning Outcomes & Program Qualifications

Course Introduction Information

Code - Course Title MAT431 - Introduction to Number Theory I
Course Type Area Elective Courses
Language of Instruction Türkçe
Laboratory + Practice 3+0
ECTS 5.0
Course Instructor(s) DOÇENT DOKTOR ADEM ERSİN ÜREYEN
Mode of Delivery The mode of delivery of this course is face to face.
Prerequisites There is no prerequisite or co-requisite for this course.
Courses Recomended There is no recommended optional programme component for this course.
Required or Recommended Resources Elementary Number Theory, David M. Burton, Mc Graw Hill, 2005.
Recommended Reading List Rosen, K . Elementary number theory and its applications, Addison-Wesley, 2011
Assessment methods and criteria 1. Midterm exam , 2. Midterm exam , Final Exam .
Work Placement NA
Sustainability Development Goals

Content

Weeks Topics
Week - 1 Natural numbers, Peano axioms.
Week - 2 Divisibility theory of integers, the division algorithm, the greatest common divisor, the Euclidean algorithm.
Week - 3 Diophantine equation.
Week - 4 Primes, The fundamental theorem of arithmetic, the sieve of Eratosthenes.
Week - 5 The theory of congruences, basic properties of congruence, special divisibility tests.
Week - 6 Linear congruences
Week - 7 Chinese Remainder theorem.
Week - 8 Fermat's theorem, Wilson's theorem.
Week - 9 Euler's Phi-function and Euler's theorem.
Week - 10 Primitive roots and indices, the order of an integer modulo n.
Week - 11 Lagrange's theorem
Week - 12 Primitive roots for primes
Week - 13 Composite numbers having primitive roots.
Week - 14 The theory of indices.

Learning Activities and Teaching Methods

  • Teaching Methods
  • Lecture
  • Discussion
  • Question & Answer
  • Drill - Practise
  • Problem Solving
  • Competences
  • Abstract analysis and synthesis
  • Problem solving
  • Elementary computing skills

Assessment Methods

Assessment Method and Passing Requirements
Quamtity Percentage (%)
1.Midterm Exam 1 30
2.Midterm Exam 1 30
Final Exam 1 40
Toplam (%) 100
  • Info on the Institution
  • Name and Adress
  • Academic Calendar
  • Academic Authorities
  • General Description
  • List of Programmes Offered
  • General Admission Requirements
  • Recognition of Prior Learning
  • Registration Procedures
  • ECTS Credit Allocation
  • Academic Guidance
  • Info on Degree Programmes
  • Doctorate Degree / Proficieny in Arts
  • Master's Degree
  • Bachelor's Degree
  • Associate Degree
  • Open&Distance Education
  • Info for Students
  • Cost of living
  • Accommodation
  • Meals
  • Medical Facilities
  • Facilities for Special Needs Students ı
  • Insurance
  • Financial Support for Students
  • Student Affairs Office
  • Info for Students
  • Learning Facilities
  • International Programmes r
  • Practical Information for Mobile Students
  • Language courses
  • Internships
  • Sports and Leisure Facilities
  • Student Associations