GATE Overflow - Recent questions tagged kenneth-rosen
https://gateoverflow.in/tag/kenneth-rosen
Powered by Question2AnswerKenneth Rosen Edition 7th Exercise 8.3 Question 16 (Page No. 535)
https://gateoverflow.in/339407/kenneth-rosen-edition-7th-exercise-8-question-16-page-no-535
Solve the recurrence relation for the number of rounds in the tournament described in question $14.$Combinatoryhttps://gateoverflow.in/339407/kenneth-rosen-edition-7th-exercise-8-question-16-page-no-535Sun, 10 May 2020 03:10:11 +0000Kenneth Rosen Edition 7th Exercise 8.3 Question 15 (Page No. 535)
https://gateoverflow.in/339406/kenneth-rosen-edition-7th-exercise-8-question-15-page-no-535
How many rounds are in the elimination tournament described in question $14$ when there are $32$ teams?Combinatoryhttps://gateoverflow.in/339406/kenneth-rosen-edition-7th-exercise-8-question-15-page-no-535Sun, 10 May 2020 03:09:21 +0000Kenneth Rosen Edition 7th Exercise 8.3 Question 14 (Page No. 535)
https://gateoverflow.in/339405/kenneth-rosen-edition-7th-exercise-8-question-14-page-no-535
Suppose that there are $n = 2^{k}$ teams in an elimination tournament, where there are $\frac{n}{2}$ games in the first round, with the $\frac{n}{2} = 2^{k-1}$ winners playing in the second round, and so on. Develop a recurrence relation for the number of rounds in the tournament.Combinatoryhttps://gateoverflow.in/339405/kenneth-rosen-edition-7th-exercise-8-question-14-page-no-535Sun, 10 May 2020 03:08:52 +0000Kenneth Rosen Edition 7th Exercise 8.3 Question 13 (Page No. 535)
https://gateoverflow.in/339404/kenneth-rosen-edition-7th-exercise-8-question-13-page-no-535
Give a big-O estimate for the function $f$ in question $12$ if $f$ is an increasing function.Combinatoryhttps://gateoverflow.in/339404/kenneth-rosen-edition-7th-exercise-8-question-13-page-no-535Sun, 10 May 2020 03:06:20 +0000Kenneth Rosen Edition 7th Exercise 8.3 Question 12 (Page No. 535)
https://gateoverflow.in/339403/kenneth-rosen-edition-7th-exercise-8-question-12-page-no-535
Find $f (n)$ when $n = 3k,$ where $f$ satisfies the recurrence relation $f (n) = 2f (n/3) + 4 \:\text{with}\: f (1) = 1.$Combinatoryhttps://gateoverflow.in/339403/kenneth-rosen-edition-7th-exercise-8-question-12-page-no-535Sun, 10 May 2020 03:04:55 +0000Kenneth Rosen Edition 7th Exercise 8.3 Question 11 (Page No. 535)
https://gateoverflow.in/339402/kenneth-rosen-edition-7th-exercise-8-question-11-page-no-535
Give a big-O estimate for the function $f$ in question $10$ if $f$ is an increasing function.Combinatoryhttps://gateoverflow.in/339402/kenneth-rosen-edition-7th-exercise-8-question-11-page-no-535Sun, 10 May 2020 03:03:13 +0000Kenneth Rosen Edition 7th Exercise 8.3 Question 10 (Page No. 535)
https://gateoverflow.in/339401/kenneth-rosen-edition-7th-exercise-8-question-10-page-no-535
Find $f (n)$ when $n = 2^{k},$ where $f$ satisfies the recurrence relation $f (n) = f (n/2) + 1 \:\text{with}\: f (1) = 1.$Combinatoryhttps://gateoverflow.in/339401/kenneth-rosen-edition-7th-exercise-8-question-10-page-no-535Sun, 10 May 2020 03:01:29 +0000Kenneth Rosen Edition 7th Exercise 8.3 Question 9 (Page No. 535)
https://gateoverflow.in/339400/kenneth-rosen-edition-7th-exercise-8-3-question-9-page-no-535
<p>Suppose that $f (n) = f (n/5) + 3n^{2}$ when $n$ is a positive integer divisible by $5, \:\text{and}\: f (1) = 4.$ Find</p>
<ol start="1" style="list-style-type:upper-alpha">
<li>$f (5)$</li>
<li>$f (125)$</li>
<li>$f (3125)$</li>
</ol>Combinatoryhttps://gateoverflow.in/339400/kenneth-rosen-edition-7th-exercise-8-3-question-9-page-no-535Sun, 10 May 2020 02:59:11 +0000Kenneth Rosen Edition 7th Exercise 8.3 Question 8 (Page No. 535)
https://gateoverflow.in/339399/kenneth-rosen-edition-7th-exercise-8-3-question-8-page-no-535
<p>Suppose that $f (n) = 2f (n/2) + 3$ when $n$ is an even positive integer, and $f (1) = 5.$ Find</p>
<ol start="1" style="list-style-type:upper-alpha">
<li>$f (2)$</li>
<li>$f (8)$</li>
<li>$f (64)$</li>
<li>$(1024)$
<br>
</li>
</ol>Combinatoryhttps://gateoverflow.in/339399/kenneth-rosen-edition-7th-exercise-8-3-question-8-page-no-535Sun, 10 May 2020 02:56:16 +0000Kenneth Rosen Edition 7th Exercise 8.3 Question 7 (Page No. 535)
https://gateoverflow.in/339398/kenneth-rosen-edition-7th-exercise-8-3-question-7-page-no-535
<p>Suppose that $f (n) = f (n/3) + 1$ when $n$ is a positive integer divisible by $3,$ and $f (1) = 1.$ Find</p>
<ol start="1" style="list-style-type:upper-alpha">
<li>$f (3)$</li>
<li>$f (27)$</li>
<li>$f (729)$</li>
</ol>Combinatoryhttps://gateoverflow.in/339398/kenneth-rosen-edition-7th-exercise-8-3-question-7-page-no-535Sun, 10 May 2020 02:52:12 +0000Kenneth Rosen Edition 7th Exercise 8.3 Question 6 (Page No. 535)
https://gateoverflow.in/339397/kenneth-rosen-edition-7th-exercise-8-3-question-6-page-no-535
How many operations are needed to multiply two $32 \times 32$ matrices using the algorithm referred to in Example $5?$Combinatoryhttps://gateoverflow.in/339397/kenneth-rosen-edition-7th-exercise-8-3-question-6-page-no-535Sun, 10 May 2020 02:49:23 +0000Kenneth Rosen Edition 7th Exercise 8.3 Question 5 (Page No. 535)
https://gateoverflow.in/339396/kenneth-rosen-edition-7th-exercise-8-3-question-5-page-no-535
Determine a value for the constant C in Example $4$ and use it to estimate the number of bit operations needed to multiply two $64$-bit integers using the fast multiplication algorithm.Combinatoryhttps://gateoverflow.in/339396/kenneth-rosen-edition-7th-exercise-8-3-question-5-page-no-535Sun, 10 May 2020 02:47:29 +0000Kenneth Rosen Edition 7th Exercise 8.3 Question 4 (Page No. 535)
https://gateoverflow.in/339395/kenneth-rosen-edition-7th-exercise-8-3-question-4-page-no-535
Express the fast multiplication algorithm in pseudocode.Combinatoryhttps://gateoverflow.in/339395/kenneth-rosen-edition-7th-exercise-8-3-question-4-page-no-535Sun, 10 May 2020 02:45:53 +0000Kenneth Rosen Edition 7th Exercise 8.3 Question 3 (Page No. 535)
https://gateoverflow.in/339394/kenneth-rosen-edition-7th-exercise-8-3-question-3-page-no-535
Multiply $(1110)_{2} \:\text{and}\: (1010)_{2}$ using the fast multiplication algorithm.Combinatoryhttps://gateoverflow.in/339394/kenneth-rosen-edition-7th-exercise-8-3-question-3-page-no-535Sun, 10 May 2020 02:44:49 +0000Kenneth Rosen Edition 7th Exercise 8.3 Question 2 (Page No. 535)
https://gateoverflow.in/339393/kenneth-rosen-edition-7th-exercise-8-3-question-2-page-no-535
How many comparisons are needed to locate the maximum and minimum elements in a sequence with $128$ elements using the algorithm in Example $2$?Combinatoryhttps://gateoverflow.in/339393/kenneth-rosen-edition-7th-exercise-8-3-question-2-page-no-535Sun, 10 May 2020 02:40:58 +0000Kenneth Rosen Edition 7th Exercise 8.3 Question 1 (Page No. 535)
https://gateoverflow.in/339391/kenneth-rosen-edition-7th-exercise-8-3-question-1-page-no-535
How many comparisons are needed for a binary search in a set of $64$ elements?Combinatoryhttps://gateoverflow.in/339391/kenneth-rosen-edition-7th-exercise-8-3-question-1-page-no-535Sun, 10 May 2020 02:38:30 +0000Kenneth Rosen Edition 7th Exercise 8.2 Question 52 (Page No. 527)
https://gateoverflow.in/339232/kenneth-rosen-edition-7th-exercise-8-question-52-page-no-527
Prove Theorem $6:$Suppose that $\{a_{n}\}$ satisfies the liner nonhomogeneous recurrence relation $$a_{n} = c_{1}a_{n-1} + c_{2}a_{n-2} + \dots + c_{k}a_{n-k} + F(n),$$ where $c_{1}.c_{2},\dots,c_{k}$ are real numbers , and<br />
<br />
$$F(n) = (b_{t}n^{t} + b_{t-1}n^{t-1}) + \dots + b_{1}n + b_{0})s^{n},$$ where $b_{0},b_{1},\dots,b_{t}$ and $s$ are real numbers. When $s$ is is not a root of the characteristic equation of the associated linear homogeneous recurrence relation, there is a particular solution of the form $$(p_{t}n^{t} + p_{t-1}n^{t-1} + \dots + p_{1}n + p_{0})s^{n}.$$<br />
<br />
When $s$ is a root of this characteristic equation and its multiplicity is $m,$ there is a particular solution of the form $$n^{m}(p_{t}n^{t} + p_{t-1}n^{t-1} + \dots + p_{1}n + p_{0})s^{n}.$$Combinatoryhttps://gateoverflow.in/339232/kenneth-rosen-edition-7th-exercise-8-question-52-page-no-527Wed, 06 May 2020 10:03:22 +0000Kenneth Rosen Edition 7th Exercise 8.2 Question 51 (Page No. 527)
https://gateoverflow.in/339231/kenneth-rosen-edition-7th-exercise-8-question-51-page-no-527
Prove Theorem $4:$ Let $c_{1},c_{2},\dots,c_{k}$ be real numbers. Suppose that the characteristic equation<br />
<br />
$$r^{k}-c_{1}r^{k-1}-\dots c_{k} = 0$$<br />
<br />
has $t$ distinct roots $r_{1},r_{2},\dots,r_{t}$ with multiplicities $m_{1},m_{2},\dots,m_{t},$ respectively, so that $m_{i}\geq 1\:\text{for}\: i = 1,2,\dots,t$ and $m_{1} + m_{2} + \dots + m_{t} = k.$ Then a sequence $\{a_{n}\}$ is a solution of the recurrence relation.<br />
<br />
$$a_{n} = c_{1}a_{n-1} + c_{2}a_{n-2} + \dots + c_{k}a_{n-k}$$<br />
<br />
if and only if<br />
<br />
$$a_{n} = (\alpha_{1},0 + \alpha_{1,1n} + \dots + \alpha_{1,m_{1}-1}n^{m_{1}-1})r_{1}^{n} + (\alpha_{1},0 + \alpha_{2,1}n \dots \alpha_{1,m_{2}-1}n^{m_{2}-1})r_{2}^{n} +\dots + (\alpha_{t},0 + \alpha_{t,1}n \dots \alpha_{t,m_{t}-1}n^{m_{t}-1})r_{t}^{n} $$<br />
<br />
for $n = 0, 1, 2,\dots,$ where $\alpha_{i,j}$ are constants for $1 \leq i \leq t\:\text{and}\: 0 \leq j \leq m_{i} - 1.$Combinatoryhttps://gateoverflow.in/339231/kenneth-rosen-edition-7th-exercise-8-question-51-page-no-527Wed, 06 May 2020 09:44:41 +0000Kenneth Rosen Edition 7th Exercise 8.2 Question 53 (Page No. 527)
https://gateoverflow.in/339230/kenneth-rosen-edition-7th-exercise-8-question-53-page-no-527
Solve the recurrence relation $T (n) = nT^{2}(n/2)$ with initial condition $T (1) = 6$ when $n = 2^{k}$ for some integer $k.$ [Hint: Let $n = 2^{k}$ and then make the substitution $a_{k} = \log T (2^{k})$ to obtain a linear nonhomogeneous recurrence relation.]Combinatoryhttps://gateoverflow.in/339230/kenneth-rosen-edition-7th-exercise-8-question-53-page-no-527Wed, 06 May 2020 09:18:44 +0000Kenneth Rosen Edition 7th Exercise 8.2 Question 50 (Page No. 527)
https://gateoverflow.in/339228/kenneth-rosen-edition-7th-exercise-8-question-50-page-no-527
<p>It can be shown that Cn, the average number of comparisons made by the quick sort algorithm (described in preamble to question $50$ in exercise $5.4),$ when sorting $n$ elements in random order, satisfies the recurrence relation</p>
<p>$$C_{n} = 1 + n + \dfrac{2}{n}\sum_{k=0}^{n-1}C_{k}$$
<br>
for $n = 1, 2, \dots,$ with initial condition $C_{0} = 0.$</p>
<ol start="1" style="list-style-type:upper-alpha">
<li>Show that $\{C_{n}\}$ also satisfies the recurrence relation $nC_{n} = (n + 1)C_{n-1} + 2n \:\text{for}\: n = 1, 2, \dots$</li>
<li>Use question $48$ to solve the recurrence relation in part $(A)$ to find an explicit formula for $C_{n}.$</li>
</ol>Combinatoryhttps://gateoverflow.in/339228/kenneth-rosen-edition-7th-exercise-8-question-50-page-no-527Wed, 06 May 2020 09:05:18 +0000Kenneth Rosen Edition 7th Exercise 8.2 Question 49 (Page No. 527)
https://gateoverflow.in/339224/kenneth-rosen-edition-7th-exercise-8-question-49-page-no-527
Use question $48$ to solve the recurrence relation $(n + 1)a_{n} = (n + 3)a_{n-1} + n, \:\text{for}\: n \geq 1, \:\text{with}\: a_{0} = 1$Combinatoryhttps://gateoverflow.in/339224/kenneth-rosen-edition-7th-exercise-8-question-49-page-no-527Wed, 06 May 2020 08:25:39 +0000Kenneth Rosen Edition 7th Exercise 8.2 Question 48 (Page No. 526)
https://gateoverflow.in/339223/kenneth-rosen-edition-7th-exercise-8-question-48-page-no-526
<p>Some linear recurrence relations that do not have constant coefficients can be systematically solved. This is the case for recurrence relations of the form $f (n)a_{n} = g(n)a_{n-1} + h(n).$ Exercises $48–50$ illustrate this.</p>
<ol start="1" style="list-style-type:upper-alpha">
<li>Show that the recurrence relation $f (n)a_{n} = g(n)a_{n-1} + h(n),$ for $n \geq 1,$ and with $a_{0} = C,$ can be reduced to a recurrence relation of the form $b_{n} = b_{n-1} + Q(n)h(n),$ where $b_{n} = g(n + 1)Q(n + 1)a_{n},$ with $Q(n) = \dfrac{(f (1)f (2) \dots f (n - 1))}{(g(1)g(2) \dots g(n))}.$</li>
<li>Use part $(A)$ to solve the original recurrence relation to obtain $a_{n} = \dfrac{C +\displaystyle{} \sum_{i = 1}^{n}Q(i)h(i)}{g(n + 1)Q(n + 1)}$</li>
</ol>Combinatoryhttps://gateoverflow.in/339223/kenneth-rosen-edition-7th-exercise-8-question-48-page-no-526Wed, 06 May 2020 08:20:24 +0000Kenneth Rosen Edition 7th Exercise 8.2 Question 47 (Page No. 526)
https://gateoverflow.in/339221/kenneth-rosen-edition-7th-exercise-8-question-47-page-no-526
<p>A new employee at an exciting new software company starts with a salary of $\$50,000$ and is promised that at the end of each year her salary will be double her salary of the previous year, with an extra increment of $\$10,000$ for each year she has been with the company.</p>
<ol start="1" style="list-style-type:upper-alpha">
<li>Construct a recurrence relation for her salary for her $n^{\text{th}}$ year of employment.</li>
<li>Solve this recurrence relation to find her salary for her $n^{\text{th}}$ year of employment.</li>
</ol>Combinatoryhttps://gateoverflow.in/339221/kenneth-rosen-edition-7th-exercise-8-question-47-page-no-526Wed, 06 May 2020 08:06:20 +0000Kenneth Rosen Edition 7th Exercise 8.2 Question 46 (Page No. 526)
https://gateoverflow.in/339220/kenneth-rosen-edition-7th-exercise-8-question-46-page-no-526
<p>Suppose that there are two goats on an island initially.The number of goats on the island doubles every year by natural reproduction, and some goats are either added or removed each year.</p>
<ol start="1" style="list-style-type:upper-alpha">
<li>Construct a recurrence relation for the number of goats on the island at the start of the $n^{\text{th}}$ year, assuming that during each year an extra $100$ goats are put on the island.</li>
<li>Solve the recurrence relation from part $(A)$ to find the number of goats on the island at the start of the $n^{th}$ year.</li>
<li>Construct a recurrence relation for the number of goats on the island at the start of the $n^{\text{th}}$ year, assuming that n goats are removed during the $n^{\text{th}}$ year for each $n \geq 3.$</li>
</ol>Combinatoryhttps://gateoverflow.in/339220/kenneth-rosen-edition-7th-exercise-8-question-46-page-no-526Wed, 06 May 2020 08:02:49 +0000Kenneth Rosen Edition 7th Exercise 8.2 Question 45 (Page No. 526)
https://gateoverflow.in/339218/kenneth-rosen-edition-7th-exercise-8-question-45-page-no-526
<p>Suppose that each pair of a genetically engineered species of rabbits left on an island produces two new pairs of rabbits at the age of $1$ month and six new pairs of rabbits at the age of $2$ months and every month afterward. None of the rabbits ever die or leave the island.</p>
<ol start="1" style="list-style-type:upper-alpha">
<li>Find a recurrence relation for the number of pairs of rabbits on the island $n$ months after one newborn pair is left on the island.</li>
<li>By solving the recurrence relation in $(A)$ determine the number of pairs of rabbits on the island $n$ months after one pair is left on the island.</li>
</ol>Combinatoryhttps://gateoverflow.in/339218/kenneth-rosen-edition-7th-exercise-8-question-45-page-no-526Wed, 06 May 2020 07:57:49 +0000Kenneth Rosen Edition 7th Exercise 8.2 Question 44 (Page No. 526)
https://gateoverflow.in/339217/kenneth-rosen-edition-7th-exercise-8-question-44-page-no-526
(Linear algebra required ) Let $A_{n}$ be the $n \times n$ matrix with $2s$ on its main diagonal, $1s$ in all positions next to a diagonal element, and $0s$ everywhere else. Find a recurrence relation for $d_{n},$ the determinant of $A_{n}.$ Solve this recurrence relation to find a formula for $d_{n}.$Combinatoryhttps://gateoverflow.in/339217/kenneth-rosen-edition-7th-exercise-8-question-44-page-no-526Wed, 06 May 2020 07:52:16 +0000Kenneth Rosen Edition 7th Exercise 8.2 Question 43 (Page No. 526)
https://gateoverflow.in/339216/kenneth-rosen-edition-7th-exercise-8-question-43-page-no-526
Express the solution of the linear nonhomogenous recurrence relation $a_{n} = a_{n-1} + a_{n-2} + 1\:\text{for}\: n \geq 2<br />
\:\text{where}\: a_{0} = 0\:\text{and}\: a_{1} = 1$ in terms of the Fibonacci numbers. [Hint: Let $b_{n} = a_{n + 1}$ and apply question $42$ to the sequence $b_{n}.]$Combinatoryhttps://gateoverflow.in/339216/kenneth-rosen-edition-7th-exercise-8-question-43-page-no-526Wed, 06 May 2020 07:48:52 +0000Kenneth Rosen Edition 7th Exercise 8.2 Question 42 (Page No. 526)
https://gateoverflow.in/339215/kenneth-rosen-edition-7th-exercise-8-question-42-page-no-526
Show that if $a_{n} = a_{n-1} + a_{n-2}, a_{0} = s\:\text{and}\: a_{1} = t,$ where $s$ and $t$ are constants, then $a_{n} = sf_{n-1} + tf_{n}$ for all positive integers $n.$Combinatoryhttps://gateoverflow.in/339215/kenneth-rosen-edition-7th-exercise-8-question-42-page-no-526Wed, 06 May 2020 07:43:43 +0000Kenneth Rosen Edition 7th Exercise 8.2 Question 41 (Page No. 526)
https://gateoverflow.in/339214/kenneth-rosen-edition-7th-exercise-8-question-41-page-no-526
<ol start="1" style="list-style-type:upper-alpha">
<li>Use the formula found in Example $4$ for $f_{n},$ the $n^{\text{th}}$ Fibonacci number, to show that fn is the integer closest to $$\dfrac{1}{\sqrt{5}}\left(\dfrac{1 + \sqrt{5}}{2}\right)^{n}$$</li>
<li>Determine for which $n\: f_{n}$ is greater than $$\dfrac{1}{\sqrt{5}}\left(\dfrac{1 + \sqrt{5}}{2}\right)^{n}$$ and for which $n\: f_{n}$ is less than $$\dfrac{1}{\sqrt{5}}\left(\dfrac{1 + \sqrt{5}}{2}\right)^{n}.$$</li>
</ol>Combinatoryhttps://gateoverflow.in/339214/kenneth-rosen-edition-7th-exercise-8-question-41-page-no-526Wed, 06 May 2020 07:39:54 +0000Kenneth Rosen Edition 7th Exercise 8.2 Question 40 (Page No. 526)
https://gateoverflow.in/339209/kenneth-rosen-edition-7th-exercise-8-question-40-page-no-526
<p>Solve the simultaneous recurrence relations</p>
<ul>
<li>$a_{n} = 3a_{n-1} + 2b_{n-1}$</li>
<li>$b_{n} = a_{n-1} + 2b_{n-1}$</li>
</ul>
<p>with $a_{0} = 1 \: \text{and}\: b_{0} = 2.$</p>Combinatoryhttps://gateoverflow.in/339209/kenneth-rosen-edition-7th-exercise-8-question-40-page-no-526Tue, 05 May 2020 22:29:27 +0000Kenneth Rosen Edition 7th Exercise 8.2 Question 39 (Page No. 526)
https://gateoverflow.in/339207/kenneth-rosen-edition-7th-exercise-8-question-39-page-no-526
<ol start="1" style="list-style-type:upper-alpha">
<li>a) Find the characteristic roots of the linear homogeneous recurrence relation $a_{n} = a_{n-4}.$ [Note: These include complex numbers.]</li>
<li>Find the solution of the recurrence relation in part $(A)$ with $a_{0} = 1, a_{1} = 0, a_{2} = -1,\: \text{and}\: a_{3} = 1.$
<br>
</li>
</ol>Combinatoryhttps://gateoverflow.in/339207/kenneth-rosen-edition-7th-exercise-8-question-39-page-no-526Tue, 05 May 2020 22:16:44 +0000Kenneth Rosen Edition 7th Exercise 8.2 Question 38 (Page No. 526)
https://gateoverflow.in/339206/kenneth-rosen-edition-7th-exercise-8-question-38-page-no-526
<ol start="1" style="list-style-type:upper-alpha">
<li>Find the characteristic roots of the linear homogeneous recurrence relation $a_{n} = 2a_{n-1} - 2a_{n-2}.$ [Note: These are complex numbers.]</li>
<li>Find the solution of the recurrence relation in part $(A)$ with $a_{0} = 1\:\text{and}\: a_{1} = 2.$
<br>
</li>
</ol>Combinatoryhttps://gateoverflow.in/339206/kenneth-rosen-edition-7th-exercise-8-question-38-page-no-526Tue, 05 May 2020 22:11:06 +0000Kenneth Rosen Edition 7th Exercise 8.2 Question 37 (Page No. 526)
https://gateoverflow.in/339205/kenneth-rosen-edition-7th-exercise-8-question-37-page-no-526
Let an be the sum of the first $n$ triangular numbers, that is,<br />
$a_{n} = \displaystyle{}\sum_{k = 1}^{n} t_{k},\:\text{where}\: t_{k} = k(k + 1)/2.$ Show that $\{an\}$ satisfies the linear nonhomogeneous recurrence relation $a_{n} = a_{n-1} + n(n + 1)/2$ and the initial condition $a_{1} = 1.$<br />
Use Theorem $6$ to determine a formula for $a_{n}$ by solving this recurrence relation.Combinatoryhttps://gateoverflow.in/339205/kenneth-rosen-edition-7th-exercise-8-question-37-page-no-526Tue, 05 May 2020 22:03:31 +0000Kenneth Rosen Edition 7th Exercise 8.2 Question 36 (Page No. 526)
https://gateoverflow.in/339178/kenneth-rosen-edition-7th-exercise-8-question-36-page-no-526
Let an be the sum of the first $n$ perfect squares, that is, $a_{n} = \displaystyle{}\sum_{k = 1}^{n} k^{2}.$ Show that the sequence $\{a_{n}\}$ satisfies the linear nonhomogeneous recurrence relation $a_{n} = a_{n-1} + n^{2}$ and the initial condition $a_{1} = 1.$ Use<br />
Theorem $6$ to determine a formula for $a_{n}$ by solving this recurrence relation.Combinatoryhttps://gateoverflow.in/339178/kenneth-rosen-edition-7th-exercise-8-question-36-page-no-526Tue, 05 May 2020 10:19:36 +0000Kenneth Rosen Edition 7th Exercise 8.2 Question 35 (Page No. 526)
https://gateoverflow.in/339177/kenneth-rosen-edition-7th-exercise-8-question-35-page-no-526
Find the solution of the recurrence relation $a_{n} = 4a_{n-1} - 3a_{n-2} + 2^{n} + n + 3\:\text{with}\: a_{0} = 1\:\text{and}\: a_{1} = 4.$Combinatoryhttps://gateoverflow.in/339177/kenneth-rosen-edition-7th-exercise-8-question-35-page-no-526Tue, 05 May 2020 10:15:29 +0000Kenneth Rosen Edition 7th Exercise 8.2 Question 34 (Page No. 526)
https://gateoverflow.in/339175/kenneth-rosen-edition-7th-exercise-8-question-34-page-no-526
Find all solutions of the recurrence relation $a_{n} =7a_{n-1} - 16a_{n-2} + 12a_{n-3} + n4^{n}\:\text{with}\: a_{0} = -2,a_{1} = 0,\:\text{and}\: a_{2} = 5.$Combinatoryhttps://gateoverflow.in/339175/kenneth-rosen-edition-7th-exercise-8-question-34-page-no-526Tue, 05 May 2020 10:13:05 +0000Kenneth Rosen Edition 7th Exercise 8.2 Question 33 (Page No. 525)
https://gateoverflow.in/339174/kenneth-rosen-edition-7th-exercise-8-question-33-page-no-525
Find all solutions of the recurrence relation $a_{n} = 4a_{n-1} - 4a_{n-2} + (n + 1)2^{n}.$Combinatoryhttps://gateoverflow.in/339174/kenneth-rosen-edition-7th-exercise-8-question-33-page-no-525Tue, 05 May 2020 10:10:31 +0000Kenneth Rosen Edition 7th Exercise 8.2 Question 32 (Page No. 525)
https://gateoverflow.in/339173/kenneth-rosen-edition-7th-exercise-8-question-32-page-no-525
Find the solution of the recurrence relation $a_{n} = 2a_{n-1} + 3 \cdot 2^{n}.$Combinatoryhttps://gateoverflow.in/339173/kenneth-rosen-edition-7th-exercise-8-question-32-page-no-525Tue, 05 May 2020 10:05:01 +0000Kenneth Rosen Edition 7th Exercise 8.2 Question 31 (Page No. 525)
https://gateoverflow.in/339172/kenneth-rosen-edition-7th-exercise-8-question-31-page-no-525
Find all solutions of the recurrence relation $a_{n} = 5a_{n-1} - 6a_{n-2} + 2^{n}+ 3n.$ [Hint: Look for a particular solution of the form $qn2^{n} + p_{1}n + p_{2},$ where $q, p_{1}, \text{and}\: p_{2}$ are constants.]Combinatoryhttps://gateoverflow.in/339172/kenneth-rosen-edition-7th-exercise-8-question-31-page-no-525Tue, 05 May 2020 10:02:53 +0000Kenneth Rosen Edition 7th Exercise 8.2 Question 30 (Page No. 525)
https://gateoverflow.in/339171/kenneth-rosen-edition-7th-exercise-8-question-30-page-no-525
<ol start="1" style="list-style-type:upper-alpha">
<li>Find all solutions of the recurrence relation $a_{n} = -5a_{n-1} - 6a_{n-2} + 42 \cdot 4^{n}.$</li>
<li>Find the solution of this recurrence relation with $a_{1} = 56\:\text{and}\: a_{2} = 278.$
<br>
</li>
</ol>Combinatoryhttps://gateoverflow.in/339171/kenneth-rosen-edition-7th-exercise-8-question-30-page-no-525Tue, 05 May 2020 09:53:46 +0000Kenneth Rosen Edition 7th Exercise 8.2 Question 29 (Page No. 525)
https://gateoverflow.in/339170/kenneth-rosen-edition-7th-exercise-8-question-29-page-no-525
<ol start="1" style="list-style-type:upper-alpha">
<li>Find all solutions of the recurrence relation $a_{n} = 2a_{n-1} + 3n.$</li>
<li>Find the solution of the recurrence relation in part $(A)$ with initial condition $a_{1} = 5.$
<br>
</li>
</ol>Combinatoryhttps://gateoverflow.in/339170/kenneth-rosen-edition-7th-exercise-8-question-29-page-no-525Tue, 05 May 2020 09:48:30 +0000Kenneth Rosen Edition 7th Exercise 8.2 Question 28 (Page No. 525)
https://gateoverflow.in/339169/kenneth-rosen-edition-7th-exercise-8-question-28-page-no-525
<ol start="1" style="list-style-type:upper-alpha">
<li>Find all solutions of the recurrence relation $a_{n} = 2a_{n-1} + 2n^{2}.$</li>
<li>Find the solution of the recurrence relation in part $(A)$ with initial condition $a_{1} = 4.$
<br>
</li>
</ol>Combinatoryhttps://gateoverflow.in/339169/kenneth-rosen-edition-7th-exercise-8-question-28-page-no-525Tue, 05 May 2020 09:46:09 +0000Kenneth Rosen Edition 7th Exercise 8.2 Question 27 (Page No. 525)
https://gateoverflow.in/339168/kenneth-rosen-edition-7th-exercise-8-question-27-page-no-525
<p>What is the general form of the particular solution guaranteed to exist by Theorem 6 of the linear nonhomogeneous recurrence relation $a_{n} = 8a_{n-2} - 16a_{n-4} + F(n)$ if</p>
<ol start="1" style="list-style-type:upper-alpha">
<li>$F(n) = n^{3}?$</li>
<li>$F(n) = (-2)^{n}?$</li>
<li>$F(n) = n2^{n}? $</li>
<li>$F(n) = n^{2}4^{n}?$</li>
<li>$F(n) = (n^{2} - 2)(-2)^{n}?$</li>
<li>$F(n) = n^{4}2^{n}?$</li>
<li>$F(n) = 2?$
<br>
</li>
</ol>Combinatoryhttps://gateoverflow.in/339168/kenneth-rosen-edition-7th-exercise-8-question-27-page-no-525Tue, 05 May 2020 09:41:30 +0000Kenneth Rosen Edition 7th Exercise 8.2 Question 26 (Page No. 525)
https://gateoverflow.in/339167/kenneth-rosen-edition-7th-exercise-8-question-26-page-no-525
<p>What is the general form of the particular solution guaranteed to exist by Theorem $6$ of the linear nonhomogeneous recurrence relation $a_{n} = 6a_{n-1} - 12a_{n-2} + 8a_{n-3} + F (n)$ if</p>
<ol start="1" style="list-style-type:upper-alpha">
<li>$F (n) = n^{2}?$</li>
<li>$F (n) = 2^{n}?$</li>
<li>$F (n) = n2^{n}?$</li>
<li>$F (n) = (-2)^{n}?$</li>
<li>$F (n) = n^{2}2^{n}?$</li>
<li>$F (n) = n^{3}(-2)^{n}?$</li>
<li>$F (n) = 3?$
<br>
</li>
</ol>Combinatoryhttps://gateoverflow.in/339167/kenneth-rosen-edition-7th-exercise-8-question-26-page-no-525Tue, 05 May 2020 09:34:13 +0000Kenneth Rosen Edition 7th Exercise 8.2 Question 25 (Page No. 525)
https://gateoverflow.in/339166/kenneth-rosen-edition-7th-exercise-8-question-25-page-no-525
<ol start="1" style="list-style-type:upper-alpha">
<li>Determine values of the constants $A$ and $B$ such that $a_{n} = A{n} + B$ is a solution of recurrence relation $a_{n} = 2a_{n-1} + n + 5.$</li>
<li>Use Theorem $5$ to find all solutions of this recurrence relation.</li>
<li>Find the solution of this recurrence relation with $a_{0} = 4.$</li>
</ol>Combinatoryhttps://gateoverflow.in/339166/kenneth-rosen-edition-7th-exercise-8-question-25-page-no-525Tue, 05 May 2020 09:28:01 +0000Kenneth Rosen Edition 7th Exercise 8.2 Question 24 (Page No. 525)
https://gateoverflow.in/339165/kenneth-rosen-edition-7th-exercise-8-question-24-page-no-525
<p>Consider the nonhomogeneous linear recurrence relation $a_{n} = 2a_{n-1} + 2^{n}.$</p>
<ol>
<li>Show that $a_{n} = n2^{n}$ is a solution of this recurrence relation.</li>
<li>Use Theorem $5$ to find all solutions of this recurrence relation.</li>
<li>Find the solution with $a_{0} = 2.$
<br>
</li>
</ol>Combinatoryhttps://gateoverflow.in/339165/kenneth-rosen-edition-7th-exercise-8-question-24-page-no-525Tue, 05 May 2020 09:21:37 +0000Kenneth Rosen Edition 7th Exercise 8.2 Question 23 (Page No. 525)
https://gateoverflow.in/339164/kenneth-rosen-edition-7th-exercise-8-question-23-page-no-525
<p>Consider the nonhomogeneous linear recurrence relation $a_{n} = 3a_{n-1} + 2^{n}.$</p>
<ol start="1" style="list-style-type:upper-alpha">
<li>Show that $a_{n} = -2^{n+1}$ is a solution of this recurrence relation.</li>
<li>Use Theorem $5$ to find all solutions of this recurrence relation.</li>
<li>Find the solution with $a_{0} = 1.$
<br>
</li>
</ol>Combinatoryhttps://gateoverflow.in/339164/kenneth-rosen-edition-7th-exercise-8-question-23-page-no-525Tue, 05 May 2020 09:17:49 +0000Kenneth Rosen Edition 7th Exercise 8.2 Question 22 (Page No. 525)
https://gateoverflow.in/339163/kenneth-rosen-edition-7th-exercise-8-question-22-page-no-525
What is the general form of the solutions of a linear homogeneous recurrence relation if its characteristic equation has the roots $-1, -1, -1, 2, 2, 5, 5, 7?$Combinatoryhttps://gateoverflow.in/339163/kenneth-rosen-edition-7th-exercise-8-question-22-page-no-525Tue, 05 May 2020 09:13:23 +0000Kenneth Rosen Edition 7th Exercise 8.2 Question 21 (Page No. 525)
https://gateoverflow.in/339162/kenneth-rosen-edition-7th-exercise-8-question-21-page-no-525
What is the general form of the solutions of a linear homogeneous recurrence relation if its characteristic equation has roots $1,1,1,1,−2,−2,−2,3,3,−4?$Combinatoryhttps://gateoverflow.in/339162/kenneth-rosen-edition-7th-exercise-8-question-21-page-no-525Tue, 05 May 2020 09:09:50 +0000Kenneth Rosen Edition 7th Exercise 8.2 Question 20 (Page No. 525)
https://gateoverflow.in/339105/kenneth-rosen-edition-7th-exercise-8-question-20-page-no-525
Find the general form of the solutions of the recurrence relation $a_{n} = 8a_{n−2} − 16a_{n−4}.$Combinatoryhttps://gateoverflow.in/339105/kenneth-rosen-edition-7th-exercise-8-question-20-page-no-525Sun, 03 May 2020 21:58:17 +0000