Step 1: Rearrange the recurrence relation
We are given:
2an+2=5an+1−3an
We can split the 5an+1 term into 2an+1+3an+1 and rearrange the equation:
2an+2−3an+1=2an+1−3an
Notice that the expression on the left is exactly the same as the expression on the right, just shifted to the next index. This means the sequence bn=2an+1−3an is a constant sequence.
Step 2: Find the constant value
Let's find the value of this constant using our initial conditions, a0=0 and a1=21.
For n=0:
2a1−3a0=2(21)−3(0)=1−0=1
Therefore, for any integer k≥1:
2ak−3ak−1=1
Step 3: Sum the relation
Now, take the sum of both sides of this new equation from k=1 to 100:
∑k=1100(2ak−3ak−1)=∑k=11001
Split the sum on the left side:
2∑k=1100ak−3∑k=1100ak−1=100
Step 4: Express in terms of the total sum S
Let the sum we are trying to find be S=∑k=1100ak.
The second sum is ∑k=1100ak−1=a0+a1+a2+⋯+a99.
Notice that this is almost the entire sum S, except it includes a0 and is missing a100. Therefore, we can write it as:
∑k=1100ak−1=S−a100+a0
Substitute this back into our equation:
2S−3(S−a100+a0)=100
Step 5: Solve for S
Since we know a0=0, substitute it in:
2S−3(S−a100+0)=100
2S−3S+3a100=100
−S+3a100=100
Rearrange to isolate S:
S=3a100−100
Therefore, the correct option is (B).