Chapter 6: Problem 1
Suppose that a coin is flipped and a die is rolled. List the members of the sample space.
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 1
Suppose that a coin is flipped and a die is rolled. List the members of the sample space.
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
Prove that for any positive integer \(n,\) there exists a positive integer which, when expressed in decimal, consists of at most \(n\) Os and 1 s and is a multiple of \(n .\) Hint: Consider the set of the \(n\) integers, \(\\{1,11,111, \ldots\\},\) using only \(1 \mathrm{~s},\) and the remainders of these numbers when divided by \(n\). Answer Exercises \(18-21\) to give an argument that shows that if \(X\) is any \((n+2)\) -element subset of \(\\{1,2, \ldots, 2 n+1\\}\) and \(m\) is the greatest element in \(X,\) there exist distinct \(i\) and \(j\) in \(X\) with \(m=i+j .\) For each element \(k \in X-\\{m\\}\), let $$ a_{k}=\left\\{\begin{array}{ll} k & \text { if } k \leq \frac{m}{2} \\ m-k & \text { if } k>\frac{m}{2}. \end{array}\right. $$
Let \(f\) be a one-to-one function from \(X=\\{1,2, \ldots, n\\}\) onto \(X\) Let \(f^{k}=f \circ f \circ \cdots \circ f\) denote the \(k\) -fold composition of \(f\) with itself. Show that there are distinct positive integers \(i\) and \(j\) such that \(f^{i}(x)=f^{j}(x)\) for all \(x \in X .\) Show that for some positive integer \(k, f^{k}(x)=x\) for all \(x \in X\).
Show that $$\sum_{k=m}^{n} C(k, m) H_{k}=C(n+1, m+1)\left(H_{n+1}-\frac{1}{m+1}\right)$$for all \(n \geq m,\) where \(H_{k},\) the \(k\) th harmonic number, is defined$$ H_{k}=\sum_{i=1}^{k} \frac{1}{i} $$
Prove that $$\sum_{k=0}^{m}(-1)^{k} C(n, k)=(-1)^{m} C(n-1, m)$$ for all \(m, 0 \leq m \leq n-1\)
Prove that among a group of six students, at least two received the same grade on the final exam. (The grades assigned were chosen from \(A, B, C, D, F .)\)
What do you think about this solution?
We value your feedback to improve our textbook solutions.