You are given a box of matches. The matches are all the same length and you are not allowed to break any. With these matchsticks, you find that you can form all six possible pairs of the four regular figures: triangle, square, pentagon, and hexagon, using all the matches every time. For example, for a box containing 11 matches you can form the three pairs of figures as shown above but it is not possible to form the other three pairs: triangle and hexagon; square and pentagon; nor square and hexagon. Hence the box you are given cannot contain 11 matches What is the minimum possible number of matches you can have in the box so that you can make all possible pairs of the given shapes using all the matchsticks in each pair? Consider some other shapes with different number of sides. IS there a general rule to relate the number of matchsticks to make all the pairs and the number of sides in the shapes.
You are given a box of matches. The matches are all the same length and you are not allowed to break any. With these matchsticks, you find that you can form all six possible pairs of the four regular figures: triangle, square, pentagon, and hexagon, using all the matches every time. For example, for a box containing 11 matches you can form the three pairs of figures as shown above but it is not possible to form the other three pairs: triangle and hexagon; square and pentagon; nor square and hexagon. Hence the box you are given cannot contain 11 matches What is the minimum possible number of matches you can have in the box so that you can make all possible pairs of the given shapes using all the matchsticks in each pair? Consider some other shapes with different number of sides. IS there a general rule to relate the number of matchsticks to make all the pairs and the number of sides in the shapes.
Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
Related questions
Question
I know the minimum number is 36. So please skip that question and I really want to know "If you consider some other shapes with different number of sides, is there a general rule to relate the number of matchsticks to make all the pairs and the number of sides in the shapes?"
![9. A regular problem
스
A
You are given a box of matches. The matches are all the same length and you are not
allowed to break any. With these matchsticks, you find that you can form all six possible
pairs of the four regular figures: triangle, square, pentagon, and hexagon, using all the matches
every time.
For example, for a box containing 11 matches you can form the three pairs of figures as shown
above but it is not possible to form the other three pairs: triangle and hexagon; square and
pentagon; nor square and hexagon. Hence the box you are given cannot contain 11 matches.
What is the minimum possible number of matches you can have in the box so that you can
make all possible pairs of the given shapes using all the matchsticks in each pair?
Consider some other shapes with different number of sides. IS there a general rule to relate
the number of matchsticks to make all the pairs and the number of sides in the shapes.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F235292ed-c631-4de3-9e65-8b6d8348209c%2F6f076e80-a7dc-408b-b326-e8c1d783324c%2Fwm27bq_processed.jpeg&w=3840&q=75)
Transcribed Image Text:9. A regular problem
스
A
You are given a box of matches. The matches are all the same length and you are not
allowed to break any. With these matchsticks, you find that you can form all six possible
pairs of the four regular figures: triangle, square, pentagon, and hexagon, using all the matches
every time.
For example, for a box containing 11 matches you can form the three pairs of figures as shown
above but it is not possible to form the other three pairs: triangle and hexagon; square and
pentagon; nor square and hexagon. Hence the box you are given cannot contain 11 matches.
What is the minimum possible number of matches you can have in the box so that you can
make all possible pairs of the given shapes using all the matchsticks in each pair?
Consider some other shapes with different number of sides. IS there a general rule to relate
the number of matchsticks to make all the pairs and the number of sides in the shapes.
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 5 steps
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Recommended textbooks for you
![Advanced Engineering Mathematics](https://www.bartleby.com/isbn_cover_images/9780470458365/9780470458365_smallCoverImage.gif)
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
![Numerical Methods for Engineers](https://www.bartleby.com/isbn_cover_images/9780073397924/9780073397924_smallCoverImage.gif)
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
![Introductory Mathematics for Engineering Applicat…](https://www.bartleby.com/isbn_cover_images/9781118141809/9781118141809_smallCoverImage.gif)
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
![Advanced Engineering Mathematics](https://www.bartleby.com/isbn_cover_images/9780470458365/9780470458365_smallCoverImage.gif)
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
![Numerical Methods for Engineers](https://www.bartleby.com/isbn_cover_images/9780073397924/9780073397924_smallCoverImage.gif)
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
![Introductory Mathematics for Engineering Applicat…](https://www.bartleby.com/isbn_cover_images/9781118141809/9781118141809_smallCoverImage.gif)
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
![Mathematics For Machine Technology](https://www.bartleby.com/isbn_cover_images/9781337798310/9781337798310_smallCoverImage.jpg)
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
![Basic Technical Mathematics](https://www.bartleby.com/isbn_cover_images/9780134437705/9780134437705_smallCoverImage.gif)
![Topology](https://www.bartleby.com/isbn_cover_images/9780134689517/9780134689517_smallCoverImage.gif)