Study guide
2.1 Real Numbers, Sets, Logic, Binary Operations & Groups
Pakistan ECAT Engineering Colleges Admission Test
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: ECAT Exam Structure, Scoring & Strategy
1.1 ECAT Exam Pattern, Scoring Scheme & UET Merit Aggregate 1.2 Time Management, Pacing & MCQ Problem-Solving Tactics
2 Chapter 2: Mathematics — Number Systems, Sets & Algebra
2.1 Real Numbers, Sets, Logic, Binary Operations & Groups 2.2 Complex Numbers, Modulus, Conjugates & De Moivre's Theorem 2.3 Matrices, Determinants, Inverses & Systems of Linear Equations 2.4 Quadratic Equations, Relations Between Roots & Factor/Remainder Theorems
3 Chapter 3: Mathematics — Sequences, Series & Combinatorics
3.1 Arithmetic, Geometric & Harmonic Progressions (AP, GP, HP) 3.2 Permutations, Combinations & Probability Distributions 3.3 Mathematical Induction & the Binomial Theorem
4 Chapter 4: Mathematics — Trigonometry & Trigonometric Equations
4.1 Fundamental Trigonometric Identities & Angle Addition Formulas 4.2 Graphs of Trigonometric Functions & Inverse Trigonometric Functions 4.3 Solutions of Triangles (Sine/Cosine Laws) & Trigonometric Equations
5 Chapter 5: Mathematics — Functions, Limits & Continuity
5.1 Real-Valued Functions, Types, Domains & Ranges 5.2 Limits of Functions, Indeterminate Forms & Squeeze Theorem 5.3 Continuity, Types of Discontinuity & Asymptotes
6 Chapter 6: Mathematics — Differential Calculus
6.1 Definition of Derivative, Power, Product, Quotient & Chain Rules 6.2 Derivatives of Trigonometric, Exponential & Logarithmic Functions 6.3 Implicit Differentiation, Parametric Equations & Higher-Order Derivatives 6.4 Tangents, Normals, Increasing/Decreasing Functions & Extrema
7 Chapter 7: Mathematics — Integral Calculus
7.1 Indefinite Integration Formulas & Integration by Substitution 7.2 Integration by Parts & Partial Fractions 7.3 Definite Integrals, Properties & Fundamental Theorem of Calculus 7.4 Area Under Curves & First-Order Differential Equations
8 Chapter 8: Mathematics — Analytic Geometry, Linear Programming & Vectors
8.1 Coordinates, Slopes, Straight Line Equations & Distances 8.2 Linear Inequalities & Linear Programming 8.3 Circle Equations, Tangents, Normals & Intersections 8.4 Conic Sections: Parabola, Ellipse & Hyperbola Characteristics 8.5 Vectors in 2D and 3D, Dot Product, Cross Product & Scalar Triple Product
9 Chapter 9: Physics — Measurements, Vectors & Equilibrium
9.1 Physical Quantities, SI Units, Errors & Dimensional Analysis 9.2 Vector Addition, Components, Scalar & Vector Products in Physics 9.3 Equilibrium Conditions, Torque & Rotational Equilibrium
10 Chapter 10: Physics — Kinematics, Dynamics & Energy
10.1 Kinematics: Displacement, Velocity, Acceleration & Motion Equations 10.2 Newton's Laws of Motion, Momentum, Impulse & Elastic Collisions 10.3 Projectile Motion: Trajectory, Height, Flight Time & Range 10.4 Work, Energy, Work-Energy Theorem, Conservative Forces & Power
11 Chapter 11: Physics — Circular Motion, Gravitation, Fluids & Oscillations
11.1 Uniform Circular Motion, Centripetal Force & Moment of Inertia 11.2 Gravitation, Escape Velocity, Satellites & Weightlessness 11.3 Viscosity, Drag Force, Equation of Continuity & Bernoulli's Principle 11.4 Simple Harmonic Motion (SHM), Pendulum, Mass-Spring & Resonance
12 Chapter 12: Physics — Waves, Optics, Optical Instruments & Thermodynamics
12.1 Waves, Speed of Sound, Standing Waves & Doppler Effect 12.2 Wave Theory of Light, Interference & Young's Double-Slit Experiment 12.3 Diffraction Grating, Resolving Power & Polarization of Light 12.4 Optical Instruments: Magnifiers, Microscopes, Telescopes, Spectrometer & Fibre Optics 12.5 Kinetic Theory of Gases, First Law, Heat Engines & Carnot Cycle
13 Chapter 13: Physics — Electrostatics, Current Electricity & Electromagnetism
13.1 Coulomb's Law, Electric Fields, Gauss's Law & Capacitors 13.2 Electric Current, Resistance, Ohm's Law, Kirchhoff's Rules & Potentiometer 13.3 Magnetic Fields, Ampere's Law, Faraday's Law, Lenz's Law & Transformers
14 Chapter 14: Physics — Alternating Current, Physics of Solids & Electronics
14.1 Alternating Current: RMS Values, Reactance, Impedance, Resonance & Power 14.2 Physics of Solids: Elasticity, Band Theory, Superconductors & Magnetic Materials 14.3 Electronics: p-n Junction, Rectifiers, Transistors, Op-Amps & Logic Gates
15 Chapter 15: Physics — Modern, Atomic & Nuclear Physics
15.1 Special Relativity, Mass–Energy Equivalence, Pair Production & Annihilation 15.2 Photoelectric Effect, Photons, Atomic Spectra, X-Rays & Nuclear Reactions 15.3 Lasers, Nuclear Reactors, Radiation Detectors, Dosimetry & Elementary Particles
16 Chapter 16: Chemistry — Basic Concepts, Atomic Structure, Bonding & States of Matter
16.1 Mole Concept, Stoichiometry, Limiting Reactants, Isotopes & Experimental Techniques 16.2 Atomic Structure, Bohr's Model, Quantum Numbers & Electronic Configurations 16.3 Chemical Bonding: Ionic, Covalent & Coordinate Bonds, VSEPR, Hybridization & MOT 16.4 Gas Laws, Ideal Gas Equation, Kinetic Molecular Theory & Real Gases 16.5 Liquids, Intermolecular Forces, Hydrogen Bonding & Crystal Lattices
17 Chapter 17: Chemistry — Energetics, Equilibrium & Kinetics
17.1 Enthalpy Changes, Calorimetry, Hess's Law & Born-Haber Cycle 17.2 Reversible Reactions, Equilibrium Constants (Kc, Kp), Le Chatelier & Ksp 17.3 Solutions, Concentration Units, Colligative Properties & Raoult's Law 17.4 Reaction Rates, Rate Equations, Order of Reaction & Activation Energy
18 Chapter 18: Chemistry — Periodic Trends, s-, p- & d-Block Elements & Electrochemistry
18.1 Periodic Trends: Atomic Radii, Ionization Energies & Electronegativities 18.2 Chemistry of s-Block and p-Block Elements (Groups I, II, III, IV, VII) 18.3 Groups V-A & VI-A: Nitrogen, Phosphorus, Oxygen & Sulphur Compounds 18.4 Transition Elements: Electronic Configurations, Complexes & Colors 18.5 Oxidation Numbers, Electrochemical Cells, Standard Potentials & Batteries
19 Chapter 19: Chemistry — Organic Chemistry & Reaction Mechanisms
19.1 Organic Functional Groups, IUPAC Nomenclature & Structural/Stereoisomerism 19.2 Aliphatic Hydrocarbons: Alkanes, Alkenes, Alkynes & Addition Reactions 19.3 Benzene: Electronic Structure, Resonance Stability & Electrophilic Substitution 19.4 Alkyl Halides (SN1/SN2), Grignard Reagents & Functional-Group Tests 19.5 Alcohols, Phenols & Ethers: Preparation and Reactions 19.6 Aldehydes, Ketones, Carboxylic Acids, Acid Derivatives & Amino Acids
20 Chapter 20: Chemistry — Macromolecules, Chemical Industries & Environment
20.1 Macromolecules: Polymers, Carbohydrates, Proteins, Lipids, Enzymes & Nucleic Acids 20.2 Chemical Industries in Pakistan & Environmental Chemistry
21 Chapter 21: English — Reading Comprehension, Vocabulary & Grammar
21.1 Reading Comprehension Strategies, Main Ideas, Inferences & Tone 21.2 Academic Vocabulary, Context Clues, Synonyms & Antonyms 21.3 Subject-Verb Agreement, Tenses & Grammatical Concord 21.4 Sentence Correction, Parallelism, Modifiers & Prepositions
2.1 Real Numbers, Sets, Logic, Binary Operations & Groups
Key Takeaways Explain This Topic AI
Real numbers split into rationals (terminating or recurring decimals, such as 0.375 0.375 0.375 or 0. 3 ‾ 0.\overline{3} 0. 3 ) and irrationals (non-terminating, non-recurring, such as 2 \sqrt{2} 2 and π \pi π ); the field and order properties govern every algebraic manipulation.
A set with n n n elements has 2 n 2^n 2 n subsets ( 2 n − 1 2^n - 1 2 n − 1 proper subsets), and n ( A ∪ B ) = n ( A ) + n ( B ) − n ( A ∩ B ) n(A \cup B) = n(A) + n(B) - n(A \cap B) n ( A ∪ B ) = n ( A ) + n ( B ) − n ( A ∩ B ) solves most Venn-diagram counting questions.
De Morgan's laws, ( A ∪ B ) ′ = A ′ ∩ B ′ (A \cup B)' = A' \cap B' ( A ∪ B ) ′ = A ′ ∩ B ′ and ( A ∩ B ) ′ = A ′ ∪ B ′ (A \cap B)' = A' \cup B' ( A ∩ B ) ′ = A ′ ∪ B ′ , have exact logical twins: ∼ ( p ∨ q ) ≡ ∼ p ∧ ∼ q \sim(p \vee q) \equiv \sim p \wedge \sim q ∼ ( p ∨ q ) ≡∼ p ∧ ∼ q and ∼ ( p ∧ q ) ≡ ∼ p ∨ ∼ q \sim(p \wedge q) \equiv \sim p \vee \sim q ∼ ( p ∧ q ) ≡∼ p ∨ ∼ q .
A conditional p → q p \to q p → q is false only when p p p is true and q q q is false, and it is logically equivalent to its contrapositive ∼ q → ∼ p \sim q \to \sim p ∼ q →∼ p , not to its converse q → p q \to p q → p .
A group is a set with a binary operation satisfying closure, associativity, an identity and inverses; it is abelian if the operation is also commutative.
Last updated: October 2026
Real Numbers, Sets, Logic, Binary Operations & Groups
The first chapters of Intermediate Mathematics Part I set up the language that the rest of the course uses: number systems, sets, logic and algebraic structures. These topics produce short recall and reasoning questions, so they are worth securing early.
1. The Real Number System
- Set Symbol Description Examples
- Natural numbers N \mathbb{N} N { 1 , 2 , 3 , … } \{1, 2, 3, \dots\} { 1 , 2 , 3 , … } 7 7 7
- Whole numbers W W W { 0 , 1 , 2 , … } \{0, 1, 2, \dots\} { 0 , 1 , 2 , … } 0 0 0
Integers Z \mathbb{Z} Z { … , − 2 , − 1 , 0 , 1 , 2 , … } \{\dots, -2, -1, 0, 1, 2, \dots\} { … , − 2 , − 1 , 0 , 1 , 2 , … } − 5 -5 − 5
Rational numbers Q \mathbb{Q} Q p q \frac{p}{q} q p with p , q ∈ Z p, q \in \mathbb{Z} p , q ∈ Z , q ≠ 0 q \neq 0 q = 0 3 8 = 0.375 \frac{3}{8} = 0.375 8 3 = 0.375 , 0. 3 ‾ 0.\overline{3} 0. 3
Irrational numbers Q ′ \mathbb{Q}' Q ′ Non-terminating, non-recurring decimals 2 \sqrt{2} 2 , π \pi π , e e e
Real numbers R \mathbb{R} R Q ∪ Q ′ \mathbb{Q} \cup \mathbb{Q}' Q ∪ Q ′ all of the above
Every terminating or recurring decimal is rational. To convert a recurring decimal, multiply by a power of 10 and subtract:
x = 0. 45 ‾ ⟹ 100 x = 45. 45 ‾ ⟹ 99 x = 45 ⟹ x = 45 99 = 5 11 x = 0.\overline{45} \implies 100x = 45.\overline{45} \implies 99x = 45 \implies x = \frac{45}{99} = \frac{5}{11} x = 0. 45 ⟹ 100 x = 45. 45 ⟹ 99 x = 45 ⟹ x = 99 45 = 11 5
Common trap: π \pi π is irrational, so 22 7 \frac{22}{7} 7 22 is only an approximation. Likewise 4 = 2 \sqrt{4} = 2 4 = 2 is rational even though it is written with a root sign.
Field and Order Properties of R \mathbb{R} R
For all real a a a , b b b , c c c :
Closure: a + b a + b a + b and a b ab ab are real.
Commutative: a + b = b + a a + b = b + a a + b = b + a , a b = b a ab = ba ab = ba .
Associative: ( a + b ) + c = a + ( b + c ) (a + b) + c = a + (b + c) ( a + b ) + c = a + ( b + c ) , ( a b ) c = a ( b c ) (ab)c = a(bc) ( ab ) c = a ( b c ) .
Identities: 0 0 0 for addition, 1 1 1 for multiplication.
Inverses: − a -a − a for addition; 1 a \frac{1}{a} a 1 for multiplication when a ≠ 0 a \neq 0 a = 0 .
Distributive: a ( b + c ) = a b + a c a(b + c) = ab + ac a ( b + c ) = ab + a c .
Order (trichotomy): exactly one of a < b a < b a < b , a = b a = b a = b , a > b a > b a > b holds.
Transitive: a < b a < b a < b and b < c b < c b < c imply a < c a < c a < c .
Multiplicative order: if a < b a < b a < b and c > 0 c > 0 c > 0 then a c < b c ac < bc a c < b c ; if c < 0 c < 0 c < 0 the inequality reverses , a c > b c ac > bc a c > b c .
The last rule is the source of many errors when solving inequalities: multiplying or dividing by a negative number flips the sign.
2. Sets and Set Operations
A set is a well-defined collection of distinct objects. It can be written in tabular form, A = { 2 , 4 , 6 } A = \{2, 4, 6\} A = { 2 , 4 , 6 } , or set-builder form, A = { x ∣ x is an even natural number , x ≤ 6 } A = \{x \mid x \text{ is an even natural number}, x \le 6\} A = { x ∣ x is an even natural number , x ≤ 6 } .
Subset: A ⊆ B A \subseteq B A ⊆ B if every element of A A A is in B B B . A set with n n n elements has 2 n 2^n 2 n subsets and 2 n − 1 2^n - 1 2 n − 1 proper subsets.
Power set: P ( A ) P(A) P ( A ) is the set of all subsets of A A A , so n ( P ( A ) ) = 2 n n(P(A)) = 2^n n ( P ( A )) = 2 n . For A = { a , b , c } A = \{a, b, c\} A = { a , b , c } , n ( P ( A ) ) = 8 n(P(A)) = 8 n ( P ( A )) = 8 .
Union, intersection, difference, complement: A ∪ B A \cup B A ∪ B , A ∩ B A \cap B A ∩ B , A − B = A ∩ B ′ A - B = A \cap B' A − B = A ∩ B ′ , and A ′ = U − A A' = U - A A ′ = U − A .
Disjoint sets: A ∩ B = ∅ A \cap B = \varnothing A ∩ B = ∅ .
Laws of Set Algebra
- Law Union form Intersection form
- Commutative A ∪ B = B ∪ A A \cup B = B \cup A A ∪ B = B ∪ A A ∩ B = B ∩ A A \cap B = B \cap A A ∩ B = B ∩ A
Associative ( A ∪ B ) ∪ C = A ∪ ( B ∪ C ) (A \cup B) \cup C = A \cup (B \cup C) ( A ∪ B ) ∪ C = A ∪ ( B ∪ C ) ( A ∩ B ) ∩ C = A ∩ ( B ∩ C ) (A \cap B) \cap C = A \cap (B \cap C) ( A ∩ B ) ∩ C = A ∩ ( B ∩ C )
Distributive A ∪ ( B ∩ C ) = ( A ∪ B ) ∩ ( A ∪ C ) A \cup (B \cap C) = (A \cup B) \cap (A \cup C) A ∪ ( B ∩ C ) = ( A ∪ B ) ∩ ( A ∪ C ) A ∩ ( B ∪ C ) = ( A ∩ B ) ∪ ( A ∩ C ) A \cap (B \cup C) = (A \cap B) \cup (A \cap C) A ∩ ( B ∪ C ) = ( A ∩ B ) ∪ ( A ∩ C )
De Morgan ( A ∪ B ) ′ = A ′ ∩ B ′ (A \cup B)' = A' \cap B' ( A ∪ B ) ′ = A ′ ∩ B ′ ( A ∩ B ) ′ = A ′ ∪ B ′ (A \cap B)' = A' \cup B' ( A ∩ B ) ′ = A ′ ∪ B ′
Counting with Venn Diagrams
n ( A ∪ B ) = n ( A ) + n ( B ) − n ( A ∩ B ) n(A \cup B) = n(A) + n(B) - n(A \cap B) n ( A ∪ B ) = n ( A ) + n ( B ) − n ( A ∩ B )
n ( A ∪ B ∪ C ) = n ( A ) + n ( B ) + n ( C ) − n ( A ∩ B ) − n ( B ∩ C ) − n ( A ∩ C ) + n ( A ∩ B ∩ C ) n(A \cup B \cup C) = n(A) + n(B) + n(C) - n(A \cap B) - n(B \cap C) - n(A \cap C) + n(A \cap B \cap C) n ( A ∪ B ∪ C ) = n ( A ) + n ( B ) + n ( C ) − n ( A ∩ B ) − n ( B ∩ C ) − n ( A ∩ C ) + n ( A ∩ B ∩ C )
Worked example: In a class of 60 students, 35 study Physics, 30 study Chemistry and 12 study both. Then n ( P ∪ C ) = 35 + 30 − 12 = 53 n(P \cup C) = 35 + 30 - 12 = 53 n ( P ∪ C ) = 35 + 30 − 12 = 53 , so 60 − 53 = 7 60 - 53 = 7 60 − 53 = 7 study neither. The number studying Physics only is 35 − 12 = 23 35 - 12 = 23 35 − 12 = 23 .
Ordered Pairs and Cartesian Products
( a , b ) = ( c , d ) (a, b) = (c, d) ( a , b ) = ( c , d ) only if a = c a = c a = c and b = d b = d b = d . The Cartesian product A × B = { ( a , b ) ∣ a ∈ A , b ∈ B } A \times B = \{(a, b) \mid a \in A, b \in B\} A × B = {( a , b ) ∣ a ∈ A , b ∈ B } has n ( A ) ⋅ n ( B ) n(A) \cdot n(B) n ( A ) ⋅ n ( B ) elements. A relation from A A A to B B B is any subset of A × B A \times B A × B , so there are 2 n ( A ) n ( B ) 2^{n(A)n(B)} 2 n ( A ) n ( B ) possible relations. A function is a relation in which every element of A A A appears as a first entry exactly once (functions are developed in Section 5.1).
3. Propositional Logic
A proposition is a statement that is either true or false. The basic connectives are:
p p p q q q ∼ p \sim p ∼ p p ∧ q p \wedge q p ∧ q p ∨ q p \vee q p ∨ q p → q p \to q p → q p ↔ q p \leftrightarrow q p ↔ q
- T T F T T T T
- T F F F T F F
- F T T F T T F
- F F T F F T T
The conditional p → q p \to q p → q is false only when p p p is true and q q q is false . A false premise makes the conditional true ("vacuously true").
Converse, Inverse and Contrapositive
For the conditional p → q p \to q p → q :
- Converse: q → p q \to p q → p
- Inverse: ∼ p → ∼ q \sim p \to \sim q ∼ p →∼ q
- Contrapositive: ∼ q → ∼ p \sim q \to \sim p ∼ q →∼ p
A conditional is logically equivalent to its contrapositive ; the converse and inverse are equivalent to each other but not to the original. Example: "If a number is divisible by 4, it is even" is true; its converse "If a number is even, it is divisible by 4" is false (6 is a counterexample); its contrapositive "If a number is not even, it is not divisible by 4" is true.
Tautologies, Contradictions and Quantifiers
A tautology is always true, such as p ∨ ∼ p p \vee \sim p p ∨ ∼ p or ( p ∧ q ) → p (p \wedge q) \to p ( p ∧ q ) → p .
A contradiction is always false, such as p ∧ ∼ p p \wedge \sim p p ∧ ∼ p .
A contingency is sometimes true and sometimes false.
Logical De Morgan laws: ∼ ( p ∧ q ) ≡ ∼ p ∨ ∼ q \sim(p \wedge q) \equiv \sim p \vee \sim q ∼ ( p ∧ q ) ≡∼ p ∨ ∼ q and ∼ ( p ∨ q ) ≡ ∼ p ∧ ∼ q \sim(p \vee q) \equiv \sim p \wedge \sim q ∼ ( p ∨ q ) ≡∼ p ∧ ∼ q .
Quantifiers: the negation of "for all x x x , P ( x ) P(x) P ( x ) " is "there exists an x x x such that not P ( x ) P(x) P ( x ) ".
4. Binary Operations and Groups
A binary operation ∗ * ∗ on a set S S S combines any two elements of S S S to give an element of S S S (closure is built into the definition). A non-empty set G G G with a binary operation ∗ * ∗ is a group if:
Closure: a ∗ b ∈ G a * b \in G a ∗ b ∈ G for all a , b ∈ G a, b \in G a , b ∈ G .
Associativity: ( a ∗ b ) ∗ c = a ∗ ( b ∗ c ) (a * b) * c = a * (b * c) ( a ∗ b ) ∗ c = a ∗ ( b ∗ c ) .
Identity: there is e ∈ G e \in G e ∈ G with a ∗ e = e ∗ a = a a * e = e * a = a a ∗ e = e ∗ a = a .
Inverses: every a a a has a − 1 ∈ G a^{-1} \in G a − 1 ∈ G with a ∗ a − 1 = a − 1 ∗ a = e a * a^{-1} = a^{-1} * a = e a ∗ a − 1 = a − 1 ∗ a = e .
If, in addition, a ∗ b = b ∗ a a * b = b * a a ∗ b = b ∗ a for all elements, the group is abelian (commutative). A set with only closure and associativity is a semi-group ; a semi-group with identity is a monoid .
- Structure Group? Reason
- ( Z , + ) (\mathbb{Z}, +) ( Z , + ) Yes, abelian Identity 0 0 0 , inverse − a -a − a
- ( Z , × ) (\mathbb{Z}, \times) ( Z , × ) No 2 2 2 has no integer inverse
( Q ∖ { 0 } , × ) (\mathbb{Q} \setminus \{0\}, \times) ( Q ∖ { 0 } , × ) Yes, abelian Identity 1 1 1 , inverse 1 a \frac{1}{a} a 1
( N , + ) (\mathbb{N}, +) ( N , + ) No No identity in N \mathbb{N} N and no inverses
{ 1 , − 1 , i , − i } \{1, -1, i, -i\} { 1 , − 1 , i , − i } under × \times × Yes, abelian Closed; identity 1 1 1 ; i − 1 = − i i^{-1} = -i i − 1 = − i
{ 1 , ω , ω 2 } \{1, \omega, \omega^2\} { 1 , ω , ω 2 } under × \times × Yes, abelian ω 3 = 1 \omega^3 = 1 ω 3 = 1 ; ω − 1 = ω 2 \omega^{-1} = \omega^2 ω − 1 = ω 2
Worked example: On R \mathbb{R} R define a ∗ b = a + b + 3 a * b = a + b + 3 a ∗ b = a + b + 3 . The identity e e e satisfies a + e + 3 = a a + e + 3 = a a + e + 3 = a , so e = − 3 e = -3 e = − 3 . The inverse of a a a satisfies a + a − 1 + 3 = − 3 a + a^{-1} + 3 = -3 a + a − 1 + 3 = − 3 , so a − 1 = − 6 − a a^{-1} = -6 - a a − 1 = − 6 − a . The operation is associative and commutative, so ( R , ∗ ) (\mathbb{R}, *) ( R , ∗ ) is an abelian group.
In any group, the identity is unique, each element has exactly one inverse, the cancellation laws hold, and ( a b ) − 1 = b − 1 a − 1 (ab)^{-1} = b^{-1}a^{-1} ( ab ) − 1 = b − 1 a − 1 .