Jump to content

help needed (maths)


sticksaint
 Share

Recommended Posts

Thanks guys.Just worked it out -it was a misprint.

 

Question should read prove (n+5) squared - (n+3) squared = 4(n+4)

 

Special thanks to whitey grandad for making me realise it was a misprint!

 

Are you sure thats the question? As I think that only works out to be true when n is -4

 

Edit: think I'm wrong: (n+5)squared -(n+3)squared = 4(n+4) is true...

Edited by Joensuu
Link to comment
Share on other sites

My daughter has a question:

 

 

Prove that (n+5)-(n+3)squared = 4(n+4).

 

 

Any help appreciated .Thanks

 

( (n+5) - (n+3) )^2 = Squaring something means times it by itself therefore...

( (n+5)*(n+5) ) - ( (n+3)*(n+3) ) = Now multiply out

(n^2 + 5n + 5n + 25) - ( n^2 + 3n + 3n + 9 ) = Simplify

(n^2 + 10n + 25) - ( n^2 + 6n + 9) = Subtract the values that match from each other

4n + 16 = Check what divides through both values

4(n+4)

Edited by Colinjb
Link to comment
Share on other sites

think you might be right.

 

Remember though that the question is to prove the rule.

 

Not find out the value of n.

 

Something vaguely interesting involving a different method to the one used before would be to use inductive reasoning to show it is true for all n (though that wouldn't be expected at what appears to be GCSE level maths (it's not even in the A Level Maths syllabus, which is a little ridiculous)).

 

Essentially, if you show that the statement holds true for n=1, then demonstrate that if we accept that it holds for n=k then that implies that it would also hold for n=k+1, then it holds for all n. Because, from the reasoning followed, as it holds for 1, and holding for any 'k' implies it holds for 'k+1', it must hold for 2,3,4,5..... like a domino effect. Though, in this problem, you'd end up multiplying out to show that p(k) => p(k+1), so it's somewhat unnecessary in this situation, but interesting (and more rigorous) nonetheless.

Link to comment
Share on other sites

Something vaguely interesting involving a different method to the one used before would be to use inductive reasoning to show it is true for all n (though that wouldn't be expected at what appears to be GCSE level maths (it's not even in the A Level Maths syllabus, which is a little ridiculous)).

 

Essentially, if you show that the statement holds true for n=1, then demonstrate that if we accept that it holds for n=k then that implies that it would also hold for n=k+1, then it holds for all n. Because, from the reasoning followed, as it holds for 1, and holding for any 'k' implies it holds for 'k+1', it must hold for 2,3,4,5..... like a domino effect. Though, in this problem, you'd end up multiplying out to show that p(k) => p(k+1), so it's somewhat unnecessary in this situation, but interesting (and more rigorous) nonetheless.

 

We covered Proof by Induction as the very first subject for A-level Pure Maths and it made we want to jack it in.

Link to comment
Share on other sites

( (n+5) - (n+3) )^2 = Squaring something means times it by itself therefore...

( (n+5)*(n+5) ) - ( (n+3)*(n+3) ) = Now multiply out

(n^2 + 5n + 5n + 25) - ( n^2 + 3n + 3n + 9 ) = Simplify

(n^2 + 10n + 25) - ( n^2 + 6n + 9) = Subtract the values that match from each other

4n + 16 = Check what divides through both values

4(n+4)

 

FAIL!

 

( (n+5) - (n+3) )^2

 

does not equal

 

( (n+5)*(n+5) ) - ( (n+3)*(n+3) )

 

it equals

 

(n+5)*(n+5) ) - (n+3)*(n+3) - 2 * (n+5) (n+3)

 

 

That wasn't the question.

 

 

Something vaguely interesting involving a different method to the one used before would be to use inductive reasoning to show it is true for all n (though that wouldn't be expected at what appears to be GCSE level maths (it's not even in the A Level Maths syllabus, which is a little ridiculous)).

 

Essentially, if you show that the statement holds true for n=1, then demonstrate that if we accept that it holds for n=k then that implies that it would also hold for n=k+1, then it holds for all n. Because, from the reasoning followed, as it holds for 1, and holding for any 'k' implies it holds for 'k+1', it must hold for 2,3,4,5..... like a domino effect. Though, in this problem, you'd end up multiplying out to show that p(k) => p(k+1), so it's somewhat unnecessary in this situation, but interesting (and more rigorous) nonetheless.

 

Not relevant here - you are just showing off. Also, this wouldn't be a satisfactory answer as you have only proved it for positive integers, not all real numbers, which would be impossible by induction.

 

(N+5)(N+5) - (N+3)(N+3) =

Nsqr +10N+25 - (Nsqr +6N+9) =

4N + 16 = 4 (N+4)

 

 

God i have too much time on my hands....

 

Correct

Link to comment
Share on other sites

Not relevant here - you are just showing off. Also, this wouldn't be a satisfactory answer as you have only proved it for positive integers, not all real numbers, which would be impossible by induction.

 

fml

Link to comment
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now
 Share

×
×
  • Create New...