(Updated as far as #62) SimonM  24.03.2009
Spoiler:ShowHmm, maybe I picked the wrong questions the last time I tried this paper  1 and 2 didn't take nearly quite as much time as 5, 8, or especially 7 (see previous thread for solution). Note to self: work on getting rid of paranoid fear of geometry.
For the geometry problems there might be a more elegant approach I missed  if someone could point out a less tedious method, that would be greatly appreciated. Especially for question 5  I was approaching that more as a linear algebra problem than geometry...
~~~~~~~~~~~~~~~
STEP I:
1: Solution by Glutamic Acid
2: Solution by Glutamic Acid
3: Solution by Glutamic Acid
4: Solution by Glutamic Acid
5: Solution by brianeverit
6: Solution by SimonM
7: Solution by DeanK22
8: Solution by Glutamic Acid
9: Solution by Unbounded
10: Solution by brianeverit
11: Solution by brianeverit
12: Solution by brianeverit
13: Solution by brianeverit
14: Solution by brianeverit
STEP II:
1: Solution by DeanK22
2: Solution by DeanK22
3: Solution by brianeverit
4: Solution by DeanK22
5: Solution by brianeverit
6: Solution by brianeverit
7: Solution by brianeverit
8: Solution by DeanK22
9: Solution by brianeverit
10: Solution by brianeverit
11: Solution by Unbounded
12: Solution by brianeverit
13: Solution by brianeverit
14: Solution by brianeverit
STEP III:
1: Solution by Zhen Lin
2: Solution by Zhen Lin
3: Solution by Zhen Lin
4: Solution by brianeverit
5: Solution by Zhen Lin
6: Solution by brianeverit
7: Solution by brianeverit
8: Solution by Zhen Lin
9: Solution by Zhen Lin
10: Solution by brianeverit
11: Solution by brianeverit
12: Solution by Glutamic Acid
13: Solution by Glutamic Acid
14: Solution by brianeverit
~~~~~~~~~~~~~~~
Solutions written by TSR members:
1987  1988  1989  1990  1991  1992  1993  1994  1995  1996  1997  1998  1999  2000  2001  2002  2003  2004  2005  2006  2007
STEP I, II, III 2000 solutions
Announcements  Posted on 



As it's been a while since you posted and nobody's responded, maybe you want to check out MarkedbyTeachers.com  the UK's largest academic coursework library.
They have over 130,000 coursework documents at GCSE, A Level and University level.
They submit all their documents to Turnitin antiplagiarism software and the site is used and approved by hundreds of thousands of UK teachers and students. 
I tried to do 4 and 6 today but failed to complete the problems. However I suppose I did not try hard enough. For question 4, I was unable to show even the first result (somehow I got the result that there must be an intersection if instead of the required ); for question 6 I'm not sure how to approach the last part using the previous results. Any hints?

For Q4, try to directly solve x+c = f(x). You end up with a quadratic involving c and a. Consider the discriminant D of that quadratic.
If there's to be an intersection regardless of c, then we must have D>=0 for all c. But D is a quadratic function of c, so for that to be true, the discriminant of D (considered as a function of c) must be >=0. This gives a quadratic inequality in a, which eventually gives the desired result.
For Q6, try a substitution x=ya for a suitable choice of a. 
Probably. I'm getting tangled up trying not to give any of the actual equations  but I'm sure you can work it out!

Re Q5: I think the idea of the D(a,b)c+D(c, a)b + D(b, c)a=0 identity was to show you can write c as a combination of b and a. So you can find the image of c under the transformation, and check if this equals r. I haven't actually done any working to see if it's noticably easier than what you did, but my feeling is that it should be.

Re: Q8. When it comes to solving the recurrence relation, I think you've approached it the wrong way around. Essentially, you've derived a formula for the solution, but you haven't shown it's the only possible solution.
In fact, to answer the question you don't need to derive it. Consider
All you need is to show , and . Then write ; you have and , so trivially b_n = 0 for all n by induction. 
(Original post by DFranklin)
Re Q5: I think the idea of the D(a,b)c+D(c, a)b + D(b, c)a=0 identity was to show you can write c as a combination of b and a.
But I suppose it could be considered one since a, b and c are known constants.
(Original post by DFranklin)
Re: Q8. When it comes to solving the recurrence relation, I think you've approached it the wrong way around. Essentially, you've derived a formula for the solution, but you haven't shown it's the only possible solution. 
Gaa. But I do not see how your method shoes that it is the only possible solution either  it certainly shows that it is a solution, and in a very simple manner indeed. 
A function is defined by its inputs and respective outputs, not the actual way you write the function. For example, x and sqrt(x^2) are the same function, even though they're written differently; they have the same domain, and for each x, we have that x = sqrt(x^2) holds. So they're the same. 
Functions are defined over domains, though. The domain is a crucial part of the definition of a given function. And I assume here that the domain of the function is the integers or something (without bothering to look back at the question), right?

I know this is old, but regarding question 8, is it expected that I know how to solve recurrence relations in that way?
Would proving the result by induction suffice? 
(Original post by squeezebox)
I know this is old, but regarding question 8, is it expected that I know how to solve recurrence relations in that way?
It's probably worth knowing that the explicit formula for the Fibonacci series as well. (e.g. http://www.mcs.surrey.ac.uk/Personal...a.html#formula)
Would proving the result by induction suffice? 
(Original post by DFranklin)
The classic 'examiners' answer' would be "you only need to know the official STEP syllabus". The pragmatic answer is that it's probably worthwhile knowing it. (The basic concept is very simply: "guess" that there are solutions of the form and use that to get a quadratic in . It's very similar to how you solve 2nd order diff equations).
It's probably worth knowing that the explicit formula for the Fibonacci series as well. (e.g. http://www.mcs.surrey.ac.uk/Personal...a.html#formula)
Yes, and in this case it's the better solution, as I explained to Zhen
Since the method is similar to solving 2nd order diff equations, if there was a repeated solution, would it be like ?
Thanks 
I know this thread is a little old now, however I think the op's solution to Q1 isn't quite what the examiner is looking for. They want you to find that the point m is at (b,a), rather than show that (b,a) fits the equation, with a little thought and care it is a fairly straightforwards result to find.
I also feel that the final "proof" needs a little more too in order to gain the marks. 
(Original post by Mrm.)
I know this thread is a little old now, however I think the op's solution to Q1 isn't quite what the examiner is looking for. They want you to find that the point m is at (b,a), rather than show that (b,a) fits the equation, with a little thought and care it is a fairly straightforwards result to find.
I also feel that the final "proof" needs a little more too in order to gain the marks.
Without disregarding your comments, in both cases I think the answer falls into the "If it's not what the examiners wanted, they should have worded the question better". I really doubt the examiners will take marks off in such cases  they very much tend to give the benefit of the doubt.
Reply
Submit reply
Register
Thanks for posting! You just need to create an account in order to submit the post Already a member? Sign in
Oops, something wasn't right
please check the following: