1. Use mathematical induction to prove the following: 1(i+1)==(n+1)(n+2) 2. As a function of n, give...

Transcribed Image Text:

1. Use mathematical induction to prove the following: 1(i+1)==(n+1)(n+2) 2. As a function of n, give an exact closed-form solution (no embedded sums) to the following summation f(n) = ?" t 3. Show that 373n+100 is O(n) (by selecting appropriate constants c and no). 4. Prove the following by specific constants c and no: f(n) = n + 2n-8=0(n) 5. Prove or disprove: f(n) = 2+1 is 0(2) 6. Analyze the running time of the following code snippet. Express the running time in Big-O notation: for (1-1; i =1; j/-2) printf(""); } // end-for 7. You are given an array nums[0..n-1] of integers, some positive some negative. You would like to determine whether there exists two elements nums[i] & nums[i] such that nums[i] =-nums[j]. If nums contains 0, then the answer is always true. bool containsNegativePositivePair(int nums[]); Constraints:-2 1. Use mathematical induction to prove the following: 1(i+1)==(n+1)(n+2) 2. As a function of n, give an exact closed-form solution (no embedded sums) to the following summation f(n) = ?" t 3. Show that 373n+100 is O(n) (by selecting appropriate constants c and no). 4. Prove the following by specific constants c and no: f(n) = n + 2n-8=0(n) 5. Prove or disprove: f(n) = 2+1 is 0(2) 6. Analyze the running time of the following code snippet. Express the running time in Big-O notation: for (1-1; i =1; j/-2) printf(""); } // end-for 7. You are given an array nums[0..n-1] of integers, some positive some negative. You would like to determine whether there exists two elements nums[i] & nums[i] such that nums[i] =-nums[j]. If nums contains 0, then the answer is always true. bool containsNegativePositivePair(int nums[]); Constraints:-2

Answer rating: 100% (QA)

1 To prove the given summation using mathematical induction we first need to establish the base case and then assume the summation holds for some arbi... View the full answer