Purchase Solution

prove the proposition

Not what you're looking for?

Ask Custom Question

Prove by induction that

fib(1) + fib(2) + ... + fib(n) = fib(n + 2) - 1.

Purchase this Solution
Solution Summary

The solution helps to prove the proposition.

Solution Preview

We need to prove the proposition P(n) by the method of Mathematical Induction.
P(n): fib(1) + fib(2) + ... + fib(n) = fib(n + 2) - 1

Induction steps:
1) For n = 1, we have fib(1) = fib (1 + 2) - 1 = fib (3) - 1
We know that the Fibonacci sequence is 1, ...

Purchase this Solution
Free BrainMass Quizzes
Basic Computer Terms

We use many basic terms like bit, pixel in our usual conversations about computers. Are we aware of what these mean? This little quiz is an attempt towards discovering that.

C++ Operators

This quiz tests a student's knowledge about C++ operators.

Inserting and deleting in a linked list

This quiz tests your understanding of how to insert and delete elements in a linked list. Understanding of the use of linked lists, and the related performance aspects, is an important fundamental skill of computer science data structures.

Javscript Basics

Quiz on basics of javascript programming language.

Java loops

This quiz checks your knowledge of for and while loops in Java. For and while loops are essential building blocks for all Java programs. Having a solid understanding of these constructs is critical for success in programming Java.

View More Free Quizzes
Related BrainMass Solutions

  • Prove the following Proposition

    457840 Prove the following Proposition Prove the following Proposition: On Z_n, both * and + are commutative and associative. The identity for Z_n with * is [1] and the identity for + is [0].

  • Congruent Modulo m

    Proposition 4 If is a fixed integer and then: (1) (2) If then (3) If and , then Proof: Before proceeding to prove any of the above propositions, we recollect the definition of the relation ' congruent modulo m' for any

  • How to prove sqrt(3) is irrational

    The proposition "if x is a real number and x^2=4, then x is irrational." is false since x=2=2/1 is rational and 2^2=4. Pinpoint where in the previous argument the proof of this proposition breaks down.

  • Quadratic Function in 2 variables and Mathematical Induction

    Thus if the proposition is true for k, its also true for k+1 and so on. b) 3^n > n^2 for n >= 1 for n = 1 3 > 1 and hence the proposition is true. for n = 2 9 > 4 and hence proposition is true.

  • Categorical Propositions: O-proposition

    This is probably one of the easiest propositions to identify, especially if you've ever heard the phrase: "There's always an exception to the rule." Think of the O-proposition as existing to prove that phrase.

  • Recursive definitions

    = f(3)*f(4) Hence the proposition holds for the base case n = 3.

  • Proofs : Denumerable Sets and Cartesian Products

    Proposition 14.2.3: If A and B are denumerable sets then so is their Cartesian product , AX B. We use Proposition 14.2.3 to prove Corollary 14.2.4. Proof: When , is a denumerable set from the condition.

  • tautology

    Once we have these, the left side of the proposition can be determined (column 7).

  • Measurable Functions

    382717 Measurable Functions Prove directly from Proposition 17.2 that each of the following function is measurable on [0,1]. a) f(x)=3 for all x in [0,1] b) f(x) =x for all x in [0,1] c) f(x)=1 if x in (0,1], f(x)=0 if x=0.

View More Related Solutions