The solution to the recurrence relation aₙ=aₙ₋₁+2n, with initi – McqOptions

MCQOPTIONS

1.	The solution to the recurrence relation aₙ=aₙ₋₁+2n, with initial term a₀=2 are _________
A.	4n+7
B.	2(1+n)
C.	3n²
D.	5*(n+1)/2
Answer» C. 3n²

Discussion

No Comment Found

Related MCQs

In a game, a fair coin is tossed 6 times. Each time the coin comes up tails, A will pay Rs. 15 but if each time heads come up, A will pay nothing. Determine the probability that A will win Rs. 45 by playing the game?
How many 4-digit numbers can be formed by using 2, 4, 6, 8, 10, 12 without repetition of digits?
Determine the solution of the recurrence relation Fₙ=20Fₙ₋₁ − 25Fₙ₋₂ where F₀=4 and F₁=14.
What is the recurrence relation for 1, 7, 31, 127, 499?
A fair coin is tossed 15 times. Determine the probability in which no heads turned up.
What is the middle term in the expansion of (x/2 + 6y)⁸?
By the expression \(\left(\frac{x}{3} + \frac{1}{x}\right)^5\), evaluate the middle term in the expression.
When a programmer compiles her code there is a 95% chance of finding a bug every time. It takes three hours to rewrite her code when she finds out a bug. Determine the probability such that she will finish her coding by the end of her workday. (Assume, a workday is 7 hours)
Determine the number of ways In a single competition a singing couple from 5 boys and 5 girls can be formed so that no girl can sing a song with their respective boy?
A postman can put 12 letters into their respective envelopes such that exactly 5 will go into the right envelope. Find the number of ways of doing this work.