Chapter 1: Problem 21
How many triangles are determined by the vertices of a regular polygon of \(n\) sides? How many if no side of the polygon is to be a side of any triangle?
/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none}
Learning Materials
Features
Discover
Chapter 1: Problem 21
How many triangles are determined by the vertices of a regular polygon of \(n\) sides? How many if no side of the polygon is to be a side of any triangle?
All the tools & learning materials you need for study success - in one app.
Get started for free
How many ways are there to place 12 marbles of the same size in five distinct jars if (a) the marbles are all black? (b) each marble is a different color?
Find the value of \(s u m\) after the given program segment is executed. (Here \(i, j, k\), increment, and sum are integer variables.) $$ \begin{aligned} &\text { increment }:=0 \\ &\text { sum }:=0 \\ &\text { for } i:=1 \text { to } 10 \text { do } \\ &\text { for } j:=1 \text { to i do } \\ &\text { for } k:=1 \text { to } j \text { do } \\ &\text { begin } \\ &\text { increment : }=\text { increment }+1 \\ &\text { sum }:=\text { sum }+\text { increment } \\ &\text { end } \end{aligned} $$
a) How many permutations of size 3 can one produce with the letters \(\mathrm{m}, \mathrm{r}, \mathrm{a}, \mathrm{f}\), and \(\mathrm{t} ?\) b) List all the combinations of size 3 that result for the letters \(m, r, a, f\), and \(t\).
a) Find the number of ways to write 17 as a sum of \(1^{\prime} s\) and 2 's if order is relevant. b) Answer part (a) for 18 in place of 17 . c) Generalize the results in parts (a) and (b) for \(n\) odd and for \(n\) even.
For any given set in a tennis tournament, opponent A can beat opponent \(\mathrm{B}\) in seven different ways. (At 6-6 they play a tie breaker.) The first opponent to win three sets wins the tournament. (a) In how many ways can scores be recorded with A winning in five sets? (b) In how many ways can scores be recorded with the tournament requiring at least four sets?
What do you think about this solution?
We value your feedback to improve our textbook solutions.