Posted by **Francesca ** on Tuesday, March 22, 2011 at 3:58pm.

Use mathematical induction to establish the following formula.

n

Σ i² / [(2i-1)(2i+1)] = n(n+1) / 2(2n+1)

i=1

Thanks for any helpful replies :)

- Discrete Math -
**Reiny**, Tuesday, March 22, 2011 at 5:48pm
check if true for n=1

LS = 1/(1(3)) = 1/3

RS = 1(2)/(2(3) = 2/6 = 1/3 , checks!

Assume it to be true for n = k

that is ....

1/(1(3)) + 4/(3(5)) = .... k^2/((2k-1)(2k+1)) = k(k+1)/(2(2k+1))

prove then it must be true for n = k+1

that is

1/(1(3)) + 4/(3(5)) + .. + (k+1)^2/((2k+1)(2k+3)) = (k+1)(k+2)/(2(2k+3))

LS = k(k+1)/2(2k+1)) + (k+1)^2/((2k+1)(2k+3))

=[k(k+1)(2k+3) + 2(k+1)^2]/[2(2k+1)(2k+3)]

= (k+1)[k)2k+3) + 2(k+1)]/[2(2k+1)(2k+3)]

= (k+1)[2k^2 + 5k + 2]/[2(2k+1)(2k+3)]

= (k+1)(2k+1)(k+2)/[2(2k+1)(2k+3)]

= (k+1)(k+2)/(22k+3)

= RS

QED!

- small typo - Discrete Math -
**Reiny**, Tuesday, March 22, 2011 at 5:50pm
6th line should have been

1/(1(3)) + 4/(3(5)) + .... + k^2/((2k-1)(2k+1)) = k(k+1)/(2(2k+1))

- Discrete Math -
**Francesca **, Tuesday, March 22, 2011 at 6:27pm
Ok thank you for your helpful response! I have a couple of questions though. . .

Is the 15th line suppose to be '(k+1)(k+2)/(22k+3)'?

Also, the 16th line = RS, which is what exactly?

- Discrete Math -
**Reiny**, Tuesday, March 22, 2011 at 6:58pm
line 15th, clearly a typo, was hoping you would realize it was

= (k+1)(k+2)/(2(2k+3))

in 1/(1(3)) + 4/(3(5)) + .. + (k+1)^2/((2k+1)(2k+3)) = (k+1)(k+2)/(2(2k+3))

there is a left side (LS) and a right side (RS) of the equation.

I started with LS and proved that it equals the RS, thus showing that the equation is true.

- Discrete Math -
**Francesca **, Tuesday, March 22, 2011 at 7:22pm
Yea that's what I thought. . .Hey if you don't mind helping me further I have been working on this problem for a while and I am a bit stuck. IDK where to go from here or if I am doing it correctly:

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 ≥ 1, and the result is true for n = k; that is 7 | (5^2k + 2^5k). Use the assumption to prove n = k + 1, in other words, 5^(2(k + 1)) - 2^(5(k + 1)) is divisible by 7. Now,

5^(2(k + 1)) - 2^(5(k + 1))

= 5^(2k + 2) - 2(5k + 5)

= 5^(2k) · 5^2 - 2^(5k) · 2^5

= 25 · 5^(2k) - 32 · 2^(5k)

= IDK what to do from here. . .

Any suggestions? Thank you again!

- Discrete Math -
**Francesca **, Tuesday, March 22, 2011 at 10:24pm
Any suggestions?

## Answer this Question

## Related Questions

- Discrete Math - Why use mathematical induction to get the sum of a sequence? ...
- Discrete Math - Use mathematical induction to prove the truth of each of the ...
- Discrete Math - Justifying your conclusions (you could also use examples in ...
- Math - The scores of 10 students on their midterm exam (x) and on their final (y...
- Math - Mathematical Induction - 3. Prove by induction that∑_(r=1)^n▒...
- Discrete Math - Use mathematical induction to prove the truth of each of the ...
- Algebra - I'm trying ti find the correlation coefficient for the following: The ...
- PRE CAL SEQUENCES - Given the following finite sum 1/(1*2)+1/(2*3)+1/(3*4)+1/(4*...
- Discrete Math - Congruence True or False: (give reason) _ __ 2 ∈ 18 (mod ...
- Discrete Math - Find f(1), f(2), and f(3) if f(n) is defined recursively by f(0...

More Related Questions