Suppose we insert parenthesis and then multiply n numbers, a1, a2, a3, ..., an. Prove there are are (n-1) multiplications using strong mathematical induction.
Added by Erin G.
Step 1
We can only multiply these two numbers once, so there is only 1 multiplication. Thus, the statement holds for n = 2. Inductive Hypothesis: Assume that the statement holds for n = k, i.e., there are (k - 1) multiplications when multiplying k numbers. Inductive Show more…
Show all steps
Close
Your feedback will help us improve your experience
Adi S and 78 other Calculus 3 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 if $a_{1}, a_{2}, \ldots, a_{n}$ are $n$ distinct real numbers, exactly $n-1$ multiplications are used to compute the product of these $n$ numbers no matter how parentheses are inserted into their product. [Hint: Use strong induction and consider the last multiplication. $]$
Induction and Recursion
Strong Induction and Well-Ordering
Use mathematical induction to prove the following assertions. $$\text { If } a_{1}=1 \text { and } a_{n+1}=\frac{n+1}{2 n} a_{n}, \text { then } a_{n}=\frac{n}{2^{n-1}}$$
Sequences; Indeterminate Forms; Improper Integrals
Sequences of Real Numbers
Prove the following by using the principle of mathematical induction for all $n \in \mathbf{N}$. $$ a+a r+a r^{2}+\ldots+a r^{n-1}=\frac{a\left(r^{n}-1\right)}{r-1} . $$
Principle of Mathematical Induction
Introduction
Recommended Textbooks
Calculus: Early Transcendentals
Thomas Calculus
Transcript
Watch the video solution with this free unlock.
EMAIL
PASSWORD