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 kenneth-rosen
0
votes
0
answers
121
Kenneth Rosen Edition 7 Exercise 8.1 Question 43 (Page No. 512)
Question $38-45$ involve the Reve's puzzle, the variation of the Tower of Hanoi puzzle with four pegs and $n$ disks. Before presenting these exercises, we describe the Frame-Stewart algorithm for moving the disks from peg $1$ to peg $4$ so that no disk is ... then $R(n) = \displaystyle{}\sum_{i = 1}^{k} i2^{i−1} − (t_{k} − n)2^{k−1}.$
admin
asked
in
Combinatory
May 2, 2020
by
admin
144
views
kenneth-rosen
discrete-mathematics
counting
descriptive
0
votes
0
answers
122
Kenneth Rosen Edition 7 Exercise 8.1 Question 42 (Page No. 512)
Question $38-45$ involve the Reve's puzzle, the variation of the Tower of Hanoi puzzle with four pegs and $n$ disks. Before presenting these exercises, we describe the Frame-Stewart algorithm for moving the disks from peg $1$ to peg $4$ so that no disk is ... that if $k$ is as chosen in question $41,$ then $R(n) − R(n − 1) = 2^{k−1}.$
admin
asked
in
Combinatory
May 2, 2020
by
admin
122
views
kenneth-rosen
discrete-mathematics
counting
descriptive
0
votes
0
answers
123
Kenneth Rosen Edition 7 Exercise 8.1 Question 41 (Page No. 512)
Question $38-45$ involve the Reve's puzzle, the variation of the Tower of Hanoi puzzle with four pegs and $n$ disks. Before presenting these exercises, we describe the Frame-Stewart algorithm for moving the disks from peg $1$ to peg $4$ so that no disk is ever on top ... $R(0) = 0\:\text{and}\: R(1) = 1.$
admin
asked
in
Combinatory
May 2, 2020
by
admin
233
views
kenneth-rosen
discrete-mathematics
counting
descriptive
0
votes
0
answers
124
Kenneth Rosen Edition 7 Exercise 8.1 Question 40 (Page No. 512)
Question $38-45$ involve the Reve's puzzle, the variation of the Tower of Hanoi puzzle with four pegs and $n$ disks. Before presenting these exercises, we describe the Frame-Stewart algorithm for moving the disks from peg $1$ to peg $4$ ... $5$ disks. $6$ disks. $7$ disks. $8$ disks.
admin
asked
in
Combinatory
May 2, 2020
by
admin
115
views
kenneth-rosen
discrete-mathematics
counting
descriptive
0
votes
0
answers
125
Kenneth Rosen Edition 7 Exercise 8.1 Question 39 (Page No. 512)
Question $38-45$ involve the Reve's puzzle, the variation of the Tower of Hanoi puzzle with four pegs and $n$ disks. Before presenting these exercises, we describe the Frame-Stewart algorithm for moving the disks from peg $1$ ... disks are moved. Show that the Reve's puzzle with four disks can be solved using nine, and no fewer, moves
admin
asked
in
Combinatory
May 2, 2020
by
admin
143
views
kenneth-rosen
discrete-mathematics
counting
descriptive
0
votes
0
answers
126
Kenneth Rosen Edition 7 Exercise 8.1 Question 38 (Page No. 512)
Question $38-45$ involve the Reve's puzzle, the variation of the Tower of Hanoi puzzle with four pegs and $n$ disks. Before presenting these exercises, we describe the Frame-Stewart algorithm for moving the disks from peg $1$ to ... are moved. Show that the Reve's puzzle with three disks can be solved using five, and no fewer, moves.
admin
asked
in
Combinatory
May 2, 2020
by
admin
211
views
kenneth-rosen
discrete-mathematics
counting
descriptive
0
votes
0
answers
127
Kenneth Rosen Edition 7 Exercise 8.1 Question 37 (Page No. 512)
Question $33-37$ deal with a variation of the $\textbf{Josephus problem}$ described by Graham, Knuth, and Patashnik in $[G_{r}K_{n}P_{a}94].$ This problem is based on an account by the historian Flavius Josephus, who was part of a band of $41$ ... $J (100), J (1000),\: \text{and}\: J (10,000)$ from your formula for $J (n).$
admin
asked
in
Combinatory
May 2, 2020
by
admin
159
views
kenneth-rosen
discrete-mathematics
counting
descriptive
0
votes
0
answers
128
Kenneth Rosen Edition 7 Exercise 8.1 Question 36 (Page No. 512)
Question $33-37$ deal with a variation of the $\textbf{Josephus problem}$ described by Graham, Knuth, and Patashnik in $[G_{r}K_{n}P_{a}94].$ This problem is based on an account by the historian Flavius ... induction to prove the formula you conjectured in question $34,$ making use of the recurrence relation from question $35.$
admin
asked
in
Combinatory
May 2, 2020
by
admin
144
views
kenneth-rosen
discrete-mathematics
counting
descriptive
0
votes
0
answers
129
Kenneth Rosen Edition 7 Exercise 8.1 Question 35 (Page No. 512)
Question $33-37$ deal with a variation of the $\textbf{Josephus problem}$ described by Graham, Knuth, and Patashnik in $[G_{r}K_{n}P_{a}94].$ This problem is based on an account by the historian Flavius Josephus, who was part of a band of $41$ Jewish rebels ...
admin
asked
in
Combinatory
May 2, 2020
by
admin
151
views
kenneth-rosen
discrete-mathematics
counting
descriptive
0
votes
0
answers
130
Kenneth Rosen Edition 7 Exercise 8.1 Question 34 (Page No. 512)
Question $33-37$ deal with a variation of the $\textbf{Josephus problem}$ described by Graham, Knuth, and Patashnik in $[G_{r}K_{n}P_{a}94].$ This problem is based on an account by the historian Flavius Josephus, who was part of a band ... $m$ is a nonnegative integer and $k$ is a nonnegative integer less than $2m.]$
admin
asked
in
Combinatory
May 2, 2020
by
admin
153
views
kenneth-rosen
discrete-mathematics
counting
descriptive
0
votes
0
answers
131
Kenneth Rosen Edition 7 Exercise 8.1 Question 33 (Page No. 512)
Question $33-37$ deal with a variation of the $\textbf{Josephus problem}$ described by Graham, Knuth, and Patashnik in $[G_{r}K_{n}P_{a}94].$ This problem is based on an account by the historian Flavius Josephus, who was part of a band of $41$ ... by $J (n).$ Determine the value of $J (n)$ for each integer $n$ with $1 \leq n \leq 16.$
admin
asked
in
Combinatory
May 2, 2020
by
admin
174
views
kenneth-rosen
discrete-mathematics
counting
descriptive
0
votes
0
answers
132
Kenneth Rosen Edition 7 Exercise 8.1 Question 32 (Page No. 512)
In the Tower of Hanoi puzzle, suppose our goal is to transfer all $n$ disks from peg $1$ to peg $3,$ but we cannot move a disk directly between pegs $1$ and $3.$ Each move of a disk must be a move ... top of a smaller disk? Show that every allowable arrangement of the n disks occurs in the solution of this variation of the puzzle.
admin
asked
in
Combinatory
May 2, 2020
by
admin
284
views
kenneth-rosen
discrete-mathematics
counting
descriptive
0
votes
0
answers
133
Kenneth Rosen Edition 7 Exercise 8.1 Question 31 (Page No. 512)
Use the recurrence relation developed in Example $5$ to determine $C_{5},$ the number of ways to parenthesize the product of six numbers so as to determine the order of multiplication. Check your result with the closed formula for $C_{5}$ mentioned in the solution of Example $5.$
admin
asked
in
Combinatory
May 2, 2020
by
admin
140
views
kenneth-rosen
discrete-mathematics
counting
descriptive
0
votes
0
answers
134
Kenneth Rosen Edition 7 Exercise 8.1 Question 30 (Page No. 512)
Write out all the ways the product $x_{0} \cdot x_{1} \cdot x_{2} \cdot x_{3} \cdot x_{4}$ can be parenthesized to determine the order of multiplication. Use the recurrence relation developed in Example $5$ to calculate $C_{4},$ ... $(B)$ by finding $C_{4},$ using the closed formula for $C_{n}$ mentioned in the solution of Example $5.$
admin
asked
in
Combinatory
May 2, 2020
by
admin
152
views
kenneth-rosen
discrete-mathematics
counting
descriptive
0
votes
0
answers
135
Kenneth Rosen Edition 7 Exercise 8.1 Question 29 (Page No. 512)
Let $S(m, n)$ denote the number of onto functions from a set with m elements to a set with $n$ elements. Show that $S(m, n)$ satisfies the recurrence relation $S(m, n) = n^{m} − \sum_{k=1 }^{n−1} C(n, k)S(m, k)$ whenever $m \geq n$ and $n > 1,$ with the initial condition $S(m, 1) = 1.$
admin
asked
in
Combinatory
May 2, 2020
by
admin
116
views
kenneth-rosen
discrete-mathematics
counting
descriptive
0
votes
0
answers
136
Kenneth Rosen Edition 7 Exercise 8.1 Question 28 (Page No. 512)
Show that the Fibonacci numbers satisfy the recurrence relation $f_{n} = 5f_{n−4} + 3f_{n−5} \:\text{for}\: n = 5, 6, 7,\dots,$ together with the initial conditions $f_{0} = 0, f_{1} = 1, f_{2} = 1, f_{3} = 2, \:\text{and}\: f4 = 3.$ Use this recurrence relation to show that $f_{5n}$ is divisible by $5$, for $n = 1, 2, 3,\dots .$
admin
asked
in
Combinatory
May 2, 2020
by
admin
133
views
kenneth-rosen
discrete-mathematics
counting
descriptive
0
votes
0
answers
137
Kenneth Rosen Edition 7 Exercise 8.1 Question 27 (Page No. 512)
Find a recurrence relation for the number of ways to lay out a walkway with slate tiles if the tiles are red, green, or gray, so that no two red tiles are adjacent and tiles of the same color are considered indistinguishable. What are the ... $(A)?$ How many ways are there to lay out a path of seven tiles as described in part $(A)?$
admin
asked
in
Combinatory
May 2, 2020
by
admin
205
views
kenneth-rosen
discrete-mathematics
counting
descriptive
0
votes
0
answers
138
Kenneth Rosen Edition 7 Exercise 8.1 Question 26 (Page No. 512)
Find a recurrence relation for the number of ways to completely cover a $2 \times n$ checkerboard with $1 \times 2$ dominoes. [Hint: Consider separately the coverings where the position in the top right corner of the checkerboard ... How many ways are there to completely cover a $2 \times 17$ checkerboard with $1 \times 2$ dominoes?
admin
asked
in
Combinatory
May 2, 2020
by
admin
169
views
kenneth-rosen
discrete-mathematics
counting
descriptive
1
vote
2
answers
139
Kenneth Rosen Edition 7 Exercise 8.1 Question 25 (Page No. 511)
How many bit sequences of length seven contain an even number of $0s?$
admin
asked
in
Combinatory
May 2, 2020
by
admin
336
views
kenneth-rosen
discrete-mathematics
counting
descriptive
0
votes
0
answers
140
Kenneth Rosen Edition 7 Exercise 8.1 Question 24 (Page No. 511)
Find a recurrence relation for the number of bit sequences of length $n$ with an even number of $0s.$
admin
asked
in
Combinatory
May 2, 2020
by
admin
184
views
kenneth-rosen
discrete-mathematics
counting
descriptive
0
votes
0
answers
141
Kenneth Rosen Edition 7 Exercise 8.1 Question 23 (Page No. 511)
Find the recurrence relation satisfied by $S_{n},$ where $S_{n}$ is the number of regions into which three-dimensional space is divided by $n$ planes if every three of the planes meet in one point, but no four of the planes go through the same point. Find $S_{n}$ using iteration.
admin
asked
in
Combinatory
May 2, 2020
by
admin
205
views
kenneth-rosen
discrete-mathematics
counting
descriptive
0
votes
0
answers
142
Kenneth Rosen Edition 7 Exercise 8.1 Question 22 (Page No. 511)
a) Find the recurrence relation satisfied by $R_{n},$ where $R_{n}$ is the number of regions into which the surface of a sphere is divided by $n$ great circles (which are the intersections of the sphere and planes passing through ... sphere), if no three of the great circles go through the same point. b) Find $R_{n}$ using iteration.
admin
asked
in
Combinatory
May 2, 2020
by
admin
215
views
kenneth-rosen
discrete-mathematics
counting
descriptive
0
votes
1
answer
143
Kenneth Rosen Edition 7 Exercise 8.1 Question 21 (Page No. 511)
Find the recurrence relation satisfied by $R_{n},$ where $R_{n}$ is the number of regions that a plane is divided into by $n$ lines, if no two of the lines are parallel and no three of the lines go through the same point. Find $R_{n}$ using iteration.
admin
asked
in
Combinatory
May 2, 2020
by
admin
1.0k
views
kenneth-rosen
discrete-mathematics
counting
descriptive
0
votes
0
answers
144
Kenneth Rosen Edition 7 Exercise 8.1 Question 20 (Page No. 511)
A bus driver pays all tolls, using only nickels and dimes, by throwing one coin at a time into the mechanical toll collector. Find a recurrence relation for the number of different ways the bus driver can pay a toll of $n$ cents ... which the coins are used matters). In how many different ways can the driver pay a toll of $45$ cents?
admin
asked
in
Combinatory
May 2, 2020
by
admin
224
views
kenneth-rosen
discrete-mathematics
descriptive
counting
0
votes
0
answers
145
Kenneth Rosen Edition 7 Exercise 8.1 Question 19 (Page No. 511)
Messages are transmitted over a communications channel using two signals. The transmittal of one signal requires $1$ microsecond, and the transmittal of the other signal requires $2$ microseconds. Find a recurrence relation ... initial conditions? How many different messages can be sent in $10$ microseconds using these two signals?
admin
asked
in
Combinatory
May 2, 2020
by
admin
223
views
kenneth-rosen
discrete-mathematics
counting
descriptive
0
votes
0
answers
146
Kenneth Rosen Edition 7 Exercise 8.1 Question 18 (Page No. 511)
Find a recurrence relation for the number of ternary strings of length $n$ that contain two consecutive symbols that are the same. What are the initial conditions? How many ternary strings of length six contain consecutive symbols that are the same?
admin
asked
in
Combinatory
May 2, 2020
by
admin
159
views
kenneth-rosen
discrete-mathematics
counting
descriptive
0
votes
0
answers
147
Kenneth Rosen Edition 7 Exercise 8.1 Question 17 (Page No. 511)
Find a recurrence relation for the number of ternary strings of length $n$ that do not contain consecutive symbols that are the same. What are the initial conditions? How many ternary strings of length six do not contain consecutive symbols that are the same?
admin
asked
in
Combinatory
May 2, 2020
by
admin
155
views
kenneth-rosen
discrete-mathematics
counting
descriptive
0
votes
0
answers
148
Kenneth Rosen Edition 7 Exercise 8.1 Question 16 (Page No. 511)
Find a recurrence relation for the number of ternary strings of length $n$ that contain either two consecutive $0s$ or two consecutive $1s.$ What are the initial conditions? How many ternary strings of length six contain two consecutive $0s$ or two consecutive $1s?$
admin
asked
in
Combinatory
May 2, 2020
by
admin
119
views
kenneth-rosen
discrete-mathematics
counting
descriptive
0
votes
0
answers
149
Kenneth Rosen Edition 7 Exercise 8.1 Question 15 (Page No. 511)
Find a recurrence relation for the number of ternary strings of length n that do not contain two consecutive $0s$ or two consecutive $1s.$ What are the initial conditions? How many ternary strings of length six do not contain two consecutive $0s$ or two consecutive $1s?$
admin
asked
in
Combinatory
May 2, 2020
by
admin
157
views
kenneth-rosen
discrete-mathematics
counting
descriptive
0
votes
0
answers
150
Kenneth Rosen Edition 7 Exercise 8.1 Question 14 (Page No. 511)
Find a recurrence relation for the number of ternary strings of length n that contain two consecutive $0s.$ What are the initial conditions? How many ternary strings of length six contain two consecutive $0s?$
admin
asked
in
Combinatory
May 2, 2020
by
admin
112
views
kenneth-rosen
discrete-mathematics
counting
descriptive
Page:
« prev
1
2
3
4
5
6
7
8
9
10
...
39
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 kenneth-rosen
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:...