Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
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 left? Just the explanation of why the Fibonacci numbers are the answer - that's the real puzzle!!
Puzzles on this page have fairly straight-forward and simple explanations as to why their solution involves the Fibonacci numbers;. Puzzles on the next page are harder to explain but they still have the Fibonacci Numbers as their solutions. So does a simple explanation exist for any of them?
Puzzles that are simply related to the Fibonacci numbers.... Brick Wall patterns o Variation - use Dominoes Making a bee-line with Fibonacci numbers Chairs in a Row: No Neighbouring Teachers Chairs in a Row: The Friendly Version Chairs in a Row: The Antisocial Version Stepping Stones Fibonacci numbers for a change! No one! Telephone Trees Leonardo's Leaps Fix or Flip Two heads are better than one? Leonardo's Lane Boat Building Pause for a little reflection A Puzzle 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..
number of patterns, depending on how long we want it: There's just one wall pattern which is 1 unit wide - made by putting the brick on its end. There are 2 patterns for a wall of length 2: two side-ways bricks laid on top of each other and two bricks long-ways up put next to each other. There are three patterns for walls of length 3. How many patterns can you find for a wall of length 4? How may different patterns are there for a wall of length 5? Look at the number of patterns you have found for a wall of length 1, 2, 3, 4 and 5. Does anything seem familiar? Can you find a reason for this? Show me an example of why the Fibonacci numbers are the answer
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987 ..More..
5 ways
You can write the sequences using T for Teacher and N for Normal people - oops - I mean Not-a-teacher !! There will always be a Fibonacci number of sequences for a given number of chairs, if 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..
2 chairs: 1 way 3 chairs: 1 way 4 chairs: or 2 ways 5 chairs: 3 ways or or There will always be a Fibonacci number of arrangements if we start with a teacher. What happens if we start with a non-teacher always? What happens if we have no restriction on the first seat? The answers to these two questions also involve the Fibonacci numbers too!!
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987 ..More..
so there are 3 ways to fill this row. What about 3 seats in a row? and 4? See Antisocial Dinner Parties by R Lewis in Fibonacci Quarterly 1995, vol 33, pages 368-370.
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987 ..More..
Stepping Stones
Some stepping stones cross a small river. How many ways back to the bank are there if you are standing on the n-th stone? You can either step on to the next stone or else hop over one stone to land on the next. If you are on stone number 1, you can only step (s) on to the bank: 1 route. If you are on stone 2, you can either step on to stone 1 and then the bank (step, step or ss) OR you can hop directly onto the bank (h): step ----- hop ----> 2 sequences From stone 3, you can step, step, step (sss) or else hop over stone 2 and then step (hs) or else step on to stone 2 and then hop over stone 1 to the bank (sh): step step step step sss hs step ss
step
sh
Why are the Fibonacci numbers appearing? [With thanks to Michael West for bringing this puzzle to my attention.]
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987 ..More..
but not a 2 cents coin, but it does have ten dollar and twenty dollar bills ($10, $20). This problem uses coins or notes of values 1 and 2. If we have just 1p and 2p coins, in how many ways can we make up a given amount of money with just 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 -- three ways
Since we are letting 1p+2p and 2p+1p be different solutions, then we are interested in the order that the coins are given also. You will have guessed how many ways there are to make up 4p and the general answer by now! But the challenge is: can you explain why the Fibonacci numbers appear yet again? Follow up: What if we are interested in collections of coins rather than sequences? Here 1p+2p is the same collection as 2p+1p. How many collections are there? If the coins sum to n pence, these are called partitions of n and have many applications. Can you find a simple link between answers to the Change puzzle and your answers to the Stepping Stones puzzle?
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987 ..More..
No one!
Your younger sister is playing with her coloured rods. They are of various lengths, from single ones (length 1 which are cubes) which are orange, length 2 are magenta, length 3 are blue and so on. length 1 length 2 length 3 length 4 length 5 ... ... However, her brother has just taken all the length 1 rods (the orange cubes) to play with but has left 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 of length 3, she can use only a rod of length 3. But for a line of length 4, she can use either a rod of length 4 or else two rods of length 2. When it comes to making a line of length 5, she has several ways of doing it: one rod of length 5: a rod of length 3 followed by one of length 2: OR she could put the rod of length 2 first and the 3-rod after it:
We can summarise this as follows: 5 = 2 + 3 = 3 + 2 and we can collect the possibilities in a table which just uses numbers: length 3 = 3 length 4 = 2 + 2 length 5 = 5 = 2 + 3 = 3 + 2 So what we are doing is listing sums where the number ONE must not appear in the sum. The order of the numbers matters so that 2+3 is not the same sum as 3+2 in this problem. Technically, the collection of sums which total a given value N are called the partitions of N. Here we are finding all the partitions of N that do not use the number 1. It will always be a Fibonacci number!
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987 ..More..
Telephone Trees
This problem is about the best way to pass on news to lots of people using the telephone. We could just phone everyone ourselves, so 14 people to share the news with would take 14 separate calls. Suppose each call takes just 1 minute, then we will be on the phone at least 14 minutes (if everyone answers their phone immediately). Can we do better than this? We could use the speakers on the phone - the "hands free" facility which puts the sound out on a speaker rather than through the handset so that others in the room can hear the call too. For the sake of a puzzle, let's suppose that 2 people hear each call. That would halve the number of calls I need to make. My 14 calls now reduces to 7. Can we do better still? Well, we could ask each person who receives a call to not only put the call through the loudspeakers but also to do some phoning too. So if two people hear the message, they could each phone two others and pass it on in the same way and so on. Here's what it looks like if I have 14 people to phone in this system as the calls "cascade". In the first minute, my first call is heard by A and B. A's call is heard by both C and D; B's call by E and F, and so on as in this diagram:
me /------------^----------\ first minute second minute A /----^----\ C /--^--\ D /--^--\ B /-----^----\ E /--^--\ F /--^--\
third minute
So all 14 people have heard the news in only 3 minutes! [This is an example of recursion - applying the same optimizing principle at all levels of a problem.] Can we do even better than this? Yes - if all the people got together in one room, it would only take one minute! So let's assume that I cannot get everyone together and I have to use the phone. Now here is your puzzle. The phones in my company are rather old and do not have an external speaker (and no "conference call" facility) - only one person can hear each call. So I decide that I will phone only two people using two separate calls. I shall give them the news and then ask that they do the same and phone just two more people only. What is the shortest time that the news can pass to 14 people? 1. Draw the cascade tree of telephone calls, or the telephone tree for this problem. It begins like this:
2. 3. 4. 5. 6. 7. 8. 9. 10. 11. . me /------------^----\ \ \
D \ E F \ /--^-\ \ /--^--\ /--^--\ \ ... ... ... ... ... ... ... ..
C /--^--\
A /----^----\
\ \
B /--^--\
How does the tree continue? 12. What is the maximum number of people in the office that could hear the news within N minutes using this method? Why is the answer related to the Fibonacci numbers? Inspired by Joan Reinthaler's Discrete Mathematics is Already in the Classroom But It's Hiding in Discrete Mathematics in Schools, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Volume 36, 1997, pages 295-299. This is a great book!
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987 ..More..
Leonardo's Leaps
I try and take the stairs rather than the elevator whenever I can so that I get a little more exercise these days. If I'm in a hurry, I can leap two stairs at once otherwise it's the usual one stair at a time. If I mix these two kinds of action - step onto the next or else leap over
the next onto the following one - then in how many different ways can I get up a flight of n steps? For example, for 3 stairs, I can go 1: step-step-step or else 2: leap-step or finally 3: step-leap ...a total of 3 ways to climb 3 steps. How many ways are there to climb a set of 4 stairs? 5 stairs? n stairs? Why? Adapted from Applied Combinatorics (Third Edition) by A Tucker, Wiley, 1995, Example 2, pages 280-281.
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987 ..More..
Fix or Flip?
Permutations are re-arrangements of a sequence of items into another order. For instance, we can permute D,B,C,A into A,B,C,D.
before: DBCA after : ABCD
Here the D has swopped places with the A whilst the B and C have not moved. In general, since we can place A in any of the 4 places, leaving 3 places for B (4x3=12 ways to place A and B) and so C can go in any of the remaining 2 places (so D has 1 choice left), then there are 4x3x2=24 permutations of 4 objects. In general, there are nx(n-1)x...x3x2 permutations of n objects. Suppose we restrict how we may move (permute) an object to either fix it, leaving it in the same position or flip it with a neighbour - two items next to each other swop places (they cannot now be moved again). However, not all permutations are made of just these two kinds of transformation. Here are 4 examples of permutations on 4 objects: A, B, C and D:
before: ABCD This is not a fix-or-flip after : than 1 place. DBCA before: However, ABCD
after : ABCD before: ABCD B and A have flipped after : permutation. BACD before: ABCD after : All objects BADC
Only the first three are fix-or-flip permutations. In the fourth A has moved more than 1 place and in the last two C has moved 2 places. How many fix-or-flip permutations are there for 4 objects? for 5? for n objects? Why?
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987 ..More..
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987 ..More..
Leonardo's Lane
This puzzle was suggested by Paul Dixon, a mathematics teacher at Coulby Newham School, Middlesbrough. A new estate of houses is to be built on one side of a street - let's call it Leonardo's Lane. The houses are to be of two types: a single house (a detached house) or two houses joined by a common wall (called "a pair of semi-detached houses" in the UK) which take up twice the frontage on the lane as a single house. For instance, if just 3 houses could be fitted on to the plot of land in a row, we could suggest: DDD: Three detached houses SD: a pair of semi's first followed by a detached house
If you were the architect and there was space for just n dwellings on the Lane of just the two kinds mentioned above, what combinations could you use along the lane?
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987 ..More..
Boat Building
[Suggested by Dmitry Portnoy (7th grade)] A boat building company makes two kinds of boat: a canoe, which takes a month to make and a sailing dinghy and they two months to build. The company only has enough space to build one boat at a time but it does have plenty of customers waiting for a boat to be built.
Suppose the area where the boats are built has to be closed for maintenance soon: if it is closed after one more months work, the builders can only build one boat - a canoe - before then. Let's write this plan as C; if it is to be closed after 2 months work, it can EITHER build 2 canoes (CC) OR ELSE build one dinghy (D), so there are two plans to choose from; if it closed in three months time, it could make 3 canoes (CCC) or a dinghy followed by a canoe (DC) or a canoe and then a dinghy (CD); so there are three choices of plan. What choices are there if it closed after 4 months? ... or after 5 months? ... or after n months?
You can adapt this puzzle: 1. .. to larger boats: patrol boats taking a year to build or container ships which take two years to make 2. .. or you can make the problem smaller, and consider model boats, a small kit taking one month on your desk or a larger kit taking two months. How many more ideas can you come up with for a similar puzzle?
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987 ..More..
reflections. In other words, the light rays must have actually penetrated the glass and we can get reflections from one or perhaps both or even none of the two internal surfaces. We may even get more reflections as the light bounces off the surfaces again and again, some of the light escaping each time. The diagram here shows the possible reflections ordered by the number of internal reflections, starting with none (the light goes straight through) to a single internal reflection (from either of the internal surfaces so there are two cases) and then exactly two internal reflections and finally we have shown 3 internal reflections. If you reflect on this, you'll notice that the Fibonacci numbers seem to be making themselves clearly visible (groan!). Why? [Advanced puzzle: What does happen with 4 reflecting surfaces in a double glazed window?] Reflections across Two and Three Glass Plates by V E Hoggatt Jr and Marjorie Bicknell-Johnson in The Fibonacci Quarterly, volume 17 (1979), pages 118 - 142.
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987 ..More..
Please do email me (see at the foot of this page) with any new variations that you find. You can then share your idea with all the other readers of this page. Let's see how big a collection we can build!
Here is one puzzle idea to get you thinking. It is about one of my favourite topics - eating chocolate! Suppose that we need to break a strip of chocolate into either just 1 square or a 2-square piece. This makes it similar to the other puzzles above. Now wse need to carefully desribe a puzzle so give the Fibonacci series as the answers. You may have lots of ideas, but not all of them will give the Fibonacci numbers.... here is one idea that does not give the Fibonacci numbers as its solution: Suppose we are on a diet but just love chocolate. So we are allowed either a single square or a 2-square piece - one or the other but not both! - and that will be our choice for one day. How many choice patterns are there if we eat chocolate on 2 days? 1. 2. 3. 4. Answer: We could have 1 square on day 1 and 1 on day 2, or a 2-square piece on days 1 and 1 square on days 2, or 1 and then 2 or even (and here we are desperate!) a 2-square piece on both days.
That gives 4 possibilities over 2 days. But 4 is not a Fibonacci number! Actually, if we see what could happen over 3 days and 4 and so on, we get an interesting series of numbers that you will recognize - 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..
Where to Now?
Fibonacci Home Page This is the first page on The next Topic is... The Fibonacci Numbers Fibonacci Puzzles. The Mathematical World and Golden Section in Nature of Fibonacci and Phi Harder Fibonacci Puzzles 1996-2003 Dr Ron Knott fibandphi @ ronknott.com updated 15 August 2002