Hint for Section 8.4 Question 2

2. You might like to refer to Example 8.4.5 on pages 469 and 470 of your textbook.

Recall that to show a statement P(n) is true by mathematical induction, you must show it is true for n = 1 (or some other basis value), then you assume that the statement is true for n = k, and finally you must show that the statement is true for n = k+1.

Let P(n) be the statement that for any positive integer n, if a1, a2, ..., an  and  b1, b2, ..., bn are real numbers then:

n (ai · bi)

=

n ai

·

n bi.
P P P
i=1 i=1 i=1

Suppose that a1 and b1 are real numbers. Then by the definition of product, P

1 (ai · bi)

=

a1 · b1

=

1 ai

·

1 bi
P P P
i=1 i=1 i=1

So the statement P(n) is true for n = 1.

Now assume that P(n) is true for n = k. That is, we assume that the following is true:

k (ai · bi)

=

k ai

·

k bi.
P P P
i=1 i=1 i=1

Now you must show that the statement is true for n = k+1.

Back to Section 8.4
Full solution