I need help with all of them 1-10 please help 1. We can prove by strong inductio

1. TRUE 2. TRUE 3. TRUE 4. TRUE 5. FALSE ANSWER: X2-X-1 6. TRUE 7. FALSE 8. TRUE 9. FALSE 1+3+5+......+2n-1=2n 10. true

ID: 3108631 • Letter: I

Question

I need help with all of them 1-10 please help

1. We can prove by strong induction that every amount of postage from 41 cents up can be made with 7 cent and 9 cent stamps.

True or False

2. We proved the Fundamental Theorem of Arithmetic using strong induction.

True or False

3. To prove that every positive integer can be written as a sum of distinct powers of 2, we used strong induction.

True or False

4. We used induction to prove that the sum of any two odd numbers must be even.

True or False

5. Binet’s formula uses two values that are roots of the polynomial x2 + x + 1 = 0. True or False

6. In proving n < 2n by induction, the inductive hypothesis is (k+1) < 2k+1.

True or False

7. In proving n < 2n by induction, the basis step is to show 20 < 21.

True or False

8. To prove that any amount of postage 24 cents can be made using 5 cent and 7 cent stamps, we need five basis steps.

True or False

9. We used strong induction to prove 1 + 2 + … + (n-1) + n = n(n+1) / 2.

True or False

10. We used induction to prove that 2n n! for all n 0.

True or False

1. TRUE

2. TRUE

3. TRUE

4. TRUE

5. FALSE

ANSWER: X2-X-1

6. TRUE

7. FALSE

8. TRUE

9. FALSE

1+3+5+......+2n-1=2n

10. true

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.