Dividing the first equation obtained by the following one results in [after rearranging];
xy=353 along with x+y=76
(x−α)(x−β)=x2−(α+β)x+αβ
So x and y are the roots of the quadratic;
p2−76p+353=0
It follows;
x=73±35230andy=73∓35230
Subsituting these into equation (i) and equation (ii) gives two simulateneous eqnts in a and b that are too tedious for me to solve without being in an exam.
Applying the above with k = 4,5 to find S_3 and S_4 respectively quickly works.
(ii) DFranklin solutions;
Claim: S_k(n) is a poly of order k+1 for all k.
Proof: Use strong induction on k. Suppose true for k < N.
Then by (*), SN(n)=(n+1)N+1+ "the sum of a load of polynomials that are of order < N+1 (by induction hypothesis)". Since the sum of an N+1 degree poly and a load of polys of degree < N+1 is a poly of degree N+1, S_N(n) is a N+1 degree poly. Since S(0) = n is a degree 1 poly, the result follows by induction.
Since S_N(0) = 0 (sum of no terms is zero) we must have a_0 = 0 so the constant term must be zero. Since S_N(1) = 1 (sum from 1 to 1 of 1^N is 1) we must have a_0 + a_1+...+a_N+a_{N+1} = 1.
(i) Letting y = x so I don't refer to a y or x by mistake the problem will be restated as;
show that
x > tanh(x/2) if x > 0
Let y1=xandy2=tanh(2x) when x = 0, y_1 == y_2 = 0
We then consider the derivitive and see that (y2)′<1 when x > 0 and the result follows.
archosh(z) > (z-1)/root(z^2-1) Let z = cosh(x) the result trivially follows from the above after rewriting (x^2-1) as (x-1)(x+1) and remembering the identity linking cosh(x) with sinh^2(x/2)
(ii) We need to that if in an interval [a,b] that f(x) => g(x) it follows that;
(ii) To me this is blatantly obviously true. It has basically been shown by the working above. I do not know what the eaminer wants from this - just look at the above epression? I guess you could talk about the relationship between integration and summation? For a STEP III I am not going to tell you that saying "well it is kin of obvious" is the thing to do but this seems like the case here.
I think you'd be expected to do a proof by induction for the first bit.
e.g. Claim: S_k(n) is a poly of order k+1 for all k.
Proof: Use strong induction on k. Suppose true for k < N.
Then by (*), SN(n)=(n+1)N+1+ "the sum of a load of polynomials that are of order < N+1 (by induction hypothesis)". Since the sum of an N+1 degree poly and a load of polys of degree < N+1 is a poly of degree N+1, S_N(n) is a N+1 degree poly. Since S(0) = n is a degree 1 poly, the result follows by induction.
Since S_N(0) = 0 (sum of no terms is zero) we must have a_0 = 0 so the constant term must be zero. Since S_N(1) = 1 (sum from 1 to 1 of 1^N is 1) we must have a_0 + a_1+...+a_N+a_{N+1} = 1.
To be honest, your "it is kind of obvious" comment looks dubious here. There are some pretty clear steps that you need to go through. And waffling about links between integration and summation indicates to me that you are missing the point of the question.
nuodai do you think you could use the same format for the first post as the other years (ie using "Solution by name" as the hyperlink. The only exception to this is 2007 which I intend to fix in the near future)
Since S_N(0) = 0 (sum of no terms is zero) we must have a_0 = 0 so the constant term must be zero. Since S_N(1) = 1 (sum from 1 to 1 of 1^N is 1) we must have a_0 + a_1+...+a_N+a_{N+1} = 1.
I just read the part about proving it would be a polynomial of degree k+1 - these other bits look abit more involved. Do you think it would be neccessary to prove the bit about the degree of the polnomial or would it be OK to say that from the previous working it can be seen?
nuodai do you think you could use the same format for the first post as the other years (ie using "Solution by name" as the hyperlink. The only exception to this is 2007 which I intend to fix in the near future)
I just read the part about proving it would be a polynomial of degree k+1 - these other bits look abit more involved. Do you think it would be neccessary to prove the bit about the degree of the polnomial or would it be OK to say that from the previous working it can be seen?
As 22>21.4 (exponential functions are strictly increasing), sufficient to show that 27/5>1+2⇔27>(1+2)5, and 128 > 99 is enough to show this holds.
Suppose ln2>221ln2−12+1⇔22ln2>ln(1+2)2⇔2ln2>ln(2+1)⇔ln22>ln(1+2)⇔22>2+1, previously established, so the first integral is greater. And we are done, forever.
−h=40tsinα−21⋅10t2 and 20=40tcosα therefore −h=2cosα40sinα−45sec2α⇒−h=20tanα−45(tan2α+1) ⇒tanα=5/220±400−5(5/4−h). The larger root means the ball will loop up in the air for ages and ages and ages like some sort of stupid duck so we choose the smaller root. As t = sec a / 2, and cos a approx 1, t is approx 1/2.
(ii) h > 5/4.
(iii)tanα=5/220−400+25/4=5/220−20(1+1/64)1/2≈5/220−20(1+1/128)=−1/16 (first term binomial expansion). Using the tan a = a approximation and that 1 radian is 57 degres, alpha is approximately 57/16 degrees.