Hello, outkast32!
There is no formula for #2.
I doubt that your textbook will help you.
It requires some Original Thinking.
2. Let
How many numbers must be chosen to ensure that two of them add up to 23?
Note that there are 7 Pairs that add up to 23:
. .
To have a sum of 23, your choices must include one of these Pairs.
Now consider the worst-case scenario: none of the Pairs.
If you select 7 numbers, one from each Pair,
. . you will not have a sum of 23.
When you choose an 8th number, you will have a Pair.
Therefore, you must draw 8 numbers.
Hello, outkast32!
The first problem (unnumbered) is not true.
It should be stated like this:
Using mathematical induction, prove that:
. .
Verify . . . True!
Assume .[1]
We must prove .[2]
Add to both sides of [1].
.
Simplify the right side:
. .
. .
We have proved [2]: .
The inductive proof is complete.