Turn on thread page Beta
 You are Here: Home >< Maths

# Help with induction! watch

1. What I did was -

U(n) = 7(7^2n) + 125(5^n)

U(n + 1) = 343(7^2n) + 625(5^n)

U(n + 1) - 6U(n) = 308(7^2n)

So as 308 is divisible by 44, U(n) is divisible by 44.

This question was in Further Maths (9231) winter 2010 paper 1.

In the mark scheme of this paper, there is a different way of solving this which I was not quite able to understand.

Here is the mark scheme -

Is my solution correct? and can someone explain me the solution in the mark scheme!
2. (Original post by Rishabh95)

What I did was -

U(n) = 7(7^2n) + 125(5^n)

U(n + 1) = 343(7^2n) + 625(5^n)

U(n + 1) - 6U(n) = 308(7^2n)

So as 308 is divisible by 44, U(n) is divisible by 44.

This question was in Further Maths (9231) winter 2010 paper 1.

In the mark scheme of this paper, there is a different way of solving this which I was not quite able to understand.

Here is the mark scheme -

Is my solution correct? and can someone explain me the solution in the mark scheme!
Your solution is also correct (apart from the fact that you wrote , rather than , but I presume that's a typo).

I would double check how your exam board wants you to lay out the answer to these induction questions as I can't really see the usual structure in your solution. You may have typed it out in such a way to save space, I'm not too sure.

In the first solution they give, they assume that is divisible by 44 and then proceed to take the inductive step by considering . In terms of manipulation, what they did was:

Since U(k) is divisible by 44 (as in our assumption) and obviously 44 is, both terms are divisible by 44 and thus is the whole expression for U(k+1). Hence it follows that U(n) is divisible by 44.

They use a very similar argument for the alternative solution, except they subtract U(k) from the start and then manipulate.
3. (Original post by Farhan.Hanif93)
Your solution is also correct (apart from the fact that you wrote , rather than , but I presume that's a typo).

I would double check how your exam board wants you to lay out the answer to these induction questions as I can't really see the usual structure in your solution. You may have typed it out in such a way to save space, I'm not too sure.

In the first solution they give, they assume that is divisible by 44 and then proceed to take the inductive step by considering . In terms of manipulation, what they did was:

Since U(k) is divisible by 44 (as in our assumption) and obviously 44 is, both terms are divisible by 44 and thus is the whole expression for U(k+1). Hence it follows that U(n) is divisible by 44.

They use a very similar argument for the alternative solution, except they subtract U(k) from the start and then manipulate.
Yeah, it was a typo! and thanks for the help!

Reply
Submit reply
Turn on thread page Beta

### Related university courses

TSR Support Team

We have a brilliant team of more than 60 Support Team members looking after discussions on The Student Room, helping to make it a fun, safe and useful place to hang out.

This forum is supported by:
Updated: April 1, 2011
Today on TSR

### Year 13s need your help

Share your uni advice here

### University open days

1. University of Bradford
University-wide Postgraduate
Wed, 25 Jul '18
2. University of Buckingham
Psychology Taster Tutorial Undergraduate
Wed, 25 Jul '18
3. Bournemouth University
Clearing Campus Visit Undergraduate
Wed, 1 Aug '18
Poll
Useful resources

## Make your revision easier

### Maths Forum posting guidelines

Not sure where to post? Read the updated guidelines here

### How to use LaTex

Writing equations the easy way

### Study habits of A* students

Top tips from students who have already aced their exams

Can you help? Study help unanswered threads

## Groups associated with this forum:

View associated groups

The Student Room, Get Revising and Marked by Teachers are trading names of The Student Room Group Ltd.

Register Number: 04666380 (England and Wales), VAT No. 806 8067 22 Registered Office: International House, Queens Road, Brighton, BN1 3XE

Write a reply...
Reply
Hide
Reputation gems: You get these gems as you gain rep from other members for making good contributions and giving helpful advice.