ARCHIVED POSTS
< Earlier Kibitzing · PAGE 6 OF 277 ·
Later Kibitzing> |
Jun-04-06 | | WillC21: <whatthefat> Your projectile problem is not difficult from a conceptual standpoint, but I've run into a brick wall in the form of equation crunching/solving :) There are three fundamental equations:
1) x(distance max.) = v(in the x-direction)*t(max)
2) V = v(in y direction)-gt
3) 0 = h+v(y direction)*t-0.5g(t^2)
I'm not gonna explain these as they're simple enough to go unexplained. In equation (3) we need to solve the quadratic for t(max). Then we need to combine(plug in) to equation(1). After doing so, the derivative dx/d(theta) needs to be taken and set to zero to maximize it. When I did this, I got the following mess:
0=(v/g)cos(2theta)+[((v/g)sin(theta))*((v^2cos(2theta)-
2gh)/(sqrt(v^2sin^2(theta)+2gh)))]
That "mess" needs to be solved for cos(theta) so we can obtain a formula dependent upon any "h" and "v" inputs. My first inclination(reflex) was to go to Mathematica so as to not spend all night equation crunching! However, with my new computer(one week old) I haven't yet installed Mathematica(I'll do so in the next few days). Well, if that above equation can be solved for cos(theta) then I think you have your answer, right? |
|
Jun-05-06 | | whatthefat: <WillC21>
Yep, that's right so far. |
|
Jun-05-06 | | WillC21: <whatthefat> Ok, so I was right.
I see two options:
1) You can tell me the simplified answer.
2) I can crunch it in Mathematica in a few days.
I'd prefer option "1", but have it your way :)
For now, I'm heading to bed(1:30am here).
P.S. After we resolve this simplification, I have a fascinating problem for you that I think you'll enjoy. |
|
Jun-05-06 | | themadhair: I suppose we now need to petition <chessgames.com> to add LaTeX support. <WillC21> I wouldn't be too sure about Mathematica. I tried using Maple when solving and it just wouldn't have it. It just kept dying. Although having said that Mathematica is better... |
|
Jun-05-06 | | themadhair: <WillC21>
<0=(v/g)cos(2theta)+[((v/g)sin(theta))*((v^2cos(2theta)- 2gh)/(sqrt(v^2sin^2(theta)+2gh)))]> There are a few ways to solve this but I'll describe what I think is the easiest. Undo your c(2theta) for (c^2-s^2) substitutions and expand to get four terms. We know that the solution is both positive and also 0<theta<pi/4. Note that there are two positive terms and two negative. You can make a periodicity arguement that allows you to equate a positive term with a negative term. There are two ways of doing this and each way gives you a pair of equations. It is clear to see that a solution to either pair of equations is a solution to the whole thing. One pair of equations trivially gives h=0 as a solution. The other pair gives the required solution. |
|
Jun-05-06 | | zarra: Here's another physics problem for you.
You throw a ball vertically upwards in real air, so there is some air resistance. Does the ball take longer to go up or come down? I spent a rather long time on that problem today, but I couldn't figure out the answer. So I'm eager to see what you can make of it. |
|
Jun-05-06 | | zarra: Ah, never mind, now I think I know what the answer is. As usual, the solution was much simpler than I firstly thought. |
|
Jun-05-06 | | mjk: <themadhair> Is something missing from the Euclid / Einstein / Erdos problem? Like Einstein at first didn't know, but knew Euclid didn't either? or is that an overspecification? |
|
Jun-05-06 | | themadhair: <mjk> Good spot - my bad. The problem should read: There are three mathematicians, Erdõs, Einstein and Euclid. Now being the @#$%-stirrer that he is Erdõs decides to have some fun in the way only Paul Erdõs can. He chooses two numbers and tells the product to Einstein and the sum to Euclid. Now Einstein knows that Euclid knows the sum and Euclid knows that Einstein knows the product. They are told that both the product and sum are less than 100, and that both numbers are greater than 1. They meet to discuss the problem. The conversation is as follows: <Einstein>:I don't know the two numbers.
<Euclid>:I knew you wouldn't know.
<Einstein>:Now I know the two numbers.
<Euclid>:Now I know the two numbers. Apologies for that error. Shouldn't be posting so late at night. |
|
Jun-06-06 | | Catfriend: <themadhair> Ah, after this correction it becomes possible to solve;) "Und I did", as says Dr.Scott. |
|
Jun-06-06 | | themadhair: <Catfriend> I posted the puzzle at about 4am and was in no way in a proper state of mind when I did so. Again, my profoundest apologies for destroying what is an excellent puzzle. |
|
Jun-08-06 | | kellmano: You have a set of weighing scales and can pick four weights of whole number values. Which weights should you pick so that you can measure the largest consecutive unit weights starting from one unit? The problem is none too difficult, but I wonder if you can work out the largest number of consecutive unit weights that can be measured using n weights. I know a kind of solution to this extension, but have not studied maths at a high enough level (degree) to fully give an answer. |
|
Jun-08-06 | | themadhair: <kellmano> I think this is the general solution. Given n weights each weight can occupy either the left scale, right scale or not be on the scale at all. In other words there are three possible states for each of the n weights. This gives a total of 3^n possible unique states. Now this counts no weights on the scale (zero weight) and treats weight w different from -w. So the upper bound on the number of possible consecutive unit weights is [(3^n)-1]/2. So how to find the weights? We require that the effect of changing one weights state cannot be replicated by the changing the states of the others. Since there are three such states for every weight there is a one-to-one correspondace to base 3 arithmatic. So for any n the optimum weights are given by 3^p for p=0 to n-1. Does that help you? |
|
Jun-08-06 | | kellmano: <themadhair> Sorry I was not clear enough in exposition. The weights you have can have different unit values. E.g. a 1 unit and three unit weight allow you to weigh anything up to 4 kilos and this is the best that can be done with two weights: 1, 3-1, 3, 3+1. Here - represents 'on the opposite side'.
Funnily enough the answer i have got to looks similar to yours for the general solution, but i only have a term to term solution not a position to term one. I hope you understand the problem now. |
|
Jun-08-06 | | themadhair: <kellmano> They do have different unit values. Let me clarify my general solution. For 1 weight the optimum weight is 3^0=1.
For 2 weights the optimum weights are 3^0,3^1 or 1,3 as in your given example. For 3 weights the optimum weights are 3^0,3^1,3^2 or 1,3,9 allowing you to weigh any integer from 1 to 13. For 4 weights the optimum weights are 3^0,3^1,3^2,3^3 or 1,3,9,27 allowing you to weight any integer from 1 to 40. Is this what you were looking for? |
|
Jun-08-06 | | ughaibu: Is it n squared plus n minus 1? |
|
Jun-08-06 | | ughaibu: Ignore my last post. |
|
Jun-08-06
 | | tamar: Stumpered! |
|
Jun-08-06 | | kellmano: <themadhair> that is indeed the sequence. First term is 1, then u(n + 1)=3xu(n) + 1. So with five weights you can do up to 121. However, what is a position to term formula. I have given this a fair bit of thought, and think 3^n must feature in some form, but don't know quite what. |
|
Jun-08-06 | | themadhair: I think the formula you are looking for is [(3^n)-1]/2. For increasing n this gives 1,4,13,40,121,364 etc. The derivation of this was explained in my first post above. Is this what you were looking for? |
|
Jun-09-06 | | kellmano: <themadhair> that's perfect - cheers. |
|
Jun-13-06 | | themadhair: Here is a pretty good explanation of the solution to the Einstein/Erdõs/Euclid problem for those who are interested - (http://www.cs.rug.nl/~grl/ds05/sump...). |
|
Jul-01-06
 | | Sneaky: Some old business:
<zarra> criticized my analysis of the envelopes stumper saying <In your equation for expected return, <0.5(2X) + 0.5(X/2)>, you use X for two different things. In the first term, X=money in the poor envelope, whereas in the second term, X=money in the rich envelope. Shame on you!> I responded <I don't know what you mean. "X" is not the poor envelope or the rich envelope, "X" is the unknown amount of money in the envelope that was picked.> Reading over zarra's post again, suddenly it is clear to me. When one speaks of the other envelope containing 2X, then the assumption is that I have picked the lessor envelope. If the other envelope contains X/2, I must have picked the bigger envelope. So in this way, my "X" takes on two different meanings. Good work zarra, your explanation was right on, but over my head. |
|
Jul-01-06
 | | Sneaky: << The Casino Paradox >> A casino offers a game which costs $X to play. Once you pay the $X, you get to flip a coin and try to get as many heads in a row that you can possibly get. As soon as you get tails even one time, the game is over. There is no payoff for less than 10 heads.
If you flip 10 heads, you get $2 back.
If you flip 11 heads, you get $4 back.
If you flip 12 heads, you get $8 back.
If you flip 13 heads, you get $16 back.
etc. etc.
There is no maximum payoff.
Question - What would be a fair amount of money for the casino to charge so that this game would appeal to the players but still give them a tiny "house edge" over the gamblers? << ** stop reading now if you don't want to know the answer ** >> Crazy as it sounds, this game will be unfair to the casino, regardless of how much money they charge to play. Even more crazy, it doesn't matter when the payoff starts E.g. they could start the payoff structure when you flip only 3 heads in a row, or start to pay out only when you flip 1000 heads in a row. So think about this: the casino says "For the price of one billion dollars, you can sit down and play this game, but the payoff structure doesn't start until you flip one thousand heads in a row." You'd have to be an idiot to accept such a bet, right? According to the math, the CASINO is the idiot to offer the bet!! If the payoff starts at 1000, the equation to tell you what the expected value of this bet is, would look something like this: 1/2^1000 * (1/2*2 + 1/4*4 + 1/8*8 + 1/16*16 ... )
Sure, 1/2^1000 is a very tiny number, but look at what's in the parentheses. It's an infinite series of ones, i.e. it's infinity! Multiply infinity by any positive constant, no matter how small, and you end up with infinity. Ergo, this game will favor the player. This isn't really a paradox, we just think of it as a paradox since it seems to violate common sense. When you think of the game on merely human terms, there will never be enough time or money to be able to break the bank. But think of it this way: suppose the Devil runs this casino and God decides to play. These two have nothing but time on their hands, and God has unlimited funds, so He keeps plugging away for eons on end. It might take billions of years for it to happen, but eventually God goes on a streak where he doubles so many times over that he takes away everything the Devil won since the game began. Weird. |
|
Jul-06-06
 | | OhioChessFan: My grandson is about as many days old as my son is in weeks, and my grandson is as many months old as I am in years. My grandson, my son and I together are 160 years. What is my age in years? |
|
 |
 |
ARCHIVED POSTS
< Earlier Kibitzing · PAGE 6 OF 277 ·
Later Kibitzing> |