Easier Fibonacci puzzles

All these puzzles except one (which??) have the Fibonacci numbers as their answers. So now you have the puzzle and the answer - so what's le t? !ust the explanation of why the Fibonacci numbers are the answer - that's the real puzzle""

#uzzles on this page have airly strai$ht- orward and simple explanations as to why their solution involves the Fibonacci numbers%. #uzzles on the next page are harder to explain but they still have the Fibonacci &umbers as their solutions. So does a simple explanation exist or any o them?

Contents of this Page

#uzzles that are simply related to the Fibonacci numbers.... 'ric( )all patterns o *ariation - use +ominoes ,a(in$ a bee-line with Fibonacci numbers -hairs in a .ow/ &o &ei$hbourin$ 0eachers -hairs in a .ow/ 0he Friendly *ersion -hairs in a .ow/ 0he Antisocial *ersion Steppin$ Stones Fibonacci numbers or a chan$e" &o one" 0elephone 0rees 1eonardo's 1eaps Fix or Flip 0wo heads are better than one? 1eonardo's 1ane 'oat 'uildin$ #ause or a little re lection A #uzzle about puzzles" o A new puzzle idea...
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987 ..More..

Fibonacci numbers and Brick Wall Patterns

2 we want to build a bric( wall out o the usual size o bric( which has a len$th twice as lon$ as its hei$ht3 and i our wall is to be two units tall3 we can ma(e our wall in a

number o patterns3 dependin$ on how lon$ we want it/ 0here's 4ust one wall pattern which is 5 unit wide - made by puttin$ the bric( on its end. 0here are 6 patterns or a wall o len$th 6/ two side-ways bric(s laid on top o each other and two bric(s lon$-ways up put next to each other. 0here are three patterns or walls o len$th 7. 8ow many patterns can you ind or a wall o len$th 9? 8ow may di erent patterns are there or a wall o len$th :? 1oo( at the number o patterns you have ound or a wall o len$th 53 63 73 9 and :. +oes anythin$ seem amiliar? -an you ind a reason or this? Show me an example o why the Fibonacci numbers are the answer

Variation use !ominoes

A domino is ormed rom two s;uares. 2n this variation o the 'ric( )all puzzle3 we are not interested in the spots on the dominoes3 4ust their shape. 2 you li(e3 turn the dominoes over with the spots underneath so that they all loo( the same. Start by placin$ n dominoes lat on a table3 ace down3 and turn them so that all are in the <tall< or <=< position (as opposed to the <wide< or <oo< orientation). #ac( them neatly to$ether to ma(e a rectan$le. 0a(e the same number o dominoes and3 usin$ this rectan$le as the picture to aim at in a 4i$saw puzzle3 see how many other lat patterns you can ma(e which have exactly this shape. 0his time dominoes can be placed in either the tall or wide direction in your desi$n. ,a(e a table o the patterns you have ound and the number o patterns possible usin$ 5 domino (easy")3 6 dominoes3 7 dominoes3 and so on3 not or$ettin$ to include the ori$inal rectan$le desi$n too.
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987 ..More..

"aking a bee line with Fibonacci numbers

8ere is a picture o a bee startin$ at the end o some cells in its hive. 2t can start at either cell # or cell $ and mo%es only to the right (that is3 only to a cell with a hi$her number in it). 0here is only one path to cell 53 but two ways to reach cell 6/ directly or via cell 5. For cell 73 it can $o 5673 573 or 673 that is3 there are three di erent paths. 8ow many paths are there rom the start to cell number n? 0he answer is a$ain the Fibonacci numbers. -an you explain why?

0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987 ..More..

Chairs in a row& 'o 'eighbouring (eachers

0his time we have n chairs in a row and a room ul o people. 2 you've ever been to a $atherin$ where there are teachers present3 you will (now they always tal( about their school>colle$e (borin$"). So we will insist that no two teachers should sit next to each other alon$ a row o seats and count how many ways we can seat n people3 i some are teachers (who cannot be next to each other) and some are not . 0he number o seatin$ arran$ements is always a Fibonacci number/ # chair $ chairs or or or $ ways ) ways

since we do not allow ) chairs 3 3 3 this time 3 and

or are not allowed.

* ways

?ou can write the se;uences usin$ ( or 0eacher and ' or &ormal people - oops - 2 mean &ot-a-teacher "" 0here will always be a Fibonacci number o se;uences or a $iven number o chairs3 i no two teachers are allowed to sit next to each other"
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987 ..More..

Chairs in a +ow& (he Friendly Version

0his variation is a little riendlier to teachers. @veryone3 teacher or not 3 must not sit on their own3 but a teacher must be next to another teacher or the teacher will be blue3 and a non-teacher must be next to a nonteacher or she will be red- aced with embarrassment" So we can have ... ... since the two teachers have the other teacher next to them. 0he non-teacher on the ri$ht o these 7 will now also need another non-teacher on his other side so that he too is not le t on his own. A special extracondition in this puzzle is that any seating arrangement must also start with a teacher" # chair/ , ways

$ chairs/ # way ) chairs/ # way - chairs/ or $ ways * chairs/ ) ways or or 0here will always be a Fibonacci number o arran$ements if we start with a teacher. )hat happens i we start with a non-teacher always? )hat happens i we have no restriction on the irst seat? 0he answers to these two ;uestions also involve the Fibonacci numbers too""
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987 ..More..

Chairs in a +ow& (he .ntisocial Version/

0his time we have the antisocial version which we may also perhaps call the @n$lish version" As you (now3 @n$lish people can be very reserved sometimes and li(e not to bother people by sittin$ next to them i they can possibly help it. So this time we still consider rows o seats o di erent len$ths3 as be ore3 but this time insist that no one can sit next to anyone else" 0here may be no one in the row3 or 4ust one person3 but wherever there are two people or more3 they must always be separated by at least one empty seat so that no one sits next to anyone else" 8ere is a row o 5 seat which is empty/ and a row o 5 seat which is occupied/ so there are 6 ways to ill a row o 5 seat in this puzzle. )hat about a row o 6 seats/

so there are 7 ways to ill this row. )hat about 7 seats in a row? and 9? See .ntisocial !inner Parties by . 1ewis in Fibonacci Quarterly 5AA:3 vol 773 pa$es 7B=-7CD.
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987 ..More..

0tepping 0tones
Some steppin$ stones cross a small river. 8ow many ways bac( to the ban( are there i you are standin$ on the n-th stone? ?ou can either step on to the next stone or else hop over one stone to land on the next. 2 you are on stone number 53 you can only step (s) on to the ban(/ 5 route. 2 you are on stone 63 you can either step on to stone 5 and then the ban( (step3 step or ss) E. you can hop directly onto the ban( (h)/ step ----- hop ----F 6 se;uences From stone 73 you can step3 step3 step (sss) or else hop over stone 6 and then step (hs) or else step on to stone 6 and then hop over stone 5 to the ban( (sh)/ step step step step sss hs step ss

----- hop ----F ----- hop ----F 7 se;uences

step

sh

)hy are the Fibonacci numbers appearin$? G)ith than(s to ,ichael )est or brin$in$ this puzzle to my attention.H
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987 ..More..

Fibonacci numbers for a change/

Some countries have coins or notes o value 5 and 6. For instance3 in 'ritain we have coins with values 5 penny (5p) and 6 pence (6p). 0he ISA has 5 cent and : cent coins

but not a 6 cents coin3 but it does have ten dollar and twenty dollar bills (J5D3 J6D). 0his problem uses coins or notes o values 5 and 6. 2 we have 4ust 5p and 6p coins3 in how many ways can we ma(e up a $iven amount o money with 4ust these two coins? For instance/1p = 1p -- only one way but 2p = 1p+1p or 2p -- two ways, and 3p = 1p+1p+1p or 1p+2p or 2p+1p -- t ree ways

Since we are lettin$ 5pK6p and 6pK5p be di erent solutions3 then we are interested in the order that the coins are $iven also. ?ou will have $uessed how many ways there are to ma(e up 9p and the $eneral answer by now" 'ut the challen$e is/ can you explain why the Fibonacci numbers appear yet a$ain? Follow up/ )hat i we are interested in collections o coins rather than se1uences? 8ere 5pK6p is the same collection as 6pK5p. 8ow many collections are there? 2 the coins sum to n pence3 these are called partitions of n and have many applications. -an you ind a simple lin( between answers to the -han$e puzzle and your answers to the Steppin$ Stones puzzle?
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987 ..More..

'o one/
?our youn$er sister is playin$ with her coloured rods. 0hey are o various len$ths3 rom sin$le ones (len$th 5 which are cubes) which are oran$e3 len$th 6 are ma$enta3 len$th 7 are blue and so on. len$th 5 len$th 6 len$th 7 len$th 9 len$th : ... ... 8owever3 her brother has 4ust ta(en all the len$th 5 rods (the oran$e cubes) to play with but has le t her with all the rest. So in how many ways can she make a line of length N if there are no rods of length 1? For a line o len$th 73 she can use only a rod o len$th 7. 'ut or a line o len$th 93 she can use either a rod o len$th 9 or else two rods o len$th 6. )hen it comes to ma(in$ a line o len$th :3 she has several ways o doin$ it/ one rod o len$th :/ a rod o len$th 7 ollowed by one o len$th 6/ E. she could put the rod o len$th 6 irst and the 7-rod a ter it/

)e can summarise this as ollows/ : L 6 K 7 L 7 K 6 and we can collect the possibilities in a table which 4ust uses numbers/ length ) L 7 length - L 6 K 6 length * L : L 6 K 7 L 7 K 6 So what we are doin$ is listin$ sums where the number E&@ must not appear in the sum. 0he order o the numbers matters so that 6K7 is not the same sum as 7K6 in this problem. 0echnically3 the collection o sums which total a $iven value & are called the partitions of '. 8ere we are indin$ all the partitions o & that do not use the number 5. 2t will always be a Fibonacci number"
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987 ..More..

(elephone (rees
0his problem is about the best way to pass on news to lots o people usin$ the telephone. )e could 4ust phone everyone ourselves3 so 59 people to share the news with would ta(e 59 separate calls. Suppose each call ta(es 4ust 5 minute3 then we will be on the phone at least 59 minutes (i everyone answers their phone immediately). Can we do better than this? )e could use the spea(ers on the phone - the <hands ree< acility which puts the sound out on a spea(er rather than throu$h the handset so that others in the room can hear the call too. For the sa(e o a puzzle3 let's suppose that 6 people hear each call. 0hat would halve the number o calls 2 need to ma(e. ,y 59 calls now reduces to C. Can we do better still? )ell3 we could as( each person who receives a call to not only put the call throu$h the loudspea(ers but also to do some phonin$ too. So i two people hear the messa$e3 they could each phone two others and pass it on in the same way and so on. 8ere's what it loo(s li(e i 2 have 59 people to phone in this system as the calls <cascade<. 2n the irst minute3 my irst call is heard by A and '. A's call is heard by both - and +% ''s call by @ and F3 and so on as in this dia$ram/
!e "------------#----------$ %&rst !&nute se)ond !&nute ' "----#----$ * "--#--$ + "--#--$ ( "-----#----$ , "--#--$ "--#--$

t &rd !&nute

So all 59 people have heard the news in only 7 minutes" G0his is an example o recursion - applyin$ the same optimizin$ principle at all levels o a problem.H Can we do even better than this? ?es - i all the people $ot to$ether in one room3 it would only ta(e one minute" So let's assume that 2 cannot $et everyone to$ether and 2 have to use the phone. &ow here is your puzzle. 0he phones in my company are rather old and do not have an external spea(er (and no <con erence call< acility) - only one person can hear each call. So 2 decide that 2 will phone only two people usin$ two separate calls. 2 shall $ive them the news and then as( that they do the same and phone 4ust two more people only. )hat is the shortest time that the news can pass to 59 people? 5. +raw the cascade tree o telephone calls3 or the telephone tree or this problem. 2t be$ins li(e this/
2. 3. 4. 5. 6. 7. 8. 9. 10. 11. . !e "------------#----$ $ $

%&rst !&nute se)ond !&nute t &rd !&nute

+ $ , $ "--#-$ $ "--#--$ "--#--$ $ ... ... ... ... ... ... ... ..

* "--#--$

' "----#----$

$ $

( "--#--$

8ow does the tree continue? 56. )hat is the maximum number o people in the o ice that could hear the news within & minutes usin$ this method? )hy is the answer related to the Fibonacci numbers? 2nspired by !oan .einthaler's !iscrete "athematics is .lready in the Classroom But 2t3s 4iding in Discrete athematics in Schools3 +2,A-S Series in +iscrete ,athematics and 0heoretical -omputer Science3 *olume 7B3 5AAC3 pa$es 6A:-6AA. 0his is a $reat boo("
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987 ..More..

5eonardo3s 5eaps
2 try and ta(e the stairs rather than the elevator whenever 2 can so that 2 $et a little more exercise these days. 2 2'm in a hurry3 2 can leap two stairs at once otherwise it's the usual one stair at a time. 2 2 mix these two (inds o action - step onto the next or else leap over

the next onto the ollowin$ one - then in how many di erent ways can 2 $et up a li$ht o n steps? For example3 or 7 stairs3 2 can $o 5/ step step step or else 6/ leap step or inally 7/ step leap ...a total o 7 ways to climb 7 steps. 8ow many ways are there to climb a set o 9 stairs? : stairs? n stairs? )hy? Adapted rom .pplied Combinatorics (0hird @dition) by A 0uc(er3 )iley3 5AA:3 @xample 63 pa$es 6=D-6=5.
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987 ..More..

Fix or Flip6
#ermutations are re-arran$ements o a se;uence o items into another order. For instance3 we can permute +3'3-3A into A3'3-3+.
be%ore5 +(*' a%ter 5 '(*+

8ere the + has swopped places with the A whilst the ' and - have not moved. 2n $eneral3 since we can place A in any o the 9 places3 leavin$ 7 places or ' (9x7L56 ways to place A and ') and so - can $o in any o the remainin$ 6 places (so + has 5 choice le t)3 then there are 9x7x6L69 permutations o 9 ob4ects. 2n $eneral3 there are nx(n-5)x...x7x6 permutations o n ob4ects. Suppose we restrict how we may move (permute) an ob4ect to either fix it3 leavin$ it in the same position or flip it with a nei$hbour - two items next to each other swop places (they cannot now be moved a$ain). 8owever3 not all permutations are made o 4ust these two (inds o trans ormation. 8ere are 9 examples o permutations on 9 ob4ects/ A3 '3 - and +/
be%ore5 '(*+ 0his is not a fix a%ter 5 than 5 place. +(*' be%ore5 8owever3 '(*+

or flip permutation since the A and + have moved more

this is since nothin$ has moved - all 9 items were fixed"

a%ter 5 '(*+ be%ore5 '(*+ ' and A have flipped a%ter 5 permutation. ('*+ be%ore5 '(*+ a%ter 5 All ob4ects ('+*

and - and + remain fixed and so this is a fix or flip

have been lipped with a nei$hbour.

For 7 ob4ects3 A'-3 we have 7x6x5LB permutations/

be%ore5 '(* a%ter 5 '(* '(* '*( '(* ('* '(* (*' '(* *'( '(* *('

Enly the irst three are fix or flip permutations. 2n the ourth A has moved more than 5 place and in the last two - has moved 6 places. 4ow many fix or flip permutations are there for - ob7ects6 for *6 for n ob7ects6 Why6
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987 ..More..

(wo heads are better than one6

Isually3 i usin$ a coin to ma(e a decision3 it is somethin$ li(e <8eads 2 win3 0ails you lose< "" )hat about tossin$ a coin until two heads appear one a ter the other? 2 we toss a coin twice3 then there are our possible outcomes/ 003 083 80 and 88 2n only # o these our do we $et two heads. )hat happens i we have to wait or exactly three tosses be ore we $et two heads? 0his time the possibilities are 0003 0083 0803 8083 8003 and 088 &ote that we do not have 880 or 888 as we would have $ot two heads a ter only 6 tosses which was covered earlier. So there is a$ain 4ust # way to $et two heads appearin$3 8 on the second and 8 on the third toss. 8ow many ways are there i 88 appears on the 7rd-and-9th tosses? 00003 00083 00803 00883 08003 08083 80883 80803 80083 8000. 0his time we ind $ se;uences. Can you find a method of generating all the se1uences of n coin tosses that do not ha%e 44 until the last two tosses6 Can you find a formula for how many of these will end in 446 8P(28'.5 E9(+./// )hat about the number o se;uences o n coin tosses that end with three 8eads to$ether? +oes this have any relationship to the Fibonacci numbers?

0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987 ..More..

5eonardo3s 5ane
0his puzzle was su$$ested by #aul +ixon3 a mathematics teacher at -oulby &ewham School3 ,iddlesbrou$h. A new estate o houses is to be built on one side o a street - let's call it 5eonardo3s 5ane. 0he houses are to be o two types/ a sin$le house (a detached house) or two houses 4oined by a common wall (called <a pair o semi-detached houses< in the IM) which ta(e up twice the ronta$e on the lane as a sin$le house. For instance3 i 4ust 7 houses could be itted on to the plot o land in a row3 we could su$$est/ +++/ 0hree detached houses S+/ a pair o semi's irst ollowed by a detached house

+S/ a detached house ollowed by a pair o semi's

2 you were the architect and there was space or 4ust n dwellin$s on the 1ane o 4ust the two (inds mentioned above3 what combinations could you use alon$ the lane?
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987 ..More..

Boat Building
GSu$$ested by +mitry #ortnoy (Cth $rade)H A boat buildin$ company ma(es two (inds o boat/ a canoe3 which ta(es a month to ma(e and a sailing dinghy and they two months to build. 0he company only has enou$h space to build one boat at a time but it does have plenty o customers waitin$ or a boat to be built.

Suppose the area where the boats are built has to be closed or maintenance soon/ i it is closed a ter one more months wor(3 the builders can only build one boat - a canoe - be ore then. 1et's write this plan as C% i it is to be closed a ter 6 months wor(3 it can @208@. build 6 canoes (CC) E. @1S@ build one din$hy (!)3 so there are two plans to choose rom% i it closed in three months time3 it could ma(e 7 canoes (---) or a din$hy ollowed by a canoe (!C) or a canoe and then a din$hy (C!)% so there are three choices o plan. )hat choices are there i it closed a ter 9 months? ... or a ter : months? ... or a ter n months?

?ou can adapt this puzzle/ 5. .. to lar$er boats/ patrol boats ta(in$ a year to build or container ships which ta(e two years to ma(e 6. .. or you can ma(e the problem smaller3 and consider model boats3 a small (it ta(in$ one month on your des( or a lar$er (it ta(in$ two months. 8ow many more ideas can you come up with or a similar puzzle?
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987 ..More..

Pause for a little reflection

2 you loo( at a window o one sheet o lat3 clear $lass3 what's on the other side is ;uite clear to see. 'ut i you loo( throu$h the same piece o $lass when it is dar( on the other side3 or instance into a shop window when the shop is dar(3 you can see your own re lection. 0his time the clear $lass is behavin$ li(e a mirror. 2 you loo( very closely3 you will see that your re lection is actually doubled - there are two ima$es o your ace side by side. 0his is because your ima$e is not only re lected o the top sur ace o the $lass but also $ets re lected rom the other side of the glass too which is called internal reflection. So a natural ;uestion is what happens if we have double gla!ing which has two sheets o $lass separated by an air $ap3 that is3 9 re lectin$ sur aces? 8an$ on a minute ... what about three surfaces?? 1et's loo( at that irst" For three sur aces ( or example two sheets o $lass restin$ on each other) what happens depends on whether we are loo(in$ through both sheets o $lass (the rays o li$ht come in on one side o the window but exit rom the other) or whether we are loo(in$ at our own re lection rom the sheets (the rays o li$ht enter and leave rom the same side o the window). )e can i$nore the re lection o the top sur ace - the li$ht bounces o and we $et one re lection. 0he other cases are the interestin$ ones - where all the re lections are internal

reflections. 2n other words3 the li$ht rays must have actually penetrated the $lass and we can $et re lections rom one or perhaps both or even none o the two internal surfaces. )e may even $et more re lections as the li$ht bounces o the sur aces a$ain and a$ain3 some o the li$ht escapin$ each time. 0he dia$ram here shows the possible re lections ordered by the number of internal reflections3 startin$ with none (the li$ht $oes strai$ht throu$h) to a sin$le internal re lection ( rom either o the internal sur aces so there are two cases) and then exactly two internal re lections and inally we have shown 7 internal re lections. 2 you re lect on this3 you'll notice that the Fibonacci numbers seem to be ma(in$ themselves clearly visible ($roan"). Why? GAdvanced puzzle/ "hat does happen with # reflecting surfaces in a double gla!ed window?H +eflections across (wo and (hree :lass Plates by * @ 8o$$att !r and ,ar4orie 'ic(nell-!ohnson in $he Fibonacci Quarterly3 volume 5C (5ACA)3 pa$es 55= - 596.
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987 ..More..

. Puzzle about Puzzles

0his is a puzzle about puzzles - the puzzle is to desi$n your own puzzle"" ?ou mi$ht have noticed that ;uite a ew o the puzzles above are really <the same< but the names and situations are chan$ed a bit. 2t is airly easy to see how 5eonardo3s 5eaps is the same as the 5p and 6p coin change puzzle and also it is 4ust 5eonardo3s 5ane but sli$htly dis$uised. So... can you de%ise your own puzzle where the answer is the Fibonacci numbers6 0he reason the puzzles above are <the same< is that the explanation o the solution o each o them involves the Fibonacci (recurrence) .ule/ F(n) L F(n-5) K F(n-6) to$ether with the <initial conditions< that F(D)LD and F(5)L5 ?our puzzle should be based around this relationship.

!o you want to see your name on this page6

#lease do email me (see at the oot o this pa$e) with any new variations that you ind. ?ou can then share your idea with all the other readers o this pa$e. 1et's see how bi$ a collection we can build"

. new puzzle idea;;;

8ere is one puzzle idea to $et you thin(in$. 2t is about one o my avourite topics - eatin$ chocolate" Suppose that we need to brea( a strip o chocolate into either 4ust 5 s;uare or a 6-s;uare piece. 0his ma(es it similar to the other puzzles above. &ow wse need to care ully desribe a puzzle so $ive the Fibonacci series as the answers. ?ou may have lots o ideas3 but not all o them will $ive the Fibonacci numbers.... here is one idea that does not $ive the Fibonacci numbers as its solution/ Suppose we are on a diet but 4ust love chocolate. So we are allowed either a sin$le s;uare or a 6-s;uare piece - one or the other but not both" - and that will be our choice or one day. 8ow many choice patterns are there i we eat chocolate on 6 days? 5. 6. 7. 9. Answer/ )e could have 5 s;uare on day 5 and 5 on day 63 or a 6-s;uare piece on days 5 and 5 s;uare on days 63 or 5 and then 6 or even (and here we are desperate") a 6-s;uare piece on both days.

0hat $ives 9 possibilities over 6 days. 'ut 9 is not a Fibonacci number" Actually3 i we see what could happen over 7 days and 9 and so on3 we $et an interestin$ series o numbers that you will reco$nize - but what is it? So now can you make a change to the puzzle so that it does give the Fibonacci numbers?
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987 ..More..

"ore 5inks and +eferences

0he Amazin$ ,athematical Eb4ect Factory has an interestin$ section on Fibonacci Numbers which contains explanations or some o the puzzles on this pa$e and the relationships between them.
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987 ..More..

Where to 'ow6
Fibonacci 8ome #a$e 0his is the irst pa$e on 0he next 0opic is... 0he Fibonacci &umbers Fibonacci #uzzles. 0he ,athematical )orld and Nolden Section in &ature o Fibonacci and #hi 8arder Fibonacci #uzzles O 5AAB-6DD7 +r .on Mnott ibandphi P ron(nott.com updated 5: Au$ust 6DD6