# STEP Maths I, II, III 1997 Solutions

Watch
Announcements

(Updated as far as #96) SimonM - 23.03.2009

For explanation, scroll down:

1: Solution by nota bene, also solved in p 21 of Siklos' booklet, also DFranklin

2: Solution by datr

3: Solution by DFranklin

4: Solved in p 17 of Siklos' booklet

5: Solution by ukgea

6: Solution by DFranklin

7: Solution by DFranklin

8: Solution by ukgea

9: Solved in p 107 of Siklos' booklet

10: Solution by DFranklin

11: Solution by ukgea

12: Solved in p 147 of Siklos' booklet

13: Solution by nota bene

14: Solution by ukgea

1: Solution by Koyla

2: Solved in p 25 of Siklos' booklet

3: Solution by insparato

4: Solution by DFranklin

5: Solution by dvs

6: Solved in p 27 of Siklos' booklet

7: Solution by waxwing

8: Solution by DFranklin

9: Solved in p 127 of Siklos' booklet

10: Solution by DFranklin

11: Solution by ad absurdum

12: Solution by datr

13: Solution by DFranklin

14: Solution by datr

1: Solution by dvs

2: Solution by khaixiang

3: Solution by ukgea

4: Solved in p 57 of Siklos' booklet

5: Solution by DFranklin

6: Solution by DFranklin, also by khaixiang

7: Solved in p 77 of Siklos' booklet

8: Solution by dvs

9: Solution by ukgea

10: Solution by DFranklin

11: Solution by DFranklin

12: Solution by DFranklin

13: Solution by DFranklin

14: Solution by DFranklin

In this thread, we will try to collectively provide solutions for the questions from the STEP Maths I, II and III papers from 1997, seeing as no solutions are available on the net.

If you want to contribute, simply find a question which is marked with "unsolved" above (you might want to check for new solutions after the time the list was last updated as well), solve it, and post your solution in the thread. I will try to update the list as often as possible. If you have a solution to a question that uses a different idea from one already posted, submit it as well, as it's often useful to see different approaches to the same problem.

If you find an error in one of the solutions, simply say so, and hope that whoever wrote the solution in the first place corrects it.

1987 - 1988 - 1989 - 1990 - 1991 - 1992 - 1993 - 1994 - 1995 - 1996 - 1997 - 1998 - 1999 - 2000 - 2001 - 2002 - 2003 - 2004 - 2005 - 2006 - 2007

For explanation, scroll down:

**STEP I:**1: Solution by nota bene, also solved in p 21 of Siklos' booklet, also DFranklin

2: Solution by datr

3: Solution by DFranklin

4: Solved in p 17 of Siklos' booklet

5: Solution by ukgea

6: Solution by DFranklin

7: Solution by DFranklin

8: Solution by ukgea

9: Solved in p 107 of Siklos' booklet

10: Solution by DFranklin

11: Solution by ukgea

12: Solved in p 147 of Siklos' booklet

13: Solution by nota bene

14: Solution by ukgea

**STEP II:**1: Solution by Koyla

2: Solved in p 25 of Siklos' booklet

3: Solution by insparato

4: Solution by DFranklin

5: Solution by dvs

6: Solved in p 27 of Siklos' booklet

7: Solution by waxwing

8: Solution by DFranklin

9: Solved in p 127 of Siklos' booklet

10: Solution by DFranklin

11: Solution by ad absurdum

12: Solution by datr

13: Solution by DFranklin

14: Solution by datr

**STEP III:**1: Solution by dvs

2: Solution by khaixiang

3: Solution by ukgea

4: Solved in p 57 of Siklos' booklet

5: Solution by DFranklin

6: Solution by DFranklin, also by khaixiang

7: Solved in p 77 of Siklos' booklet

8: Solution by dvs

9: Solution by ukgea

10: Solution by DFranklin

11: Solution by DFranklin

12: Solution by DFranklin

13: Solution by DFranklin

14: Solution by DFranklin

**Explanation:**In this thread, we will try to collectively provide solutions for the questions from the STEP Maths I, II and III papers from 1997, seeing as no solutions are available on the net.

If you want to contribute, simply find a question which is marked with "unsolved" above (you might want to check for new solutions after the time the list was last updated as well), solve it, and post your solution in the thread. I will try to update the list as often as possible. If you have a solution to a question that uses a different idea from one already posted, submit it as well, as it's often useful to see different approaches to the same problem.

If you find an error in one of the solutions, simply say so, and hope that whoever wrote the solution in the first place corrects it.

**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

0

reply

Report

#2

I

Q1

Possibilities to obtain 10p by using coins of 1, 2, 5 and 10p

10

5+5

5+2+2+1

5+2+1+1+1

5+1+1+1+1+1

2+2+2+2+2

2+2+2+2+1+1

2+2+2+1+1+1+1

2+2+1+1+1+1+1+1

2+1+1+1+1+1+1+1+1

1+1+1+1+1+1+1+1+1+1

Possibilities to obtain 20p by using 1, 2, 5 and 10p coins:

20=10+10 Hence we can see that there are 11 possibilities to obtain it if added with a 10.

Now we will have;

5+5+5+5

5+5+5+2+2+1 etc. 2 times more

5+5+2+2+2+2+2, 5+5+2+2+2+2+1+1 etc. 4 times more

5+2+2+2+2+2+2+2+1 etc. 7 times more

2+2+2+2+2+2+2+2+2+2 etc. 10 times more

i.e. total answer =41

And, as DFranklin pointed out later, I missed the obvious 20p

Edited: corrected stupid thinking mistake, should not just work on a STEP question for 5min

Edit2: Now it shall be OK, and when checking in Siklos I find he writes something that is wrong (only finds 6ways to get 5+....) but the final answer in there is the same.

Q1

Possibilities to obtain 10p by using coins of 1, 2, 5 and 10p

10

5+5

5+2+2+1

5+2+1+1+1

5+1+1+1+1+1

2+2+2+2+2

2+2+2+2+1+1

2+2+2+1+1+1+1

2+2+1+1+1+1+1+1

2+1+1+1+1+1+1+1+1

1+1+1+1+1+1+1+1+1+1

Possibilities to obtain 20p by using 1, 2, 5 and 10p coins:

20=10+10 Hence we can see that there are 11 possibilities to obtain it if added with a 10.

Now we will have;

5+5+5+5

5+5+5+2+2+1 etc. 2 times more

5+5+2+2+2+2+2, 5+5+2+2+2+2+1+1 etc. 4 times more

5+2+2+2+2+2+2+2+1 etc. 7 times more

2+2+2+2+2+2+2+2+2+2 etc. 10 times more

i.e. total answer =41

And, as DFranklin pointed out later, I missed the obvious 20p

Edited: corrected stupid thinking mistake, should not just work on a STEP question for 5min

Edit2: Now it shall be OK, and when checking in Siklos I find he writes something that is wrong (only finds 6ways to get 5+....) but the final answer in there is the same.

0

reply

Report

#3

Ive got STEP II Question 3 to write up. Ill do it abit later on .

I didnt see you posting this oops! Ill get a mod to delete the one i started.

I didnt see you posting this oops! Ill get a mod to delete the one i started.

0

reply

Report

#5

Papers coming, upload is sloooow...

insparato: Actually yours was first, so I should be the one to say sorry. But I just thought that you might want some relief from having to update the thread, I mean I just happen to got too much free time right now so I might just as well do it, you concentrate on doing the questions instead.

insparato: Actually yours was first, so I should be the one to say sorry. But I just thought that you might want some relief from having to update the thread, I mean I just happen to got too much free time right now so I might just as well do it, you concentrate on doing the questions instead.

0

reply

Report

#6

Ukgea can attach them or you could pm me and ill give you the link.

I dont think im allowed to provide you it on TSR threads.

As Nicholas has tried to do above .

I dont think im allowed to provide you it on TSR threads.

As Nicholas has tried to do above .

0

reply

Report

#7

(Original post by

Papers coming, upload is sloooow...

insparato: Actually yours was first, so I should be the one to say sorry. But I just thought that you might want some relief from having to update the thread, I mean I just happen to got too much free time right now so I might just as well do it, you concentrate on doing the questions instead.

**ukgea**)Papers coming, upload is sloooow...

insparato: Actually yours was first, so I should be the one to say sorry. But I just thought that you might want some relief from having to update the thread, I mean I just happen to got too much free time right now so I might just as well do it, you concentrate on doing the questions instead.

0

reply

Report

#8

Meh!

"STEP I 1997.pdf:

Your file of 1.32 MB bytes exceeds the forum's limit of 609.7 KB for this filetype.

STEP II 1997.pdf:

Your file of 1.17 MB bytes exceeds the forum's limit of 609.7 KB for this filetype.

STEP III 1997.pdf:

Your file of 1.33 MB bytes exceeds the forum's limit of 609.7 KB for this filetype."

How were your files so small, insparato?

"STEP I 1997.pdf:

Your file of 1.32 MB bytes exceeds the forum's limit of 609.7 KB for this filetype.

STEP II 1997.pdf:

Your file of 1.17 MB bytes exceeds the forum's limit of 609.7 KB for this filetype.

STEP III 1997.pdf:

Your file of 1.33 MB bytes exceeds the forum's limit of 609.7 KB for this filetype."

How were your files so small, insparato?

0

reply

Report

#10

shall we upload them to rapidshare or something instead? (Although that would mean we had to download the files to the harddrive...)

0

reply

Report

#11

**STEP II Question 1**

Note that the first term + last term, 2000+5777 = 7777. The second term + last-1'th term, 2002+5775 = 7777, and so on.

We only have to consider the number of terms in the 2000's and 5000's. As we are adding the terms up, we need to find the number of terms in the 2000's.

Looking at the progression:

2000

2002

2005

2007

2020

2022

2025

2027

2050

2052

2055

2057

2070

2072

2075

2077

etc...

There are 16 terms with the first two digits, and this occurs 4 times with each different hundreds number, so there are 64 "sets" of 7777.

Therefore:

Done.

2

reply

Report

#12

Perhaps. If you want to do it, then fine. Otherwise we could just have people PMing around the links, besides I think most people who are actually doing STEP revision know where to find them anyway.

0

reply

Report

#13

(Original post by

Perhaps. If you want to do it, then fine. Otherwise we could just have people PMing around the links, besides I think most people who are actually doing STEP revision know where to find them anyway.

**ukgea**)Perhaps. If you want to do it, then fine. Otherwise we could just have people PMing around the links, besides I think most people who are actually doing STEP revision know where to find them anyway.

0

reply

Report

#14

(Original post by

Yes, I think so too, but it seemed like dvs wanted them, I'll see if I upload them to rapidshare soon, otherwise someone could PM him, and others wanting it (if that isn't done...)

**nota bene**)Yes, I think so too, but it seemed like dvs wanted them, I'll see if I upload them to rapidshare soon, otherwise someone could PM him, and others wanting it (if that isn't done...)

0

reply

Report

#15

Nota Bene - I think you're just missing the "obvious" solution of just using the 20p! As I happen to have an approach I think can be useful in similar problems, I hope no-one minds if I give it here:

Step I, Q1, 1997.

Let P(n,k) be the no. of ways of making n using coins <=k. We make the following observations:

P(n,1) = 1 for all n.

P(1,2) = 1, P(2,2) = 2, P(n,2)=floor(n/2)+1 (using 0,1,2,...,floor(n/2) 2's).

P(10,5) = P(10,2)+P(5,2)+1 = 6 + 3 + 1 = 10 (first term is using no 5's, second term is using one 5, last term is using 2 fives. We will use a similar construction repeatedly later).

P(10,10) = P(10,5)+1 = 11. (first term using no 10s, 2nd term using 1 10).

For the 2nd part:

P(20,5)=P(20,2)+P(15,2)+P(10,2)+P(5,2)+1 = 11 + 8 + 6 + 3 + 1 = 29

P(20,10) = P(20,5)+P(10,5)+1 = 29 + 10 + 1 = 40

P(20,20) = P(20,10)+1 = 41.

Step I, Q1, 1997.

Let P(n,k) be the no. of ways of making n using coins <=k. We make the following observations:

P(n,1) = 1 for all n.

P(1,2) = 1, P(2,2) = 2, P(n,2)=floor(n/2)+1 (using 0,1,2,...,floor(n/2) 2's).

P(10,5) = P(10,2)+P(5,2)+1 = 6 + 3 + 1 = 10 (first term is using no 5's, second term is using one 5, last term is using 2 fives. We will use a similar construction repeatedly later).

P(10,10) = P(10,5)+1 = 11. (first term using no 10s, 2nd term using 1 10).

For the 2nd part:

P(20,5)=P(20,2)+P(15,2)+P(10,2)+P(5,2)+1 = 11 + 8 + 6 + 3 + 1 = 29

P(20,10) = P(20,5)+P(10,5)+1 = 29 + 10 + 1 = 40

P(20,20) = P(20,10)+1 = 41.

0

reply

Report

#17

(Original post by

Nota Bene - I think you're just missing the "obvious" solution of just using the 20p!

**DFranklin**)Nota Bene - I think you're just missing the "obvious" solution of just using the 20p!

0

reply

Report

#18

**STEP II Question 3**

Therefore

Expand out

Comparing coefficients

- 1

- 2

- 3

- 4

- Substituting this into 2 and 3

- Substituting this into 4

Substituting values of b and d into 2

- Substituting back into 1

So

Therefore

Consider

Consider

let u = x+1

Therefore

Consider

Consider

Consider

Therefore

Finally

This has been a nightmare typing this up as i dont exactly write in a logical order when its a big question on paper. Ill read through it just to check it. Although it does get the answer.

1

reply

Report

#19

STEP I question 8

Clearly, the equation has no non-positive roots (as the RHS is always positive for real x).

Then we can take logs of both sides for the equivalent

.

Let . Then

Note that is strictly decreasing (well for positive x anyway, which are the only ones we're worrying about).

Now, setting we get

This is a maximum since was decreasing. The value at the maximum is

For there to be zeroes to f(x), we must have that the maximum is larger than or equal to zero:

Exponentiating:

and again:

,

and so there are no real roots if .

If , then and so is strictly positive (again for x>0). This means that there can be at most 1 solution to the equation. Consider now

which is negative since and . Then consider f(1):

which is positive since . Because f(x) is continuos, there must then be one point x, with such that , i.e. the equation has at least one solution.

But now must have exactly one root. Since this equation is equivalent (for positive x) to the given equation , it follows that this latter one also has exactly one solution.

Clearly, the equation has no non-positive roots (as the RHS is always positive for real x).

Then we can take logs of both sides for the equivalent

.

Let . Then

Note that is strictly decreasing (well for positive x anyway, which are the only ones we're worrying about).

Now, setting we get

This is a maximum since was decreasing. The value at the maximum is

For there to be zeroes to f(x), we must have that the maximum is larger than or equal to zero:

Exponentiating:

and again:

,

and so there are no real roots if .

If , then and so is strictly positive (again for x>0). This means that there can be at most 1 solution to the equation. Consider now

which is negative since and . Then consider f(1):

which is positive since . Because f(x) is continuos, there must then be one point x, with such that , i.e. the equation has at least one solution.

But now must have exactly one root. Since this equation is equivalent (for positive x) to the given equation , it follows that this latter one also has exactly one solution.

0

reply

Report

#20

Inspirato: does it come out simpler if you write:

as the 1st bit is just .

(And similarly for the other part).

I actually set essentially the same question as this for some students, once upon a while...

as the 1st bit is just .

(And similarly for the other part).

I actually set essentially the same question as this for some students, once upon a while...

0

reply

X

### Quick Reply

Back

to top

to top