Question
Let $r: N a t-\{0,1\} \rightarrow$ Rat be given by$$r(k)=\prod_{i=2}^k\left(1-\frac{1}{i}\right) .$$Write a recursive definition for $r$, and then prove that, for $k \geq 2$,$$r(k)=1 / k \text {. }$$
Step 1
To write a recursive definition for $r$, we need to express $r(k)$ in terms of $r(k-1)$. Show more…
Show all steps
Your feedback will help us improve your experience
Abhishek Kumar and 94 other educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Show that $\left(\begin{array}{l}n \\ k\end{array}\right)=\left(\begin{array}{c}n-1 \\ k-1\end{array}\right)+\left(\begin{array}{c}n-1 \\ k\end{array}\right)$ for $k<n$ and $n \geq 2$
Sequences and Series
The Binomial Theorem
Show that $\left(\begin{array}{l}n \\ k\end{array}\right)=\left(\begin{array}{c}n-1 \\ k1\end{array}\right)+\left(\begin{array}{c}n-1 \\ k\end{array}\right)$for $k<n$ and $n \geq 2$
Show that: $\left(\begin{array}{l}n \\ r\end{array}\right)$ is given by the recursion formula $$\left(\begin{array}{l}n \\r\end{array}\right)=\frac{n-r+1}{r}\left(\begin{array}{c}n \\r-1\end{array}\right)$$ where $\left(\begin{array}{l}n \\ 0\end{array}\right)=1$
Sequences, Induction, and Probability
The Binomial Formula
Transcript
Watch the video solution with this free unlock.
EMAIL
PASSWORD