Scribd
Upload
12 views

Maths Formulas

The document covers fundamental concepts in set theory, relations and functions, number theory, mathematical induction, probability, and determinants and matrices. It includes key formulas, theoretical concepts, and example questions with solutions for each unit. The content is structured to provide a comprehensive overview of essential mathematical principles and operations.

Uploaded by

personal876459
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
12 views

Maths Formulas

The document covers fundamental concepts in set theory, relations and functions, number theory, mathematical induction, probability, and determinants and matrices. It includes key formulas, theoretical concepts, and example questions with solutions for each unit. The content is structured to provide a comprehensive overview of essential mathematical principles and operations.

Uploaded by

personal876459
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 9

Unit 1: Set Theory

Key Formulas and Theoretical Concepts


1. Basic Concepts:
o Set: A collection of well-defined and distinct objects.
o Notation: Sets are denoted by capital letters (e.g.,
A,B,C)
o Element: Denoted as x∈A if x A; x∉A if not.
2. Set Operations:
o Union: A∪B={x∣x∈A or x∈B}.
o Intersection: A∩B={x∣x∈A and x∈B}.
o Difference: A−B={x∣x∈A and x∉B}.
o Complement: A^c=U−A (where U is the universal
set).
o Symmetric Difference: AΔB=(A−B)∪(B−A).
3. Laws of Set Theory:
o Idempotent Laws: Doing the same operation on a set
repeatedly doesn’t change the result.
A∪A=A,A∩A=A.
o Commutative Laws: The order of sets in union or
intersection doesn’t matter.
A∪B=B∪A,A∩B=B∩A.
o Distributive Laws: Union and intersection distribute
over each other.
A∩(B∪C)=(A∩B)∪(A∩C).
o De Morgan’s Laws: The complement of a union or
intersection can be written in terms of the complement
of each set.
(A∪B)^c=A^c∩B^c,(A∩B)^c=A^c∪B^c.
4. Cardinality: If A has n elements, ∣A∣=n.
5. Inclusion-Exclusion Principle:
∣A∪B∣=∣A∣+∣B∣−∣A∩B∣.

Example Questions
1. Find the union and intersection of two sets:
A={1,2,3,4},B={3,4,5,6}.
Solution:
A∪B={1,2,3,4,5,6},A∩B={3,4}.
2. Using the Inclusion-Exclusion Principle:
∣A∣=15,∣B∣=20,∣A∩B∣=10 Find ∣A∪B∣.
Solution:
∣A∪B∣=15+20−10=25.
------------------------------------------------------------------------------
Unit 2: Relations and Functions
Key Formulas and Theoretical Concepts
1. Cartesian Product:
o A×B={(a,b)∣a∈A,b∈B}
2. Binary Relations:
o Domain: Set of all first elements.
o Range: Set of all second elements.
3. Types of Relations:
o Reflexive: (a,a)∈R for all a∈A
o Symmetric: (a,b)∈R ⟹ (b,a)∈R
o Transitive: (a,b)∈R and (b,c)∈R ⟹ (a,c)∈R
4. Functions:
o f:A→ B where f(a)=b
o Types:
o Injective (One-to-One): Unique mapping (no
duplicates in outputs).
o Surjective (Onto): Codomain fully covered.
o Bijective (One-to-One and Onto): Perfect one-to-
one correspondence between domain and codomain.

Example Questions
1. Find the Cartesian Product:
A={1,2},B={x,y}
Solution:
A×B={(1,x),(1,y),(2,x),(2,y)}
2. Check if a relation is reflexive:
A={1,2},R={(1,1),(2,2),(1,2)}
Solution:
Reflexive as (1,1),(2,2)∈R.
------------------------------------------------------------------------------
Unit 3: Number Theory
Key Formulas and Theoretical Concepts
1. Greatest Common Divisor (GCD):
o Euclidean Algorithm: GCD(a,b)=GCD(b,a mod b).
2. Least Common Multiple (LCM):
LCM(a,b)=∣a⋅b∣/GCD(a,b).
3. Prime Number Testing:
o A number n is prime if it has no divisors other than 1
and n.

Example Questions
1. Find GCD using Euclidean Algorithm:
Find GCD of 56 and 98.
Solution:
GCD(56,98)=GCD(98,56)=GCD(56,42)=14.
Explanaition: GCD of (56,42) so 56 as it is write and 42
kese aaya 98-56=42 to 42 ese aaya or total answer 14 hai to
wo 56-42=14 ese aaya.

2. Find LCM:
a=12,b=18.
Solution:
GCD(12,18)=6,LCM=12⋅18/6=36.

Explanation: GCD jo hai (12,18) is ka matlab hai 12-


18=6 ese ‘6’ aaya or jo LCM hai 12.18/6 =36 to 12.18
ko 12 X 18 = 216 hota hai total 36 aagay.
------------------------------------------------------------------------------
Unit 4: Mathematical Induction, Recursion, and Probability
Key Formulas and Theoretical Concepts
1. Mathematical Induction:
o Base Case: Verify for n=1.
o Inductive Step: Assume for n=k, prove for n=k+1.
2. Probability:
P(E)=Number of favorable outcomes/Total outcomes.

Example Questions
1. Use Induction to prove:
1+2+⋯+n= n(n+1)/2.
Solution: Prove base case and inductive step.
Explanation:
Step 1: Base Case
For n=1:
LHS=1
RHS=1(1+1)/2 = 1⋅2/2 = 1
Since LHS=RHS,the base case holds.

Step 2: Inductive Hypothesis


Assume the formula is true for n=k:
1+2+⋯+k=k(k+1)/2

Step 3: Inductive Step


Prove the formula is true for n=k+1:
1+2+⋯+k+(k+1)=(k+1)(k+2)/2
Start with the LHS for n=k+1:
1+2+⋯+k+(k+1)
Using the inductive hypothesis (1+2+⋯+k=k(k+1)/2):
LHS=k(k+1)/2 +(k+1)
Simplify by combining terms:
LHS=k(k+1)+2(k+1)/2
LHS=(k+1)(k+2)/2
This matches the RHS. Hence, the formula is proven by
induction.
2. Find Probability:
Rolling a die, probability of getting a 4.
Solution:
P(4)=1/6
Explanation:
When rolling a standard die, there are 6 outcomes:
{1,2,3,4,5,6}.
Step 1: Define the Event
The event of rolling a 4 is a single outcome: {4}.
Step 2: Calculate the Probability
The formula for probability is:
P(E)=Number of favorable outcomes/Total outcomes
Here:
• Favorable outcomes = 1 (only rolling a 4).
• Total outcomes = 6.
P(4)=1/6
So, the probability of rolling a 4 is 1/6 or approximately
0.167 (16.7%).
Unit 5: Determinants and Matrices
Key Formulas and Theoretical Concepts
1. Determinant:
Determinant of 2×2 matrix [ab] =ad−bc.
[cd]
Matrix Operations:
o Addition: A+B=[aij+bij].
o Multiplication: Row-column rule.
------------------------------------------------------------------------------
Example Questions
1. Find the determinant:
[32]
[14]
Solution:
Determinant=3(4)−2(1)=12−2=10.
Explanation: to is ka matlab hai ki 3x4=12, 2x1=2 to is ka
answer aagaya 12 or 2 in ko 12-2=10 answer aagaya.

2. Matrix Multiplication:
Multiply A= [12] with B= [20]
[34] [13]
Solution: Perform row-column multiplication.
Explanation:
Step-by-Step Multiplication:
1. Calculate the First Row, First Column Element:
(1×2)+(2×1)=2+2=4.
2. Calculate the First Row, Second Column Element:
(1×0)+(2×3)=0+6=6.
3. Calculate the Second Row, First Column Element:
(3×2)+(4×1)=6+4=10.
4. Calculate the Second Row, Second Column Element:
(3×0)+(4×3)=0+12=12.
Resultant Matrix:
Result C= [4 6]
[10 12]

You might also like