Today we played a great Nigerian game called Dara.
A printable board and the rules can be found here.
Today we played a great Nigerian game called Dara.
A printable board and the rules can be found here.
The rules of a secret santa are that each person’s name is put in a hat and the names are mixed. Then each person must choose 1 name from the hat. If you choose your own name, you must put it back in the hat.
If 2 people do a secret santa there is only one solution: Person A gives to person B and person B gives to person A.
Stage 1: With 3 people, there are 2 possible ways. Can you think why?
Stage 2: Now how many different ways are there with 4 people?
The final challenge is to find the number of different scenarios with 5 people.
Solutions can be found here.
Did you know genuine snowflakes have six fold symmetry? We learnt this and more using the resources by Matt Parker here.
Today we worked on all our Christmas cracker puzzles.
Today we looked at ways to count on our fingers. Up to 10 is obviously straight forward, but can you do better?
We managed 1023. Can you work out how? Can you do better?
This idea came from a great maths book – Things to Make and Do in the Fourth Dimension This website link has lots of gadgets to play with.
It can be proven that there are no integer (whole number) solutions to
So there are no integer solutions to
But can you find positive integer values of a and b that nearly work? That give the answer 1 or -1?
Can you find a pattern to all your solutions?
What does a/b give a good approximation to?
Today we worked on this fun puzzle from Mathpickle.com.
You can work through the website at your own pace, but make sure you don’t read beyond the slide below until you have tried it yourself (Spoiler alert!).
This week we looked at an online simulation of the Galton board (or Bean Machine), which is a device where beads are dropped from a funnel at the top through ranks of nails.
Each time a bead strikes a nail it has a 50% chance to veer left and a 50% chance to veer right.
Each bead eventually drops in one of the column A, B, C, D or E.
1. Do you think the probabilities for a bead to land in A,B,C,D or E are equal ?
2. If not which column has the highest probability ?
3. Can you do a computer simulation of 10,000 beads dropping in a Galton
board using scratch or Python ?
When you throw two dice and add the numbers together what number are you most likely to get? What is the smallest number you can get? What is the biggest? Are all numbers equally likely?
We used python to simulate rolling a dice 100 times and plotted the results using pygal. Step by step instructions are here.
A big challenge would be to program the following game on python:
The game of Pig is a two player game played with two six-sided dice. The object of the game is to reach 100 points of more. Play is taken in turns. On each person’s turn that person has the option of either:
We really enjoyed working on the following puzzle from Nrich.
Thirteen nations competed in a sports tournament. Unfortunately, we do not have the final medal table, but we have the following pieces of information:
1. Turkey and Mexico both finished above Italy and New Zealand.
2. Portugal finished above Venezuela, Mexico, Spain and Romania.
3. Romania finished below Algeria, Greece, Spain and Serbia.
4. Serbia finished above Turkey and Portugal, both of whom finished below Algeria and Russia.
5. Russia finished above France and Algeria.
6. Algeria finished below France but above Serbia and Spain.
7. Italy finished below Greece and Venezuela, but above New Zealand.
8. Venezuela finished above New Zealand but below Greece.
9. Greece finished below Turkey, who came below France.
10. Portugal finished below Greece and France.
11. France finished above Serbia, who came above Mexico.
12. Venezuela finished below Mexico, and New Zealand came above Spain.
We came up with different strategies to sort out the medal table, and we were largely successful eventually, but we were all impressed by a quick way to solve it!