subject
Mathematics, 19.05.2020 13:02 abolton04

Consider the following proposed proof, which claims to show that every nonnegative integer power of every nonzero real number is 1.
Let r be any nonzero real number, and let P(n) be the equation r ^n = 1.
Show that P(0) is true : P(0) is true because r^0 = 1 by definition of zeroth power.
Show that for every integer k >= 0, if P(i) is true for each integer i from 0 through k, then P(k + 1) is also true:
Let k be any integer with k >= 0 and suppose that r^ i = 1 for each integer i from 0 through k. This is the inductive hypothesis. We must show that r^ k + 1 = 1. Now
r^ k + 1 = r^ k + k - (k - 1) because k + k - (k - 1) = k + 1
r ^k * r^ k / r^ k - 1 by the laws of exponents
1*1 / 1 by inductive hypothesis
=1
Thus r^ k + 1 = 1 [as was to be shown].
[Since we have proved the basis step and the inductive step of the strong mathematical induction, we conclude that the given statement is true.]
Question:
a) Identify the error(s) in the above "proof."

ansver
Answers: 2

Another question on Mathematics

question
Mathematics, 21.06.2019 17:30
Can someone me with this problem i don't understand i need
Answers: 2
question
Mathematics, 21.06.2019 18:00
Factor x2 – 8x + 15. which pair of numbers has a product of ac and a sum of what is the factored form of the
Answers: 1
question
Mathematics, 21.06.2019 21:00
Can some one explain how to slove specifically, what is the value of x? 0.9(x+1.4)-2.3+0.1x=1.6 enter the answer as a decimal in the box. x= ?
Answers: 2
question
Mathematics, 21.06.2019 23:00
Acaterer knows he will need 60, 50, 80, 40 and 50 dinner napkins on five successive evenings. he can purchase new napkins initially at 25 cents each, after which he can have dirty napkins laundered by a fast one-day laundry service (i.e., dirty napkins given at the end of the day will be ready for use the following day) at 15 cents each, or by a slow two-day service at 8 cents each or both. the caterer wants to know how many napkins he should purchase initially and how many dirty napkins should be laundered by fast and slow service on each of the days in order to minimize his total costs. formulate the caterer’s problem as a linear program as follows (you must state any assumptions you make): a. define all variables clearly. how many are there? b. write out the constraints that must be satisfied, briefly explaining each. (do not simplify.) write out the objective function to be minimized. (do not simplify.)
Answers: 1
You know the right answer?
Consider the following proposed proof, which claims to show that every nonnegative integer power of...
Questions
question
Mathematics, 10.07.2019 18:30
question
History, 10.07.2019 18:30