Answer:
- No
- yes
- yes
- yes
- No.
- yes
- No
- yes
- No.
- yes
- No
- No
- Yes
- Yes
- No
These are the answers according to serials.
From angle bisector theorem, we know that:
Moreover:
so:
and
Answer:
4004
Step-by-step explanation:
The number of combinations of choosing r objects from a group of n is nCr.
So the number of ways to get 7, 8, 9, or 10 heads from 13 coin tosses is:
₁₃C₇ + ₁₃C₈ + ₁₃C₉ + ₁₃C₁₀
= 1716 + 1287 + 715 + 286
= 4004