Recursive Formula - Discrete Math - Quiz, Exercises of Discrete Mathematics

Main points of this past exam are: Recursive Formula, Meant, Significance, Proof, Million Dollars, Computes, Product

Typology: Exercises

2012/2013

Uploaded on 03/31/2013

parthivi
parthivi 🇮🇳

4.1

(8)

85 documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Prof. S. Brick Discrete Math; Quiz 3 Math 267
Spring ’02 section 1
0. Print your name:
1. Explain briefly what is meant by “P” and “NP” in “P=NP”. Besides the million dollars
you would win, what would be the significance of a proof of “P=NP” ?
2. Give a recursive formula that computes the product of the first nodd integers.
3. Prove that f1+f3+. . . +f2n1=f2nwhere fkis the kth Fibonacci number.

Partial preview of the text

Download Recursive Formula - Discrete Math - Quiz and more Exercises Discrete Mathematics in PDF only on Docsity!

Prof. S. Brick Discrete Math; Quiz 3 Math 267

Spring ’02 section 1

  1. Print your name:
  2. Explain briefly what is meant by “P” and “NP” in “P=NP”. Besides the million dollars you would win, what would be the significance of a proof of “P=NP”?
  3. Give a recursive formula that computes the product of the first n odd integers.
  4. Prove that f 1 + f 3 +... + f 2 n− 1 = f 2 n where fk is the kth Fibonacci number.