M-303 Mathematical Logic and Number Theory
Lecture Topic Exercise Assignment/H.W.
Number
Set Theory
1 1 Number System, Interval, concept of sets
2 Subset, operations, universal sets
3 More Set Quality Proofs; Circle Proofs
2 4 Chain Proofs, Small Sets; Power Sets
5 Contrasting ∈ and ⊆ Ordered Pairs; Product
Sets
6 General Unions and Intersections
Logic:
3 7 Propositions; Logical Connectives; Truth
Tables, Logical Equivalence;
8 IF-Statements, IF, IFF, Tautologies, and
Contradictions,
9 Quantifiers; Universes, Properties of
Quantifiers, Uniqueness
Proofs:
4 10 Definitions, Axioms, Theorems and
Proofs,Proving Existence Statements and IF
Statements,
11 Contrapositive Proofs; IFF Proofs,
12 Proofs by Contradiction; OR Proofs,
5 13 Proof by Cases; Disproof’s
14 Proving Universal Statements; Multiple
Quantifiers
15 Recursive Definitions, Proofs by Induction,
6 16 Induction Starting Anywhere:
17 Backwards Induction, Strong Induction
18 Prime Numbers
7 19 Division with Remainder, Greatest Common
Divisors;
20 Euclid’s GCD Algorithm, More on GCDs;
21 Uniqueness of Prime Factorizations
Relations and Functions:
8 22 Binary Relations,Relations, Images of Sets
under Relations,
23 Inverses, Identity and Composition of
Relations, Properties of Relations,
24 Definition of Functions, Examples of
Functions; Proving Equality of Functions,
Composition,
Recommended Books:
1. Yousuf S.M., Majeed A., Amin M., Mathematical Methods, Ilmi Kitab Khanna, 2016.
9 25 Composition, Restriction, and Gluing,
26 Direct Images and Pre-images Injective,
Surjective, and Bijective Functions,
27 Inverse Functions.
Cardinality And Number Theory:
10 28 Finite Sets, Countable Infinite Sets,
29 Countable Sets, Uncountable Sets
30 Number theory
11 31 Preliminaries
32 Well-ordering principle,
33 Principle of finite induction
Divisibility theory:
12 34 The division algorithms, Basis representation
theorem, Prime and composite numbers,
Canonical decomposition
35 The greatest common divisor, The Euclidean
algorithm
36 The fundamental theorem of arithmetic, Least
common multiple
Linear Diophantine equations:
13 37 Congruence’s, Linear congruence’s,
38 System of linear congruence’s
39 System of linear congruence’s
14 40 The Chinese remainder theorem,
41 Divisibility tests,
42 Solving polynomial congruence’s
15 43 Fermat's and Euler's theorems
44 Wilson's theorem
45
2. Jain R.K., Lyengar, S.R.K., Advanced Engineering Mathematics, Narosa Publishing House, New
Delhi, 3rd edition, 2007.
3. Kreyszig E., Advanced Engineering Mathematics, John Wiley & Sons, Singapore, 9th edition,
2005.
4. Strang G., Introduction to Linear Algebra, 5th Edition, MIT Maths.
5. Mathews J.H., Howell, R.W., Complex Analysis for Mathematics and Engineering, Jones and
Bartlett Publishers, Boston, 5th edition, 2006.
6. O’Neil, P.V., Advanced Engineering Mathematics, Cengage learning, 7 th edition, 2011.
7. Liebeck A., A Concise Introduction to pure Mathematics, 4 th edition, CRC Press.
8. John B. F., A First Course in Abstract Algebra, 7 th edition, Pearson.
9. Sheldon M. R., Introduction to probability and Statistics for Engineers and Scientists, 5 th
edition, Elsevier.
