The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
GATE Overflow
Facebook Login
Google Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
Blogs
New Blog
Exam Category
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions.
Kenneth Rosen (Special Indian Edition) Section 6.1 Exercise Problem #9d
+1
vote
155
views
Solve the recurrence relation $a_n = a_{n1} + 2n + 3, a_0 = 4$
kennethrosen
discretemathematics
permutationsandcombinations
recurrence
recurrencerelation
asked
Dec 22, 2016
in
Combinatory
by
Rounak Agarwal
Junior
(
507
points)
retagged
Jun 27
by
Arjun

155
views
Facebook
Google+
Twitter
answer
comment
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
1
Answer
+3
votes
Best answer
The recurrence relation is n^2 + 4n + 4
answered
Dec 23, 2016
by
Arnabi
Boss
(
8.1k
points)
selected
Dec 30, 2016
by
Rounak Agarwal
comment
Thanks :)
I had made the mistake of adding up all the constant terms and then looking for some pattern in them :p
Welcome.:)
Please
log in
or
register
to add a comment.
← Prev. Qn. in Sub.
Next Qn. in Sub. →
← Prev.
Next →
Related questions
+1
vote
1
answer
1
Kenneth Rosen (Special Indian Edition) Section 5.1 Exercise Problem # 5
asked
Dec 19, 2016
in
Combinatory
by
Rounak Agarwal
Junior
(
507
points)

322
views
kennethrosen
permutationsandcombinations
discretemathematics
counting
+4
votes
2
answers
2
ISBN9780070681880  Exercise 5.3  Problem 35 (Kenneth Rosen 7ed SIE)
asked
May 27
in
Mathematical Logic
by
Rounak Agarwal
Junior
(
507
points)

113
views
kennethrosen
discretemathematics
permutationsandcombinations
counting
+1
vote
1
answer
3
rosen exercise problem
How many bit strings of length 10 contain at least three 1s and at least three 0s? My Approach:> using product rule There are 3 subtask following (filling 3 ones in 10 places) = (filling 3 zeros in remaing 7 places) = (filling ... is greater than (total number of string). Now , i want to know what is wrong in my apporach. please explain..
asked
Jul 11
in
Combinatory
by
indrajeet
Active
(
1.9k
points)

85
views
discretemathematics
permutationsandcombinations
kennethrosen
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
Jobs @cvppindia
How to be productive?For all Members,GATE Aspirants, everybody associated with "GO Family"
How to Do preparation for Gate2018
How to write nice answers/questions in GO
Organizing NET Questions
All categories
General Aptitude
1.1k
Engineering Mathematics
4k
Discrete Mathematics
2.8k
Mathematical Logic
1k
Set Theory & Algebra
772
Combinatory
512
Graph Theory
459
Probability
515
Linear Algebra
401
Calculus
311
Digital Logic
1.7k
Programming & DS
2.9k
Algorithms
2.6k
Theory of Computation
3.2k
Compiler Design
1.2k
Operating System
2.3k
Databases
2.3k
CO & Architecture
2.1k
Computer Networks
2.4k
Non GATE
795
Others
1.2k
Admissions
244
Exam Queries
419
Tier 1 Placement Questions
16
Job Queries
40
Projects
4
Follow @csegate
Gatecse
Recent Blog Comments
Hilarious :)
Visit exam center at your own risk ...
@papesh, Thanks. Helpful Post. Waiting for the ...
Thank you very much. :)
written exam wil held in jammu only..:(
28,947
questions
36,793
answers
91,077
comments
34,690
users