0% found this document useful (0 votes)
39 views7 pages

Week3 New

math

Uploaded by

tizonjunagen
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
39 views7 pages

Week3 New

math

Uploaded by

tizonjunagen
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 7

DAVAO CENTRAL COLLEGE,

INC.
Juan dela Cruz Street, Toril, Davao City
Landline No. (082) 291 1882
Accredited by ACSCU-ACI

Week 3

Unit 1: The Nature of Mathematics


Topic: Problem Solving and Reasoning

Learning Outcomes:
1. Use different types of reasoning to justify statements
and arguments made about mathematics and mathematical
concepts;
2. Write clear and logical proofs;
3. Solve problems involving patterns and recreational
problems following Polya’s four steps; and
4. Organize one’s methods and approaches for proving and
solving problems.
Concept Digest (Discussion)
We always hear arguments that persuade us to believe because we
think that these arguments that we hear are manifesting
truthfulness. Some people verify these arguments and may come up
with a sound proof - that is, to verify them or refute them. One
of the ways to verify or refute arguments is to analyze the
statements using the concept of inductive and deductive
reasoning.
Inductive and deductive reasoning are two fundamental forms of
reasoning for mathematics. The formal theorems and proofs that we
rely on today all began with these two types of reasoning. Even
today, mathematicians are actively using these two types of
reasoning to discover new mathematical theorem and proofs.
Believe me or not, you yourself might be using inductive and
deductive reasoning when you make assumptions about how the world
works.

Inductive Reasoning
According to www.study.com, inductive reasoning is a logical
process in which multiple premises, all believe to be true most
of the time are combined to obtained a specific conclusion. This
reasoning is used in applications that involved prediction,
forecasting, or behavior.
A conclusion that is reached by inductive reasoning may or
may not be valid. An example of inductive reasoning is when you
notice that all of mice you see around you are brown, and you
make the conclusion that all mice in the world are brown.
Can you say for certain that this conclusion is correct?
Example for Inductive
1. Jenny leaves for school at 7:00am. Jenny is always on time.
Therefore, Jenny assumes then that if she leaves for school at
7:00am, she will always be on time.
2. James is a grandfather.
James is bald.
Therefore, all grandfathers are bald.
3. Rico is a first-year college student.

PAGE \* MERGEFORMAT 8
DAVAO CENTRAL COLLEGE,
INC.
Juan dela Cruz Street, Toril, Davao City
Landline No. (082) 291 1882
Accredited by ACSCU-ACI

Rico is male.
Therefore, all first-year college students are males.
Deductive Reasoning
Inductive reasoning typically leads to deductive reasoning, the
process of reaching conclusion based on previously known facts.
The conclusions reached by this type of reasoning are valid and
can be relied on. For example, you know for a fact that all
pennies are copper-colored. Now, if your friend gave you penny,
what can you conclude about the penny? You can conclude that the
penny will be copper-colored. You can say this for certain
because your statement is based on facts.

Examples
1. All men are mortal. (Major premise)
President Rody is a man. (Minor Premise)
Therefore, Rody is mortal. (Conclusion)
Can you definitely say that the major premise is correct?

2. All first-year college students in the new curriculum take


mathematics in the Modern World.
Matilda is a first-year college student in the new
curriculum.
Therefore, Matilda takes Mathematics in the Modern World.
Can you definitely say that the major premise is correct?

3. All Filipinos eat rice.


Ronnie is a Filipino.
Therefore, Ronnie eats rice.
Can you definitely say that the major premise is correct?

Proofs
In evidence; some may call it an argument that establishes a fact
or the veracity of something holds. This definition tells us that
in order to claim that a statement or argument is true or valid,
there has to be some evidences verified by science.

Mathematical Induction
One way of looking at the beautiful scenes of Chocolate Hills in
Bohol is to use a series of steps in order for a viewer to be on
top of the viewing deck. Suppose we want to know whether we can
reach every step in these series of steps. We know two things:
 We can reach the first step of the series of steps.
 If we can reach a particular step of the series, then we can
reach the next step.
Thus, if we want to be on top of the series of steps, we need to
pass the step before the last step.

Mathematical Induction
Suppose there is a claim the

PAGE \* MERGEFORMAT 8
DAVAO CENTRAL COLLEGE,
INC.
Juan dela Cruz Street, Toril, Davao City
Landline No. (082) 291 1882
Accredited by ACSCU-ACI

n
n( n+1)
∑ i=1+ 2+ 3+4 +5 .. .+n=
2
i=1 for n = 1,2,3,…
To verify whether the sum is indeed true, we check for n = 1,2,3,
…,k,(k + 1).

Hence, for n = 1
n
1(1+1) 1(2)
∑ i= 2
=
2
=1
i=1
n = 2
2
2( 2+1 ) 2( 3 )
∑ i= 2
=
2
=1+ 2=3
i=1
n = 3
3
3( 3+1 ) 3 ( 4 )
∑ i= 2
=
2
=1+2+3=6
i=1
By applying the process,
For n = k,
k
k ( k +1)
∑ i= 2
i=1
For n = k + 1,
k +1
( k +1 )( k +1+1) ( k + 1)( k +2 )
∑ i= 2
=
2
i=1

We would like to show that the last statement is true. And


according to the basic definition of the summation,
k +1 k
∑ i=1+2+3+4 +5+. ..+ k +( k + 1)=∑ i +( k +1)
i=1 i=1
Thus,
k (k +1 ) k (k +1 )+2(k +1 )
+(k +1 )=
2 2 By factoring (k + 1),
( k +1)(k +2)
=
2 This is what we are proving for.

The Principle of Mathematical Induction


Assume that for each positive integer n we have a statement,
S(n), that is either true or false. Imagine that,
Basic Step: S(1) is true
Inductive Step: We would want to show if S(k) is true,
then S(k + 1) is also true.

Show by induction that the following summations are true:


n
n (n+1)(n+ 2)
∑ i( i+1)=1⋅2+2⋅3+3⋅4+ 4⋅5+. ..+n ( n+1)= 3
a. i=1

Basic Step:

PAGE \* MERGEFORMAT 8
DAVAO CENTRAL COLLEGE,
INC.
Juan dela Cruz Street, Toril, Davao City
Landline No. (082) 291 1882
Accredited by ACSCU-ACI

for n = 1
1
1(1+1 )(1+2 ) 1(2 )(3)
∑ i(i+1)= 3
=
3
=1⋅2=2
i=1
for n = 2
2
2( 2+1 )( 2+ 2) 2( 3)( 4 )
∑ i ( i +1)= 3
=
3
=1⋅2+ 2⋅3=8
i=1
Inductive Step:
for n = k for n = k + 1
k k +1
k ( k +1 )( k +2) ( k +1 )( k +1+1)( k +2+1) ( k +1 )( k +2 )( k +3 )
∑ i( i+1)= 3
∑ i( i+1 )= 3
=
3
i=1 i=1

n
n ( n+1)( 2 n+1 )
∑ i2 =12 +22 +32 +. . .+ n2 = 6
b. i=1
Basis Step:
For n = 1
1
1(1+1 ) [ 2(1 )+1 ] 1(2 )(3 ) 2
∑ i2= 6
=
6
=1 =1
i=1
For n = 2
2
2( 2+ 1) [ 2( 2)+1 ] 2 (3 )( 5 ) 2 2
∑ i2= 6
=
6
=1 +2 =5
i=1

Inductive Step:
For n = k
k
k ( k +1 )( k +2 )
∑ i2= 6
i=1
For n = k + 1
k +1
( k + 1)( k +1+1 ) [ 2( k+ 1)+1 ] ( k +1 )( k +2 )( k +3 )
∑ i2= 6
=
6
i=1

n
n2 (n+1) 2
∑ i3 =13 + 23 +33 +.. .+n3 = 4
c. i=1
Basis Step:
For n = 1 for n = 2
1 2
12 ( 1+1)2 2
22 ( 2+1 )2 4 ( 9) 3 3
∑ i3 = 4 = 24 =13 =1 ∑ i3= 4
=
4
=1 + 2 =9
i=1 i=1

Inductive Step:
For n = k for n = k + 1
k 2 2 k +1
k (k +1) ( k+1)2 ( k +1+1)2 (k +1)2 (k +2 )2
∑i = 43
∑i = 3
4
=
4
i=1 i=1

For n = k for n = k + 1
k k +1
k 2 (k +1)2 ( k+1)2 ( k +1+1)2 (k +1)2 (k +2 )2
∑ i3= 4
∑ i3= 4
=
4
i=1 i=1

PAGE \* MERGEFORMAT 8
DAVAO CENTRAL COLLEGE,
INC.
Juan dela Cruz Street, Toril, Davao City
Landline No. (082) 291 1882
Accredited by ACSCU-ACI

Problem Solving
Why does a problem-solving appear unappealing?
One of the primary reasons people have trouble with problem-
solving is that there is no single procedure that work all the
time. This means that each problem must be considered slightly
different. Also, problem-solving requires practical knowledge
about the specific situation. If there is a misunderstanding of
either the problem or the underlying situation, we may make
mistakes or incorrect assumptions. One of the main goal is to
become a better problem solver.

Polya’s Four-Step Approach to Problem-Solving


1. Preparation: Understand the problem.
Consider the terminology and notation use in the
problem:
 What is the problem all about?
 What sort of problems is it?
 What is being asked?
2. Thinking Time: Devise a plan.
How are we going to treat a problem?
Possible strategies:
 Draw pictures.
 Use a variable and choose helpful names for variables
or unknowns.
3. Insight: Carry a plan.
 Solve.
 Once you have an idea for a few approach, jot it down
immediately. When you have time, try it out and see if
it leads to a solution.
 If the plan does not seem to be working, then start
over and try another approach. Often that first
approach does not work. Do not worry; if an approach
does not work, it does not mean we did it wrong. You
actually accomplished something; knowing a way does not
work is part of the process of elimination.
 The key is to keep trying until something works.
4. Verification: Look back
Once you have a potential solution, check to see if it
works.
 Did you answer the question?
 Double check to make sure that all of the conditions
related to the problem are satisfied.
 Double check any computations involved in finding your
solution.

PAGE \* MERGEFORMAT 8
DAVAO CENTRAL COLLEGE,
INC.
Juan dela Cruz Street, Toril, Davao City
Landline No. (082) 291 1882
Accredited by ACSCU-ACI

Example
Every person at a party of twenty-eight people said ”hello” to
each of the other people of the party exactly once. How many
“hello’s” were said at the party?
Polya’s Steps Guide Questions Answers
 This is a problem about
 What is the two people in a party
problem all saying “hello” to each
Understand the
about? other.
problem
 What is being  The task is to determine
asked? the number of “hello”
words uttered or said.
 The problem can be solved
by means of
“combinations” as
 Draw a
discussed in Elementary
picture/s.
Statistics. This is
 Use a
because when two people
variable and
Devise a plan had already said “hello”
choose
to each other, the
helpful names
reverse is already a form
for variables
of duplication.
or unknowns.
 In other cases, if
duplications are allowed,
we use the permutation.
 The problem can be solved
by determining the number
of ways in which 28
people create a pair and
shake each other’s hands
and say “hello”
 Mathematically, we have,
 What is the
Carry out the
solution to n!
plan n C r=
the problem? r !(n−r)!
28!
28 C 2=
2!(28−2 )!
28! 28 (27 )
28 C 2= = =378
2!26 ! 2
Thus, there are 378 “hellos”
uttered in the party.
Look back  Did you  Yes. The question is
answer the answered.
question?  This method is required
 Can the in solving similar
problem or problems.
method be
generalized

PAGE \* MERGEFORMAT 8
DAVAO CENTRAL COLLEGE,
INC.
Juan dela Cruz Street, Toril, Davao City
Landline No. (082) 291 1882
Accredited by ACSCU-ACI

so as to be
useful for
future
problems?

PAGE \* MERGEFORMAT 8

You might also like