COURSE UNIT TITLE

: NUMBER THEORY

DEGREE PROGRAMMES

Description of Individual Course Units

Course Unit Code Course Unit Title Type Of Course D U L ECTS
LME 5012 NUMBER THEORY ELECTIVE 2 0 0 4

Offered By

Mathematics Teacher Education

Level of Course Unit

First Cycle Programmes (Bachelor's Degree)

Course Coordinator

ASSISTANT PROFESSOR HASIBE SEVGI MORALI

Offered to

Mathematics Teacher Education

Course Objective

The main aim of this course is to introduce well ordered principle, induction, fibonacci numbers, prime numbers, the fundemental theorem of arithmetics, the method of separation to fermat multipliers, least common multiple, greatest common divisor, the euclidean algorithm, the finite number of finite elements, linear diophant equations, perfect numbers, mersenne numbers, congruences, linear congruences, remainer theorem, Wilson theorem and fermat's small theorem, properties of euler phi function, moebius reversing, continuous fractions.

Learning Outcomes of the Course Unit

1   1. Well ordered principle, proof using induction
2   2. Divisibilty, Fibonacci numbers
3   3. Prime numbers and properties
4   4. least common multiple, greatest common divisor
5   5. Euclidean Algorithm, fundamental theorem of arithmetics, applications
6   6.Linear diophant equations
7   7. Congruances, Chinese remainder theorem, Wilson s theorem, Fermat s small theorem, Euler phi function
8   8. Continuous fractions

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

None

Recomended Optional Programme Components

None

Course Contents

Week Subject Description
1 Integers, well ordered sets, proof with induction
2 Divisibility, Fibonacci numbers
3 Prime numbers, properties
4 Least common multiple, greatest common divisor
5 Euclidean Algorithm, fundamental theorem of arithmetics
6 Fermat s factoring method
7 Diophant equations
8 Course overview, evaluation and midterm examination
9 Perfect numbers, Mersenne numbers
10 Congruances, chinese remainder theorem
11 Wilson s theorem, Fermat s small theorem
12 Euler phi function, moebius inverse
13 Continuous fractions
14 General exercises, problems
15 Final Exam

Recomended or Required Reading

Prof. Dr. Arif Kaya, Sayılar kuramına Giriş, Ege Üni. Yayınları 1988

Planned Learning Activities and Teaching Methods

Lecture, discussion, question-answer, problem solving, active learning techniques, group work

Assessment Methods

SORTING NUMBER SHORT CODE LONG CODE FORMULA
1 VZ Midterm
2 FN Semester final exam
3 BNS BNS Student examVZ * 0.40 + Student examFN * 0.60
4 BUT Make-up note
5 BBN End of make-up grade Student examVZ * 0.40 + Student examBUT * 0.60


*** Resit Exam is Not Administered in Institutions Where Resit is not Applicable.

Further Notes About Assessment Methods

None

Assessment Criteria

To be announced.

Language of Instruction

Turkish

Course Policies and Rules

To be announced.

Contact Details for the Lecturer(s)

To be announced.

Office Hours

To be announced.

Work Placement(s)

None

Workload Calculation

Activities Number Time (hours) Total Work Load (hours)
TOTAL WORKLOAD (hours) 0

Contribution of Learning Outcomes to Programme Outcomes

PO/LOPO.1PO.2PO.3PO.4PO.5PO.6PO.7PO.8PO.9PO.10PO.11PO.12PO.13PO.14PO.15PO.16PO.17PO.18
LO.1543323
LO.2543323
LO.3543323
LO.4543323
LO.5543323
LO.6
LO.7
LO.8

CONTACT INFORMATION
Dokuz Eylül Üniversitesi Cumhuriyet Bulvarı No: 144 35210 Alsancak / İZMİR
Phone: +90(232) 412 12 12 - Fax: +90 (232) 464 81 35

Copyright 2015 DEÜ. BİD

HOME / ABOUT US / DEGREE PROGRAMMES / GENERAL INFORMATION FOR STUDENTS / INTERNATIONAL RELATIONS