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
241
Kenneth Rosen Edition 7 Exercise 8.2 Question 26 (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} = 6a_{n-1} - 12a_{n-2} + 8a_{n-3} + F (n)$ if $F (n) = n^{2}?$ $F (n) = 2^{n}?$ $F (n) = n2^{n}?$ $F (n) = (-2)^{n}?$ $F (n) = n^{2}2^{n}?$ $F (n) = n^{3}(-2)^{n}?$ $F (n) = 3?$
admin
asked
in
Combinatory
May 5, 2020
by
admin
272
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
0
answers
242
Kenneth Rosen Edition 7 Exercise 8.2 Question 25 (Page No. 525)
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.$ Use Theorem $5$ to find all solutions of this recurrence relation. Find the solution of this recurrence relation with $a_{0} = 4.$
admin
asked
in
Combinatory
May 5, 2020
by
admin
261
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
0
answers
243
Kenneth Rosen Edition 7 Exercise 8.2 Question 24 (Page No. 525)
Consider the nonhomogeneous linear recurrence relation $a_{n} = 2a_{n-1} + 2^{n}.$ Show that $a_{n} = n2^{n}$ is a solution of this recurrence relation. Use Theorem $5$ to find all solutions of this recurrence relation. Find the solution with $a_{0} = 2.$
admin
asked
in
Combinatory
May 5, 2020
by
admin
248
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
0
answers
244
Kenneth Rosen Edition 7 Exercise 8.2 Question 23 (Page No. 525)
Consider the nonhomogeneous linear recurrence relation $a_{n} = 3a_{n-1} + 2^{n}.$ Show that $a_{n} = -2^{n+1}$ is a solution of this recurrence relation. Use Theorem $5$ to find all solutions of this recurrence relation. Find the solution with $a_{0} = 1.$
admin
asked
in
Combinatory
May 5, 2020
by
admin
250
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
1
answer
245
Kenneth Rosen Edition 7 Exercise 8.2 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?$
admin
asked
in
Combinatory
May 5, 2020
by
admin
2.4k
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
1
answer
246
Kenneth Rosen Edition 7 Exercise 8.2 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?$
admin
asked
in
Combinatory
May 5, 2020
by
admin
280
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
1
answer
247
Kenneth Rosen Edition 7 Exercise 8.2 Question 20 (Page No. 525)
Find the general form of the solutions of the recurrence relation $a_{n} = 8a_{n−2} − 16a_{n−4}.$
admin
asked
in
Combinatory
May 3, 2020
by
admin
285
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
1
answer
248
Kenneth Rosen Edition 7 Exercise 8.2 Question 19 (Page No. 525)
Solve the recurrence relation $a_{n} = −3a_{n−1} − 3a_{n−2} − a_{n−3}\:\text{with}\: a_{0} = 5, a_{1} = −9,\:\text{and}\: a_{2} = 15.$
admin
asked
in
Combinatory
May 3, 2020
by
admin
346
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
1
answer
249
Kenneth Rosen Edition 7 Exercise 8.2 Question 18 (Page No. 525)
Solve the recurrence relation $a_{n} = 6a_{n−1} − 12a_{n−2} + 8a_{n−3} \:\text{with}\: a_{0} = −5, a_{1} = 4,\: \text{and}\: a_{2} = 88.$
admin
asked
in
Combinatory
May 3, 2020
by
admin
254
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
0
answers
250
Kenneth Rosen Edition 7 Exercise 8.2 Question 17 (Page No. 525)
Prove this identity relating the Fibonacci numbers and the binomial coefficients: $f_{n+1} = C(n, 0) + C(n − 1, 1) +·\dots+ C(n − k, k),$ where $n$ is a positive integer and $k = n/2 .$ ... Show that the sequence $\{a_{n}\}$ satisfies the same recurrence relation and initial conditions satisfied by the sequence of Fibonacci numbers.]
admin
asked
in
Combinatory
May 3, 2020
by
admin
209
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
0
answers
251
Kenneth Rosen Edition 7 Exercise 8.2 Question 16 (Page No. 525)
Prove Theorem $3:$ 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 $k$ distinct roots $r_{1},r_{2},\dots r_{k}.$ Then a sequence $\{a_{n}\}$ ... $n = 0,1,2,\dots,$ where $\alpha_{1},\alpha_{2},\dots,\alpha_{k}$ are constants.
admin
asked
in
Combinatory
May 3, 2020
by
admin
223
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
1
answer
252
Kenneth Rosen Edition 7 Exercise 8.2 Question 15 (Page No. 525)
Find the solution to $a_{n} = 2a_{n−1} + 5a_{n−2} − 6a_{n−3}\: \text{with}\: a_{0} = 7, a_{1} = −4,\:\text{and}\: a_{2} = 8.$
admin
asked
in
Combinatory
May 3, 2020
by
admin
241
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
1
answer
253
Kenneth Rosen Edition 7 Exercise 8.2 Question 14 (Page No. 525)
Find the solution to $a_{n} = 5a_{n−2}− 4a_{n−4} \:\text{with}\: a_{0} = 3, a_{1} = 2, a_{2} = 6, \:\text{and}\: a_{3} = 8.$
admin
asked
in
Combinatory
May 3, 2020
by
admin
217
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
1
answer
254
Kenneth Rosen Edition 7 Exercise 8.2 Question 13 (Page No. 525)
Find the solution to $a_{n} = 7a_{n−2} + 6a_{n−3}\:\text{with}\: a_{0} = 9, a_{1} = 10, \text{and}\: a_{2} = 32.$
admin
asked
in
Combinatory
May 3, 2020
by
admin
223
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
1
answer
255
Kenneth Rosen Edition 7 Exercise 8.2 Question 12 (Page No. 525)
Find the solution to $a_{n} = 2a_{n−1} + a_{n−2} − 2a_{n−3} \:\text{for}\: n = 3, 4, 5,\dots, \:\text{with}\: a_{0} = 3, a_{1} = 6, \:\text{and}\: a_{2} = 0.$
admin
asked
in
Combinatory
May 3, 2020
by
admin
235
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
0
answers
256
Kenneth Rosen Edition 7 Exercise 8.2 Question 11 (Page No. 525)
The Lucas numbers satisfy the recurrence relation $L_{n} = L_{n−1} + L_{n−2},$ and the initial conditions $L_{0} = 2$ and $L_{1} = 1.$ Show that $L_{n} = f_{n−1} + f_{n+1}\: \text{for}\: n = 2, 3,\dots,$ where fn is the $n^{\text{th}}$ Fibonacci number. Find an explicit formula for the Lucas numbers.
admin
asked
in
Combinatory
May 3, 2020
by
admin
238
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
0
answers
257
Kenneth Rosen Edition 7 Exercise 8.2 Question 10 (Page No. 525)
Prove Theorem $2:$ Let $c_{1}$ and $c_{2}$ be real numbers with $c_{2}\neq 0.$ Suppose that $r^{2}-c_{1}r-c_{2} = 0$ has only one root $r_{0}.$ A sequence $\{a_{n}\}$ ... $n = 0,1,2,\dots,$ where $\alpha_{1}$ and $\alpha_{2}$ are constants.
admin
asked
in
Combinatory
May 3, 2020
by
admin
228
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
proof
0
votes
0
answers
258
Kenneth Rosen Edition 7 Exercise 8.2 Question 9 (Page No. 525)
A deposit of $\$100,000$ is made to an investment fund at the beginning of a year. On the last day of each year two dividends are awarded. The first dividend is $ ... $n$ years if no money has been withdrawn?
admin
asked
in
Combinatory
May 3, 2020
by
admin
541
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
0
answers
259
Kenneth Rosen Edition 7 Exercise 8.2 Question 8 (Page No. 524 - 525)
A model for the number of lobsters caught per year is based on the assumption that the number of lobsters caught in a year is the average of the number caught in the two previous years. Find a recurrence relation for $\{L_{n}\},$ ... if $100,000$ lobsters were caught in year $1\:\text{ and}\: 300,000$ were caught in year $2.$
admin
asked
in
Combinatory
May 3, 2020
by
admin
324
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
0
answers
260
Kenneth Rosen Edition 7 Exercise 8.2 Question 7 (Page No. 524)
In how many ways can a $2 \times n$ rectangular checkerboard be tiled using $1 \times 2 \:\text{and}\: 2 \times 2$ pieces?
admin
asked
in
Combinatory
May 3, 2020
by
admin
280
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
0
answers
261
Kenneth Rosen Edition 7 Exercise 8.2 Question 6 (Page No. 524)
How many different messages can be transmitted in $n$ microseconds using three different signals if one signal requires $1$ microsecond for transmittal, the other two signals require $2$ microseconds each for transmittal, and a signal in a message is followed immediately by the next signal?
admin
asked
in
Combinatory
May 3, 2020
by
admin
371
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
0
answers
262
Kenneth Rosen Edition 7 Exercise 8.2 Question 5 (Page No. 524)
How many different messages can be transmitted in $n$ microseconds using the two signals described in question $19$ in Section $8.1?$
admin
asked
in
Combinatory
May 3, 2020
by
admin
264
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
0
answers
263
Kenneth Rosen Edition 7 Exercise 8.2 Question 4 (Page No. 524)
Solve these recurrence relations together with the initial conditions given. $a_{n} = a_{n-1}+ 6a_{n-2} \:\text{for}\: n \geq 2, a_{0} = 3, a_{1} = 6$ $a_{n} = 7a_{n-1}− 10a_{n-2} \:\text{for}\: n \geq 2, a_{0} = 2, a_{1} = 1$ ... $a_{n+2} = −4a_{n+1} + 5a_{n} \:\text{for}\: n \geq 0, a_{0} = 2, a_{1} = 8$
admin
asked
in
Combinatory
May 3, 2020
by
admin
359
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
1
answer
264
Kenneth Rosen Edition 7 Exercise 8.2 Question 3 (Page No. 524)
Solve these recurrence relations together with the initial conditions given. $a_{n} = 2a_{n−1}\:\text{for}\: n \geq 1, a_{0} = 3$ $a_{n} = a_{n−1} \:\text{for}\: n \geq 1, a_{0} = 2$ ... $a_{n} = a_{n−2} /4 \:\text{for}\: n \geq 2, a_{0} = 1, a_{1} = 0$
admin
asked
in
Combinatory
May 3, 2020
by
admin
1.1k
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
1
answer
265
Kenneth Rosen Edition 7 Exercise 8.2 Question 2 (Page No. 524)
Determine which of these are linear homogeneous recurrence relations with constant coefficients. Also, find the degree of those that are. $a_{n} = 3a_{n-2}$ $a_{n} = 3$ $a_{n} = a^{2}_{n−1}$ $an = a_{n−1} + 2a_{n−3}$ $an = a_{n−1}/n$ $an = a_{n−1} + a_{n−2} + n + 3$ $a_{n} = 4a_{n−2} + 5a_{n−4} + 9a_{n−7}$
admin
asked
in
Combinatory
May 3, 2020
by
admin
709
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
1
answer
266
Kenneth Rosen Edition 7 Exercise 8.2 Question 1 (Page No. 524)
Determine which of these are linear homogeneous recurrence relations with constant coefficients. Also, find the degree of those that are. $a_{n} = 3a_{n−1} + 4a_{n−2} + 5a_{n−3}$ $a_{n} = 2na_{n−1} + a_{n−2}$ $a_{n} = a_{n−1} + a_{n−4}$ $a_{n} = a_{n−1} + 2 $ $a_{n} = a^{2}_{n−1} + a_{n−2} $ $a_{n} = a_{n−2}$ $a_{n} = a_{n−1} + n$
admin
asked
in
Combinatory
May 3, 2020
by
admin
4.5k
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
0
answers
267
Kenneth Rosen Edition 7 Exercise 8.1 Question 57 (Page No. 512)
Dynamic programming can be used to develop an algorithm for solving the matrix-chain multiplication problem introduced in Section $3.3.$ This is the problem of determining how the product $A_{1}A_{2} \dots A_{n}$ can be computed ... algorithm from part $(D)$ has $O(n^{3})$ worst-case complexity in terms of multiplications of integers.
admin
asked
in
Combinatory
May 3, 2020
by
admin
245
views
kenneth-rosen
discrete-mathematics
counting
descriptive
0
votes
0
answers
268
Kenneth Rosen Edition 7 Exercise 8.1 Question 56 (Page No. 512)
In this question, we will develop a dynamic programming algorithm for finding the maximum sum of consecutive terms of a sequence of real numbers. That is, given a sequence of real numbers ... worst-case complexity in terms of the number of additions and comparisons of your algorithm from part $(C)$ is linear.
admin
asked
in
Combinatory
May 3, 2020
by
admin
331
views
kenneth-rosen
discrete-mathematics
counting
descriptive
0
votes
0
answers
269
Kenneth Rosen Edition 7 Exercise 8.1 Question 55 (Page No. 512)
For each part of question $54,$ use your algorithm from question $53$ to find the optimal schedule for talks so that the total number of attendees is maximized. $20, 10, 50, 30, 15, 25, 40.$ $100, 5, 10, 20, 25, 40, 30. $ $2, 3, 8, 5, 4, 7, 10. $ $10, 8, 7, 25, 20, 30, 5.$
admin
asked
in
Combinatory
May 3, 2020
by
admin
178
views
kenneth-rosen
discrete-mathematics
counting
descriptive
0
votes
0
answers
270
Kenneth Rosen Edition 7 Exercise 8.1 Question 54 (Page No. 512)
Use Algorithm $1$ to determine the maximum number of total attendees in the talks in Example $6$ if $w_{i},$ the number of attendees of talk $i, i = 1, 2,\dots, 7,$ is $20, 10, 50, 30, 15, 25, 40.$ $100, 5, 10, 20, 25, 40, 30. $ $2, 3, 8, 5, 4, 7, 10. $ $10, 8, 7, 25, 20, 30, 5.$
admin
asked
in
Combinatory
May 3, 2020
by
admin
206
views
kenneth-rosen
discrete-mathematics
counting
descriptive
Page:
« prev
1
...
4
5
6
7
8
9
10
11
12
13
14
...
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:...