Académique Documents
Professionnel Documents
Culture Documents
Shamim A. Arif
Room No.
9-235
Office Hours
TBA
sarif@lums.edu.pk
Telephone
35608228
Secretary/TA
Shazia/Noreen
TA Office Hours
TBA
Lecture(s)
Duration
Duration
1
Duration
1 hour
Learning Outcomes
At the end of this course, the students will be able to:
Analyze statements using truth table
Construct simple proof including proofs by contradiction and proofs by induction
Prove statements about sets and functions
Prove standard results about countable sets
Course Distribution
Core
Math Major
Elective
Open for Student Category
All students
None
COURSE DESCRIPTION
Advanced Mathematics introduces progressively more and more abstract ideas and structures, and demands more and more in the way of proofs,
until by the end of a mathematics degree most of students time is occupied with understanding proofs and creating his or her own.
Proofs are important because of proof one knows things in mathematics, and it is its proofs that the strength and richness of mathematics is to be
found. Learning to deal with abstraction and with proofs takes time. This course aims to bridge the gap between school and university
mathematics, by beginning with some rather concrete techniques where the emphasis is on calculation, and gradually moving towards abstraction
and proof.
COURSE Anti-PREREQUISITE(S)
Apply Euclids Algorithm to find the greatest common divisor of pairs of integers and to solve linear Diophantine equations To
solve simultaneous linear congruence
Prove Fermats Little Theorem
Construct multiplication tables for congruence classes
Have a informal introduction of algebraic structures and understanding of isomorphism between the groups.
Grading Breakup and Policy(tentative)
Quiz(s): 30%
Midterm: 30%
Final Examination: 40%
Examination Detail
Midterm
Exam
Final Exam
Yes/No:
Yes/No:
Exam Specifications:
COURSE OVERVIEW
Week/ Lecture/
Module
Topics
Recommended
Readings
Chapter 1
1.1-1.6
Sets
Basic concept of Sets,
Set Operations, identities, Venn diagrams, power sets
Mathematical induction, Generalized principle of mathematical
induction ,principle of complete induction
Equivalent forms of Induction, The Well ordering principle, Principles
of counting
Chapter 2
2.1-2.6
Objectives/
Application
Chapter 3
3.1-3.4
Functions
Functions as relations
Construction of Functions
Injections, Surjections, Bijections
Inverse Functions, Inverse Images
Image of Sets
Chapter 4
4.1-4.5
Cardinality
Equivalent Sets; Finite Sets, the Pigeon-hole Principle
Infinite Sets; Countable, Uncountable
Cardinal Numbers Axiom
of Choice
Chapter 5
5.1-5.5
Arithmetic
Integers, Divisibility
Division algorithm
Primes and Factorization, Fundamental theorem of Arithmetic Linear
Diophantine Equations
Lecture Notes
Modular Arithmetic
Congruence and modular arithmetic
Linear Congruence, Chinese Reminder Theorem
Fermats Theorem, Eulers phi function
Eulers theorem
Lecture Notes
Algebraic Structures
Algebraic Structures
Groups
Subgroups
Order of an element, Lagrange Theorem
Homomorphism and Isomorphism
Brief introduction to Rings and Fields, Examples
Lecture Notes
Textbook(s)/Supplementary Readings
D. Smith, M. Eggen, R. S. Andre, A Transition to Advanced Mathematics, 7th Edition
P.J. Eccles, An Introduction to Mathematical Reasoning: Numbers, Sets and Functions, Cambridge University Press, 1997.
I.N. Stewart and D.O. Tall, Foundations of Mathematics, OUP, 1977
J. Farleigh, A First Course in Abstract Algebra, Addison-Wesley