use induction to prove (12)+(23)+(34)+...+(n-1)n= n(n-1)(n+1)/3 for all n >= 2.

Question

Question

use induction to prove (1*2)+(2*3)+(3*4)+...+(n-1)*n= n(n-1)(n+1)/3 for all n >= 2.

math Advanced-Math

Answer 1

Answer #1

Using induction proof is as follows

To prove, 12+2 3+3 4 + ... + (n-1). A = n(n-1) (n+1) 9 ; n22 3 For n=2, L.H.S = 1x2 =2 R.H.S= 2(2-1)(2+1) - 2 3 So relation i

Answer 2

Similar Homework Help Questions

.n= n(n-1)(n+1) for all n > 2. 12. Use induction to prove (1 : 2) +(2-3)+(3-4)...

.n= n(n-1)(n+1) for all n > 2. 12. Use induction to prove (1 : 2) +(2-3)+(3-4) +...+(n-1).n [9 points) 3
Prove using mathematical induction that 3" + 4" < 5" for all n > 2.

Prove using mathematical induction that 3" + 4" < 5" for all n > 2.
Use the Principle of Mathematical Induction to prove that (2i+3) = n(n + 4) for all...

Use the Principle of Mathematical Induction to prove that (2i+3) = n(n + 4) for all n > 1.

Induction proofs. a. Prove by induction: n sum i^3 = [n^2][(n+1)^2]/4 i=1 Note: sum is intended...

Induction proofs. a. Prove by induction: n sum i^3 = [n^2][(n+1)^2]/4 i=1 Note: sum is intended to be the summation symbol, and ^ means what follows is an exponent b. Prove by induction: n^2 - n is even for any n >= 1 10 points 6) Given: T(1) = 2 T(N) = T(N-1) + 3, N>1 What would the value of T(10) be? 7) For the problem above, is there a formula I could use that could directly calculate T(N)?...
Discrete Math Use mathematical induction to prove that for all positive integers n, 2 + 4...

Discrete Math Use mathematical induction to prove that for all positive integers n, 2 + 4 + ... + (2n) = n(n+1).
. 1. Prove by induction that for all integers n≥1, 4+8+12+...+4n = 2n^2+2n 2. A number...

. 1. Prove by induction that for all integers n≥1, 4+8+12+...+4n = 2n^2+2n 2. A number a is divisible by b if the remainder of dividing a by b is zero. For example 10 is divisible by 5 but 11 is not divisible by 5. Prove by induction that for all integers n≥1,11^n - 6 is divisible by 5. 3. Prove by induction that for all integers n ≥ 1, 3^n ≥ 2^n+n^2

Prove using mathematical induction: (4) Prove that for all n E N, 3(7" – 4”).

Prove using mathematical induction: (4) Prove that for all n E N, 3(7" – 4”).
1. Prove the following statement by mathematical induction. For all positive integers n. 2++ n+1) =...

1. Prove the following statement by mathematical induction. For all positive integers n. 2++ n+1) = 2. Prove the following statement by mathematical induction. For all nonnegative integers n, 3 divides 22n-1. 3. Prove the following statement by mathematical induction. For all integers n 27,3" <n!
Proofs using induction: In 3for all n 2 0. n+11 Use the Principle of Mathematical Induction...

Proofs using induction: In 3for all n 2 0. n+11 Use the Principle of Mathematical Induction to prove that 1+3+9+27+3 Use the Principle of Mathematical Induction to prove that n3> n'+ 3 for all n 22

7n Use Mathematical Induction to prove that Σ 2-2n+1-2, for all n e N

7n Use Mathematical Induction to prove that Σ 2-2n+1-2, for all n e N

use induction to prove (1*2)+(2*3)+(3*4)+...+(n-1)*n= n(n-1)(n+1)/3 for all n >= 2.