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

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 i\le k" 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!
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top