3/5/22, 2:23 PM Last Minute Notes – Discrete Mathematics - GeeksforGeeks

Data Structures Algorithms Interview Preparation Topic-wise Practice C++ Java Python Competitive Pro

Last Minute Notes – Discrete Mathematics

Difficulty Level :
Easy ● Last Updated :
28 Jun, 2021

See L ast Minute Notes on all subjects here.

Propositional Logic

1. Implication( →): For any two propositions p and q, the statement “if p then q” is
called an implication and it is denoted by p → q.

2. if and only if( ↔): For any two propositions p and q, the statement “p if and only
if(iff) q” is called a biconditional and it is denoted by p ↔ q.

De Morgan’s Law :

Special Conditional Statements

1.Implication :

2.Converse : The converse of the proposition is

3.Contrapositive : The contrapositive of the proposition is

4.Inverse : The inverse of the proposition is

https://www.geeksforgeeks.org/last-minute-notes-discrete-mathematics/ 1/9
3/5/22, 2:23 PM Last Minute Notes – Discrete Mathematics - GeeksforGeeks

Types of propositions based on Truth values

Start Your Coding Journey Now!

1.Tautology – A proposition which is always true, is called a tautology.

Login Register
2.Contradiction – A proposition which is always false, is called a contradiction.

3.Contingency – A proposition that is neither a tautology nor a contradiction is

called a contingency.

There are two ver y impor tant equivalences involving quantifiers

1.

2.

Rules of inference

Combinatric s

Permutation: A permutation of a set of distinct objects is an ordered arrangement of

these objects.

   

Combination: A combination of a set of distinct objects is just a count of the number

of ways a specific number of elements can be selected from a set of a cer tain size.

The order of elements does not matter in a combination.

which gives us-

https://www.geeksforgeeks.org/last-minute-notes-discrete-mathematics/ 2/9
3/5/22, 2:23 PM Last Minute Notes – Discrete Mathematics - GeeksforGeeks

Start Your Coding Journey Now! Login Register

   

Binomial Coefficients: The -combinations from a set of elements if denoted by

. This number is also called a binomial coefficient since it occurs as a coefficient

in the expansion of powers of binomial expressions.

Let and be variables and be a non-negative integer. Then

   

The binomial expansion using Combinatorial symbols

Set Theor y

A Set is an unordered collection of objects, known as elements or members of the

set.

An element ‘a’ belong to a set A can be written as ‘a ∈ A’, ‘a ∉ A’ denotes that a is not
an element of the set A .

Equal sets

Two sets are said to be equal if both have same elements. For example A = {1, 3, 9,

7} and B = {3, 1, 7, 9} are equal sets.

NOTE: Order of elements of a set doesn’t matter.

Subset

A set A is said to be subset of another set B if and only if ever y element of set A is

also a par t of other set B.

Denoted by ‘ ⊆‘.

‘A ⊆ B ‘ denotes A is a subset of B.

To prove A is the subset of B, we need to simply show that if x belongs to A then x

also belongs to B.

https://www.geeksforgeeks.org/last-minute-notes-discrete-mathematics/ 3/9
3/5/22, 2:23 PM Last Minute Notes – Discrete Mathematics - GeeksforGeeks

To prove A is not a subset of B, we need to find out one element which is par t of set A

Start Your Coding Journey Now!

but not belong to set B.

Login Register

‘U’ denotes the universal set. Above Venn Diagram shows that A is a subset of B.

Size of a Set

Size of a set can be finite or infinite.

For example

Finite set: Set of natural numbers less than 100.

Infinite set: Set of real numbers.

Size of the set S is known as Cardinality number, denoted as |S|.

Note: Cardinality of a null set is 0.

Power Sets

The power set is the set all possible subset of the set S. Denoted by P(S).

Example: What is the power set of {0, 1, 2}?

Solution: All possible subsets

{ ∅}, {0}, {1}, {2}, {0, 1}, {0, 2}, {1, 2}, {0, 1, 2}.
Note: Empty set and set itself is also the member of this set of subsets.

Cardinality of power set is , where n is the number of elements in a set.

Car tesian Products

Let A and B be two sets. Car tesian product of A and B is denoted by A × B, is the set

of all ordered pairs (a, b), where a belong to A and b belong to B.

A × B = {(a, b) | a ∈ A ∧ b ∈ B}.

The cardinality of A × B is N*M, where N is the Cardinality of A and M is the

cardinality of B.

Note: A × B is not the same as B × A .

https://www.geeksforgeeks.org/last-minute-notes-discrete-mathematics/ 4/9
3/5/22, 2:23 PM Last Minute Notes – Discrete Mathematics - GeeksforGeeks

Union

∪ B, is the set of distinct element belongs to

Start Your Coding Journey Now!
Union of the sets A and B, denoted by A

Login Register
set A or set B, or both.

Intersection

The intersection of the sets A and B, denoted by A ∩ B, is the set of elements

belongs to both A and B i.e. set of the common element in A and B.

Disjoint

Two sets are said to be disjoint if their intersection is the empty set .i.e sets have no

common elements.

Set Difference

Difference between sets is denoted by ‘A – B’, is the set containing elements of set A

but not in B. i.e all elements of A except the element of B.

Complement

The complement of a set A , denoted by , is the set of all the elements except A .

Complement of the set A is U – A .

Formula:

1.

2.

Group

A non-empty set G, (G, *) is called a group if it follows the following axiom:

Closure :(a*b) belongs to G for all a, b ∈ G.

A ssociativity: a*(b*c) = (a*b)*c ∀ a, b, c belongs to G.
Identity Element :There exists e ∈ G such that a*e = e*a = a ∀ a ∈ G
Inverses : ∀ a ∈ G there exists a ∈ G such that a*a
-1 -1
= a
-1
*a = e

Relations And Functions

|A| = m and |B| = n, then

m
1. No. of functions from A to B = n

2. No. of one to one function = (n, P, m)

m m m m
3. No. of onto function =n – (n, C, 1)*(n-1) + (n, C, 2)*(n-2) …. +(-1) *(n, C, n-

1), if m >= n; 0 other wise

4. Necessar y condition for bijective function |A| = |B|

5. The no. of bijection function =n!

mn
6. No. of relations =2

n(n-1)
7. No. of reflexive relations =2

n(n+1)/2
8. No. of symmetric relations = 2

https://www.geeksforgeeks.org/last-minute-notes-discrete-mathematics/ 5/9
3/5/22, 2:23 PM Last Minute Notes – Discrete Mathematics - GeeksforGeeks

n n(n-1)/2
9. No. of Anti Symmetric Relations = 2 *3

n(n-1)/2

Start Your Coding Journey Now!

10. No. of asymmetric relations = 3

n(n-1)
Login Register
11. No. of irreflexive relations = 2

12. A relation is a par tial order if

1) Reflexive

2) Antisymmetric

3) Transitive

13. Meet Semi L attice :

For all a, b belongs to L a∧b exists

14. Join Semi L attice

For all a, b belongs to L a∨b exists

15. A poset is called L attice if it is both meet and join semi-lattice

16. Complemented L attice : Ever y element has complement

17. Distributive L attice : Ever y Element has zero or 1 complement .

18. Boolean L attice: It should be both complemented and distributive. Ever y

element has exactly one complement.

19. A relation is an equivalence if

1) Reflexive

2) symmetric

3) Transitive

Graph Theor y

1. No. of edges in a complete graph = n(n-1)/2

2. Bipar tite Graph : There is no edges between any two ver tices of same par tition . In

complete bipar tite graph no. of edges =m*n

3. Sum of degree of all ver tices is equal to twice the number of edges.

4. Maximum no. of connected components in graph with n ver tices = n

5. Minimum number of connected components =

0 (null graph)

1 (not null graph)

6. Minimum no. of edges to have connected graph with n ver tices = n-1

7. To guarantee that a graph with n ver tices is connected, minimum no. of edges

required = {(n-1)*(n-2)/2 } + 1

8. A graph is euler graph if it there exists atmost 2 ver tices of odd – degree

9. Tree

https://www.geeksforgeeks.org/last-minute-notes-discrete-mathematics/ 6/9
3/5/22, 2:23 PM Last Minute Notes – Discrete Mathematics - GeeksforGeeks

-> Has exactly one path btw any two vertices

Start-> not contain cycle

Your Coding Journey Now!

-> connected

Login Register
-> no. of edges = n -1

n-2
10. For complete graph the no . of spanning tree possible = n

11. For simple connected planar graph

A graph is planar if and only if it does not contain a subdivision of K and K as a

5 3, 3

subgraph.

Let G be a connected planar graph, and let n, m and f denote, respectively, the

numbers of ver tices, edges, and faces in a plane drawing of G. Then n – m + f = 2.

Let G be a connected planar simple graph with n ver tices and m edges, and no

triangles. Then m ≤ 2n – 4.
Let G be a connected planar simple graph with n ver tices, where n ? 3 and m

edges. Then m ≤ 3n – 6.
12.) Ever y bipar tite graph is 2 colourable and vice versa

n
13.) The no. of per fect matchings for a complete graph (2n)/(2 n!)

14.) The no. of complete matchings for Kn.n = n!

Like

Previous Next

LINQ | Element Operator | LINQ | Element Operator | Last

SingleOrDefault

RECOMMENDED ARTICLES Page :

https://www.geeksforgeeks.org/last-minute-notes-discrete-mathematics/ 7/9
3/5/22, 2:23 PM Last Minute Notes – Discrete Mathematics - GeeksforGeeks

Start Your Coding Journey Now! Login Register

Ar ticle Contributed By :

VaibhavRai3
@VaibhavRai3

Vote for difficulty

Current difficulty :
Easy

Easy Normal Medium Hard Expert

Article Tags : GATE CS

Report Issue

Writing code in comment?

Please use ide.geeksforgeeks.org,
generate link and share the link here.

Load Comments

5th Floor, A-118,

Sector-136, Noida, Uttar Pradesh - 201305

[email protected]

Company Learn
About Us Algorithms
Careers Data Structures
Privacy Policy Machine learning
Contact Us CS Subjects
Copyright Policy Video Tutorials

https://www.geeksforgeeks.org/last-minute-notes-discrete-mathematics/ 8/9
3/5/22, 2:23 PM Last Minute Notes – Discrete Mathematics - GeeksforGeeks

News Languages

Start Your Coding Journey Now!

Technology Login Python Register
Work & Career Java
Business CPP
Finance Golang
Lifestyle C#

Web Development Contribute

Web Tutorials Write an Article
HTML Pick Topics to Write
CSS Write Interview Experience
JavaScript Internships
Bootstrap Video Internship

@geeksforgeeks
, Some rights reserved

https://www.geeksforgeeks.org/last-minute-notes-discrete-mathematics/ 9/9