Stron induction, multiple choice not sure how he got his answer

Click For Summary

Homework Help Overview

The discussion revolves around a problem related to strong induction, specifically concerning the correctness of multiple-choice answers in a sequence defined by a recurrence relation. Participants are trying to verify which answers are correct based on the properties of the sequence.

Discussion Character

  • Exploratory, Assumption checking, Conceptual clarification

Approaches and Questions Raised

  • The original poster expresses confusion about the validity of certain answers and how to test them using the defined sequence. They question the initial conditions and the values of n to plug into the recurrence relation.
  • Another participant suggests that all answers could be correct and discusses the need to verify divisibility conditions for the sequence terms.
  • Further contributions highlight issues with the induction process, particularly regarding the starting point and the assumptions made during the induction step.
  • One participant seeks clarification on determining boundaries for the induction process and how to establish the base case and induction step effectively.

Discussion Status

Contextual Notes

Participants are grappling with the specifics of strong induction, including the importance of base cases and the implications of assuming statements for all integers up to k. There is a noted lack of clarity regarding the initial conditions and how they affect the induction process.

mr_coffee
Messages
1,613
Reaction score
1
Hello everyone, I'm confused on what the answer is here, it looks like he circled every answer but i don't see how that's possible. So maybe he cirlced c and b and marked a and b wrong. http://suprfile.com/src/1/3pyqpub/lastscan.jpg How would I test to verify that c and d are correct?
if b1 = 3, b2 = 6 and b_n = b_n-1 + b_n=2
for all integgers n >= 3.

n has to be >= 1, so do I plug in
n = 1, n = 2, and n = 3?

like n = 1, so b_n = b_0 + b_n-1

But b_0 and b_n-1 isn't even listed so I am not sure where to go from this.
 
Last edited by a moderator:
Physics news on Phys.org
Yes, all four of those are correct. (You would, of course, have to verify that b1 is divisible by 3 and, for b, that b2 is divisible by 3, for a and c, that both b2 and b3 are divisible by 3.

like n = 1, so b_n = b_0 + b_n-1

But b_0 and b_n-1 isn't even listed so I am not sure where to go from this.
There is no b_0: the sequence starts with b_1. The first one you would have to calculate is b_3= b_1+ b_2= 3+ 6= 9 which is divisible by 3.

It really doesn't matter where you start the "induction step", as long as you have verified the statement separately for each n less than that.

Of course, if it is true that "ai is divisible by 3 for all [itex]i\le k[/itex]" then we can write ak= 3m and ak-1= 3n for some integers m and n. Then ak+1= ak+ ak-1= 3n+ 3m= 3(n+m), a multiple of 3.
 
Thanks Ivy, i'll take another look at it!
 
c and d are correct, a and b are not correct.
The problem with a is that you start the induction on k > 3. It doesn't check to see if it's true for k = 3.
The problem with b is that you assume the statement is true for all i <= k. So you assume it's true when i = k and then you show that it's true for k--circular logic.
 
THanks for the responce!
i'm confused on how you figure out ur boundaries...
how do u know which boundary is correct or incorrect for i and also how did u know what k to test for? I was able to figure out easy problems using induction but I'm quite lost when it comes to strong induction on how you set up your base case and step. any guidance would be great!
 

Similar threads

Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 4 ·
Replies
4
Views
3K
Replies
2
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
Replies
2
Views
5K