Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged discrete-mathematics
0
votes
0
answers
211
Kenneth Rosen Edition 7 Exercise 8.3 Question 3 (Page No. 535)
Multiply $(1110)_{2} \:\text{and}\: (1010)_{2}$ using the fast multiplication algorithm.
admin
asked
in
Combinatory
May 9, 2020
by
admin
336
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
0
answers
212
Kenneth Rosen Edition 7 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$?
admin
asked
in
Combinatory
May 9, 2020
by
admin
348
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
1
answer
213
Kenneth Rosen Edition 7 Exercise 8.3 Question 1 (Page No. 535)
How many comparisons are needed for a binary search in a set of $64$ elements?
admin
asked
in
Combinatory
May 9, 2020
by
admin
426
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
1
vote
0
answers
214
Kenneth Rosen Edition 7 Exercise 8.2 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}$ ... solution of the form $n^{m}(p_{t}n^{t} + p_{t-1}n^{t-1} + \dots + p_{1}n + p_{0})s^{n}.$
admin
asked
in
Combinatory
May 6, 2020
by
admin
387
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
0
answers
215
Kenneth Rosen Edition 7 Exercise 8.2 Question 51 (Page No. 527)
Prove Theorem $4:$ Let $c_{1},c_{2},\dots,c_{k}$ be real numbers. Suppose that the characteristic equation $r^{k}-c_{1}r^{k-1}-\dots c_{k} = 0$ has $t$ distinct roots $r_{1},r_{2},\dots,r_{t}$ ... $\alpha_{i,j}$ are constants for $1 \leq i \leq t\:\text{and}\: 0 \leq j \leq m_{i} - 1.$
admin
asked
in
Combinatory
May 6, 2020
by
admin
356
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
0
answers
216
Kenneth Rosen Edition 7 Exercise 8.2 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.]
admin
asked
in
Combinatory
May 6, 2020
by
admin
393
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
2
votes
0
answers
217
Kenneth Rosen Edition 7 Exercise 8.2 Question 50 (Page No. 527)
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$ ... $48$ to solve the recurrence relation in part $(A)$ to find an explicit formula for $C_{n}.$
admin
asked
in
Combinatory
May 6, 2020
by
admin
258
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
0
answers
218
Kenneth Rosen Edition 7 Exercise 8.2 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$
admin
asked
in
Combinatory
May 6, 2020
by
admin
227
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
1
answer
219
Kenneth Rosen Edition 7 Exercise 8.2 Question 48 (Page No. 526)
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$ ...
admin
asked
in
Combinatory
May 6, 2020
by
admin
404
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
0
answers
220
Kenneth Rosen Edition 7 Exercise 8.2 Question 47 (Page No. 526)
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 $\ ... year of employment. Solve this recurrence relation to find her salary for her $n^{\text{th}}$ year of employment.
admin
asked
in
Combinatory
May 6, 2020
by
admin
572
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
0
answers
221
Kenneth Rosen Edition 7 Exercise 8.2 Question 46 (Page No. 526)
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. Construct a recurrence relation for the number of goats on ... assuming that n goats are removed during the $n^{\text{th}}$ year for each $n \geq 3.$
admin
asked
in
Combinatory
May 6, 2020
by
admin
481
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
0
answers
222
Kenneth Rosen Edition 7 Exercise 8.2 Question 45 (Page No. 526)
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. ... $n$ months after one pair is left on the island.
admin
asked
in
Combinatory
May 6, 2020
by
admin
379
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
0
answers
223
Kenneth Rosen Edition 7 Exercise 8.2 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}.$
admin
asked
in
Combinatory
May 6, 2020
by
admin
228
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
0
answers
224
Kenneth Rosen Edition 7 Exercise 8.2 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 \:\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}.]$
admin
asked
in
Combinatory
May 6, 2020
by
admin
188
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
0
answers
225
Kenneth Rosen Edition 7 Exercise 8.2 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.$
admin
asked
in
Combinatory
May 6, 2020
by
admin
167
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
0
answers
226
Kenneth Rosen Edition 7 Exercise 8.2 Question 41 (Page No. 526)
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}$ Determine for which $n\: f_{n}$ is greater ... for which $n\: f_{n}$ is less than $\dfrac{1}{\sqrt{5}}\left(\dfrac{1 + \sqrt{5}}{2}\right)^{n}.$
admin
asked
in
Combinatory
May 6, 2020
by
admin
209
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
1
answer
227
Kenneth Rosen Edition 7 Exercise 8.2 Question 40 (Page No. 526)
Solve the simultaneous recurrence relations $a_{n} = 3a_{n-1} + 2b_{n-1}$ $b_{n} = a_{n-1} + 2b_{n-1}$ with $a_{0} = 1 \: \text{and}\: b_{0} = 2.$
admin
asked
in
Combinatory
May 5, 2020
by
admin
1.2k
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
0
answers
228
Kenneth Rosen Edition 7 Exercise 8.2 Question 39 (Page No. 526)
a) Find the characteristic roots of the linear homogeneous recurrence relation $a_{n} = a_{n-4}.$ [Note: These include complex numbers.] 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.$
admin
asked
in
Combinatory
May 5, 2020
by
admin
213
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
1
answer
229
Kenneth Rosen Edition 7 Exercise 8.2 Question 38 (Page No. 526)
Find the characteristic roots of the linear homogeneous recurrence relation $a_{n} = 2a_{n-1} - 2a_{n-2}.$ [Note: These are complex numbers.] Find the solution of the recurrence relation in part $(A)$ with $a_{0} = 1\:\text{and}\: a_{1} = 2.$
admin
asked
in
Combinatory
May 5, 2020
by
admin
877
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
0
answers
230
Kenneth Rosen Edition 7 Exercise 8.2 Question 37 (Page No. 526)
Let an be the sum of the first $n$ triangular numbers, that is, $a_{n} = \displaystyle{}\sum_{k = 1}^{n} t_{k},\:\text{where}\: t_{k} = k(k + 1)/2.$ Show that $\{an\}$ satisfies the linear nonhomogeneous ... and the initial condition $a_{1} = 1.$ Use Theorem $6$ to determine a formula for $a_{n}$ by solving this recurrence relation.
admin
asked
in
Combinatory
May 5, 2020
by
admin
256
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
0
answers
231
Kenneth Rosen Edition 7 Exercise 8.2 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}\}$ ... initial condition $a_{1} = 1.$ Use Theorem $6$ to determine a formula for $a_{n}$ by solving this recurrence relation.
admin
asked
in
Combinatory
May 5, 2020
by
admin
186
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
1
answer
232
Kenneth Rosen Edition 7 Exercise 8.2 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.$
admin
asked
in
Combinatory
May 5, 2020
by
admin
374
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
0
answers
233
Kenneth Rosen Edition 7 Exercise 8.2 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.$
admin
asked
in
Combinatory
May 5, 2020
by
admin
227
views
kenneth-rosen
discrete-mathematics
descriptive
counting
recurrence-relation
0
votes
1
answer
234
Kenneth Rosen Edition 7 Exercise 8.2 Question 33 (Page No. 525)
Find all solutions of the recurrence relation $a_{n} = 4a_{n-1} - 4a_{n-2} + (n + 1)2^{n}.$
admin
asked
in
Combinatory
May 5, 2020
by
admin
582
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
0
answers
235
Kenneth Rosen Edition 7 Exercise 8.2 Question 32 (Page No. 525)
Find the solution of the recurrence relation $a_{n} = 2a_{n-1} + 3 \cdot 2^{n}.$
admin
asked
in
Combinatory
May 5, 2020
by
admin
242
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
0
answers
236
Kenneth Rosen Edition 7 Exercise 8.2 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.]
admin
asked
in
Combinatory
May 5, 2020
by
admin
229
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
0
answers
237
Kenneth Rosen Edition 7 Exercise 8.2 Question 30 (Page No. 525)
Find all solutions of the recurrence relation $a_{n} = -5a_{n-1} - 6a_{n-2} + 42 \cdot 4^{n}.$ Find the solution of this recurrence relation with $a_{1} = 56\:\text{and}\: a_{2} = 278.$
admin
asked
in
Combinatory
May 5, 2020
by
admin
321
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
0
answers
238
Kenneth Rosen Edition 7 Exercise 8.2 Question 29 (Page No. 525)
Find all solutions of the recurrence relation $a_{n} = 2a_{n-1} + 3n.$ Find the solution of the recurrence relation in part $(A)$ with initial condition $a_{1} = 5.$
admin
asked
in
Combinatory
May 5, 2020
by
admin
300
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
0
answers
239
Kenneth Rosen Edition 7 Exercise 8.2 Question 28 (Page No. 525)
Find all solutions of the recurrence relation $a_{n} = 2a_{n-1} + 2n^{2}.$ Find the solution of the recurrence relation in part $(A)$ with initial condition $a_{1} = 4.$
admin
asked
in
Combinatory
May 5, 2020
by
admin
191
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
0
answers
240
Kenneth Rosen Edition 7 Exercise 8.2 Question 27 (Page No. 525)
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 $F(n) = n^{3}?$ $F(n) = (-2)^{n}?$ $F(n) = n2^{n}? $ $F(n) = n^{2}4^{n}?$ $F(n) = (n^{2} - 2)(-2)^{n}?$ $F(n) = n^{4}2^{n}?$ $F(n) = 2?$
admin
asked
in
Combinatory
May 5, 2020
by
admin
190
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
Page:
« prev
1
...
3
4
5
6
7
8
9
10
11
12
13
...
80
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent questions tagged discrete-mathematics
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...