Compilation of Compilation of

formulas formulas
IN IN
MATH 100 MATH 100

SUBMITTED BY: DANNY KIM PIGAR SUBMITTED BY: DANNY KIM PIGAR

SUBMITTED TO: MA’AM LEA ANGGOT SUBMITTED TO: MA’AM LEA ANGGOT
 MATHEMATICAL CONVENTION
A mathematical convention is a
fact, name, notation, or usage
which is generally agreed upon by
mathematicians. For instance, the
fact that one evaluates
multiplication before addition in
the expression is merely
conventional: there is nothing
inherently significant about the
order of operations.
Mathematicians abide by
conventions in order to allow other
mathematicians to understand
what they write without constantly
having to redefine basic terms.
(Imagine if every mathematical
paper began with an explanation
of PEMDAS)
MATHEMATICAL CONVENTION
A mathematical convention is a
fact, name, notation, or usage
which is generally agreed upon by
mathematicians. For instance, the
fact that one evaluates
multiplication before addition in
the expression is merely
conventional: there is nothing
inherently significant about the
order of operations.
Mathematicians abide by
conventions in order to allow other
mathematicians to understand
what they write without constantly
having to redefine basic terms.
(Imagine if every mathematical
paper began with an explanation
of PEMDAS)
 FIBONACCI SEQUENCE
The Fibonacci Sequence is the series of numbers:
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, ...
The next number is found by adding up the two numbers
before it:
 the 2 is found by adding the two numbers before it (1+1),
 the 3 is found by adding the two numbers before it (1+2),
 the 5 is (2+3),
 and so on!
Example: the next number in the sequence above is 21+34 = 55
Golden Ratio
And here is a surprise. When we take any two successive
(one after the other) Fibonacci Numbers, their ratio is very
close to the Golden Ratio "φ" which is approximately
1.618034...
And even more surprising is that we can calculate any
Fibonacci Number using the Golden Ratio:
xn = φn − (1−φ)n√5
The answer comes out as a whole number, exactly
equal to the addition of the previous two terms.
FIBONACCI SEQUENCE
The Fibonacci Sequence is the series of numbers:
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, ...
The next number is found by adding up the two numbers
before it:
 the 2 is found by adding the two numbers before it (1+1),
 the 3 is found by adding the two numbers before it (1+2),
 the 5 is (2+3),
 and so on!
Example: the next number in the sequence above is 21+34 = 55
Golden Ratio
And here is a surprise. When we take any two successive
(one after the other) Fibonacci Numbers, their ratio is very
close to the Golden Ratio "φ" which is approximately
1.618034...
And even more surprising is that we can calculate any
Fibonacci Number using the Golden Ratio:
xn = φn − (1−φ)n√5
The answer comes out as a whole number, exactly
equal to the addition of the previous two terms.
 PROPERTIES OF ALGEBRA
Like operations with numbers, operations with variables
obey certain laws.
The commutative law tells us we can reorder the terms
when performing addition or multiplication. For variables
aaa and bbb:
a+b=b+aa+b=b+aa, plus, b, equals, b, plus, a
a×b=b×aa×b=b×aa, times, b, equals, b, times, a
The associative law tells us that in addition or
multiplication, we can associate the terms or factors as we
please. For variables aaa, bbb, and ccc:
(a+b)+c=a+(b+c)(a+b)+c=a+(b+c)left parenthesis, a,
plus, b, right parenthesis, plus, c, equals, a, plus, left
parenthesis, b, plus, c, right parenthesis
(a×b)×c=a×(b×c)(a×b)×c=a×(b×c)left parenthesis, a,
times, b, right parenthesis, times, c, equals, a, times, left
parenthesis, b, times, c, right parenthesis
Both the commutative law and the associative law apply
to either addition or multiplication, but not a mixture of
the two.
The distributive law deals with the combination of
addition and multiplication. When a sum is multiplied by
value, the value is distributed to each part of the sum. For
variables aaa, bbb, and ccc:
PROPERTIES OF ALGEBRA
Like operations with numbers, operations with variables
obey certain laws.
The commutative law tells us we can reorder the terms
when performing addition or multiplication. For variables
aaa and bbb:
a+b=b+aa+b=b+aa, plus, b, equals, b, plus, a
a×b=b×aa×b=b×aa, times, b, equals, b, times, a
The associative law tells us that in addition or
multiplication, we can associate the terms or factors as we
please. For variables aaa, bbb, and ccc:
(a+b)+c=a+(b+c)(a+b)+c=a+(b+c)left parenthesis, a,
plus, b, right parenthesis, plus, c, equals, a, plus, left
parenthesis, b, plus, c, right parenthesis
(a×b)×c=a×(b×c)(a×b)×c=a×(b×c)left parenthesis, a,
times, b, right parenthesis, times, c, equals, a, times, left
parenthesis, b, times, c, right parenthesis
Both the commutative law and the associative law apply
to either addition or multiplication, but not a mixture of
the two.
The distributive law deals with the combination of
addition and multiplication. When a sum is multiplied by
value, the value is distributed to each part of the sum. For
variables aaa, bbb, and ccc:
 Geometric properties
Geometric properties are those that can be derived from the
geometry of a solid body or particle. They are very important
as a means by which the size and shape of an irregular shaped
particle can be easily quantified. This is true whether the
particle is treated as an individual solid body, or as one that is
representative of many particles in a disperse system. Material
systems that consist of particles surrounded by a continuous
medium are known as disperse systems. The particles form the
disperse phase, and the surrounding medium is the continuous
phase. The size of the particles can vary from the magnitude of
10−1 m (grapefruit, melons, potatoes) to 10−6 m (emulsions),
and down to 10−8 m (colloids and nanoparticles). Particles can
be solid, liquid or gaseous.
MATH CONCEPTS
Basic mathematical concepts include:
 Counting. Note that this can include both regular counting, such
as 1, 2, 3, 4, 5..., and counting using different increments, such as
0.5, 1, 1.5, 2,.....
 Addition
 Subtraction
 Multiplication
 Division
Understanding mathematical concepts is important to learning and
understanding mathematics. Memorizing a multiplication table is
great, but understanding that multiplication is repeated addition, and
that division is the inverse operation of multiplication, makes it easier
to understand multiplication as a whole. It also helps when a math
fact is forgotten.
Geometric properties
Geometric properties are those that can be derived from the
geometry of a solid body or particle. They are very important
as a means by which the size and shape of an irregular shaped
particle can be easily quantified. This is true whether the
particle is treated as an individual solid body, or as one that is
representative of many particles in a disperse system. Material
systems that consist of particles surrounded by a continuous
medium are known as disperse systems. The particles form the
disperse phase, and the surrounding medium is the continuous
phase. The size of the particles can vary from the magnitude of
10−1 m (grapefruit, melons, potatoes) to 10 −6 m (emulsions),
and down to 10−8 m (colloids and nanoparticles). Particles can
be solid, liquid or gaseous.
MATH CONCEPTS
Basic mathematical concepts include:
 Counting. Note that this can include both regular counting, such
as 1, 2, 3, 4, 5..., and counting using different increments, such as
0.5, 1, 1.5, 2,.....
 Addition
 Subtraction
 Multiplication
 Division
Understanding mathematical concepts is important to learning and
understanding mathematics. Memorizing a multiplication table is
great, but understanding that multiplication is repeated addition, and
that division is the inverse operation of multiplication, makes it easier
to understand multiplication as a whole. It also helps when a math
fact is forgotten.
 Measures of variation Measures of variation

Range Range

Range is one of the simplest measures of variation. It's the lowest point of data subtracted Range is one of the simplest measures of variation. It's the lowest point of data subtracted
from the highest point of data. from the highest point of data.

Variance Variance

Variance is the average squared variations of values from the mean. It compares every Variance is the average squared variations of values from the mean. It compares every
piece of value to the mean, which is why variance differs from the other measures of piece of value to the mean, which is why variance differs from the other measures of
variation. Variance also displays the spread of the data set. Here's an example of this variation. Variance also displays the spread of the data set. Here's an example of this
calculation, where "S" stands for standard deviation: calculation, where "S" stands for standard deviation:

S=8 S=8

S2= 8 × 8 = 64 S2= 8 × 8 = 64

If your standard deviation is 8, then your variance would be 64. If your standard deviation is 8, then your variance would be 64.

Quartiles Quartiles

Quartiles divide your data into four equal sections, or quarters. They divide the data in Quartiles divide your data into four equal sections, or quarters. They divide the data in
ascending order, meaning there are the lower two quartiles and the higher two quartiles. ascending order, meaning there are the lower two quartiles and the higher two quartiles.

Interquartile range Interquartile range

Interquartile range (IQR) refers to the middle of your data distribution or the middle of Interquartile range (IQR) refers to the middle of your data distribution or the middle of
your four quartiles, meaning that the IQR is in the middle of the upper and lower your four quartiles, meaning that the IQR is in the middle of the upper and lower
quartiles. The IQR measures how the data spreads around the average. IQR = Q3 − Q1 quartiles. The IQR measures how the data spreads around the average. IQR = Q3 − Q1

For example, if the median of your Q3 was 10 and the median of your Q1 was 6, For example, if the median of your Q3 was 10 and the median of your Q1 was 6,
your IQR would be 4, as shown by the following: your IQR would be 4, as shown by the following:

IQR = 10 − 6 IQR = 10 − 6

IQR = 4 IQR = 4

Statisticians use IQR to measure the distribution of your data. IQR is valuable for Statisticians use IQR to measure the distribution of your data. IQR is valuable for
measuring the variability of both skewed and consistent data sets. measuring the variability of both skewed and consistent data sets.

Standard deviation Standard deviation

Standard deviation Standard deviation

is the average or standard distance between each point of data and the is the average or standard distance between each point of data and the
mean. mean.
 Operations on Binary numbers Operations on Binary numbers

Binary Addition Binary Addition

There are four steps in binary addition, they are written below There are four steps in binary addition, they are written below

 0+0=0  0+0=0
 0+1=1  0+1=1
 1+0=1  1+0=1
1 + 1 = 0 (carry 1 to the next significant bit) 1 + 1 = 0 (carry 1 to the next significant bit)

Binary Subtraction Binary Subtraction

Here are too four simple steps to keep in memory Here are too four simple steps to keep in memory

 0–0=0  0–0=0
 0 – 1 = 1, borrow 1 from the next more significant bit  0 – 1 = 1, borrow 1 from the next more significant bit
 1–0=1  1–0=1
1–1=0 1–1=0

Binary Multiplication Binary Multiplication

Binary multiplication may sound like it would be more difficult than binary Binary multiplication may sound like it would be more difficult than binary
addition or subtraction – but is actually a simple process. Here are the four steps to addition or subtraction – but is actually a simple process. Here are the four steps to
be followed, using the same binary numbers 10001001 and 10010101: be followed, using the same binary numbers 10001001 and 10010101:

 0×0=0  0×0=0
 1×0=0  1×0=0
 0×1=0  0×1=0
1×1=1 (there is no carry or borrow for this) 1×1=1 (there is no carry or borrow for this)

Binary Division Binary Division

Binary division is comprised of other two binary arithmetic Binary division is comprised of other two binary arithmetic
operations, multiplication and subtraction; an example will explain operations, multiplication and subtraction; an example will explain
the operation more easily. the operation more easily.
 LINEAR PROGRAMMING
Linear programming,
mathematical modeling technique
in which a linear function is
maximized or minimized when
subjected to various constraints.
This technique has been useful for
guiding quantitative decisions in
business planning, in industrial
engineering, and—to a lesser
extent—in the social and physical
sciences. The a’s, b’s, and c’s are constants
determined by the capacities, needs, costs, profits,
and other requirements and restrictions of the
problem. The basic assumption in the application
of this method is that the various relationships
between demand and availability are linear; that is,
none of the xi is raised to a power other than 1.
LINEAR PROGRAMMING
Linear programming,
mathematical modeling technique
in which a linear function is
maximized or minimized when
subjected to various constraints.
This technique has been useful for
guiding quantitative decisions in
business planning, in industrial
engineering, and—to a lesser
extent—in the social and physical
sciences. The a’s, b’s, and c’s are constants
determined by the capacities, needs, costs, profits,
and other requirements and restrictions of the
problem. The basic assumption in the application
of this method is that the various relationships
between demand and availability are linear; that is,
none of the xi is raised to a power other than 1.
 MATHEMATICS OF FNANCE
Simple Interest
If you'd like to calculate a total value for principal and
interest that will accrue over a particular period of time,
use this slightly more involved simple interest formula:
A = P(1 + rt). A = total accrued, P = the principal
amount of money (e.g., to be invested), r = interest rate
per period, t = number of periods.
Compound Interest
The compound interest formula is ((P*(1+i)^n) - P),
where P is the principal, i is the annual interest rate,
and n is the number of periods. Using the same
information above, enter “Principal value” into cell A1
and “1000” into cell B1.
Methods of Apportionment
The Hamilton/Vinton Method sets the divisor as the
proportion of the total population per house seat. After
each state's population is divided by the divisor, the
whole number of the quotient is kept and the fraction
dropped. This will result in surplus house seats.
MATHEMATICS OF FNANCE
Simple Interest
If you'd like to calculate a total value for principal and
interest that will accrue over a particular period of time,
use this slightly more involved simple interest formula:
A = P(1 + rt). A = total accrued, P = the principal
amount of money (e.g., to be invested), r = interest rate
per period, t = number of periods.
Compound Interest
The compound interest formula is ((P*(1+i)^n) - P),
where P is the principal, i is the annual interest rate,
and n is the number of periods. Using the same
information above, enter “Principal value” into cell A1
and “1000” into cell B1.
Methods of Apportionment
The Hamilton/Vinton Method sets the divisor as the
proportion of the total population per house seat. After
each state's population is divided by the divisor, the
whole number of the quotient is kept and the fraction
dropped. This will result in surplus house seats.
 Logic gates
The AND gate is so named because, if 0 is called "false" and 1 is
called "true," the gate acts in the same way as the logical "and"
operator.
The OR gate gets its name from the fact that it behaves after the
fashion of the logical inclusive "or." The output is "true" if either
or both of the inputs are "true." If both inputs are "false," then
the output is "false." In other words, for the output to be 1, at
least input one OR two must be 1. The XOR ( exclusive-
OR ) gate acts in the same way as the logical "either/or." The
output is "true" if either, but not both, of the inputs are "true."
The output is "false" if both inputs are "false" or if both inputs
are "true." Another way of looking at this circuit is to observe
that the output is 1 if the inputs are different, but 0 if the inputs
are the same.
A logical inverter, sometimes called a NOT gate to differentiate it
from other types of electronic inverter devices, has only one
input. It reverses the logic state. If the input is 1, then the output
is 0. If the input is 0, then the output is 1.
The NAND gate operates as an AND gate followed by a NOT
gate. It acts in the manner of the logical operation "and" followed
by negation. The output is "false" if both inputs are "true."
Otherwise, the output is "true."
The NOR gate is a combination OR gate followed by an inverter.
Its output is "true" if both inputs are "false." Otherwise, the
output is "false."
The XNOR (exclusive-NOR) gate is a combination XOR gate
followed by an inverter. Its output is "true" if the inputs are the
same, and "false" if the inputs are different.
Logic gates
The AND gate is so named because, if 0 is called "false" and 1 is
called "true," the gate acts in the same way as the logical "and"
operator.
The OR gate gets its name from the fact that it behaves after the
fashion of the logical inclusive "or." The output is "true" if either
or both of the inputs are "true." If both inputs are "false," then
the output is "false." In other words, for the output to be 1, at
least input one OR two must be 1. The XOR ( exclusive-
OR ) gate acts in the same way as the logical "either/or." The
output is "true" if either, but not both, of the inputs are "true."
The output is "false" if both inputs are "false" or if both inputs
are "true." Another way of looking at this circuit is to observe
that the output is 1 if the inputs are different, but 0 if the inputs
are the same.
A logical inverter, sometimes called a NOT gate to differentiate it
from other types of electronic inverter devices, has only one
input. It reverses the logic state. If the input is 1, then the output
is 0. If the input is 0, then the output is 1.
The NAND gate operates as an AND gate followed by a NOT
gate. It acts in the manner of the logical operation "and" followed
by negation. The output is "false" if both inputs are "true."
Otherwise, the output is "true."
The NOR gate is a combination OR gate followed by an inverter.
Its output is "true" if both inputs are "false." Otherwise, the
output is "false."
The XNOR (exclusive-NOR) gate is a combination XOR gate
followed by an inverter. Its output is "true" if the inputs are the
same, and "false" if the inputs are different.
 Mathematical logic
CONJUNCTION
We can join two statements by “AND” operand. It is
also known as a conjunction. Its symbolic form is “∧“.
In this operator, if anyone of the statement is false,
then the result will be false. If both the statements are
true, then the result will be true. It has two or more
inputs but only one output.
DISJUNCTION
We can join two statements by “OR” operand. It is
also known as disjunction. It’s symbolic form is “∨”. In
this operator, if anyone of the statement is true, then
the result is true. If both the statements are false, then
the result will be false. It has two or more inputs but
only one output.
NEGATION
Negation is an operator which gives the opposite
statement of the given statement. It is also known as
NOT, denoted by “∼”. It is an operation that gives the
opposite result. If the input is true, then the output will
be false. If the input is false, then the output will be
true. It has one input and one output. The truth table
for NOT is given below:
Mathematical logic
CONJUNCTION
We can join two statements by “AND” operand. It is
also known as a conjunction. Its symbolic form is “∧“.
In this operator, if anyone of the statement is false,
then the result will be false. If both the statements are
true, then the result will be true. It has two or more
inputs but only one output.
DISJUNCTION
We can join two statements by “OR” operand. It is
also known as disjunction. It’s symbolic form is “∨”. In
this operator, if anyone of the statement is true, then
the result is true. If both the statements are false, then
the result will be false. It has two or more inputs but
only one output.
NEGATION
Negation is an operator which gives the opposite
statement of the given statement. It is also known as
NOT, denoted by “∼”. It is an operation that gives the
opposite result. If the input is true, then the output will
be false. If the input is false, then the output will be
true. It has one input and one output. The truth table
for NOT is given below:
 Graph theory
As used in graph theory, the term graph does not refer to
data charts, such as line graphs or bar graphs. Instead, it
refers to a set of vertices (that is, points or nodes) and of
edges (or lines) that connect the vertices. When any two
vertices are joined by more than one edge, the graph is
called a multigraph. A graph without loops and with at most
one edge between any two vertices is called a simple graph.
Unless stated otherwise, graph is assumed to refer to a
simple graph. When each vertex is connected by an edge to
every other vertex, the graph is called a complete graph.
When appropriate, a direction may be assigned to each edge
to produce what is known as a directed graph, or digraph.
Graph theory
As used in graph theory, the term graph does not refer to
data charts, such as line graphs or bar graphs. Instead, it
refers to a set of vertices (that is, points or nodes) and of
edges (or lines) that connect the vertices. When any two
vertices are joined by more than one edge, the graph is
called a multigraph. A graph without loops and with at most
one edge between any two vertices is called a simple graph.
Unless stated otherwise, graph is assumed to refer to a
simple graph. When each vertex is connected by an edge to
every other vertex, the graph is called a complete graph.
When appropriate, a direction may be assigned to each edge
to produce what is known as a directed graph, or digraph.
 Graph theory
An important number associated
with each vertex is its degree, which
is defined as the number of edges that
enter or exit from it. Thus, a loop
contributes 2 to the degree of its vertex.
For instance, the vertices of the simple
graph shown in the diagram all have a
degree of 2, whereas the vertices of the
complete graph shown are all of degree
3. Knowing the number of vertices in a
complete graph characterizes its essential
nature. For this reason, complete graphs
are commonly designated Kn, where n
refers to the number of vertices, and all
vertices of Kn have degree n − 1.
(Translated into the terminology of
modern graph theory, Euler’s theorem
about the Königsberg bridge problem
could be restated as follows: If there is a
path along edges of a multigraph that
traverses each edge once and only once,
then there exist at most two vertices of
odd degree; furthermore, if the path
begins and ends at the same vertex, then
no vertices will have odd degree.)
Graph theory
An important number associated
with each vertex is its degree, which
is defined as the number of edges that
enter or exit from it. Thus, a loop
contributes 2 to the degree of its vertex.
For instance, the vertices of the simple
graph shown in the diagram all have a
degree of 2, whereas the vertices of the
complete graph shown are all of degree
3. Knowing the number of vertices in a
complete graph characterizes its essential
nature. For this reason, complete graphs
are commonly designated Kn, where n
refers to the number of vertices, and all
vertices of Kn have degree n − 1.
(Translated into the terminology of
modern graph theory, Euler’s theorem
about the Königsberg bridge problem
could be restated as follows: If there is a
path along edges of a multigraph that
traverses each edge once and only once,
then there exist at most two vertices of
odd degree; furthermore, if the path
begins and ends at the same vertex, then
no vertices will have odd degree.)