Chapter 6: Problem 62
Refer to the integers from 5 to 200 , inclusive. How many are greater than \(72 ?\)
Short Answer
Step by step solution
Key Concepts
These are the key concepts you need to understand to accurately answer the question.
/*! 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 6: Problem 62
Refer to the integers from 5 to 200 , inclusive. How many are greater than \(72 ?\)
These are the key concepts you need to understand to accurately answer the question.
All the tools & learning materials you need for study success - in one app.
Get started for free
If the coin is flipped 10 times, what is the probability of at most five heads?
If the coin is flipped 10 times, what is the probability of at least one head given at least one tail?
Answer to give an argument that shows that in a group of 10 persons there are at least two such that either the difference or sum of their ages is divisible by \(16 .\) Assume that the ages are given as whole numbers. Let \(a_{1}, \ldots, a_{10}\) denote the ages. Let \(r_{i}=a_{i} \bmod 16\) and let $$ s_{i}=\left\\{\begin{array}{ll} r_{i} & \text { if } r_{i} \leq 8 \\ 16-r_{i} & \text { if } r_{i}>8 \end{array}\right. $$ Show that if the conditions in Exercise 29 fail, then 16 divides \(a_{j}+a_{k}\).
Give a combinatorial argument to prove that $$\sum_{k=0}^{n} C(n, k)^{2}=C(2 n, n)$$
How many integers between 1 and 1,000,000 have the sum of the digits equal to \(20 ?\)
What do you think about this solution?
We value your feedback to improve our textbook solutions.