FLEX-OBEDIZED MODULE FOR MATHEMATICS IN THE

MODERN WORLD

Engr. Oliver John Y. Alajas

Instructor

Chapter 3: Problem Solving

3.1. Inductive and Deductive Reasoning
A. Inductive Reasoning
B. Deductive Reasoning
3.2. Problem Solving with Pattern
A. Difference Table
B. nth Term Formula for a Sequence
C. Recursive Definition for a Sequence

Description

Architects and Engineers require good problem-solving skills in order to solve many complicated problems in constructing and designing modern buildings
and establishments. It is necessary for them to have this skill so that they can able to create aesthetically pleasing and functional buildings and meet the requirements
for safety as well.

In this chapter, there are two topics that students must have to learn. First is the inductive and deductive reasoning. Inductive reasoning is based on set of
observation while deductive reasoning is based on facts. Both are necessary ways of reasoning in the world of mathematics. Second topic is the problem solving
pattern wherein it involves solving different problems in terms of sequences. The goal for this chapter is to help students become a good problem solver and let them
know that problem solving can be an enjoyable experience.

Objectives

After completing the module, the students should be able to:

- Understand the difference between Inductive and Deductive Reasoning.

- Learn how to use Inductive Reasoning to draw a conclusion from a series of example.
- Demonstrate knowledge on how to use Deductive Reasoning to draw conclusion based from facts or accepted statements. -
Understand the patterns or sequences in a certain problem.

- Learn how to solve patterned problems using difference table.

- Learn how to solve patterned problems by predicting a formula.

- Demonstrate knowledge on how to solve patterned problems suing Fibonacci sequence.

Duration

Start:
End:
Contents:

Phase 1: Read, Understand, & Watch & Listen

Students are expected to choose from the tables below considering their classification and preferences.
3Ps 3Ns 3Ws
(Paper, Pencil, & Phone) (Network slow, Needs Combi-Modes, (Willing, With Fast Internet,
 & Neutral Students) Wean-not students)

-Modules that will be provided are complete -A pdf copy of the module will be sent via -PowerPoint presentation of the lesson will be
with illustration, step-by-step solution & email or group chat on messenger that the discussed via Google Meet/_______.
discussion. student will provide. The module copy will be Illustration and solutions will also be discuss
the same as 3Ps category. live via mentioned online platform.
-For the internet availability, the student will
be provided a link and can join the online
live discussion anytime.

Phase 2: Test yourself

3Ps 3Ns 3Ws
(Paper, Pencil, & Phone) (Network slow, Needs Combi-Modes, (Willing, With Fast Internet,
& Neutral Students) Wean-not students)

-Series of sample problems and correct - Series of sample problems and correct answers - A sample problem will be flashed and the
answers will be given. Try to answer the will be given. Try to answer the given problems students will be given time to try and answer
given problems and compare your answers to and compare your answers to the correct one. - the posted question or problem. After, the
the correct one. For online availability, a sample problem will be instructor will discuss live the and give the
flashed and the students will be given time to complete solution and correct answer.
try and answer the posted question or problem.
After, the instructor will discuss live the and
give the complete solution and correct answer.

Phase 3: Activity or Homework

3Ps 3Ns 3Ws
(Paper, Pencil, & Phone) (Network slow, Needs Combi-Modes, (Willing, With Fast Internet,
& Neutral Students) Wean-not students)
 -Activity or Homework are included in - Activity or Homework are included in - Activity will be given 15 to 30 minutes
the module. The correct answer and the module. The correct answer and before class dismissal. For limited time,
complete solution will be included in the complete solution will be included in the activity given will be considered assignment
(2nd) second module. (2nd) second module. and must be submitted on the next class
-For online, activity will be given 15 to 30 schedule.
minutes before class dismissal. For limited
time, activity will be considered assignment
and must be submitted on the next class
schedule.

References:

1. Mathematics in the Modern World, Aufmann e [Chapter 3, pg 56 -73]

2. Inductive Reasoning retrieved from https://youtu.be/NarWCrwSBKI
3. Inductive Reasoning and Counterexample retrieved from https://youtu.be/JzCPff7eQ2w
4. Counterexample retrieved from https://youtu.be/MUWUSs23UFQ
5. Finding a counterexample retrieved from https://youtu.be/lb8RZ2_trTY
6. Introduction to Deductive Reasoning retrieved from https://youtu.be/yMzNaqdxiZY
7. Deductive reasoning retrieved from https://youtu.be/ZTfVIMPV8KY
8. Deductive reasoning explained retrieved from https://youtu.be/6lDWNu55eYk
9. Equations of sequence patterns, Sequence, series and induction retrieved from https://youtu.be/_3BnyEr5fG4
10. Write Algebraic Expression for Pattern Blocks retrieved from https://youtu.be/Uapg1oaiuJQ
11. Algebra – Recognizing Patterns retrieved from https://youtu.be/dDEFWSlLTpc
12. Fibonacci sequence – Derive Recursive Formula retrieved from https://youtu.be/fxGlt-OXnw8
13. Recursion Fibonacci series retrieved from https://youtu.be/U1UnHruyqnk
14. Find nth Fibonacci number using recursive technique retrieved https://youtu.be/4GMh0MfCiqE
 *reference number 2-14 are online references, video tutorials about the mentioned topic
3.2. Problem Solving with Pattern

A. Difference Table

PROBLEM SOLVING WITH PATTERNS

Terms of a Sequence

An ordered list of numbers such as

5, 14, 27, 44, 65, …….

is called a sequence. The numbers in a sequence that are separated by commas are the terms of the sequence.

Terms can be represented by the notation an. Thus, it is a sequence in the form a1, a2, a3, …, an

Note: a1 ------- 1st term

a2 ------- 2nd term

a3 ------- 3rd term

 … ------- sequence continues

an ------- nth term

When we examine a sequence, it is natural to ask:

a. What is the next term?

b. What formula or rule can be used to generate the terms?

To answer these questions, we often construct a difference table, which shows the differences between successive terms of the sequence.

EXAMPLES:

1. Difference Table for the sequence 2, 5, 8, 11, 14, …

Sequence:

First Differences:
2. Differences Table for the sequence 5, 14, 27, 44, 65, …

Sequence:

First
differences:

Second differences:
3. Use a difference table to predict the next term in the sequence.

2, 7, 24, 59, 118, 207, …

Sequence:

First differences:

Second differences:

Third differences:
 We predict that the next term is 332.

B. nth Term Formula for a Sequence

formula to generate terms of a sequence.

EXAMPLES:
1. 1, 4, 9, 16, 25, …, n2

Solution:

a1 = 1, a2 = 4, a3 = 9, a4 = 16, a5 = 25

then: an = n2,

for n = 1, an = n2, a1 = (1)2, a1 = 1

n = 2, an = n2, a2 = (2)2, a2 = 4

n = 3, an = n2, a3 = (3)2, a3 = 9

2. Consider, an = 3n2 + n. This formula defines a sequence and provides a method for finding any term of the sequence.

Let say, we replace n with 1, 2, 3, 4, 5, and 6

a1 = 3n2 + n = 3(1)2 + (1) = 3 + 1 = 4

a2 = 3n2 + n = 3(2)2 + (2) = 3(4) + 2 = 12 + 2 = 14

a3 = 3n2 + n = 3(3)2 + (3) = 3(9) + 3 = 27 + 3 = 30

a4 = 3n2 + n = 3(4)2 + (4) = 3(16) + 4 = 48 + 4 = 52

a5 = 3n2 + n = 3(5)2 + (5) = 3(25) + 5 = 75 + 5 = 80

a6 = 3n2 + n = 3(6)2 + (6) = 3(36) + 6 = 108 + 6 = 114

then, we have 4, 14, 30, 52, 80, 114. If we will find the 40th term, we need to replace each n with 40.

a40 = 3n2 + n = 3(40)2 + 40 = 3(1600) + 40 = 4800 + 40 = 4840

3. Assume the pattern shown by the square tiles in the following figures continues. a. What

is the nth-term formula for the number of tiles in the nth figure of the sequence? b. How
 many tiles are in the eight figure of the sequence?

c. Which figure will consist of exactly 320 tiles?

SOLUTION:

a. a1 a2 a3 a4
Unshaded: 0 2 4 6 ------- 2n - 2
2 5 8 11

Shaded: 2 3 4 5 ------- n +1

So, an = 2n – 2 + n + 1 = 3n -1
Check: an = 3n -1 For n = 1, an = 3n -1; a1 = 3n -1 = 3(1) – 1 = 3 – 1 = 2 For n =

2, an = 3n -1; a2 = 3n -1 = 3(2) – 1 = 6 – 1 = 5

For n = 3, an = 3n -1; a3 = 3n -1 = 3(3) – 1 = 9 – 1 = 8

For n = 4, an = 3n -1; a4 = 3n -1 = 3(4) – 1 = 12 – 1 = 11

Alternative solution:
 a1 a2 a3 a4

2 5 8 11

Unshaded: 2 4 6 8 ------- 2n

Shaded: 0 1 2 3 ------- n - 1

So, an = 2n + n - 1 = 3n -1
Check: an = 3n -1 For n = 1, an = 3n -1; a1 = 3n -1 = 3(1) – 1 = 3 – 1 = 2 For n =

2, an = 3n -1; a2 = 3n -1 = 3(2) – 1 = 6 – 1 = 5

For n = 3, an = 3n -1; a3 = 3n -1 = 3(3) – 1 = 9 – 1 = 8

For n = 4, an = 3n -1; a4 = 3n -1 = 3(4) – 1 = 12 – 1 = 11

 b. n = 8; an = 3n -1; a8 = 3(8) -1 = 24 – 1 = 23 tiles c. since, an = 3n -1; 320

= 3n -1

320 + 1 = 3n

3n = 321

n = 321
3

n = 107, the 107th figure is composed of 320 tiles

or using the Arithmetic Sequence formula: a n = a1 + (n -1) d.

where d is the common differences only applicable for first differences that are common.

d=3

an = a1 + (n -1) d
an = 2 + (n -1)

(3) an = 2 + 3n –

3 an = 3n - 1

C. Recursive Definition for a Sequence

- it is one in which each successive term of a sequence is defined by using some of the preceding terms. By recursive definition the nth Fibonacci

number Fn is given by the formula:

Fn = Fn-1 + Fn-2 for n ≥ 3

where: F1 = 1 and F2 = 1

EXAMPLES:

1. The first six Fibonacci numbers are 1, 1, 2, 3, 5, and 8. Use the definition of Fibonacci numbers to find the seventh and eighth Fibonacci

numbers.

SOLUTION:
Fn = Fn-1 + Fn-2 for n ≥ 3 n = 8 Fn = Fn-1 + Fn-2 for n ≥ 3 n = 7

F8 = F7 + F6 F8
F7 = F7-1 + F7-2
= 13 + 8 F8 =
F7 = F6 + F5 F 7
21
=8+5

F7 = 13
F8 = F8-1 + F8-2
The seventh and eighth Fibonacci numbers are 13 and 21 respectively.

2. Determine whether each of the following statements about Fibonacci number s true or false. Note: the first 10 terms of the Fibonacci sequence

are, 1, 1, 2, 3, 5, 8, 13, 21, 34, and 55.

a. If n is even, then Fn is an odd number.

b. 2 Fn - Fn-2 = Fn+1 for n ≥ 3

SOLUTION:

a. Applying Inductive Reasoning

Fn = Fn-1 + Fn-2 n = 6 F6 = Fn = Fn-1 + Fn-2 n = 8 F8 =
Fn = Fn-1 + Fn-2 n = 4 F4 =
F6-1 + F6-2 F8-1 + F8-2
F4-1 + F4-2
F 6 = F5 + F4 F8 = F7 + F6
F 4 = F3 + F2
F6 = 5 + 3 F8 = 13 + 8
F4 = 2 + 1
F6 = 8 F8 = 21
F4 = 3

Since for n = 6 the statement “If n is even, then Fn is an odd number” is found to be false, therefore such statement is false.
b. Applying Inductive Reasoning 2 Fn - Fn-2 = Fn+1 for n ≥ 3
n=3
 2 Fn - Fn-2 = Fn+1 2 Fn - Fn-2 = Fn+1
2 Fn - Fn-2 = Fn+1
2 F4 – F4-2 = F4+1 2 F5 – F5-2 = F5+1
2 F3 – F3-2 = F3+1
2 F 4 – F 2 = F5 2 F5 – F 3 = F 6
2 F 3 – F 1 = F4
2 (3) – (1) = 5 2 (5) – (2) = 8
2 (2) – (1) = 3
6–1=5 10 – 2 = 8
4–1=3
5=5 8=8
3=3

2 Fn - Fn-2 = Fn+1 for n ≥ 3 n = 5

2 Fn - Fn-2 = Fn+1 for n ≥ 3 n = 4

Since for the three values for n as examples that statement “2 Fn - Fn-2 = Fn+1 for n ≥ 3” is found to be true. Therefore, we conjecture that such statement

is true.