Skip to content

Commit

Permalink
Merge pull request #24 from IDEMSInternational/v2-release
Browse files Browse the repository at this point in the history
updated explanation for 7D
  • Loading branch information
mikensubuga authored Jul 29, 2022
2 parents a941ceb + fe9bca2 commit bb4e6eb
Show file tree
Hide file tree
Showing 2 changed files with 4 additions and 1 deletion.
3 changes: 3 additions & 0 deletions src/app/components/cards.component.scss
Original file line number Diff line number Diff line change
Expand Up @@ -274,6 +274,9 @@ div p {
.Table_Handshakes_image_0{
width: 50%;
}
.Pieces_of_Cake_image_0{
width: 50%;
}
.Table_Handshakes_image_1{
width: 50%;
}
Expand Down
2 changes: 1 addition & 1 deletion src/assets/card-content/en/cards/7D.json
Original file line number Diff line number Diff line change
Expand Up @@ -7,7 +7,7 @@
"statement": "<p>What is the biggest number of pieces of a circular cake you can obtain with 5 straight cuts? Cuts must be made on the top of the cake.</p>",
"correct_answer": "16",
"hint": "<p>Start with a small number of cuts, e.g. 1, 2, 3. How can you add another cut to get the biggest number of pieces? Remember it doesn't say that the pieces have to be of the same size! What happens if many cuts pass through the same point?</p>",
"explanation": "<p>It is best to start with a simpler question and look for patterns. Start by looking at a square. There are two different ways we could slice the cake. </p>\n<p><img alt=\"\" src=\"images/Triangular_Slices_image_1.png\" class=\"Triangular_Slices_image_1\" /></p>\n<p>For a pentagon there are five ways:</p>\n<p><img alt=\"\" src=\"images/Triangular_Slices_image_2.png\" class=\"Triangular_Slices_image_2\" /></p>\n<p>For a hexagon there are 14 ways as you can see below:</p>\n<p><img alt=\"\" src=\"images/Triangular_Slices_image_3.png\" class=\"Triangular_Slices_image_3\" /></p>\n<p>In this diagram you can see the solution is found by thinking of 6 + 3 + 2 + 3 = 14, but you can arrive at the solution by using the solutions for smaller polygons: If we consider the side of the hexagon connecting points 1 and 2, it can form a triangle with any of the other 4 points. If we pick point 3 or 6, we are left with a pentagon, for which we know there are 5 ways of triangulating it. If we pick point 4 or 5, we are left with a triangle and a square, for which there are 1\u00d72 ways. Adding up the number of choices gives us 5 + 2 + 2 + 5 = 14. The equivalent combination for the pentagon is 2 + 1 + 2 = 5, where 1 is the result of the triangle (which has of course only one option) and 2 is the result for a square.</p>\n<p>This is a more useful technique for moving on to thinking of polygons with more vertices.</p>"
"explanation": "<p>With one cut you always get 2 pieces. With two cuts you can get 4 pieces. With three cuts, if all cuts pass through the same point you get 6 pieces. However, you can get 7 pieces if the third cut doesn’t pass through the same point as the previous two. Use this idea to get the maximum number with four cuts. So to get the most pieces, make sure that no more than two cuts pass through the same point, otherwise you get less pieces. With four cuts you can get 11 pieces. Do the same again for five cuts, start with the four cuts that give 7 pieces and add a cut without passing through any meeting points (intersections) and you can get 16 pieces.</p>\n<p><img alt=\"\" src=\"assets/images/Pieces_of_Cake_image_0.png\" class=\"Pieces_of_Cake_image_0\" />"
},
"extension_1": {
"statement": "<p>What is the biggest number of pieces of cake you can obtain with 7 cuts?</p>",
Expand Down

0 comments on commit bb4e6eb

Please sign in to comment.