# InductionWatch

#1
Show that

Base step:

Let

Inductive hypothesis:

What's the most elegant way of showing this?
0
9 years ago
#2
hhmmm. The above does not look right. You wil want to quote [or easily prove] the summation of the natural numbers 1 to k and form the inductive hypotheses;

add (k + 1)^3 to both sides - try factoring the rhs to show that P(k) implies truth of p(k+1)

You have established that P(1) is true.
0
#3
Ah yes, it never occurred to me to look at it that way. Thanks. I see the epic fail I made with forming my induction hypothesis now

Although, I've got this hunch that all we're going to have to prove in the exam is which should be straightforward enough.
0
9 years ago
#4
(Original post by Planto)
Although, I've got this hunch that all we're going to have to prove in the exam is which should be straightforward enough.
If this is FP1, I would have thought you could assume this, and it's in the formula booklet, isn't it?
0
#5
Nah, this is my level 1 Computer Science maths exam. It's a whole lot of content squeezed into one module, so most of the questions are just to confirm comprehension of principle, rather than any major problem solving tasks.
0
X

new posts
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

• Cranfield University
Cranfield Forensic MSc Programme Open Day Postgraduate
Thu, 25 Apr '19
• University of the Arts London
Open day: MA Footwear and MA Fashion Artefact Postgraduate
Thu, 25 Apr '19
• Cardiff Metropolitan University
Sat, 27 Apr '19

### Poll

Join the discussion

#### Have you registered to vote?

Yes! (162)
38.94%
No - but I will (22)
5.29%
No - I don't want to (30)
7.21%
No - I can't vote (<18, not in UK, etc) (202)
48.56%