Chapter 10: Problem 18
Determine the points of intersection of the parabola \(y=\) \(x^{2}-1\) and the line \(y=x\)
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 10: Problem 18
Determine the points of intersection of the parabola \(y=\) \(x^{2}-1\) and the line \(y=x\)
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
Suppose that the integers \(1,2,3,4,5,6,7,8\) are permuted using the stack (of Example 10.43). (a) How many permutations are possible? (b) How many permutations have 1 in position 4 and 5 in position \(8 ?\) (c) How many permutations have 1 in position 6 ? (d) How many permutations start with 321 ?
Let \(n \in \mathbf{Z}^{+}\). On a \(1 \times n\) chessboard two kings are called nontaking, if they do not occupy adjacent squares. In how many ways can one place 0 or more nontaking kings on a \(1 \times n\) chessboard?
If Laura invests \(\$ 100\) at \(6 \%\) interest compounded quarterly, how many months must she wait for her money to double? (She cannot withdraw the money before the quarter is up.)
For \(n \geq 1\), let \(a_{n}\) be the number of ways to write \(n\) as an ordered sum of positive integers, where each summand is at least 2. (For example, \(a_{5}=3\) because here we may represent 5 by 5 , by \(2+3\), and by \(3+2\).) Find and solve a recurrence relation for \(a_{n}\).
For \(n \geq 0\), let \(a_{n}\) count the number of ways a sequence of 1's and 2 's will sum to \(n\). For example, \(a_{3}=3\) because (1) \(1,1,1 ;\) (2) 1,2; and (3) 2,1 sum to 3 . Find and solve a recurrence relation for \(a_{n}\)
What do you think about this solution?
We value your feedback to improve our textbook solutions.