Computer Science, asked by anthatisnehaa36, 1 month ago

1,3)
solve the following recurrences exactly.
T(1) = 1 ,T (2) =6 and for all n>=3 T(n)= T(n-2) +3n+4

Answers

Answered by pariandshivmalhotra

3

Answer:

Sorry I dont know this

Previous Question

Next Question

Similar questions

Hindi, 15 days ago

Jo hokar hi hi rahe anek shabd...

English, 15 days ago

Pehli barish bay nasir kazmi...

Math, 15 days ago

You have 4 chocolate bars to share evenly among you and your 2 sisters...

Math, 1 month ago

4,2,8,4,24,12,96,....? find the next Number ...

Hindi, 1 month ago

4. लेखिका को राजेंद्र बाबू से निकटता का अवसर कब मिला?

Math, 8 months ago

If the equation secx+cosecx=c has three real roots between 0 and pi then 1)c^2= 8 2)c^2 8 4)0...

Hindi, 8 months ago

क → आशय स्पष्ट करो रस उठेलकर गा लेती...

Science, 8 months ago

[Fill in the blanks with article and preposition] 1) we strongly condem the terror act ________February 14, 2019 . 2) It occured ________ Tom that he wished he was Sick. 3) hair was ________vague possibility.