COMPILATION OF

DISCRETE MATH
TOPICS
MEMBERS:
DEL ROSARIO, Charize Mae
MACLANG, Rhoanne
MARASIGAN, King Gabriel
MAGALING, Jesnie
MARCELINO, Jeramie
GALANG, Angela
ORTULA, Angela Mae
PALERO, Aldrin
TIBON, Jasper Maico
TOLENTINO, John Hydrix
 TABLE OF CONTENT
PRELIMS: FINALS:

Lesson 1 - Logic Sets ………………………………………………………………………… Lesson 8 – Matrices…………………………………………………………………………

Lesson 2 - Hexadecimal and Number System………………………………………………

Lesson 9 - Propositional Truth
Table………………………………………………………..
Lesson 3 - Truth Table……………………………………………………………………….
Lesson 10 - Number
MIDTERMS: Theory……………………………………………………………………

Lesson 4 - Simulator - Basic Gate……………………………………………………………..

REFERENCES:………………………………………………………………………………………..

Lesson 5 - Boolean Expression………………………………………………………………..

Lesson 6 - Boolean Algebra…………………………………………………………………..

Lesson 7 - Induction and Recursion…………………………………………………………..

 LESSON 1: LOGIC SETS
A LOGICAL SET IS OFTEN USED IN BOOLEAN ALGEBRA AND COMPUTER SCIENCE,
WHERE LOGICAL VALUES ARE USED TO REPRESENT THE TRUTH OR FALSEHOOD OF
STATEMENTS OR TO REPRESENT THE PRESENCE OR ABSENCE OF CERTAIN FEATURES
OR ATTRIBUTES.
WHAT IS SET?
A SET IS AN UNORDERED COLLECTION OF OBJECTS.
THE 4 SETS SYMBOL
1. & (AND) - ALL OF THE CONTENT OF A, B AND C 2. L (OR) - ALL THE ELEMENTS WITH THE SAME
WITH NO ELEMENTS DUPLICATION. VALUE AND NO DUPLICATION.

EXAMPLES: EXAMPLES:
A = RAIN B = PAIN C = SANE A = “RAIN” B = “PAIN” C = “SANE”

1. A & B = RAINP 1. A L B = AIN

2. A & C = RAINSE 2. A L C = AN
3. B & A = PAINR 3. B L A = AIN
4. B & C = PAINSE 4. B L C = AN
5. C & A = SANER 5. C L A = AN
3. ^ (SYMMETRIC) - ALL ELEMENTS WITH NO THE 4. - (NOT) - ALL ELEMENTS OF THE FIRST VARIABLE
SAME VALUE BUT NO DUPLICATION. THAT ARE NOT ON THE SECOND VARIABLE.

EXAMPLES: EXAMPLES:
X = “LOVE” Y = “LIFE” Z = “NOW” X = “LOVE” Y = “LIFE” Z = “NOW”

1. X ^ Y = OVIF 1. X ^ Y = OV
2. Y ^ X = IFOV 2. Y ^ X = IF
3. X ^ Z = LVENW 3. X ^ Z = LVE
4. Y ^ Z = LIFENOW 4. Y ^ Z = LIFE
5. Z ^ X = NWLVE 5. Z ^ X = NW
LESSON 2: HEXADECIMAL AND NUMBER SYSTEM
HEXADECIMAL IS A NUMBERING SYSTEM WITH BASE 16. IT CAN BE USED TO REPRESENT LARGE
NUMBERS WITH FEWER DIGITS. IN THIS SYSTEM THERE ARE 16 SYMBOLS OR POSSIBLE DIGIT
VALUES FROM 0 TO 9, FOLLOWED BY SIX ALPHABETIC CHARACTERS -- A, B, C, D, E AND F.

USES 10 DIGITS 0,1,2,3,4,5,6,7,8,9

USES 6 LETTERS, 0,1,2,3,4,5,6,7,8,9,A,B,C,D,E,F

LETTERS REPRESENTS NUMBERS STARTING FROM

A = 10, B = 11, C = 12, D = 13, E = 14, F = 15.

AND BACKS TO ZERO (0) AFTER THE NUMBER 15.

 Example:
0,1,2,3,4,5,6,7,8,9,10(A),11(B),12(C),13(D),14(E),15(F)
16(0),17(1),18(2),19(3),20(4),21(5),22(6),23(7),24(8),25(9)
RULES OF HEXADECIMAL:
Always remember In addition of Hexadecimal, in the cases of carry,
always use 1.
ADDITION IN HEXADECIMAL:
In addition of hexadecimal all you have to do is to add the specific question
But remember that if the answer is above 9 you have to use the letter indicated from 10-
15 And back to number 0 after 15.

Example:
 SUBTRACTION IN HEXADECIMAL:
In Subtraction of Hexadecimal every time a low value is borrowed from the next number
next to him, the one who borrowed will have an extra 16 from his original value.

Example:
 SUBTRACTION IN HEXADECIMAL EXAMPLE:

3.

4.
 NUMBER SYSTEM TYPES OF NUMBER SYSTEM
A SYSTEM FOR REPRESENTING
NUMBERS IS REFERRED TO AS A BINARY
NUMBER SYSTEM. IT ALSO DEFINES A BINARY NUMBER SYSTEM IS ONE
A SET OF VALUES TO REPRESENT A THAT UTILIZES 2 BASES. IT IMPLIES
QUANTITY AND IS ALSO KNOWN AS THAT THERE ARE ONLY TWO
THE SYSTEM OF NUMERATION. THE DISTINCT, ITS NUMBER SYSTEM IS
MOST WIDELY USED DIGITS AMONG MADE UP OF SYMBOLS. THE BINARY
THEM ARE 0 AND 1, WHICH ARE NUMBERS THAT ARE CREATED IN
USED TO REPRESENT BINARY SYSTEMS CONSIST OF 0 OR 1.
NUMBERS.
DECIMAL
THERE ARE FOUR DIFFERENT THE SYSTEM OF NUMBERS THAT
TYPES OF A NUMBER SYSTEM, IT WE USE IS KNOWN AS TEN AS THE
INCLUDES BINARY, DECIMAL, BASE NUMBER IN THE DECIMAL
OCTAL AND SYSTEM. SINCE WE UTILIZE A BASE
HEXADECIMAL. SO THEREFORE OF 10, THERE ARE TEN POSSIBLE
EACH SYSTEM HAS FOUR NUMBER SYMBOLS.
BASES.
 OCTAL HEXADECIMAL
CHARACTERISTICS OF THE OCTAL CHARACTERISTICS OF THE HEX NUMBER
NUMBER SYSTEM ARE AS FOLLOWS − SYSTEM ARE AS FOLLOWS − IT IS ALSO
ALSO REFERRED TO AS THE BASE-8 REFERRED TO AS THE BASE-16 NUMBER
NUMBER SYSTEM. WIDELY USED IN A SYSTEM. IT IS USED IN SYSTEMS OF
COMPUTING SYSTEM. COMPUTATION AND MEMORY
REPRESENTATION.
Examples of Number System Conversion

BINARY TO
DECIMAL

There are two methods

in solving for binary to
decimal
2.
 BINARY TO OCTAL (Octal is a Group of 3)

Binary to Octal conversion uses the octal subdivision of binary

to 3 Right to left for whole number and left to right for
decimal.
BINARY TO HEXADECIMAL (Hex is a group of 4)
DECIMAL TO BINARY
There are three method to
answer this conversion
 The third method:

Steps to Convert Binary to

Decimal Converting from
binary to decimal involves
multiplying the value of
each digit (i.e. 1 or 0) by the
value of the placeholder in
the number.

Step 1 - Write down the 2-1 = 1 ÷ 2 = 0.5

number.
Step 2 - Starting with the
2-2 = 1 ÷ 2 ÷ 2 = 0.25
LSB, multiply the digit by 2-3 = 1 ÷ 2 ÷ 2 ÷ 2 = 0.125
the value of the placeholder. 2-4 = 1 ÷ 2 ÷ 2 ÷ 2 ÷ 2 = 0.0625
Step 3 - Continue doing this
until you reach the MSB.
2-5 = 1 ÷ 2 ÷ 2 ÷ 2 ÷ 2 ÷ 2 = 0.03123
Add the results together.
 Lesson 3: Truth Table
It produces possible outcomes of statements and connectives.
AND Truth Table OR Truth Table NOT Truth Table
T and T = T T or T = T NOT T = F
T and F = F T or F = T NOT F = T
F and T = F F or T = T
F and F = F F or F = F
EXAMPLE:
Always the first answer is T and start from AND.
1. 2. 3.
4. 5.

Lesson 4: Simulator - Basic Gate

Logic gates are an important concept if you are studying electronics. These are
important digital devices that are mainly based on the Boolean function. Logic
gates are used to carry out logical operations on single or multiple binary inputs
and give one binary output. In simple terms, logic gates are the electronic circuits
in a digital system.

In this lesson, we will further look at the different types of basic logic gates with
their truth table and understand what each one is designed for...
 Types of Basic Gates
OR Gate
In an OR gate, the output of an OR gate attains state 1 if
one or more inputs attain state 1.

AND Gate
In the AND gate, the output of an AND gate attains state 1
if and only if all the inputs are in state 1.
NOT Gate
In a NOT gate, the output of a NOT gate attains state 1 if
and only if the input does not attain state 1.
 Exclusive-OR gate
(XOR Gate)

In an XOR gate,
the output of a
two-input XOR Example:
gate attains state 1 1. Using three AND
if one adds only gate if all of the input
input and attains is equal to 1 then the
state 1. output is 1 else if one
of the input is equal
to false then the
output is 0.
 2. Using three AND gate two BUFFER
gate and NOT gate if all input is equal
to 1 then two BUFFER gate and one
3. Using 2 AND gate 1 OR gate and 1
AND gate the output is 1 else if one of
NOT gate If all the input is equal to 1
the input is equal to 0 then the two
then the output of OR gate is 1 and the
BUFFER gate and one AND gate the
output of NOT gate is 0.
output is 0 and the output of NOT gate
is 1.

​
 4. Using ANDGate and XOR GateIf all
the input is equal to 1 then the output 5. Using 4 AND Gate and NOT Gate. If
of AND Gate is 1 and the output of XOR all the input is equal to true then the
Gate is 0 because the input of XOR output of all AND Gate is On and the
Gate is the same true value that is output of Not Gate is Off. Therefore if
why the output is 0. the input of NOT gate is equal to false
then the Output of Not gate is On.
 Lesson 5:
Boolean expressions are the expressions that evaluate a
condition and result in a Boolean value i.e true or false.
Variables
A is a variable that represents a Boolean value. It can be either true or
false. Variables in Boolean algebra are typically denoted by letters, such
as A, B, C, and so on. They serve as placeholders for Boolean values or
logical propositions. These variables can be combined with logical
operators (AND, OR, NOT) to construct logical expressions and perform
logical operations. For instance, the expression A AND B represents a
Boolean expression where A and B are variables combined with the
logical AND operator. It evaluates to true only if both A and B are true.
Variables form the foundation of Boolean algebra, allowing us to work
with and reason about logical values and propositions.
 Complement
Let's consider a variable A. The complement of A, denoted as A',
represents the negation or opposite of the value of A.
If A is true (1), then the complement of A, A', is false (0).
If A is false (0), then the complement of A, A', is true (1).
So, the complement of A (A') is the opposite of its original value.
For example, if A = 1, then A' = 0. And if A = 0, then A' = 1.
The complement operator (' or overline) in Boolean algebra
allows us to represent the logical negation or inversion of
variables, enabling more complex logical expressions and
operations.
 LITERAL
Let's consider two variables, A and B. A literal is either a variable or its
complement. So, in this case, the literals would be A and B.

Examples of literals:
1. A: A is a literal representing the variable A.
2. B': B' is a literal representing the complement of the variable B.

In the context of Boolean algebra, literals serve as the building blocks for
constructing logical expressions. They can be combined using logical
operators (AND, OR, NOT) to form more complex expressions. For instance,
the expression A' + B represents a Boolean expression that consists of two
literals, A' and B, combined with the OR operator (+). It means "not A OR B."
Literals play a fundamental role in Boolean algebra, allowing us to
represent variables and their complements, which are essential for
constructing logical expressions and performing logical operations.
 EXAMPLES:
1. 2. 3. 4. 5.
K̅ .M.N̅ = 0 x.y.z̄ = 1 K.M̅ .N = 0 X̅ .Y̅ .Z=0 A̅ +B̅ +C̅ =1
K̅ =1 x=1 K=0 X̅ =1 A̅ =0
M=0 y=1 M̅ =1 Y̅ =1 B̅ =0
N̅ =1 z̄=0 N=0 Z=0 C̅ =0
Lesson 6: Boolean Algebra
Boolean algebra, a discrete mathematics branch of algebra, focuses on manipulating and evaluating mathematical
operations and statements using logical values. George Boole, a mathematician and logician, invented it in the
mid-1800s. Boolean algebra is the cornerstone of digital logic and is widely used in computer science, electrical
engineering, and other professions.

Values in Boolean algebra can only be true or false, which are commonly represented as 1 and 0, respectively.
These are referred to as Boolean values or Boolean variables. Boolean algebra's fundamental operations are
conjunction (AND), disjunction (OR), and negation (NOT).

In Boolean algebra, terminology like Variable, Complement, and Literal are utilized. A variable is a logical amount
represented by a symbol. Any one variable may have a value of 1 or 0. The complement of a variable is its inverse. A
bar above a variable (overbar) indicates this. As an example, consider the complement of A is the variable. If A
equals 1, then A equals 0. If A is equal to 0, then A is equal to 1. The Complement of the variable A is interpreted as
"not A" or "A bar." The complement of an is denoted with a prime sign rather than an overbar. variable; for
example, B' denotes B's complement. A Literal expression is a variable or the complement of a variable.
 The Laws of Boolean Commutative Laws
Algebra The commutative law of addition for two
variables is written as A+B = B+A This law
The basic rules of Boolean algebra
states that the order in which the variables
are the same as in ordinary algebra:
are ORed makes no difference. Remember,
the commutative laws for addition
in Boolean algebra as applied to logic
and multiplication, the associative
circuits, addition and the OR operation are
laws for addition and multiplication, the same. The commutative law of
and the distributive law. multiplication for two variables is A.B = B.A
Commutative Laws for two This law states that the order in which the
variables, the commutative law of variables are ANDed makes no difference.
addition is stated as A+B = B+A. This Examples:
law asserts that the order in which 1: A + B = B + A
the variables are ORed makes no 2: X . Y = Y . X
effect. Remember that addition and 3: P + Q = Q + P
the OR operation are the same in
4: M . N = N . M
Boolean algebra as applied to logic
5: C + D = D + C
circuits.
 Associative Laws:
For three variables, the associative law of addition is expressed as
follows: A + (B + C) = (A + B) + C This law asserts that when ORing more
than two variables, the result is the same regardless of how the
variables are grouped. Use of the associative law of addition. For three
variables, the associative law of multiplication is expressed as follows:
A(BC) = (AB)C This law asserts that it makes no difference in whatever
order the variables are grouped when ANDing more than two variables.
Examples:
1. (A + B) + C = A + (B + C)
2: (D . E) . F = D . (E . F)
3: (P + Q) + R = P + (Q + R)
4: (X . Y) . Z = X . (Y . Z)
5: (M + N) + O = M + (N + O)
 Distributive Law:
The distributive law is written for three variables as follows:

A(B + C) = AB + AC

This law states that ORing two or more variables and then ANDing the result with a
single variable is equivalent to ANDing the single variable with each of the two or
more variables and then ORing the products. The distributive law also expresses the
process of factoring in which the common variable A is factored out of the product
terms, for example, AB + AC = A(B + C).

Examples:
1: A . (B + C) = (A . B) + (A . C)
2: X + (Y . Z) = (X + Y) . (X + Z)
3: P . (Q + R) = (P . Q) + (P . R)
4: M + (N . O) = (M + N) . (M + O)
5: C . (D + E) = (C . D) + (C . E)
 Absorptive Law
The absorptive law in Boolean algebra pertains to the simplification of logical
expressions by eliminating redundant terms.
1. Absorption of the OR operator (+): A + (A . B) simplifies to just A. This means that
when we perform the OR operation between a variable A and the logical AND
operation between A and another variable B, the term A . B can be absorbed or
eliminated.
2. Absorption of the AND operator (.): A . (A + B) simplifies to just A. This means that
when we perform the AND operation between a variable A and the logical OR
operation between A and another variable B, the term A + B can be absorbed or
eliminated.
Examples:
1: (A + (A . B)) = A
2: ((X . Y) + X) = X
3: ((P + Q) . P) = P
4: ((M . N) + O) . (M + O) = M + O
5: ((C + D) . E) + E = E
 The Annulment law
The Annulment law, also known as the Zero Annihilation law, states the effect of
logical operations involving zero or complemented zero values.

1. Zero Annihilation for the OR operator (+): A + 0 = A A + A' = 1

2. This means that when you perform the OR operation between a variable A and
zero (0), the result is simply A. Additionally, if you perform the OR operation
between a variable A and its complement A', the result is always 1 (true).
3. Zero Annihilation for the AND operator (.): A . 0 = 0 A . A' = 0
4. This means that when you perform the AND operation between a variable A and
zero (0), the result is always 0 (false). Similarly, if you perform the AND operation
between a variable A and its complement A', the result is also 0.
Examples:
1: A + 0 = A
2: B + B' = 1
3: C . 0 = 0
4: D . D' = 0
5: E + 0 = E
 Idempotent law

The Idempotent law is a property in Boolean algebra that describes the behavior of
logical operations when applied multiple times to the same variable or expression. It
states that applying an operation twice does not change the result.

1. Idempotence for the OR operator (+): A + A = A

2. This means that when you perform the OR operation between a variable A and
itself, the result is always equal to A. In other words, repeating the OR operation
with the same variable does not change the outcome.
3. Idempotence for the AND operator (.): A . A = A
4. This means that when you perform the AND operation between a variable A and
itself, the result is always equal to A. Repeating the AND operation with the same
variable does not alter the result.

The Idempotent law is useful for simplifying Boolean expressions by identifying and
eliminating redundant terms.
 Examples:
1: A + A = A
2: B + B = B
3: C . C = C
4: D . D = D
e 5: E + E = E
Complement law
The Complement law in Boolean algebra states the relationship between a variable and its
complement (negation). It specifies that the logical complement of a variable and its
negation always add up to the universal value, which is usually represented as 1.
1. Complement law for the OR operator (+): A + A' = 1 This means that when you perform
the OR operation between a variable A and its complement A', the result is always 1
(true).
2. Complement law for the AND operator (.): A . A' = 0

This means that when you perform the AND operation between a variable A and its
complement A', the result is always 0 (false).
The Complement law helps in simplifying Boolean expressions and understanding the
relationship between variables and their complements.
 Examples:
1: A + A' = 1
2: B + B' = 1
3: C . C' = 0
4: D . D' = 0
5: E + E' = 1

Lesson 7: Induction and Recursion

Induction is a powerful method for showing a
property is true for all non negative integers. It is
use in defining characteristics of discrete as
opposed to continuous mathematics.
Examples:
1. 2+4+6…+24 = n(n+1) Induction 4. 1+2+3…+10 = n(n+1) Not Induction
N=1 N=2 N=3 N=1 N=2 N=3
2 = 1(1+1) 2+4 = 2(2+1) 2+4+6 = 3(3+1) 1 = 1(1+1) 1+2 = 2(2+1) 1+2+3 = 3(3+1)
2 = 2 6 = 6 12 = 12 1 = 2 3 = 6 6 = 12
5. 2+4+6…+28 = n(n+1) Induction
2. 2+3+4+...+n = n(n+1) Not Induction N=1 N= 2 N= 3
N=1 N=2 N=3 2 = 1(1+1) 2+4 = 2(2+1) 2+4+6 = 3(3+1)
2 = 1(1+1) 2+3 = 2(2+1) 2+3+4 = 3(3+1) 2 = 2 6 = 6 12 = 12
2 = 2 5 = 6 9 = 12

3. 3+6+9…+18 = n(n+1) Not Induction

N=1N=2N=3
3 = 1(1+1) 3+6 = 2(2+1) 3+6+9 = 3(3+1)
3 = 2 9 = 6 18 = 12
 Recursion
Recursion is a method of defining something (usually a sequence or
function) in terms of previously defined values.
Examples: 3. 2an+3 In the value of 4
an = 1 2an+3 = 2(1)+3 = 5
1. 3an+2 In the value of 3 an = 2 2an+3 = 2(5)+3 = 13
an = 1 3an+2 = 3(1)+2 = 5 an = 3 2an+3 = 2(13)+3 = 26
an = 2 3an+2 = 3(5)+2 = 17 an = 4 2an+3 = 2(26)+3 = 59
an = 3 3an+2 = 3(17)+2 = 53
4. 2-n+1 In the value of 3
n = 1 2-1+1 = 2
2. 2an+1 In the value of 2
n = 2 2-2+1 = 1
an = 1 2an+1 = 2(1)+1 = 3
n = 3 2-1+1 = 2
an = 2 2an+1 = 2(3)+1 = 7
5. 4+n-1 In the value of 2
n = 1 4+1-1 = 4
n = 2 4+4-1 = 7
 Lesson 8: Matrices
Matrix is an array of numbers: They can be called matrix, or several matrices. It can
be addition, subtraction, multiplication, transposing,

The two matrices must have the same size, i.e. the rows must match
the size, and the column must match in size. Here’s an example: a
matrix with 3 rows and columns can be added to another matrix with
3 rows and 5 columns, but it could not be added to a matrix with 3
rows and 4 columns because the columns do not match.
 Subtraction
To subtract two matrices: subtract the numbers in the matching
positions:
 Multiplication
To multiply two matrices: multiply it by a single number (the value 2 in this
case):
These are the calculations:
2x4=8 2x0=0
2x1=2 2x-9=-18
Here is another way of multiplying the matrices called “Dot
Product”

The "Dot Product" is where we multiply matching members,

then sum up:
(1, 2, 3) • (7, 9, 11) = 1×7 + 2×9 + 3×11
= 58
 Here is the 1st row and the 2nd
column.
(1, 2, 3) • (8, 10, 12) = 1×8 + 2×10 + 3×12
= 64

The 2nd row and 1st column.

(4, 5, 6) • (7, 9, 11) = 4×7 + 5×9 + 6×11
= 139

The 2nd row and 2nd column.

(4, 5, 6) • (8, 10, 12) = 4×8 + 5×10 +
6×12
= 154

And here is the final answer.

 (Matrix Calculator used) https://matrix.reshish.com/

Lesson 9: Proposition Truth Table

NEGATION (¬)
It is the opposite of the given value.
CONJUNCTION (^)
It is simply represented as AND.

∨
DISJUNCTION ( )

It is simply represented as OR.

 EXCLUSIVE ( ) ⊕
It represents F if the given value is the same and T if
different.
IMPLICATION (→)

BICONDITION (↔)

It represents T if the given value is the same and F if not.

 Lesson 10: Number Theory
It is a mathematical process of getting the relationship and
percentile in a given scenario.
We can use the venn diagram to find the relationship in the given
examples.
Example 1:
Find out the favorite dessert of BSIT 1A
1.Ice Cream - 10 votes (Upper left)
2. Brownies - 5 votes (Upper right)
3. Cookies - 6 votes (Bottom)
(21 students have voted)

The stars inside the venn diagram represent the

number of voters for Ice Cream, Brownies and Cookies.
Now we can find out the percentile using the given votes.
Supposed that Ice Cream, Brownies and Cookies are A, B, C
Divide the number of votes to 21 students to get each of their percentile.
=P(A) 10/21 = 0.48 %
=P(B) 5/21 = 0.24 %
=P(C) 6/21 = 0.29 %
 Example 2:
Favorite sport of BSIT 1B
1. Basketball - 15 votes (Upper left)
2. Volleyball - 8 votes (Upper right)
3. Football - 3 votes (Bottom)
(26 students have voted)

=P(A) 15/26 = 0.58%

=P(B) 8/26 = 0.31%
=P(C) 3/26 = 0.12%

Example 3:

Preferred shoe brands of BSIT 1A and B =P(A) 15/84 = 0.18%

1. Adidas - 15 (Upper left) =P(B) 19/84 = 0.23%
2. Converse - 19 (Upper right) =P(C) 18/84 = 0.21
3. Nike - 18 (Bottom) Add A&B, B&C before dividing
4. Adidas-Converse - 17 (in-between) =P(A&B) 34/84 = 0.40%
5. Nike-Converse - 15 (in-between) =P(B&C) 37/84 = 0.44%
(84 students have voted)
 Example 4:
Favorite cartoon of 20 selected
children in
LCUP
1.Spongebob - 13 (Upper left)
2.Gravity Falls - 3 (Upper right)
3. Adventure Time - 4 (Bottom)
(20 children have voted)
=P(A) 13/20 = 0.65%
=P(B) 3/20 = 0.15%
=P(C) 4/20 = 0.2%

Example 5:
Most used social media of 50 selected students in LCUP
1. Facebook - 20 (Upper left) =P(A) 20/50 = 0.4%
2. Instagram - 20 (Upper right) =P(B) 20/50 = 0.4%
3. Twitter - 5 (Bottom) =P(C) 20/50 = 0.4%
4. Facebook-Instagram 20 (In-between) =P(A&B) 40/50 = 0.8 %
5. Instagram-Twitter - 3 (In-between) =P(B&C) 25/50 = 0.5 %
 References:
Lesson 1 - Logic Sets
https://www.cl.cam.ac.uk/teaching/1213/DiscMathII/Ch2.pdf
https://math.mit.edu/~apm/cha.pdf

Lesson 2 - Hexadecimal and Number System

https://owlcation.com/stem/How-to-Convert-Decimal-to-Binary-and-Binary-to-Decimal
https://www.rapidtables.com/math/number/Numeral_system.html
https://byjus.com/maths/hexadecimal-number-system/

Lesson 3 - Truth Table

https://www.codeguage.com/courses/logic/propositional-logic-truth-tables#:~:text=A%20truth%20table%20is%20a%20tabular%20way%20of,table%20is%20a%20fundamental%20concept%20in%20propositional%20logic.

Lesson 4 - Simulator - Basic Gate

https://byjus.com/jee/basic-logic-gates/
https://academo.org/demos/logic-gate-simulator/

Lesson 5 - Boolean Expression

https://learn.microsoft.com/en-us/dotnet/visual-basic/programming-guide/language-features/operators-and-expressions/boolean-expressions

Lesson 6 - Boolean Algebra

https://www.pvpsiddhartha.ac.in/dep_it/lecture%20notes/DSD/unit2.pdf
https://sg.element14.com/idempotent-law-definition

Lesson 7 - Induction and Recursion

https://math.libretexts.org/Bookshelves/Mathematical_Logic_and_Proof/Book%3A_Mathematical_Reasoning__Writing_and_Proof_(Sundstrom)/04%3A_Mathematical_Induction/4.03%3A_Induction_and_Recursion

Lesson 8 – Matrices
https://www.mathsisfun.com/algebra/matrix-introduction.html
https://matrix.reshish.com/

Lesson 9 - Proposition Truth Table

https://iep.utm.edu/propositional-logic-sentential-logic/

Lesson 10 - Number Theory

https://www.britannica.com/science/number-theory/Euclid
https://mathworld.wolfram.com/NumberTheory.html