<?xml version="1.0" encoding="UTF-8" ?>
  <resource>
  <id>537</id>
  <path>/www/nrich/html/content/97/11/six4/</path>
  <resourceTypeID>1</resourceTypeID>
  <last_published>2011-02-01T00:00:01</last_published>
  <indexXML>&lt;?xml version=&quot;1.0&quot; encoding=&quot;UTF-8&quot;?&gt;
&lt;mdoxml version=&quot;1.0&quot;&gt;&lt;br&gt;&lt;/br&gt;
The Fibonacci sequence is&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
$1, 1, 2, 3, 5, 8, 13, 21 \ldots $&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
where each term is the sum of the two terms that go before it (i.e $1+1=2$, $1+2=3$, $2+3=5$ and so on.)&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
What is the sixth term of the Fibonacci type sequence that starts with $2$ and $38$ as the first two terms?&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
How many Fibonacci type sequences can you find containing the number $196$ as one of the terms where the sequence starts with two whole numbers $a$ and $b$ with $a&amp;amp;lt; b$?
&lt;div class=&quot;framework&quot;&gt;&lt;br&gt;&lt;/br&gt;
NOTES AND BACKGROUND&lt;br&gt;&lt;/br&gt;
&lt;p&gt;Fibonacci sequences are named after a merchant, one Leonardo of Pisa who had the nickname Fibonacci. On his travels, around 1200 AD, he learnt a lot of mathematics (particularly algebra) from the Arabs.&lt;/p&gt;
&lt;p&gt;The Arabs had developed the study of mathematics for about 800 years after the fall of the Greek and Roman civilisations. The story behind the methods in this problem spans this whole period.&lt;/p&gt;
&lt;p&gt;Equations in which one seeks whole number solutions, are called Diophantine equations after Diophantus (250 A.D) who developed the method and a special notation for recording it.&lt;/p&gt;
&lt;p&gt;For more about the stories of Diophantus and Fibonacci see the &lt;a href=&quot;http://turnbull.mcs.st-and.ac.uk/history/Indexes/HistoryTopics.html&quot;&gt;History of Maths website&lt;/a&gt; .&lt;/p&gt;
&lt;/div&gt;
&lt;br&gt;&lt;/br&gt;&lt;/mdoxml&gt;</indexXML>
  <solutionXML>&lt;?xml version=&quot;1.0&quot; encoding=&quot;UTF-8&quot;?&gt;
&lt;mdoxml version=&quot;1.0&quot;&gt;&lt;br&gt;&lt;/br&gt;
&lt;p&gt;&lt;span class=&quot;editorial&quot;&gt;Lots of people sent in the solution that
the sixth term of the Fibonacci sequence starting with $2$ and $38$
is $196$ and you found other sequences with $196$ as one of the
terms. Exactly how many other Fibonacci sequences contain the term
$196$?&lt;/span&gt; &lt;em class=&quot;editorial&quot; style=&quot;font-style: normal;&quot;&gt;A
lot of solutions as Jimmy rightly pointed out!&lt;/em&gt;&lt;/p&gt;
We are only looking for positive whole numbers. The terms increase
quickly so $196$ has to be one of the first few terms.
&lt;p&gt;The simplest Fibonacci sequence is:&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
$1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 253, \ldots$&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
and we denote the $n$th term of this sequence by $F(n)$.&lt;/p&gt;
&lt;p&gt;Starting with the terms $a, b$ (for $a$ and $b$ positive whole
numbers and $a &amp;lt; b$) we get the general Fib sequence:&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
$a$, $b$, $a+b$, $a+2b$, $2a+3b$, $3a+5b$, $5a+8b$, $8a+13b$,
$13a+21b$, $21a+34b$, $34a+55b$, $55a+89b$, $89a+144b$,
$\ldots$&lt;/p&gt;
&lt;p&gt;The $n$th term of the general Fib sequence $f(n) = aF(n-2) +
bF(n-1)$ and note that, if the term $196$ occurs in the sequence,
it can't be beyond the twelfth term as after that the terms are too
large.&lt;/p&gt;
&lt;p&gt;Here are some sequences containing $196$.&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;Sequences with $196$ as the first term&lt;/strong&gt;&lt;/p&gt;
 
&lt;table border=&quot;0&quot;&gt;
&lt;tbody&gt;
&lt;tr&gt;
&lt;td width=&quot;300&quot;&gt;$196, b, 196+b, 196+2b, \ldots$&lt;/td&gt;
&lt;td width=&quot;180&quot;&gt;for $b &amp;gt; 196$&lt;/td&gt;
&lt;/tr&gt;
&lt;/tbody&gt;
&lt;/table&gt;
&lt;br&gt;&lt;/br&gt;
&lt;strong&gt;Sequences with $196$ as the second term&lt;/strong&gt;&lt;br&gt;&lt;/br&gt;
 
&lt;table border=&quot;0&quot;&gt;
&lt;tbody&gt;
&lt;tr&gt;
&lt;td width=&quot;300&quot;&gt;$a, 196, \ldots$&lt;/td&gt;
&lt;td width=&quot;180&quot;&gt;for $1 &amp;lt; a &amp;lt; 195$&lt;/td&gt;
&lt;/tr&gt;
&lt;/tbody&gt;
&lt;/table&gt;
&lt;br&gt;&lt;/br&gt;
&lt;strong&gt;Sequences with 196 as the third term&lt;/strong&gt;&lt;br&gt;&lt;/br&gt;

&lt;p&gt;$1, 195, 196, \ldots$&lt;br&gt;&lt;/br&gt;
$2, 194, 196, \ldots$&lt;br&gt;&lt;/br&gt;
$...$&lt;br&gt;&lt;/br&gt;
$97, 99, 196, \ldots$&lt;br&gt;&lt;/br&gt;
$98, 98, 196, \ldots$ etc&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
So far we see that there are infinitely many sequences with $196$
as the first term; exactly $195$ with $196$ as the second term;
exactly $98$ with $196$ as the third term.&lt;/p&gt;
&lt;p&gt;To find all the remaining sequences containing $196$ we have to
find whole numbers $a$ and $b$ where:&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
$a + 2b = 196$&lt;br&gt;&lt;/br&gt;
or&lt;br&gt;&lt;/br&gt;
$2a + 3b = 196$&lt;br&gt;&lt;/br&gt;
or&lt;br&gt;&lt;/br&gt;
$3a + 5b = 196$&lt;br&gt;&lt;/br&gt;
etc.&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
In general we have to find whole number values of $a$ and $b$
satisfying&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
$aF(n-2) + bF(n-1) = 196$.&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
and so we need to find whole number solutions to these equations
for $n = 4, 5, 6, \ldots12$.&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
We shall consider one remaining case and leave the rest to the
reader.&lt;/p&gt;
&lt;p&gt;For $n = 6$ we seek values of $a$ and $b$ such that $3a + 5b =
196$&lt;/p&gt;
&lt;p&gt;There are no solutions for $a = 1$ because then b would not be a
whole number. We have already seen that $a = 2$ and $b = 38$ gives
$196$ as the sixth term. For larger values of $a$ we have to take
smaller values of $b$. For $a = 3$ or $4$ or $5$ or $6$ there are
again no solutions because b has to be a whole number.&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
For $a = 7$ we have:&lt;/p&gt;
 
&lt;table border=&quot;0&quot;&gt;
&lt;tbody&gt;
&lt;tr&gt;
&lt;td align=&quot;right&quot; width=&quot;100&quot;&gt;$21 + 5b$&lt;/td&gt;
&lt;td align=&quot;center&quot; width=&quot;20&quot;&gt;$=$&lt;/td&gt;
&lt;td align=&quot;left&quot; width=&quot;50&quot;&gt;$196$&lt;/td&gt;
&lt;/tr&gt;
&lt;tr&gt;
&lt;td align=&quot;right&quot; width=&quot;100&quot;&gt;$5b$&lt;/td&gt;
&lt;td align=&quot;center&quot; width=&quot;20&quot;&gt;$=$&lt;/td&gt;
&lt;td align=&quot;left&quot; width=&quot;50&quot;&gt;$175$&lt;/td&gt;
&lt;/tr&gt;
&lt;tr&gt;
&lt;td align=&quot;right&quot; width=&quot;100&quot;&gt;$b$&lt;/td&gt;
&lt;td align=&quot;center&quot; width=&quot;20&quot;&gt;$=$&lt;/td&gt;
&lt;td align=&quot;left&quot; width=&quot;50&quot;&gt;$35$&lt;/td&gt;
&lt;/tr&gt;
&lt;/tbody&gt;
&lt;/table&gt;
&lt;br&gt;&lt;/br&gt;

&lt;p&gt;giving the sequence $7, 35, 42, 77, 119, 196, \ldots$&lt;/p&gt;
&lt;p&gt;To find the remaining solutions for $n = 6$ we increase $a$ by
steps of $5$ and decrease $b$ by steps of $3$.&lt;br&gt;&lt;/br&gt;
There are five solutions for $n = 6$, which are:&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;$2, 38, \ldots$&lt;/li&gt;
&lt;li&gt;$7, 35, \ldots$&lt;/li&gt;
&lt;li&gt;$12, 32, \ldots$&lt;/li&gt;
&lt;li&gt;$17, 29,\ldots$&lt;/li&gt;
&lt;li&gt;$22, 26,\ldots$&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;You can use the same method to find the solutions for $n = 4, 5,
7, \ldots 12$&lt;/p&gt;
&lt;br&gt;&lt;/br&gt;&lt;/mdoxml&gt;</solutionXML>
  <noteXML>&lt;?xml version=&quot;1.0&quot; encoding=&quot;UTF-8&quot;?&gt;
&lt;mdoxml version=&quot;1.0&quot;&gt;&lt;br&gt;&lt;/br&gt;
Fibonacci sequences are named after a merchant, one Leonardo of
Pisa who had the nickname Fibonacci. On his travels, around 1200
AD, he learnt a lot of mathematics (particularly algebra) from the
Arabs.&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
The Arabs had developed the study of mathematics for about 800
years after the fall of the Greek and Roman civilisations. The
story behind the methods in this problem spans this whole period.
&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
Equations in which one seeks whole number solutions, are called
Diophantine equations after Diophantus (250 A.D) who developed the
method and a special notation for recording it. &lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
For more about the stories of Diophantus and Fibonacci see the
&lt;a href=&quot;http://www-groups.dcs.st-and.ac.uk/~history/&quot;&gt;History of
Maths website&lt;/a&gt; . &lt;br&gt;&lt;/br&gt;&lt;/mdoxml&gt;</noteXML>
  <clueXML/>
  <canonXML/>
  <end_user_role>2</end_user_role>
  <difficulty>5</difficulty>
  <keystage1>0</keystage1>
  <keystage2>0</keystage2>
  <keystage3>1</keystage3>
  <keystage4>0</keystage4>
  <keystage4plus>0</keystage4plus>
  <title>Fibs</title>
  <description>The well known Fibonacci sequence is 1 ,1, 2, 3, 5, 8, 13, 21....
How many Fibonacci sequences can you find containing the number 196
as one of the terms?</description>
  <spec_group>Admin
    <specifier>Workshop</specifier>
  </spec_group>
  <spec_group>Algebra
    <specifier>Linear equations</specifier>
  </spec_group>
  <spec_group>Algebra
    <specifier>Creating expressions/formulae</specifier>
  </spec_group>
  <spec_group>Sequences, Functions and Graphs
    <specifier>Fibonacci sequence</specifier>
  </spec_group>
  <spec_group>Algebra
    <specifier>Diophantine equations</specifier>
  </spec_group>
</resource>