Math - Mathematical Induction

3. Prove by induction that∑_(r=1)^n▒〖r(r+4)=1/6 n(n+1)(2n+13)〗.

5. It is given that u_1=1 and u_(n+1)=3u_n+2n-2 where n is a positive integer.
Prove, by induction, that u_n=3^n/2-n+1/2.

14. The rth term of a sequence is given by u_r=r(3r+1),r=1,2,3,…
i) Write down the values of ∑_(r=1)^n▒u_r for n=1,2,3, and 4.
ii) Make a conjecture for a formula for ∑_(r=1)^n▒u_r , giving your answer in the form nf(n), where f(n) is a function of n.
iii) Prove by induction a formula for ∑_(r=1)^n▒u_r .

If the text isn't displaying properly, please use my screenshot.

Sorry about the inconvenience, and thanks!

  1. 2
asked by Iman

Respond to this Question

First Name

Your Response

Similar Questions

  1. Computer proof

    Prove by induction on all positive integer k that if m is any ordinary nfa with k states, and m has fewer than k - 1 transitions, then there exists a state of m that is not reachable. Let N be the λ-NFA: "L" for "λ" b >(1)
  2. Calculus

    Use mathematical induction to prove that the statement holds for all positive integers. Also, label the basis, hypothesis, and induction step. 1 + 5 + 9 + … + (4n -3)= n(2n-1)
  3. AP Calc

    Use mathematical induction to prove that the statement holds for all positive integers. Also, can you label the basis, hypothesis, and induction step in each problem. Thanks 1. 2+4+6+...+2n=n^2+n 2. 8+10+12+...+(2n+6)=n^2+7n
  4. Discrete Math Help

    1) How would I prove that (n - 1 + 2 C 2) = n + (n C 2) 2) A cafeteria offers 17 types of pizza and 5 types of soda. Bob goes there everyday for lunch, always buying two slices of pizza and one soda. However, he never gets exactly
  5. math

    There is one step in a proof that I don't understand. Could someone please explain? u = any vector in vector space S W = finite dimensional subspace of S with orthonormal basis of vectors {v1, v2, ..., vn} The theorem to prove is:
  6. precalculus

    Can you check my answers? 1.Which of the following shows the best next step to prove the following by mathematical induction? 3^n>n*2^n, n≥1 1.When n=1, the formula is valid because 3^1 1*2^1 3>2 2.Assuming that 3^k>k*2^k
  7. Algebra

    To prove: (1 + 2 + 4 + . . . + 2n) + 1 = 2n+1 , ?n = 0 by induction
  8. Theory of Computing

    1. Prove by induction that b - a | b^n - a^n for all n >= 1.
  9. Discrete Math

    Use mathematical induction to prove the truth of each of the following assertions for all n ≥1. 5^2n – 2^5n is divisible by 7 If n = 1, then 5^2(1) - 2^5(1) = -7, which is divisible by 7. For the inductive case, assume k ≥
  10. math

    use mathematical induction to prove -1/2^n = 1/2^n - 1

More Similar Questions