It's a good question, but it has been asked and answered before here, just do a little search...

EDIT: double post

I believe that you can prove your claim by applying a 'folk theorem' for repeated games. You can find a statement of a simple folk theorem in Rubinstein's book and also, I think, in Gibbon.

<t>QuoteSo that is an approach if you lack the inspiration to guess the correct answer as Kaibab did. But it is not very satisfying since it is alot of calculus to arrive at an answer which is very simple. Is there any intuition about why that bizarre-looking function of x, y and z should have such ...

QuoteOriginally posted by: gegradHere's what the description of this section says "lateral thinking puzzles, logic problems, interview questions... " What is your greater weakness? (another perfectly valid interview question)

QuoteOriginally posted by: gegradOf all the assumption that we make in the B-S model, which one is the most relevant (i.e. most realistic) and which one is the most unrealistic ?Why ?this is a brainteaser?

The distribution of \xi in #1 is x=a with probability 1/2 or x=b with probability 1/2.

<t>I think it's just a bit below 2. You will certainly guess one card right. For your second guess, there is 1/2 probability that it has appeared before the first one, so you will not get it right at all. For the third card, there is 3/4 that you will not get it right etc. Hence, the expectation of ...

It has been answered already at this post. When n->infinity, shouldn't the shape become the unit sphere?

Thanks a lot!

I need to learn C# up to a decent level: I am working for a firm that uses this language for the bulk of the quant work. Can anyone suggest a good book for learning the language? Also, is there a QF-related book on C#? Thanks!

<r>QuoteOriginally posted by: AdvaitaA woman with 2 balls of weight 10 each has to cross a bridge that is 100 feet long. She weighs 100.The bridge is old and breaks at weight > 115. How will she cross the bridge if she can cross it only once?The way you ask it, she can just drop one, or both, balls ...

<t> Let n be the number of red (and black) cards. I have come up with this recursive formula for the expected value of the game F(n)=V(R=n,B=n):f[1]=1/2 and f[n]=2^(-n)+(1-2^(1-n))*f[n-1].with f[1]=1/2f[2]=3/4f[3]=15/16...The limit is at about 1.30335, and f[26] is very close to this limit. EDIT: Th...

Option A has half option B's value. That's a restatement of the 'reflection principle.'

<t>I have had a similar problem with a prop shop based somewhere in the EU (not the UK.) They also had an one-year non-compete agreement. I told them to stuff it, and I didn't accept the job because of this - even though it was a good offer. Subsequently, I found out that in the EU area, including t...