You are given an equilateral triangle of three matchsticks like given figure. What is the minimum number of sticks needed to add three more equilateral triangles to it?
Answer : 3
Explanation : Technically 4 triangles require 12 matchsticks, but we only have 6, that means each matchstick must be used in 2 triangles. So every triangle has to border 3 other triangles (one on each side).It’s a tetrahedron (a three-sided pyramid).
This article is contributed by Swapnika. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
- Ratio of area of one circle to the equilateral triangle when three equal circles are placed inside an equilateral triangle
- Count of Equilateral Triangles of unit length possible from a given Hexagon
- Puzzle | Form Three Equilateral Triangles
- Biggest Reuleaux Triangle inscribed within a Square inscribed in an equilateral triangle
- Program to check similarity of given two triangles
- Program to check congruency of two triangles
- Dividing the rectangle into n right-angled triangles
- Conditionally assign a value without using conditional and arithmetic operators
- Puzzle 1 | (How to Measure 45 minutes using two identical wires?)
- Puzzle 4 | (Pay an employee using a 7 units gold rod?)
- Puzzle 23 | (Days of month using 2 dice)
- Case conversion (Lower to Upper and Vice Versa) of a string using BitWise operators in C/C++
- Puzzle | Measure 4L using given 3 buckets
- Program to find Length of Bridge using Speed and Length of Train
- Program to Print Alphabets from A to Z Using Loop
- Program to Assign grades to a student using Nested If Else
- Find temperature of missing days using given sum and average
- Puzzle | Connect 9 circles each arranged at center of a Matrix using 3 straight lines
- Puzzle | Maximum pieces that can be cut from a Circle using 6 straight lines
- Find maximum of minimums from Layers of Matrix using numbers 1 to N^2