# Proof by Induction FP3Watch

Announcements
#1
I don't know how to proceed after a few steps in the question, and having had a look at the MS, I don't get it.

Its says: prove that for

I said for n = k
n = k + 1

But I don't know what to do next.

Help appreciated
0
#2
(Original post by Angus-Higgins)
Consider what you need to show, namely that:

.

Angus Higgins
I know that, but how do I proceed from the step I mentioned?
We can expand to say that

But there is a step from where I am stuck on, to that, and I don't understand it.
0
11 years ago
#3
1 is always less than k..

Idk what the mark scheme wants from you, really.. what does it say?
0
11 years ago
#4
(Original post by The Sherminator)
I know that, but how do I proceed from the step I mentioned?
We can expand to say that

But there is a step from where I am stuck on, to that, and I don't understand it.
Well, you've already established As it only wants proof for n >= 3, you can safely assume that .
0
#5
4k is bigger than (2k + 2) so we change 2k + 2k to (2k + 2) and continue the proof? Why do we swap though, thats what is confusing me (sorry for sounding daft )

That is what the MS does as well.
0
#6
(Original post by DoMakeSayThink)
Well, you've already established As it only wants proof for n >= 3, you can safely assume that .
Thats it? We know that because k > 3, we can rule out the previous values?
0
11 years ago
#7
(Original post by The Sherminator)
Thats it? We know that because k > 3, we can rule out the previous values?
Not quite sure what you mean by rule out the previous values, but because we know k > 3 > 1, we can just drop a 1 in, in place of the k, and it will strengthen the inequality. The way I originally phrased it might be a little more formal, but as long as you explain what you're doing, you're fine.
0
#8
(Original post by DoMakeSayThink)
Not quite sure what you mean by rule out the previous values, but because we know k > 3 > 1, we can just drop a 1 in, in place of the k, and it will strengthen the inequality. The way I originally phrased it might be a little more formal, but as long as you explain what you're doing, you're fine.
Okay, i think I understand. Its this strengthening the inequality bit which I wasn't understanding. But I see what is happening. Thanks a lot!
0
11 years ago
#9
Oh wow, I actually got something right in the maths forum
0
11 years ago
#10
(Original post by The Sherminator)
Its says: prove that for

I said for n = k
n = k + 1

Spoiler:
Show
And the rightmost side is, very conveniently, equal to Which basically satisfies the inductive principle, don't you say?
0
#11
Yep, Runes, thanks.
It all makes sense now

TSR
0
11 years ago
#12
We need an FP3 thread. I remember that question, what year was it?

Some of the papers are tricky, others straightforward. June 02, I cant believe they give away 16 marks for two standard induction questions; 9 of which were for proving is divisible by 3, whereas another paper I did had had a tougher induction and was worth almost half that. They must allocate marks randomly

There's a lot to remember in this unit, I have just realised! On another note, I've just figured out how to do matrices on my calculator. It's so nice being able to check those fiddly answers
0
#13
(Original post by silent ninja)
We need an FP3 thread. I remember that question, what year was it?

Some of the papers are tricky, others straightforward. June 02, I cant believe they give away 16 marks for two standard induction questions; 9 of which were for proving is divisible by 3, whereas another paper I did had had a tougher induction and was worth almost half that. They must allocate marks randomly

There's a lot to remember in this unit, I have just realised! On another note, I've just figured out how to do matrices on my calculator. It's so nice being able to check those fiddly answers
Its a Solomon paper, not an Edexcel. I hate proof I just don't seem to get it, hopefully an easy one in the paper!
0
11 years ago
#14
(Original post by The Sherminator)
Its a Solomon paper, not an Edexcel. I hate proof I just don't seem to get it, hopefully an easy one in the paper!
Yes I didnt quite understand it, until a thread by Glutamic turned up a few weeks back. The questions in the book are pretty good though-- only bad thing is that the method is crucial, and the answers dont give you this.
I felt the same for complex transformations until a thread a couple of weeks ago (that chapter also has few answers). Actually, I learn most of the useful maths stuff on here!

3 days to go. Crack on with them and i'm sure they'll make more sense. Post up if you're stuck and someone will be able to help. I think posting full solutions for these once someone has attempted them is the only way to see what's going on.
0
#15
Yep, good idea SN.
I got FP2 tomorrow, and then have to work on FP3 for a couple of days. Gah, so many maths exams and really close to each other. I wish the FP3 was on like Monday, I would have cracked it by then
0
X

new posts
Back
to top
Latest
My Feed

### Oops, nobody has postedin the last few hours.

Why not re-start the conversation?

see more

### See more of what you like onThe Student Room

You can personalise what you see on TSR. Tell us a little about yourself to get started.

### University open days

• Bournemouth University
Midwifery Open Day at Portsmouth Campus Undergraduate
Wed, 16 Oct '19
• Teesside University
Wed, 16 Oct '19
• University of the Arts London
London College of Fashion – Cordwainers Footwear and Bags & Accessories Undergraduate
Wed, 16 Oct '19

### Poll

Join the discussion

#### How has the start of this academic year been for you?

Loving it - gonna be a great year (115)
17.8%
It's just nice to be back! (177)
27.4%
Not great so far... (229)
35.45%
I want to drop out! (125)
19.35%