 # 1. (5 pts) Compute the following sums. You do not have to fully sim...

## Question

Show transcribed text

## Transcribed Text

1. (5 pts) Compute the following sums. You do not have to fully simplify your answer but your answer cannot have a summation (symbol) in it. (a) 18 1 i-3 (b) [2f (c) (2i-4) 2. (4 pts) Prove that ((2i-4)EO(nf) --1 3. (2 pts) Let f(n) - n2, g(n) - n h(n) n° and p(ni) - n. For each statement, fill in the blank with the best answer from f(n), g(n), h(n) or p(n), that fits the statement. a)3n³ log 1-15n+2e O( b)7n4 -n logn+ ) 4. (5 pts) Consider the following pseudocode. How many times is the print subroutine called? Write your answer first using sums and then compute the closed form it (e.g., the closed form of - i is n(n +1)/2). i-1 Assume that nis large enough for both loops to execute at least once. for from 1 to n do for from 2 ton*n do print 'Q' end do print newline end do 5. (4 pts) Prove that / (n) - 3n³-4n² +17 e (2(n)). Show your work.

## Solution Preview

These solutions may offer step-by-step problem-solving explanations or good writing examples that include modern styles of formatting and construction of bibliographies out of text citations and references. Students may use these solutions for personal skill-building and practice. Unethical use is strictly forbidden.

By purchasing this solution you'll be able to access the following files:
Solution.docx.

\$25.00
for this solution

or FREE if you
register a new account!

PayPal, G Pay, ApplePay, Amazon Pay, and all major credit cards accepted.

### Find A Tutor

View available Discrete Math Tutors

Get College Homework Help.

Are you sure you don't want to upload any files?

Fast tutor response requires as much info as possible.