0% found this document useful (0 votes)
5 views1 page

Understanding Deductive Reasoning and Patterns

Deductive reasoning involves using broad techniques to reach conclusions, exemplified by a mathematical process that demonstrates how to derive a result based on an original number. The document also discusses the Fibonacci sequence, detailing how to compute terms using both the recursive formula and Binet's formula, with an example of finding the 20th term. Additionally, it introduces Pascal's Triangle and its formula for summing elements in a row.
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)
5 views1 page

Understanding Deductive Reasoning and Patterns

Deductive reasoning involves using broad techniques to reach conclusions, exemplified by a mathematical process that demonstrates how to derive a result based on an original number. The document also discusses the Fibonacci sequence, detailing how to compute terms using both the recursive formula and Binet's formula, with an example of finding the 20th term. Additionally, it introduces Pascal's Triangle and its formula for summing elements in a row.
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

Deductive Reasoning

A style of reasoning in which broad techniques and principles are used to arrive at a situation. It is the
process of arriving at a broad conclusion by employing broad assumptions, techniques, or principles.
Deductive reasoning, for example, is used to form a hypothesis. Multiply the number by ten, add eight
to the product, divide the total by two, and remove four. Let n represent the original number as a
solution. 10n is the result of multiplying n by ten. 8 + 10n = 8 + 10n + 8 + 10n + 8 + 10n + 8 + 10n + 8 +
10n Divide the total by two: 8 + 10n/ 2 = 4 + 5n Subtraction by 4 yields the quotient: 4 + 5n – 4 = 5n.
Finally, after following the technique, we began with 5n. This signifies that the specified technique yields
a result that is five times the original value. 10n is the result of multiplying n by ten. 8 + 10n = 8 + 10n + 8
+ 10n + 8 + 10n + 8 + 10n + 8 + 10n Divide the total by two: 8 + 10n/ 2 = 4 + 5n Subtraction by 4 yields
the quotient: 4 + 5n – 4 = 5n. Finally, after following the technique, we began with 5n. This signifies that
the specified technique yields a result that is five times the original value.

3.3 Problem Solving with Patterns

The Fibonacci numbers, typically abbreviated as Fn, are a mathematical series in which each number is
the sum of the two preceding ones. The Fibonacci formula is given as, Fn = Fn-1 + Fn-2, where n > 1. For
example, if you are tasked to look for the value 8th term of Fibonacci sequence. Using the formula:
F⁸=F⁷+F⁶ followed by =(F⁶+F⁵)+F⁶ next is =(8+5)+8 then =13+8 so, the answer is 21. Though it is easy to
find the nth term of Fibonacci number using Fn if this two previous numbers,Fn-1 and Fn-2 are known.
However, supposed we want to find the F20. Using the definition, it will be tedious and time consuming
to compute F19 and F18 to determine F20. Thus, it will be more effective to use Jacques Binet's formula
to find the nth Fibonacci number. The explicit formula for the terms of the Fibonacci sequence of Binet
is, Fn=(1+√5/2)n−(1−√5/2)n√5. For example, we are tasked to find the 20th Fibonacci number. Using the
formula: F²⁰= ⅕ [(1+√5/2)²⁰ +(1-√5/2)²⁰] . Hence, the 20th Fibonacci number is 6765. Another famous
mathematician who loves patterns is Blaise Pascal who created the Pascal's Triangle. Pascal's triangle is a
triangular array constructed by summing adjacent elements in preceding rows. Using the Pascals triangle
formula for the sum of the elements in the nth row of the Pascals triangle: Sum = 2n where n is the
number of the row.

You might also like