You are not logged in.

- Topics: Active | Unanswered

Pages: **1**

**broncos18****Member**- Registered: 2014-01-28
- Posts: 4

for every positive integer n?

I did the base case and was able to do the s(k) but when I was doing the s(k+1) I got lost for the LHS

Offline

**bob bundy****Moderator**- Registered: 2010-06-20
- Posts: 6,914

hi broncos18

Welcome to the forum.

Does it have to be proved by induction?

My method, hint:

Bob

You cannot teach a man anything; you can only help him find it within himself..........Galileo Galilei

Offline

**broncos18****Member**- Registered: 2014-01-28
- Posts: 4

Yes, this problem has to be proved by induction

Offline

**bob bundy****Moderator**- Registered: 2010-06-20
- Posts: 6,914

OK.

So we'll assume the n-1 th case

Get both fractions over the same denominator:

I've left a few ??? for you to complete. Can you finish it from here?

Bob

You cannot teach a man anything; you can only help him find it within himself..........Galileo Galilei

Offline

**broncos18****Member**- Registered: 2014-01-28
- Posts: 4

Is it

Offline

**bob bundy****Moderator**- Registered: 2010-06-20
- Posts: 6,914

Yes, that's good for the first ???

Bob

Offline

**broncos18****Member**- Registered: 2014-01-28
- Posts: 4

Offline

**bob bundy****Moderator**- Registered: 2010-06-20
- Posts: 6,914

That's it! Just cancel an 'n'.

Bob

Offline

Pages: **1**