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 counting
0
votes
0
answers
271
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
207
views
kenneth-rosen
discrete-mathematics
counting
descriptive
0
votes
0
answers
272
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
218
views
kenneth-rosen
discrete-mathematics
counting
descriptive
0
votes
1
answer
273
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
274
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
226
views
kenneth-rosen
discrete-mathematics
descriptive
counting
0
votes
0
answers
275
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
226
views
kenneth-rosen
discrete-mathematics
counting
descriptive
0
votes
0
answers
276
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
162
views
kenneth-rosen
discrete-mathematics
counting
descriptive
0
votes
0
answers
277
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
156
views
kenneth-rosen
discrete-mathematics
counting
descriptive
0
votes
0
answers
278
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
279
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
280
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
114
views
kenneth-rosen
discrete-mathematics
counting
descriptive
1
vote
1
answer
281
Kenneth Rosen Edition 7 Exercise 8.1 Question 13 (Page No. 511)
A string that contains only $0s, 1s,$ and $2s$ is called a ternary string. Find a recurrence relation for the number of ternary strings of length $n$ that do not contain two consecutive $0s.$ What are the initial conditions? How many ternary strings of length six do not contain two consecutive $0s?$
admin
asked
in
Combinatory
May 2, 2020
by
admin
335
views
kenneth-rosen
discrete-mathematics
counting
descriptive
1
vote
0
answers
282
Kenneth Rosen Edition 7 Exercise 8.1 Question 12 (Page No. 511)
Find a recurrence relation for the number of ways to climb $n$ stairs if the person climbing the stairs can take one, two, or three stairs at a time. What are the initial conditions? In many ways can this person climb a flight of eight stairs?
admin
asked
in
Combinatory
May 2, 2020
by
admin
141
views
kenneth-rosen
discrete-mathematics
counting
descriptive
2
votes
1
answer
283
Kenneth Rosen Edition 7 Exercise 8.1 Question 11 (Page No. 511)
Find a recurrence relation for the number of ways to climb n stairs if the person climbing the stairs can take one stair or two stairs at a time. What are the initial conditions? In how many ways can this person climb a flight of eight stairs?
admin
asked
in
Combinatory
May 2, 2020
by
admin
330
views
kenneth-rosen
discrete-mathematics
counting
descriptive
1
vote
1
answer
284
Kenneth Rosen Edition 7 Exercise 8.1 Question 10 (Page No. 511)
Find a recurrence relation for the number of bit strings of length $n$ that contain the string $01$. What are the initial conditions? How many bit strings of length seven contain the string $01?$
admin
asked
in
Combinatory
May 1, 2020
by
admin
392
views
kenneth-rosen
discrete-mathematics
counting
descriptive
0
votes
0
answers
285
Kenneth Rosen Edition 7 Exercise 8.1 Question 9 (Page No. 511)
Find a recurrence relation for the number of bit strings of length n that do not contain three consecutive $0s.$ What are the initial conditions? How many bit strings of length seven do not contain three consecutive $0s?$
admin
asked
in
Combinatory
May 1, 2020
by
admin
214
views
kenneth-rosen
discrete-mathematics
counting
descriptive
0
votes
0
answers
286
Kenneth Rosen Edition 7 Exercise 8.1 Question 8 (Page No. 511)
Find a recurrence relation for the number of bit strings of length $n$ that contain three consecutive $0s.$ What are the initial conditions? How many bit strings of length seven contain three consecutive $0s?$
admin
asked
in
Combinatory
May 1, 2020
by
admin
171
views
kenneth-rosen
discrete-mathematics
counting
descriptive
0
votes
0
answers
287
Kenneth Rosen Edition 7 Exercise 8.1 Question 7 (Page No. 510 - 511)
Find a recurrence relation for the number of bit strings of length $n$ that contain a pair of consecutive $0s$. What are the initial conditions? How many bit strings of length seven contain two consecutive $0s?$
admin
asked
in
Combinatory
May 1, 2020
by
admin
205
views
kenneth-rosen
discrete-mathematics
counting
descriptive
0
votes
0
answers
288
Kenneth Rosen Edition 7 Exercise 8.1 Question 6 (Page No. 510)
Find a recurrence relation for the number of strictly increasing sequences of positive integers that have 1 as their first term and n as their last term, where n is a positive integer. That is, sequences $a_{1}, a_{2},\dots,a_{k},$ ... How many sequences of the type described in $(A)$ are there when $n$ is an integer with $n \geq 2?$
admin
asked
in
Combinatory
May 1, 2020
by
admin
198
views
kenneth-rosen
discrete-mathematics
counting
descriptive
0
votes
0
answers
289
Kenneth Rosen Edition 7 Exercise 8.1 Question 5 (Page No. 510)
How many ways are there to pay a bill of $17$ pesos using the currency described in question $4,$ where the order in which coins and bills are paid matters?
admin
asked
in
Combinatory
May 1, 2020
by
admin
200
views
kenneth-rosen
discrete-mathematics
counting
descriptive
0
votes
0
answers
290
Kenneth Rosen Edition 7 Exercise 8.1 Question 4 (Page No. 510)
A country uses as currency coins with values of $1$ peso, $2$ pesos, $5$ pesos, and $10$ pesos and bills with values of $5$ pesos, $10$ pesos, $20$ pesos, $50$ pesos, and $100$ pesos. Find a recurrence relation for the number of ways to pay a bill of $n$ pesos if the order in which the coins and bills are paid matters.
admin
asked
in
Combinatory
May 1, 2020
by
admin
261
views
kenneth-rosen
discrete-mathematics
counting
descriptive
0
votes
0
answers
291
Kenneth Rosen Edition 7 Exercise 8.1 Question 3 (Page No. 510)
A vending machine dispensing books of stamps accepts only one-dollar coins, $\$1$ bills, and $\$5$ bills. Find a recurrence relation for the number of ways to deposit $n$ dollars in the vending machine, where the order in which ... $10$ for a book of stamps?
admin
asked
in
Combinatory
May 1, 2020
by
admin
306
views
kenneth-rosen
discrete-mathematics
counting
descriptive
0
votes
0
answers
292
Kenneth Rosen Edition 7 Exercise 8.1 Question 2 (Page No. 510)
Find a recurrence relation for the number of permutations of a set with $n$ elements. Use this recurrence relation to find the number of permutations of a set with $n$ elements using iteration
admin
asked
in
Combinatory
May 1, 2020
by
admin
228
views
kenneth-rosen
discrete-mathematics
counting
descriptive
0
votes
0
answers
293
Kenneth Rosen Edition 7 Exercise 8.1 Question 1 (Page No. 510)
Use mathematical induction to verify the formula derived in Example $2$ for the number of moves required to complete the Tower of Hanoi puzzle.
admin
asked
in
Combinatory
May 1, 2020
by
admin
192
views
kenneth-rosen
discrete-mathematics
counting
descriptive
0
votes
0
answers
294
Kenneth Rosen Edition 7 Exercise 6.6 Question 16 (Page No. 439)
The remaining exercises in this section develop another algorithm for generating the permutations of $\{1, 2, 3,\dots,n\}.$ This algorithm is based on Cantor expansions of integers. Every nonnegative integer less than $n!$ has ... between Cantor expansions and permutations as described in the preamble to question $14.$ $3$ $89$ $111$
admin
asked
in
Combinatory
May 1, 2020
by
admin
462
views
kenneth-rosen
discrete-mathematics
counting
combinatory
descriptive
0
votes
0
answers
295
Kenneth Rosen Edition 7 Exercise 6.6 Question 17 (Page No. 438)
The remaining exercises in this section develop another algorithm for generating the permutations of $\{1, 2, 3,\dots,n\}.$ ... all permutations of a set of n elements based on the correspondence described in the preamble to question $14.$
admin
asked
in
Combinatory
May 1, 2020
by
admin
505
views
kenneth-rosen
discrete-mathematics
counting
combinatory
descriptive
0
votes
0
answers
296
Kenneth Rosen Edition 7 Exercise 6.6 Question 15 (Page No. 438)
Show that the correspondence described in the preamble is a bijection between the set of permutations of $\{1, 2, 3,\dots,n\}$ and the nonnegative integers less than $n!.$
admin
asked
in
Combinatory
May 1, 2020
by
admin
241
views
kenneth-rosen
discrete-mathematics
counting
combinatory
descriptive
0
votes
0
answers
297
Kenneth Rosen Edition 7 Exercise 6.6 Question 14 (Page No. 438)
The remaining exercises in this section develop another algorithm for generating the permutations of $\{1, 2, 3,\dots,n\}.$ This algorithm is based on Cantor expansions of integers. Every nonnegative integer less than $n!$ has a unique ... $a_{1}, a_{2},\dots,a_{nā1}$ that correspond to these permutations. $246531$ $12345$ $654321$
admin
asked
in
Combinatory
May 1, 2020
by
admin
359
views
kenneth-rosen
discrete-mathematics
counting
combinatory
descriptive
0
votes
1
answer
298
Kenneth Rosen Edition 7 Exercise 6.6 Question 13 (Page No. 438)
List all $3$-permutations of $\{1, 2, 3, 4, 5\}.$
admin
asked
in
Combinatory
May 1, 2020
by
admin
287
views
kenneth-rosen
discrete-mathematics
counting
combinatory
descriptive
0
votes
1
answer
299
Kenneth Rosen Edition 7 Exercise 6.6 Question 12 (Page No. 438)
Develop an algorithm for generating the $r$-permutations of a set of $n$ elements.
admin
asked
in
Combinatory
May 1, 2020
by
admin
233
views
kenneth-rosen
discrete-mathematics
counting
combinatory
descriptive
0
votes
0
answers
300
Kenneth Rosen Edition 7 Exercise 6.6 Question 11 (Page No. 438)
Show that Algorithm $3$ produces the next larger $r$-combination in lexicographic order after a given $r$-combination.
admin
asked
in
Combinatory
May 1, 2020
by
admin
228
views
kenneth-rosen
discrete-mathematics
counting
combinatory
descriptive
Page:
« prev
1
...
5
6
7
8
9
10
11
12
13
14
15
...
24
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 counting
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:...