The 2012 STEP Results Discussion Thread

Maths exam discussion - share revision tips in preparation for GCSE, A Level and other maths exams and discuss how they went afterwards.

Announcements Posted on
TSR launches Learn Together! - Our new subscription to help improve your learning 16-05-2013
IMPORTANT: You must wait until midnight (morning exams)/4.30AM (afternoon exams) to discuss Edexcel exams and until 1pm/6pm the following day for STEP and IB exams. Please read before posting, including for rules for practical and oral exams. 28-04-2013
Sign in to Reply
  • View Poll Results: Should we include the AEA in this thread?
    Yes
    53 33.76%
    No
    104 66.24%

  1. Rahul.S's Avatar
    • Overlord in Training
    • Location: GREENGATE
    • Posts: 3,496
    Re: The 2012 STEP Prep Thread!
    (Original post by wcp100)
    Do you actually derive the moments of inertia though in physics?
    yh you do

    my teacher printed me the stuff i need to know.....I think you can access via them through e-AQA or something.

    theres also angular motion and tonnes to do with thermodynamics
  2. desijut's Avatar
    • Peer Of The TSR Realm
    • Posts: 1,578
    Re: The 2012 STEP Prep Thread!
    Ok, now here is STEP II/1998:

    my opinion on them:

    Spoiler:
    Show

    1) I'd done it before from the Siklos booklet, but it was a while ago... edit: Well it was a long time ago.... so i missed the hence...
    2) Done something similar but not quite that before, still made a meal of it.
    3) Nice question, should have maybe stated i used the method of differences and a silly error at the end
    12) First part was ok, second part i calculated the wrong thing, which i think i was doing right before i crossed it out....
    5) Got stuck on the inductive step... Maybe could have proved it like I proved it for |z1 + z2| =< |z1| + |z2| (but that was unconvincing imo)
    7) Very nice question, didnt have time to add a conclusion to the last part

    All in all, i think i did well but it could have been an amzing paper if i didnt make silly mistakes. But it is a strong 1 i think (better than i usually do) edit: with the mistake in Q1 it makes it a weak 1
    Attached Files
  3. File Type: pdf 1998STEP2 Part 1.pdf (818.1 KB, 66 views)
  4. File Type: pdf 1998STEP2 Part 2.pdf (649.9 KB, 34 views)
  5. Last edited by desijut; 27-05-2012 at 17:47.
  6. Farhan.Hanif93's Avatar
    • Section Moderator
    • PS Helper
    • TSR Idol
    • Location: Cambridge
    Re: The 2012 STEP Prep Thread!
    (Original post by desijut)
    Ok, now here is STEP II/1998:

    my opinion on them:

    Spoiler:
    Show

    1) I'd done it before from the Siklos booklet, but it was a while ago...
    2) Done something similar but not quite that before, still made a meal of it.
    3) Nice question, should have maybe stated i used the method of differences and a silly error at the end
    12) First part was ok, second part i calculated the wrong thing, which i think i was doing right before i crossed it out....
    5) Got stuck on the inductive step... Maybe could have proved it like I proved it for |z1 + z2| =< |z1| + |z2| (but that was unconvincing imo)
    7) Very nice question, didnt have time to add a conclusion to the last part

    All in all, i think i did well but it could have been an amzing paper if i didnt make silly mistakes. But it is a strong 1 i think (better than i usually do)
    Here's my pennies worth:
    Spoiler:
    Show
    Q1 - You forgot/didn't bother to show that if (*) has a solution then n is even. Whether that is OK is up for debate because the question requires you to "deduce" that (*) has no solutions from these earlier parts. You may be able to get away with it for the first equation because it explicitly asks you to show that n^2 is a factor of 54, which is a fact you've based your argument upon but you certainly haven't deduced that (**) has no solutions from the fact that n must be even as requested so you may be punished quite heavily for that.

    My mark: 12/20 (being generous - I'm not sure how lenient they would be)

    Q2 - As you say, you've made quite the meal of the second part. After choosing a, you could have just noted that you need to choose (preferably small) N s.t. 125+N =2n^3 for some integer n (as the denominator is already 5^3). Since you want N to be small, looking around the 60 mark for cubes would have been the next obvious step and you could have chosen N by inspection from there. You've also either made a small error in your division or a typo as there is one too many 9's in your approximation.

    My mark: 18/20

    Q3 - I think you have put in slightly too much effort in here too, you could just as easily have expressed \dfrac{2n-1}{n(n+1)(n+2)} in partial fractions directly rather than doing it twice. The sum at the end should come to 1, rather than 1/2 (mistake is on the 4th line from the bottom, two equality signs in).

    My mark: 19/20

    Q12 - it's not one that I bothered doing so I can't really comment.

    Q5 - If I'm going to be honest, I don't think this would have got you any marks at all. You don't seem to have used the geometrical interpretation of |z_1 - z_2| to prove the triangle inequality, as asked in the question and as you say, there isn't really much of an inductive step in your proof of the general case. If you need a hint, add |z_{k+1} to both sides of your n=k assumed inequality and use the triangle inequality you proved at the start.

    My mark: 1/20

    Q7 - This was mostly fine, might be worth familiarising yourself with the definition of a strictly increasing function (at A-Level, a function f is said to be strictly increasing over a particular interval if f'(x)&gt;0 for all x in that interval. Equivalently, with such functions, x_2 \geq x_1 \implies f(x_2) \geq f(x_1) (with equality iff x_1=x_2) for each pair of such x_1, x_2 over said interval). This would have saved you from having to find the turning points. For the last part, you want to find an expression for F'(x) in terms of F(x) and other functions, and deduce it's sign from there.

    My mark: 16/20

    Overall opinion: Low grade 1/high grade 2 (66 marks) excluding Q12, which probably makes it a comfortable grade 1 overall.


    Reading that back, I sound pretty harsh. That wasn't the intention, I promise and it should be said; I'm no examiner so it's possible that I'm way off - this is my genuine opinion. Hope that helps.
    Last edited by Farhan.Hanif93; 27-05-2012 at 02:12.
  7. desijut's Avatar
    • Peer Of The TSR Realm
    • Posts: 1,578
    Re: The 2012 STEP Prep Thread!
    (Original post by Farhan.Hanif93)
    Here's my pennies worth:
    Spoiler:
    Show
    Q1 - You forgot/didn't bother to show that if (*) has a solution then n is even. Whether that is OK is up for debate because the question requires you to "deduce" that (*) has no solutions from these earlier parts. You may be able to get away with it for the first equation because it explicitly asks you to show that n^2 is a factor of 54, which is a fact you've based your argument upon but you certainly haven't deduced that (**) has no solutions from the fact that n must be even as requested so you may be punished quite heavily for that.

    My mark: 12/20 (being generous - I'm not sure how lenient they would be)

    Q2 - As you say, you've made quite the meal of the second part. After choosing a, you could have just noted that you need to choose (preferably small) N s.t. 125+N =2n^3 for some integer n (as the denominator is already 5^3). Since you want N to be small, looking around the 60 mark for cubes would have been the next obvious step and you could have chosen N by inspection from there. You've also either made a small error in your division or a typo as there is one too many 9's in your approximation.

    My mark: 18/20

    Q3 - I think you have put in slightly too much effort in here too, you could just as easily have expressed \dfrac{2n-1}{n(n+1)(n+2)} in partial fractions directly rather than doing it twice. The sum at the end should come to 1, rather than 1/2 (mistake is on the 4th line from the bottom, two equality signs in).

    My mark: 19/20

    Q12 - it's not one that I bothered doing so I can't really comment.

    Q5 - If I'm going to be honest, I don't think this would have got you any marks at all. You don't seem to have used the geometrical interpretation of |z_1 - z_2| to prove the triangle inequality, as asked in the question and as you say, there isn't really much of an inductive step in your proof of the general case. If you need a hint, add |z_{k+1} to both sides of your n=k assumed inequality and use the triangle inequality you proved at the start.

    My mark: 1/20

    Q7 - This was mostly fine, might be worth familiarising yourself with the definition of a strictly increasing function (at A-Level, a function f is said to be strictly increasing over a particular interval if f'(x)&gt;0 for all x in that interval. Equivalently, with such functions, x_2 \geq x_1 \implies f(x_2) \geq f(x_1) (with equality iff x_1=x_2) for each pair of such x_1, x_2 over said interval). This would have saved you from having to find the turning points. For the last part, you want to find an expression for F'(x) in terms of F(x) and other functions, and deduce it's sign from there.

    My mark: 16/20

    Overall opinion: Low grade 1/high grade 2 (66 marks) excluding Q12, which probably makes it a comfortable grade 1 overall.


    Reading that back, I sound pretty harsh. That wasn't the intention, I promise and it should be said; I'm no examiner so it's possible that I'm way off - this is my genuine opinion. Hope that helps.
    One thing i also wanted to know is, is that ok to lay out these questions? is it clear enough to read? Or is it too messy?

    Spoiler:
    Show
    1) **** forgot about the "deduce" And although i did this ages ago, i dont remember the 2nd part at all
    2) and 3) I was making lots of silly errors so i thought it was best to start again in places (i knew what to do so i knew i wasnt wasting time by doing that) Also on the approximations, i wasnt sure how to handle "Justify the accuracy of your approximations"
    12) I would have got a few, not many though. Maybe 5 if i'm lucky?
    5) I started but then saw 7 and knew it was straight forward (i thought it was very easy originally)
    7) Yep, i did it in 30 minutes, i needed an extra 5-10 minutes to wrap up the question...

    When i said high 1 i gave myself full marks on Q1 so take off 8-12 marks would make me low 70's (I was a little more leniant but that's because i gave myself a few more on Q5 and 5-6 on Q7) but i take on board what you said.
    Last edited by desijut; 27-05-2012 at 10:57.
  8. ian.slater's Avatar
    • Exalted and Worshipped Member
    Re: The 2012 STEP Prep Thread!
    (Original post by TheJ0ker)
    Ok for STEP 2 am I expected to know these things? Its just that that topic is in FP3 which I haven't done...
    Have a go at 1997 STEP II Q3. It plays on an idea that two similar expressions have totally different integrals. As it happens, MEI make a great point of it in their FP2.

    Also, there are a lot of things that you are not 'required' to know, but it helps if you have seen them before because it saves time. For example, 2007 STEP II Q3 asks you to prove the arctan result that would have helped with your earlier question. So it's not on the I/II syllabus now, but the ability to prove it is.
  9. fruktas's Avatar
    • Benevolent Member
    • Location: London
    • Posts: 713
    Re: The 2012 STEP Prep Thread!
    (Original post by Rahul.S)
    im the only one doing applied....its kind of sik. got alot of mechanics....even some m5
    Yeah, my teacher said we are doing astrophysics because it's the easiest for the rest of the class. but he said he wanted to teach applied physics lol. It seems very good!
  10. TheJ0ker's Avatar
    • Peer Of The TSR Realm
    • Location: Four dimensional paradise
    • Posts: 1,729
    Re: The 2012 STEP Prep Thread!
    (Original post by ian.slater)
    Have a go at 1997 STEP II Q3. It plays on an idea that two similar expressions have totally different integrals. As it happens, MEI make a great point of it in their FP2.

    Also, there are a lot of things that you are not 'required' to know, but it helps if you have seen them before because it saves time. For example, 2007 STEP II Q3 asks you to prove the arctan result that would have helped with your earlier question. So it's not on the I/II syllabus now, but the ability to prove it is.
    Ok thanks I will have a go at it.
  11. TheJ0ker's Avatar
    • Peer Of The TSR Realm
    • Location: Four dimensional paradise
    • Posts: 1,729
    Re: The 2012 STEP Prep Thread!
    Can someone check this proof by induction, FP1 was a long time ago and I am a bit rusty.

    Trying to prove n!&gt;2^n for n>=4
    Spoiler:
    Show
    let n=4
    4!&gt;2^4 \Rightarrow 24&gt;16 which it true

    Let n=k where k>4

    assume k!&gt;2^k \Rightarrow 1&gt;\frac{2^k}{k!}

    let n=k+1

    (k+1)! &gt; 2^{k+1} \Rightarrow (k!)(k+1)&gt;(2)(2^k) \Rightarrow k+1&gt;2.\frac{2^k}{k!} (*)

    as k>4 and 1&gt;\frac{2^k}{k!} (*) must be true.
  12. matt2k8's Avatar
    • Overlord in Training
    • Posts: 3,445
    Re: The 2012 STEP Prep Thread!
    You have the right induction step, but the answer is not written out well - I'd write something like-

    4! = 24 < 16 = 2^4, so the statement is true for n = 4.

    Now suppose for some k >4, the statement is true.

    Then (k+1)! = (k+1)*k! > (k+1)*2^k > 2*2^k = 2^k+1.

    So if it's true for n =k, it's also true for n=k+1- so by induction, it's true for all n >= 4.
  13. desijut's Avatar
    • Peer Of The TSR Realm
    • Posts: 1,578
    Re: The 2012 STEP Prep Thread!
    (Original post by TheJ0ker)
    Can someone check this proof by induction, FP1 was a long time ago and I am a bit rusty.

    Trying to prove n!&gt;2^n for n>=4
    Spoiler:
    Show
    let n=4
    4!&gt;2^4 \Rightarrow 24&gt;16 which it true

    Let n=k where k>4

    assume k!&gt;2^k \Rightarrow 1&gt;\frac{2^k}{k!}

    let n=k+1

    (k+1)! &gt; 2^{k+1} \Rightarrow (k!)(k+1)&gt;(2)(2^k) \Rightarrow k+1&gt;2.\frac{2^k}{k!} (*)

    as k>4 and 1&gt;\frac{2^k}{k!} (*) must be true.
    I think this would be a better conclusion

    Spoiler:
    Show
    From
     (k!)(k+1) &gt; (2)(2^k)

    Since
     k! &gt; 2^k
    (k+1) &gt; 2
     k \geq 4

     (k!)(k+1) &gt; (2)(2^k) must be true.
    Last edited by desijut; 27-05-2012 at 12:15.
  14. TheJ0ker's Avatar
    • Peer Of The TSR Realm
    • Location: Four dimensional paradise
    • Posts: 1,729
    Re: The 2012 STEP Prep Thread!
    Ok thanks guys.
  15. jack.hadamard's Avatar
    • Benevolent Member
    • Posts: 696
    Re: The 2012 STEP Prep Thread!
    What is a Proof -- a general read.


    A Sample Proof by Induction.

    a) Some notes on induction. b) Some Exercises (Ignore Q7).

    Divisibility proofs are often a bit unusual -- e.g. how do you prove that 10^{n + 1} + 10^{n} + 1 is divisible by 3 for all natural n.
  16. ben-smith's Avatar
    • Overlord in Training
    • Location: Hilbert Space
    • Posts: 2,366
    Re: The 2012 STEP Prep Thread!
    (Original post by jack.hadamard)
    Divisibility proofs are often a bit unusual -- e.g. how do you prove that 10^{n + 1} + 10^{n} + 1 is divisible by 3 for all natural n.
    Unless I'm being stoopid, that last one is easy:
    Spoiler:
    Show
    it's the decimal expansion of 110000...1. It's digits add up to 3 ===> divisible by 3. A more explicit proof would involve rewriting the 10s as 9+1 and the binomially expanding.
  17. jack.hadamard's Avatar
    • Benevolent Member
    • Posts: 696
    Re: The 2012 STEP Prep Thread!
    (Original post by ben-smith)
    Unless I'm being stoopid, that last one is easy:
    Spoiler:
    Show
    it's the decimal expansion of 110000...1. It's digits add up to 3 ===> divisible by 3. A more explicit proof would involve rewriting the 10s as 9+1 and the binomially expanding.
    Both of these are perfectly good approaches, but they are more direct in nature.
    They also rely on more ``advanced" tools like congruences and the binomial theorem.

    By induction, a proof may contain the following.
    Spoiler:
    Show

    Suppose that, for some k \in \mathbb{N}, you have 10^{k} + 10^{k - 1} + 1 = 3m for a positive integer m.

    Multiplying by 10, this equality gives 10^{k + 1} + 10^k + 10 = 10 \times 3m, and it follows that 10^{k + 1} + 10^k + 1 = 3(10m - 3).
    Last edited by jack.hadamard; 27-05-2012 at 16:04.
  18. Farhan.Hanif93's Avatar
    • Section Moderator
    • PS Helper
    • TSR Idol
    • Location: Cambridge
    Re: The 2012 STEP Prep Thread!
    (Original post by desijut)
    One thing i also wanted to know is, is that ok to lay out these questions? is it clear enough to read? Or is it too messy?
    Yeah I think your presentation is fine, it's good that you leave quite a bit of space between your lines of working as it gives you room to fill those gap if needed; I should really learn to do that.

    That said, there were a lot of pages of crossing outs. It must have taken quite a bit of time to write each of those pages so it's not really time efficient to write them out twice in the exam. In general, it would have been much faster to just spot the mistake and try again from there - checking through as you go along is often a good idea.

    From what I've noticed, the place you can save the most time is in the amount you write down. Taking Q7i) for example, you could have just jumped from \sec ^2x - 1 = 0 \iff cos x = \pm 1 (although it would have been quicker still to notice that this is equivalent to tan ^2x = 0). Further down the line, in the same question, it would have been fine to go from \sin x - x\cos x =0 to \tan x -x=0 directly. Looking at these individual cases, it doesn't seem like a lot but when you consider all the similar bits of working throughout the paper, it would have saved you a lot of time to juggle the algebra in your head first. Still have to be cautious not to exclude any key details, and not make little mistakes so there's an element of balance to be struck - only make these leaps in small steps of algebra that you are completely confident about.

    Spoiler:
    Show
    1) **** forgot about the "deduce" And although i did this ages ago, i dont remember the 2nd part at all
    2) and 3) I was making lots of silly errors so i thought it was best to start again in places (i knew what to do so i knew i wasnt wasting time by doing that) Also on the approximations, i wasnt sure how to handle "Justify the accuracy of your approximations"
    12) I would have got a few, not many though. Maybe 5 if i'm lucky?
    5) I started but then saw 7 and knew it was straight forward (i thought it was very easy originally)
    7) Yep, i did it in 30 minutes, i needed an extra 5-10 minutes to wrap up the question...

    When i said high 1 i gave myself full marks on Q1 so take off 8-12 marks would make me low 70's (I was a little more leniant but that's because i gave myself a few more on Q5 and 5-6 on Q7) but i take on board what you said.
    Spoiler:
    Show
    Even though you knew what you had to do in 2) and 3), you could still have saved yourself time by finding your mistake rather than rewriting - whenever I do a STEP paper, it's the writing which takes most of the time rather than the "doing" of the question. The question says that you don't need to justify the accuracy of your approximation so you don't need to worry about it - I think for STEP, if they do ask you to do this, all you would have to show is that your x value is in the interval of validity and the error in your approximation (generally the modulus of the first neglected term in the expansion) doesn't affect the digits in any of the decimal places you've expanded to.
    Last edited by Farhan.Hanif93; 27-05-2012 at 16:17.
  19. bananarama2's Avatar
    • TSR Legend
    Re: The 2012 STEP Prep Thread!
    (Original post by Rahul.S)
    yh you do

    my teacher printed me the stuff i need to know.....I think you can access via them through e-AQA or something.

    theres also angular motion and tonnes to do with thermodynamics
    All of the stuff I need to know for my engineering interview and none of the stuff I get taught facepalm. I don't think I learnt anything in school. I self taught it before hand, so I know the stuff that would be useful.
  20. Rahul.S's Avatar
    • Overlord in Training
    • Location: GREENGATE
    • Posts: 3,496
    Re: The 2012 STEP Prep Thread!
    (Original post by wcp100)
    All of the stuff I need to know for my engineering interview and none of the stuff I get taught facepalm. I don't think I learnt anything in school. I self taught it before hand, so I know the stuff that would be useful.
    like a bawwws gaussss :cool:
  21. desijut's Avatar
    • Peer Of The TSR Realm
    • Posts: 1,578
    Re: The 2012 STEP Prep Thread!
    (Original post by Farhan.Hanif93)
    Yeah I think your presentation is fine, it's good that you leave quite a bit of space between your lines of working as it gives you room to fill those gap if needed; I should really learn to do that.

    That said, there were a lot of pages of crossing outs. It must have taken quite a bit of time to write each of those pages so it's not really time efficient to write them out twice in the exam. In general, it would have been much faster to just spot the mistake and try again from there - checking through as you go along is often a good idea.

    From what I've noticed, the place you can save the most time is in the amount you write down. Taking Q7i) for example, you could have just jumped from \sec ^2x - 1 = 0 \iff cos x = \pm 1 (although it would have been quicker still to notice that this is equivalent to tan ^2x = 0). Further down the line, in the same question, it would have been fine to go from \sin x - x\cos x =0 to \tan x -x=0 directly. Looking at these individual cases, it doesn't seem like a lot but when you consider all the similar bits of working throughout the paper, it would have saved you a lot of time to juggle the algebra in your head first. Still have to be cautious not to exclude any key details, and not make little mistakes so there's an element of balance to be struck - only make these leaps in small steps of algebra that you are completely confident about.


    Spoiler:
    Show
    Even though you knew what you had to do in 2) and 3), you could still have saved yourself time by finding your mistake rather than rewriting - whenever I do a STEP paper, it's the writing which takes most of the time rather than the "doing" of the question. The question says that you don't need to justify the accuracy of your approximation so you don't need to worry about it - I think for STEP, if they do ask you to do this, all you would have to show is that your x value is in the interval of validity and the error in your approximation (generally the modulus of the first neglected term in the expansion) doesn't affect the digits in any of the decimal places you've expanded to.
    Oh wow i read it as "You need to justify the accuracy of your approximations" :| so I was thinking i had to justify it...

    I think those little long ways i took for say \sin x - x\cos x =0 to \tan x -x=0 was just me not pausing for a moment to realise it.
  22. deejayy's Avatar
    • Adored and Respected Member
    • Location: Melbourne
    • Posts: 505
    Re: The 2012 STEP Prep Thread!
    (Original post by ben-smith)
    Unless I'm being stoopid, that last one is easy:
    Spoiler:
    Show
    it's the decimal expansion of 110000...1. It's digits add up to 3 ===> divisible by 3. A more explicit proof would involve rewriting the 10s as 9+1 and the binomially expanding.
    Could you also use modular arithmetic ?
    Spoiler:
    Show

     10^{n+1}+10^{n}+1=1^{n+1}+1^{n}+  1 mod 3 =1+1+1 mod 3= 0 mod3

    I'm not totally sure if you are allowed to do that with indices when working with modular arithmetic though. Can you?
  23. ben-smith's Avatar
    • Overlord in Training
    • Location: Hilbert Space
    • Posts: 2,366
    Re: The 2012 STEP Prep Thread!
    (Original post by deejayy)
    Could you also use modular arithmetic ?
    Spoiler:
    Show

     10^{n+1}+10^{n}+1=1^{n+1}+1^{n}+  1 mod 3 =1+1+1 mod 3= 0 mod3

    I'm not totally sure if you are allowed to do that with indices when working with modular arithmetic though. Can you?
    The thing I wrote with binomial expansion is basically mod arithmetic
Sign in to Reply
Share this discussion:  
Article updates
Moderators

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

Reputation gems:
The Reputation gems seen here indicate how well reputed the user is, red gem indicate negative reputation and green indicates a good rep.
Post rating score:
These scores show if a post has been positively or negatively rated by our members.