You are not logged in.
No worries,
Found the problem.
Thanks,
Mitch.
Hi,
Could anyone please help me with the following?
This is question number 6 of Further Problems III on page 143 of K A Stroud's Further Engineering Mathematics.
given
and
and
prove that
Here's my attempt but I end up missing out the middle term of the answer. Can anyone see where I've gone wrong?
Starting with the generic formulae:
and
we have:
and
and
and
therefore
and
therefore
=
=
and similarly therefore
=
=
so now we subtract these two expressions to give
which simplifes to
=
which finally simplifies to
which is not the desired result, I am missing the
term.
So either the book is wrong, or I am wrong or the missing term evaluates to zero. I strongly suspect I am wrong. Can anyone help me see where I made a mistake?
Thanks,
Mitch.
Hi,
Could I ask, would folks agree with my calculation below:
It is to do with tossing N coins.
By an "experiment" I mean the act of tossing a N coins.
So:
n = Number of experiments performed.
P = Probability of getting N heads in a row after n experiments.
I wish to derive a formula that gives n as a function of P and N.
Here's the reasoning:
On the first experiment, the probability of getting N heads in a row is:
So the probability of not getting N heads in a row is:
If one actually gets N heads in a row at this point then one stops. However, if one does not yet have N heads in a row then one continues.
I'm visualizing this as a probability tree diagram where at each splitting of the tree there are two paths, one with probability
and the other with probabilitySo with this setup, one could ask, what is the probability of obtaining the N heads in a row in two experiments. Well, for this to have happened either "the first experiment would have succeeded" OR "the first experiment would have failed and the second experiment would have succeeded" in producing N heads in a row. So the probability would be:
In this way, we can form an infinite sum which gives us the probability of obtaining the N heads in a row after n experiments, it is:
This is geometric progression and so we can find the sum of the first n terms as:
which simplifies to:
which gives:
So is this correct?
Well we can ask what it gives for the various possibilities below:
1) How many experiments should I perform such that the chances of me getting all heads with 10 coins (N = 10) is 0:
Formula gives
That makes sense.
2) How many experiments should I perform such that the chances of me getting all heads with 10 coins (N = 10) is 1 in 1024:
Formula gives
That makes sense.
3) How many experiments should I perform such that the chances of me getting all heads with 10 coins (N = 10) is 1:
Formula gives
That makes sense.
4) How many experiments should I perform such that the chances of me getting all heads with 10 coins (N = 10) is 0.9999:
Formula gives
(rounded up to nearest whole number of experiments)That makes sense?
My question is, would folks agree with the correctness of this formula?
Thanks,
Mitch.
To futher complete this topic I'll post that I now have a solution for the hyperbola.
The task is:
Given the conic section :
Find the foci.
(If the equation represents a parabola
then one should find the focus and directorix, but case is solved above).If the equation represents a hyperbola, which will be the case when
then the method is as follows:
Find the asymptotes of the hyperbola
case B != 0.0:
Gradients given by
Intercepts by
case B = 0.0:
Gradients given by
and other asymptote verticalIntercetps by
andThis covers all cases of the hyperbola.
Now, find intersection points of these two lines, this is the centre of the hyperbola.
Next find the two lines which bisect the two angles formed by the two asymptotes. Only one of these lines will intersect the hyperbola, the two intersection points are the vertices of the hyperbola.
Let a = the distance from the centre to a vertex.
Next, move from the centre a distance ae along the line joining the two vertices towards each vertex where e is the eccentricity of the hyperbola calculated as:
where n is 1 or -1 as the determinant:
is negative or positive respectively.
This gives the two foci of the hyperbola.
I've got this running nicely in an interactive application and it works very well.
If anyone can think of a more elegant method I'd be very glad to hear.
Onward to the ellipse..........
Thanks for your suggestion.
I agree with you, things would be much simpler in such a change of reference.
I wonder though, if the task of finding the suitable reference frame is not itself just as difficult.
Say for example we take the specific hyperbola:
How can one determine the correct change of reference frame that will make the coordinate axes become the lines of symmetry of the hyperbola?
Thanks for any help.
Hello. I wonder could anyone help me with the following.
All conic sections can be represented by the equation:
Let's start with the parabola. This is the curve comprised of the locus of points whose distance to a line ax+by+c=0 (the directorix) is always the same as their distance to a point (u,v) (the focus).
So, given the directorix and the focus can one derive the general form given above for that particular parabola?
Yes. One can equate the distance of the general point (x,y) from the directorix and the focus like so:
Now one just moves everything to the left hand side, collects up terms in x^2,y^2,xy,x and y and obtains the results:
Good. So given u,v,a,b,c as input, one can calculate A,B,C,D,E and F as output.
How about the inverse. Given a general conic (A,B,C,D,E,F) known the be a parabola, can one find the focus and directorix.
Yes. From the first two equations above, we have:
Now this alone is not sufficient to determine a and b, as each square root may be either positive or negative, but we also have the third equation above. So if we calculate the positive roots and then find that -2ab is not equal to C then we can choose either a or b and reverse its sign and we are done. So we now know a and b. The remaining equations give as c,u and v as:
Job done.
My question is, how about the hyperbola and the ellipse. Can we do the same thing?
Let's just consider the hyperbola.
The first part is easy enough. Given the foci ( two of them obviously, (a,b) and (c,d) ) of the hyperbola we can set the difference of the distances from the general point (x,y) on the hyperbola to these foci to be a constant (say k) to obtain:
Now again, we collect powers of x and y etc. and after the dust has settled we obtain:
This all works perfectly well. I've written code to allow me to move the mouse around on the screen to define the position of the second focus given the first and the hyperbola is drawn from the calculated values of A,B,C,D,E and F and all is well.
BUT, how about obtaining a,c,b,d from A,B,C,D,E and F. That looks hard to me.
As you can see, I've been pleasantly busy. So after all this my question is:
Given the general equation of a hyperbola or ellipse. How to find the foci?
I have solved the problem fully for the parabola as you see above. But only half the problem for the hyperbola and ellipse (i.e. given the foci I can obtain the general equation).
Thanks for any suggestions. There may be a much simpler approach which I am missing.
This is answered correctly here: http://answers.yahoo.com/question/index … 350AAFk8Nb
let
then
and
so
Hence:
We need to show that this is always between -1 and 1 inclusive, that is to say we need to show that the denominator always has greater or equal absolute value than that of the numerator, i.e. that:
i.e. that
i.e. that
i.e. that
i.e. that
Which is clearly true as the LHS is always > 0.
One thing, we have proven the inequality for ALL complex numbers except one, the number 0 + 0i, for this number the inequality is not true as the denominator would be zero.
Hello,
I've recently written code to calculate the Levenshtein distance
between two strings of characters. I further wish to find the a
minimal cost path through the matrix generated.
This page explains fully the cost function - http://www.levenshtein.net/
My approach is to start at the top left cell and move to the bottom right cell by a series of locally minimal-cost moves.
Where there is a choice of equally costly such moves I follow all routes which begin at this branching point. I can discard a branch when its cumulative cost rises above the Levenshtein distance.
Trouble is this can be a very very very slow process.
Is there an efficient algorithm for finding at least ONE minially
costly route through the matrix?
Is there one for finding ALL such routes?
I have implemented a fast approximate algorithm but this can often be quite off from the minimal distance.
I may have read somewhere that this problem is NP hard but I can't re-find that reference. If it is then I'm out of luck.
Thanks for any help.
Quite right. Good fun. The problem is mine.
I write:
And that is true, at any given instant in time for the cone of water.
I next need to calculate
BUT, for the water cone, r is a function of h, in fact r = h/3.
However, I differentiated as if r were a constant wrt h.
I should have substituted in r = h/3 to give:
And THEN differentiated wrt h. Then we of course agree.
Lesson learned (again!).
Radius a top of cone = 200cm, cone is 600cm high so radius at 200cm high is 200/3 cm. so
so we have
So my answer is
I appreciate I differ in the above expression for dv/dh by a factor of 3. Is it my mistake somewhere?
Never too late,
Thank you. I had eventually solved this one but not this way. It is always instructive and enjoyable to see alternative attacks on given problems.
Hi Denominator,
No worries.
I am confused though,
Bobbym's answer was 87531 * 9642
and my answer was 9642 * 87531
They are the same, they both equal 843973902.
To prove this we can use the "rearrangement inequality".
This states that given two sets of positive real numbers:
and
and a given rearrangement of X and Y:
The product (and therefore also the sum - as product is just repeated addition):
is maximized when X' and Y' are both ordered in either ascending or descending order.
To prove this consider the case n = 2:
where
and
then
For the general case for any n let
and
such that
and
suppose that
is a permutation of X with
and
is a permutation of Y such that the product
is maximized.
If there exists a pair
then
So interchange of these pairs will increase the product. Well if we interchange all such situations we end up with V and Z ordered in the same way.
So in choosing our numbers we should use a greedy approach:
First choose 9 and 8.
then 7 and 6.
We place the 7 so that the partial products of cross multiplication are maximized so we now have 96 and 87 and so on to give:
9642 * 87531 as the largest product.
Now of course my proof above assumes both sets of numbers have equal cardinality but clearly here we have and odd number of digits and our two subsets are of differing cardinality - but you can fill in the details here, details also which need to be shown to prove that any other splitting of the digits will produce only lesser products e.g. a two digit number times a seven digit number etc etc.
interesting links:
http://en.wikipedia.org/wiki/Inequality … tric_means
and
3.2:
Clearly x = 0 is the only vertical asymptote.
As x tends to infinity we can see that this function tends to 2, therefore y = 2 is only horizontal asymptote.
There are no skew asymptotes as performing the division gives no whole part.
Rearranging the equation for x gives:
Clearly when y = 0 so x = -2 therfore (-2,0) is the intercept.
1) {(0,0),(1,3),(2,1),(3,4),(4,2)}
2) From above the range of f(x) is A. This is because the value of f(x) can take any of all of the values from A = {0,1,2,3,4}.
3)
You can verify this by multiplying each second element in every ordered pair by 2 and reducing modulo 5 and seeing that the answer in each case is the first element in the corresponding ordered pair.
2 is said to be the multiplicative inverse of 3 mod(5)
Don't use y = mx + c form as indeed vertical lines are not representable this way.
Use the more general form ax + by = d.
So your two lines will be:
and
So you now solve the matrix equation:
Check determinant of matrix is not zero then solve system. Check that solutions for x and y lie between x and y extremities of line segments given.
These formulae are just two different ways of writing the same thing, like x + y and y + x they are just alternative ways of expressing the same quantity.
Notice also that (x-y)^2 is the same as (y-x)^2. If one of x-y and y-x is -'ve so the other will be +'ve, but both will be of the same magnitude. e.g. 7-5=2 and 5-7=-2 etc. But as a -'ve times a -'ve is +'ve we see that (7-5)^2 = 2^2 = (-2)^2 = (5-7)^2
So:
Quite right stoobzy, my answer was wrong.
It may be instructive to see why it is wrong.
I assumed that the distance travelled by the queue during the time it took for the police car to travel from the back of the queue to the front was the same as the distance travelled by the queue during the time it took the police car to travel from the front of the queue to the back. It is not.
The police car's velocity relative to the queue is different on each pass. My answer was wrong because I indirectly set this relative velocity the same on each pass.
Indeed the answer is greater than my original.
(If only the queue had not been moving at all, then my original answer would have been right!)
[Removed]
[Answer removed]
2)
Call this "Equation (1)".
Differentiation gives us the gradient of this curve at any point:
We know that two lines which are mutually perpendicular have gradients whose product is -1. Therefore the gradient of the line we require the equation of is:
This is the gradient of the perpendicular to the curve at any point on the curve with a given x ordinate.
So we know that the equation of the perpendicular to the curve at any given x ordinate will have the form:
Specifically, we are interested in the point where x = a, hence the equation at this point will be:
Call this "Equation (2)".
We just need to know the value for C. Well, we know one point on this line. The point (a,2a^3+7a-3) is on this line - this from equation (1).
So in Equation (2) we simply substitute in X = a and Y = 2a^3+7a-3 to give:
So putting this value of C into Equation (2) gives:
Call this Equation (3).
This is the equation we desire, it now has to be put into general form. At the moment it is in the form y = mx + c but general form would be ax + by + c = 0
So, working on Equation (3) yeilds:
This is our answer.
To see an instance of this result, let's set a=2. Then Equation (2) becomes:
A plot of this should yield a line which cuts the curve perpendicularly at x = 2.
I can thoroughly recommend Mathematica - it is truly exellent - http://www.wolfram.com/
For low numbers trial and error would be fine, in the example you gave we know that we need to use the formula:
Specifically we need to solve:
for n.
We can simply try integral values of n {1,2,3.....} and we soon arrive at n=8 as our solution.
In general this function will not have an integral solution.
The generalised factorial function is the Gamma function which defines the factorial of real and complex values: http://en.citizendium.org/wiki/Gamma_function
It is the inverse of this function which one would need in general - not a trivial thing. Google "inverse Gamma function" to find out more!
2)
Solve
Lets gather all terms on the LHS be subtracting RHS from both sides to give:
Call this equation (1) and let the LHS be called f(x)
Solving this is most easily done by factorising this expression. We can see simply by tring it that x = 1 is a root of the LHS so (x-1) must be a factor, so let's do the long division:
so (1) is equivilent to:
Again, it is easy to see that x = 1 is a root of the cubic and so (x-1) is yet again a factor:
So now we have reduced the problem to:
Again we easily spot a root of the quadratic, x = -2, and so (x+2) is a factor:
And we can see easily that:
so, we have reduced are problem to:
So, f(x) is zero at x = -2, x = 1 and x = 3
To check which way the curve is bending we check its value anywhere but at the zeros, so at x = 0 f(x) = -6, so now we can easily see that:
You can see the correctness of the result here:
Plot of x^4+11x vs 3*(x^3+x^2+2)