We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>
+ Link For Assignments, GDBs & Online Quizzes Solution
+ Link For Past Papers, Solved MCQs, Short Notes & More
Dear Students! Share your Assignments / GDBs / Quizzes files as you receive in your LMS, So it can be discussed/solved timely. Add Discussion
How to Add New Discussion in Study Group ? Step By Step Guide Click Here.
CS702 Assignment No 01 Solution & Discussion Fall 2016
.+ http://bit.ly/vucodes (Link for Assignments, GDBs & Online Quizzes Solution)
+ http://bit.ly/papersvu (Link for Past Papers, Solved MCQs, Short Notes & More)+ Click Here to Search (Looking For something at vustudents.ning.com?) + Click Here To Join (Our facebook study Group)
Please Discuss here about this assignment.Thanks
Our main purpose here discussion not just Solution
We are here with you hands in hands to facilitate your learning and do not appreciate the idea of copying or replicating solutions.
Prove the following by induction.
We need to identify the three basic elements of the proof.
Induction Hypothesis: It is what we need to prove,
Base Case: We need to show that the induction hypothesis holds for the value of n = 1.
This is easy to show.
The left hand side of the equality is
When n = 1, the value of the left hand side is
The right hand side in this case is equal to
Therefore, for the base case, the left hand side is equal in value to the
right hand side. In other words, the induction hypothesis holds for the base case.
Induction Step: Here we need to show that if the induction hypothesis holds for an arbitrary positive integer value k (and for each positive integer smaller than k), it holds for the next higher integer k + 1. Let us assume that for some k >= 1, the induction hypothesis holds.
We need to show that
The proof follows. Let us start from the right hand side of the equation given immediately
The sequence<un>is defined by the recurrence
You have initial conditionu1 = 1:
Now you have to showunin terms of Fibonacci / Lucasnumbers.
We first prove a straightforward lemma.
Lemma: For all n>=1;
Proof (of the Lemma): From straightforward manipulations of the Binet formulas for Fn and Ln; one can easily show that
Thus we have
Which is (1) also,
Which is (2) also
Now we can prove the result in Question.
Theorem: For all n>=1,
Let so our goal is to prove that for all n>=1 it is clear that
Hence we need only check that unsatisfies
From Lemma above
Dear will you able to attach it in MSword form it seen some steps or words is missing...
2nd Question is easy to solve but in 1st question we have to convert 1st order Recurrence relation to 2nd order.
if u know then help... not getting it...
solve it for us
M.Tariq aap he help kr dain... jaldi
right solution for question no.2 of CS702 assignment?
question 1 plz
thanks :-) questions no 2 ka bsolution bata dain