Professional Documents
Culture Documents
During the European Renaissance, renowned artists and architects used an equation known as the
"golden ratio" to map out their masterpieces. Thousands of years later, scientists adopted this
mathematical formula to help explain why some people are considered beautiful...and others are not.
Dr. Kendra, an assistant professor of biostatistics, uses the golden ratio and 29 other measurements to
study facial sex appeal. These measurements are calculated to determine a person's beauty on a scale of
1 to 10. What does she measure?
A. First, Dr. Kendra measures the length and width of the face. Then, she divides the length by the
width. The ideal result—as defined by the golden ratio— is roughly 1.6, which means a beautiful
person's face is about 1 1/2 times longer than it is wide.
B. Next, Dr. Kendra measures three segments of the face— from the forehead hairline to a spot
between the eyes, from between the eyes to the bottom of the nose, and from the bottom of the
nose to the bottom of the chin. If the numbers are equal, a person is considered more beautiful.
C. Finally, statisticians measure other facial features to determine symmetry and proportion. On a
perfect face, Dr. Kendra says the length of an ear is equal to the length the nose, and the width of
an eye is equal to the distance between the eyes.
SECTION 1:
THE NATURE OF MATHEMATICS
Mathematics, developed by human mind and culture, is a formal system of thought for recognizing,
classifying, and exploiting patterns.
Mathematics is a language
Mathematics is an art
WHERE IS MATHEMATICS?
• in every people’s daily task or activity
• in communities
• IT IS EVERYWHERE
WHAT IS MATHEMATICS FOR?
• useful in making conclusions and/or predictions of the events of the world
• everyone
Leonardo Pisano
European mathematician 1175-1250
Leonardo of Pisa.
A remarkable property of the sequence is that the ratio between two numbers in the sequence
eventually approaches the “Golden Ratio” as a limit.
IMPORTANCE OF LANGUAGE
• To understand the expressed ideas
3. Relation Symbols- (=,≥,≤ and ~) are use for comparison and act as verbs in the mathematical
language.
4. Grouping Symbols- (),{} and [], are used to associate groups of numbers and operators.
Example: 2x + y = 6
DIFFICULTIES
• The word “is” could mean equality, inequality, or membership in a set
• Mathematical objects may be represented in many ways such as sets and functions.
• The words “and” and “or” mean differently in mathematics from its English use.
SETS
• Definition. A Set is any well defined collection of “objects.”
• Definition. The elements of a set are the objects in a set.
• Notation. Usually we denote sets with upper-case letters, elements with lower-case letters.
The following notation is used to show set membership
• xA means that x is a member of the set A
• xA means that x is not a member of the set A.
A= 1,2,3,4,5,6
FUNCTIONS
BINARY OPERATIONS
• A binary operation is an operation that takes two input elements from a set and gives a unique
result that also belongs to the same set. For example “3+5=8”.
• A mapping from a Set A to a set B is a set of ordered pairs (a,b), where a is an element of A and
b is an element of B. it is denoted by * which assigns to each ordered pair of elements of S a
uniquely determined element of S.
2. x is multiple of 5.
LOGIC
• Allows us to determine the validity of arguments in and out of mathematics
STATEMENT OR PROPOSITION
• Must express a complete thought.
• A declarative sentence or statement that is either true or false but not both.
IS IT A PROPOSITION OR NOT?
• All multiples of 5 are odd numbers.
• 9 is greater than 8.
QUANTIFICATION
• Universal Quantification
▪ “For all” or “For every”
▪ Symbol: ∀
▪ Example: “For every object x in the universe, x > 1", which is expressed as " ∀x, x > 1"
• Existential Quantification
▪ “There exists” or “For some”
▪ Symbol: ∃
▪ Example: “There exists an object x in the universe, x > 1", which is expressed as "∃x, x
> 1"
A. If p, then q.
B. p implies q.
C. p only if q.
D. Not p or q.
E. Every p is q.
F. q, if p.
G. Q provided that p.
H. Q is a necessary condition for p.
I. p is a sufficient condition for q.
J. P yields q.
K. q follows from p.
EXAMPLES:
Consider the following statements:
P: x is a prime number.
Q: x is odd
Solution:
a. p→q b. p→q
EXAMPLE
Write each statement in the form “If p, then q.”
a. I will be able to tour abroad next year provided that I have my passport renewed.
If I have my passport renewed, then I’ll be able to tour abroad next year.
EXAMPLE
Write each statement in the form “If p, then q.”
CONVERSE FORM: q → p
INVERSE FORM: ~p → ~q
EXAMPLE
• Write the converse, inverse, and contrapositive of the following statements:
1. She is allowed to join the volleyball team, only if she knows how to receive the ball.
4. I will be able to tour abroad next year provided that I have my passport renewed.
EXAMPLE
1. She is allowed to join the volleyball team, only if she knows how to receive the ball.
p→ q: If she is allowed to join the volleyball team, then she knows how to receive the ball.
q→ p: If she knows how to receive the ball, then she is allowed to join the volleyball team.
~p→ ~q: If she is not allowed to join the volleyball team, then she doesn’t know how to receive
the ball.
~q→ ~p: If she doesn’t know how to receive the ball, then she is not allowed to join the volleyball
team.
EXAMPLE
~p→ ~q: If it will not rain, then I will not bring an umbrella.
~q→ ~p: If I will not bring an umbrella, then it will not rain.
• If the truth table of a compound statement is always true regardless of the truth values of each
of the component statements, then the statement is said to be tautology.
• If the truth table of a compound statement is always false regardless of the truth values of each
of the component statements, then the statement is said to be contradictionn.
When solving a problem, one must understand the question, gather all pertinent facts, analyze
the problem i.e. compare with previous problems (note similarities and differences), perhaps use
pictures or formulas to solve the problem.
2. Deductive Reasoning
INDUCTIVE REASONING
It is the process of reaching a general conclusion by examining specific examples. A conclusion
based on inductive reasoning is called a conjecture. A conjecture may or may not be correct.
DEDUCTIVE REASONING
It is the process of reaching a conclusion by applying general assumptions, procedures, or
principles.
If you can find one case in which a statement is not true, called a counterexample, then the
statement is a false statement.
PROBLEM SOLVING WITH PATTERNS: SEQUENCES
A sequence is an ordered list of numbers. Each number in a sequence is called a term of the
sequence. The an is used to designate the nth term of a sequence.
A formula that can be used to generate all the terms of a sequence is called an nth – term
formula.
an = a1 + n − 1 d
PROBLEM-SOLVING STRATEGIES
One of the foremost recent mathematicians to make a study of problem solving was George
Polya (1877-1985). He was born in Hungary and moved to the United States in 1940, the basic
problem-solving strategy that Polya advocated consisted of the following four steps .
2. Devise a plan
Polya’s four steps are deceptively simple. To become a good problem solver, it helps to examine each of
these steps and determine what is involved.