Scribd
Upload
6 views17 pages

Problem Solving With Patterns 20240311 083609 0000

This document discusses patterns in sequences and the Fibonacci sequence. It defines what a sequence is and introduces subscript notation to represent terms. It then explains how to construct a difference table to look for patterns in sequences. As an example, it examines the Fibonacci sequence that describes rabbit populations. The sequence begins with 1, 1, 2, 3, 5, 8, etc where each term is the sum of the previous two. This recursive pattern is seen in nature like sunflower seed spirals. Later, the document notes the Fibonacci sequence can be calculated non-recursively using Binet's formula.

Uploaded by

Jean Klitzku T. Recamara
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
6 views17 pages

Problem Solving With Patterns 20240311 083609 0000

This document discusses patterns in sequences and the Fibonacci sequence. It defines what a sequence is and introduces subscript notation to represent terms. It then explains how to construct a difference table to look for patterns in sequences. As an example, it examines the Fibonacci sequence that describes rabbit populations. The sequence begins with 1, 1, 2, 3, 5, 8, etc where each term is the sum of the previous two. This recursive pattern is seen in nature like sunflower seed spirals. Later, the document notes the Fibonacci sequence can be calculated non-recursively using Binet's formula.

Uploaded by

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

01

BAPOS 1
Problem
solving with
patterns
Jean Klitzku T. Recamara
Dawn Gilead T. Bait-it
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. In the above sequence, 5 is the first term, 14 is
the second term, 27 is the third term, 44 is the fourth term, and 65 is the fifth
term. The three dots"..." indicate that the sequence continues beyond 65, which
is the last written term. It is customary to use the subscript notation a, to
designate the nth term of a sequence. That is,

a¹ represents the first term of a sequence.


a² represents the second term of a sequence.
a³ represents the third term of a sequence.

an - represents the nth term


To answer these questions, we often construct a
difference table, which shows the differ ences between
successive terms of the sequence. The following table is
a difference table for the sequence 2, 5, 8, 11, 14,...
To predict the next term of a sequence, we
often look for a pattern in a row if differences.
For instance, in the following table, the second differences shown
in blue are all the same constant, namely 4. If the pattern
continues, then a 4 would also be the next second difference, and
we can extend the table to the right as shown.
Now we work upward. That is, we add 4 to the
first difference 21 to produce the next first
difference, 25. We then add this difference to the
fifth term, 65, to predict that 90 is the next term in
the sequence. This process can be repeated to
predict additional terms of the sequence
Leonardo of Pisa, also known as Fibonacci (fë
bo-nä chê) (c. 1170-1250), is one of the best
known mathematicians of medieval Europe. In
1202, after a trip that took him to several Arab
and Eastern countries, Fibonacci wrote the book
Liber Abaci. In this book Fibonacci explained
why the Hindu-Arabic numeration system that
he had learned about during his travels was a
more sophisticated and efficient system than the
Roman numeration system.
Leonardo Pisano
Fibonacci
At the beginning of a month, you are given a
pair of newborn rabbits. After a month the
rabbits have produced no offspring; however,
every month thereafter, the pair of rabbits
produces another pair of rabbits. The
offspring reproduce in exactly the same
manner. If none of the rabbits dies, how matty
pairs of rabbits will there be at the start of
each succeeding month?
The solution of this problem is a
sequence of numbers that we
now call the Fibonacci
sequence. The following figure
shows the numbers of pairs of
rabbits on the first day of each
of the first six months. The
larger rabbits represent mature
rabbits produce another pair of
rabbits each month. The
numbers in the blue region-1,
1,2,3,5, 8-are the first six terms
of the Fibonacci sequence.
Fibonacci discovered that the number
of pairs of rabbits for any month after
the first two months can be
determined by adding the numbers of
pairs of rabbits in each of the two
previous months. For instance, the
number of pairs of rabbits at the start
of the sixth month is 3+5 = 8
A recursive definition for a sequence is
one in which each successive term of the
sequence is defined by using some of the
preceding terms. If we use the
mathematical notation F. to represent the
ath Fibonacci number, then the numbers in
the Fibonacci sequence are given by the
following recursive definition.
Fibonacci's rabbit problem is not a very realistic model of
the population growth rate of rabbits; however, the
numbers in the Fibonacci sequence often occur in nature.
For instance, the seeds on a sunflower are arranged in
spirals that curve both clockwise and counterclockwise
from the center of the sunflower's head to its outer edge. In
many sunflowers, the number of clockwise spirals and the
number of counterclockwise spirals are consecutive
Fibonacci numbers. For instance, in the sunflower shown
at the left, the number of clockwise spirals is 34 and the
number of counterclockwise spirals is 55.
It has been conjectured that the seeds on a
sunflower grow in spirals that involve
Fibonacci numbers because this arrangement
forms a uniform packing. At any stage in the
sunflower's development, its seeds are packed
so that they are not too crowded in the center
and not too sparse at the edges.
We can find any term after the second term of the Fibonacci
sequence by computing the sum of the previous two terms.
However, this procedure of adding the previous two terms can
be tedious. For instance, what is the 100th term or the 1000th
term of the Fibo- nacci sequence? To find the 100th term, we
need to know the 98th and 99th terms. To find the 1000th
term, we need to know the 998th and 999th terms. Many
mathematicians tried to find a nonrecursive nth-term formula
for the Fibonacci sequence without success, until a formula
was discovered by Jacques Binet in 1843. Binet's formula is
given in Exercise 23 of this section.
For further examples, Dawn
will demonstrate:

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy