Voting systems

voting

Finding betting ways to vote

We looked at different ways to decide which candidate or choice won a vote. We realised that by using different methods, different candidates won the vote. This raises the troubling question about whether our way of voting is the best and the fairest. Here is a link to the activity we did and here is a link to an interactive website that discuss precisely this question. In the UK, the voting system is relative majority. However, it could be a good thing if we use absolute majority voting, because it would allow members of smaller parties to also get a voice. This could lead to a bigger number of parties rather than two or three major parties. However, there is no perfect voting system.

Gabriel’s problem

Gabriel box

Gabriel wrote the numbers 1-9 in a 3×3 grid.

He then multiplied together all the numbers in each row and wrote the resulting product next to that row.
He also multiplied the numbers in each
column together, and wrote the product
under that column.
He then rubbed out the numbers 1-9.

Can you work out where Gabriel placed the numbers 1-9?

Did you have more information than you needed?

This puzzle comes directly from this NRich page, with the pdf of the problem available here.

Parable of the Polygons

polygons

Today we looked at this “playable post on the nature of society”. It is a great activity to make you think about how you can positively contribute to society becoming less segregated.

We tried to work out the maths behind the applet. Where does 95% come from in the screenshot from above?? In the javascript for the applet you can see that a measure of “sameness” is used which involves the fraction of neighbours that are the same as you. Can you create/recreate the algorithm used to find the 95%?

91 card game

 

cardsfor91

91 card game

This card game can be played with two or more players. The goal of the game is to collect the most number of points possible. You do this by biding on the diamonds, using your cards.

The game starts with each player having one complete suit, for instance, one player could have the spades. You can use more than one pack if there are more than three players.

The diamonds are mixed up and placed in the middle. These diamonds are turned over one by one and each player throws a card depending on the value of the diamond card. The values for each card are as follows:

King – 13   Queen – 12   Jack – 11 and the rest of the cards follow as such, Ace being worth 1 point.

The player who’s card has the highest value collects the diamond card. In the picture above, the person who played the King of Clubs would win the Jack of Diamonds.

If there is a tie and two or more people play cards of the same value, then another diamond is added to the middle and all the players bid again for these cards. If the final card played by each player is a tie then no one wins the diamonds in the middle.

The player who wins is the player who collects the most points out of the 91 available after all cards have been played.

Can you find a winning strategy to be able to collect the most points every time?

Taxicab geometry

Taxicab geometry is a form of geometry, where the distance between two points A and B is not the length of the line segment AB but the sum of the shortest horizontal and vertical distances between the two points. Example:

Length

The first challenge is to try to find what a midpoint would be in taxicab geometry. Here is an example to help:

midpointexample

Since the distance between A to the midpoint is the same as the distance between the point B and the midpoint, the midpoint is at the same distance from A and B. Can you spot any more midpoints, if there are any? Can you pick two different points that do not have a midpoint?

The second task is to find what a perpendicular bisector looks like on taxicab geometry.

The third task is to try to draw a circle in the taxicab geometry.

Next, try to draw an equilateral triangle and a rhombus.

If you can do all that, try to draw other geometrical shapes you know on taxicab geometry and post them in the comments.

For more info have a look here.

The second challenge – The Two Eggs Problem

two eggs

You are given two eggs, and access to a 100-storey building. Both eggs are identical. The aim is to find out the highest floor from which an egg will not break when dropped out of a window from that floor. If an egg is dropped and does not break, it is undamaged and can be dropped again. However, once an egg is broken, that’s it for that egg.

If an egg breaks when dropped from floor n, then it would also have broken from any floor above that. If an egg survives a fall, then it will survive any fall shorter than that.

The question is: What strategy should you adopt to minimize the number egg drops it takes to find the solution? (And what is the worst case for the number of drops it will take?)