[nota bene]

(Original post by *bobo*)
for some reason my computer won't let me access paper III anymore, says its damaged?

Odd (do the other papers work?)

I can email a copy if you think that would help...

[*bobo*]

all the other papers work. strange.
please do

[generalebriety]

(Original post by *bobo*)
for some reason my computer won't let me access paper III anymore, says its damaged?

It could be your cache that's got damaged. Try clearing it then opening the paper again.

[*bobo*]

STEP II
11)
if the purse scrapes the edge of the cliff, it reaches its max point at 0.5d from edge of cliff.
vertical movement:
u=VsinA, v=0, a=-g
=> s= (VsinA)^2/(2g)

horizontl movement after max point:
v=VcosA, s=0.5d => t=d/(2VcosA)
vertical movement after max point:
s=((VsinA)^2/(2g))-h, u=0, a=g, t= d/(2VcosA)

((VsinA)^2/(2g))-h= 0.5g(d/(2VcosA))^2

=> 8V^4sin^4A- 8V^2(2gh+V^2)sin^2A + 2g(gd^2 + 8V^2h)=0
sin^2A= (8V^2(2gh+V^2) +/- (64V^4(V^4+4gh+4g^2h^2)-64gV^4(gd^2+8V^2h))^0.5)/16V^4

for the purse to be able to be thrown in the situations given, sinA must exist so:
(V^4 +4ghV^2 +4g^2h^2)>= g^2d^2 + 8ghV^2

(V^4- 4ghV^2 +4g^2h^2)>=(gd)^2
(V^2-2gh)>=gd
V^2>= g(2h +d)

[insparato]

STEP I Question 7(This question was partially completed on post #4)















if g(1) and g(0) for any given value of n, g(n) is an integer.













Therefore because f(-1),f(0) and f(1) are integers

Now for the bit that harder









Take the first term Aalpha^2







next term -2A\alpha n



Next two easier terms Ba + C



Next term is Bn



So!





As \alpha and all the functions involving alpha are integers therefore f(\alpha + n) must be an integer.

Id tidy that up too but i really cant be arsed at the moment.

What a bitch that was. I bet theres a much more elegant way. Ive most definitely made an error in that but the method is there. You just have to find the function of f(\alpha + n) in terms of functions that are known integers.

[insparato]

STEP I Question 8

Calling F(t) the integrated function of f(t)







(thanks to Billy (GE) for the cleaning up the tizwozz i got into about the third and last part)
Consider
.
You can just differentiate both sides from here and get

and plug this into the integrals in the second and third part:








Just attempting the final and 4th part now.

[generalebriety]

(Original post by insparato)
STEP I Question 8







if

Consider
.
You can just differentiate both sides from here and get

and plug this into the integrals in the second and third part:






.

[insparato]

I was mucking about with this yesterday but i must of got myself in a twist becaues i did get A = 1, or something of this nature but didnt know where it led to.

Yes that seems reasonable.

Argh i just realised i had a stupid idea that f(x) was on both sides on third equation which obviously doesnt make sense.

[DFranklin]

(Original post by insparato)
What a bitch that was. I bet theres a much more elegant way.

There is. (I posted it earlier, actually).

Put . Then g is a quadratic, and g(-1),g(0) and g(1) are all integers. So g(n) is an integer for all n. Therefore so is .

[insparato]

Nevermind, i thought nobody had finished that last part off as it was up as incomplete.

[generalebriety]

To my knowledge no one had completed it. Which post did you complete it in, David?

[DFranklin]

(Original post by generalebriety)
To my knowledge no one had completed it. Which post did you complete it in, David?

I gave a (spoilered) hint in post #40. Looking back at it, it's not actually right (sign of alpha is wrong), but it should have been enough I think.

[Swayum]

(Original post by insparato)

Just a slight pedantic note about A:

f(-1) + f(1) = A - B + C + A + B + C = 2A + 2C
f(-1) + f(1) - 2f(0) = 2A + 2C - 2C = 2A

So what you've actually got there is 2An^2 not An^2. You'll have to divide by 2. I'm just saying this in case in a few years time someone sees your solution and thinks their one is wrong.

[generalebriety]

Ooh, ok, so no one has actually completed it yet?

[DFranklin]

(Original post by generalebriety)
Ooh, ok, so no one has actually completed it yet?

What, you mean other than insparato's solution about 10 posts earlier and my shorter solution for the end bit? (Or are we talking about different questions? For clarity, I am talking about STEP I, Q7).

[generalebriety]

(Original post by DFranklin)
What, you mean other than insparato's solution about 10 posts earlier and my shorter solution for the end bit? (Or are we talking about different questions? For clarity, I am talking about STEP I, Q7).

As I understood, Aaron's solution had a mistake (pointed out by DeathAwaitsU) and yours was just a hint. I don't know though, you tell me.

[Swayum]

It's solved. I was just pointing out a minor mistake and David was explaining a more elegant solution. Regardless, Insparato finished off the bit I didn't do so the question is complete (assuming his solution was correct - I don't have the strength right now to read it).

[generalebriety]

Ok, well, I'll leave the link up there and Aaron is free to correct his minor mistake if he wants. I shall add a link to David's post and everyone can then fight it out amongst themselves.

[DFranklin]

(Original post by generalebriety)
Ok, well, I'll leave the link up there and Aaron is free to correct his minor mistake if he wants. I shall add a link to David's post and everyone can then fight it out amongst themselves.

Yet another solution:

g(n) = g(0)+n(g(1)-g(0)), so g(n) is always an integer.

Now set . g(0) and g(1) are both integers and so g(n) is always an integer. Since f(0) is an integer it follows that f(n) is always an integer. (This is obvious, but if you want to prove it, suppose not, and let n be the integer of smallest modulus such that f(n) is not an integer. We know f(0) is an integer, so n =/= 0. If n > 0, we have f(n-1) is an integer, and so f(n) = f(n-1)+g(n) is an integer. If n < 0 we have f(n+1) is an integer and so f(n) = f(n+1)-g(n+1) is an integer).

Finally, consider . Since h is a quadratic and h(-1),h(0),h(1) are all integers, h is an integer for all n. Therefore is an integer for all n.

[insparato]

(Original post by generalebriety)
Ok, well, I'll leave the link up there and Aaron is free to correct his minor mistake if he wants. I shall add a link to David's post and everyone can then fight it out amongst themselves.

Handbags at dawn?

Yeah ill correct it, i should really start writing these question on paper instead. Although its not elegant.