Skip to main content

Global Probability: Expected Value

 Hey, welcome back! This blog post is a continuation of my previous blog post which you can read over here . These are just notes and problems. 

The handouts/ books I referred to are Evan Chen's Probability handout , AOPS introduction to Counting and probability, Calt's Expected value handout, brilliant and this IIT Delhi handout.

I am reading expected value because it's a prerequisite to the Otis combo unit Global. Hence the name Global Probability."

Probability is Global

Expected Value:   

  • The expected value is the sum of the probability of each individual event multiplied by the number of times the event happens.
  • It is denoted as $\Bbb E$ $[x]$
  • We have $$\Bbb E[x]=\sum x_n P(x_n)$$
    where $x_n$ is the value of the outcome and $P(x_n)$ is the probability that $x_n$ occurs.

Problem 1: What is the expected value of the number that shows up when you roll a fair $6$ sided
dice?

Solution: Since it's a fair dice, we get each outcome to have equal probability i.e $\frac {1}{6}.$
So $$\Bbb E[x]=\frac 16 \cdot 1+\frac 16 \cdot 2+\frac 16 \cdot 3+\frac 16 \cdot 4+\frac 16 \cdot 5+\frac 16 \cdot 6=\frac {21}{6}=3.5$$

Problem 2: Find the expected value of a roll on a fair $n$ sided dice, labelled from $1$ to $n.$

Solution: Since it's a fair dice, we get each outcome to have equal probability i.e $\frac {1}{n}.$ So $$\Bbb E[x]=\frac 1n \cdot 1+\frac 1n \cdot 2+\dots+\frac 1n \cdot (n-1)+\frac 1n\cdot n=\frac {n+1}{2}$$

Problem 3: Suppose you have a weighted coin in which heads comes up with probability $3/4$ and tails $1/4$ with probability . If you flip heads, you win $2$ but if you flip tails, you lose $1.$ What is the expected win of a coin flip in dollars?

Solution: $$\Bbb E[x]=\frac{3}{4} 2+\frac{1}{4}(-1)=1.25$$

Problem 4:  At a raffle, $25$ tickets are sold at $1$ each for $3$ prizes of $100, 50,$ and $10.$ You buy $1$ ticket. What is the expected value of your gain?

Solution: $$\Bbb E[x]= \frac{1}{25}\cdot 99+ \frac{1}{25}\cdot 49+ \frac{1}{25}\cdot 9-\frac{22}{25}\cdot 1=\frac{135}{25}=5.4$$

Problem 5: Linda estimates the number of questions she answered correctly on a test. She answered $10$ correctly with probability $0.6,$  $20$ correctly with probability $0.3,$ and $50$ correctly with probability $0.1.$ What is the expected value of the number of questions Linda answered correctly?

Solution: $$\Bbb E[x]=\frac{6}{10}\cdot 10+\frac{3}{10}\cdot 20+\frac{1}{10}\cdot 50$$
$$=17$$

Problem 6: Mara is playing a game. There are two marbles in a bag. If she chooses the purple marble, she will win $10.$ If she chooses the orange marble, she will win $200.$ What is the expected value of Mara's winnings from the game?

Solution:  $$\Bbb E[x]=\frac 12 \cdot 10+\frac 12 \cdot 200= 105$$

Problem 7: In the casino game roulette, a wheel with $38$ spaces ($18$ red, $18$ black, and $2$ green) is spun. In one possible bet, the player bets $1$ on a single number. If that number is spun on the wheel, then they receive $36$ (their original $1 + 35$). Otherwise, they lose their $1.$ On average, how much money should a player expect to win or lose if they play this game repeatedly?

Solution: $$\Bbb E[x]=\frac{1}{38} \cdot 35-\frac{37}{38}\cdot 1=\frac{-2}{38}$$

Problem 8: In a certain state's lottery, $48$ balls numbered $1$ through $48$ are placed in a machine and six of them are drawn at random. If the six numbers are drawn match the numbers that a player had chosen, the player wins $1,000,000.$ If they match $5$ numbers, then win $1,000.$ It costs $1$ to buy a ticket. Find the expected value.

Solution: $$\Bbb E[x]=\ \frac{1}{\binom{48}{6}}\cdot 1000000+ \frac{6\cdot 42}{\binom{48}{6}}\cdot 1000-\frac{\binom{48}{6}-253}{\binom{48}{6}}\cdot 1$$ 
$$ =\frac{12271259}{12271512}$$

Linearity of Expectation:

If there exist variables $a_1 , a_2 , a_3 ,\dots, a_n ,$ independent or dependent,

$$\Bbb E[a_1+a_2+\dots+a_n]=\Bbb E[a_1]+\dots+ \Bbb E[a_n]$$

Also $$\Bbb E[X\times Y]=\Bbb E[X]\times \Bbb E[Y]$$ holds when $X,Y$ independent.

Problem 9: What is the expected value of the sum of two dice rolls?

Solution: Let the expected value of the first dice be $X$ and the second dice be $Y.$
So $$\Bbb E[X+Y]=\Bbb E[X]+\Bbb E[Y]= 2\cdot \frac{7}{2}=7.$$

Problem 10: Caroline is going to flip $10$ fair coins one after the other. If she flips $n$ heads, she will be paid $n$. What is the expected value of her payout?

Solution:  Let $X_i$ be $1$ if heads and $0.$ Also, denote $X_i$ as the outcome of the $i$ th coin flip.
So $$\Bbb E[X]=\Bbb E[X_1+\dots + X_{10}]=\Bbb E[X_1]+\dots +\Bbb E[X_{10}]=10\cdot \frac 12=5$$

Problem 11: Sammy is lost and starts to wander aimlessly. Each minute, he walks one meter forward with probability \frac{1}{2}  ​ , stays where he is with probability \frac{1}{3}  ​ , and walks one meter backward with probability \frac{1}{6}. After one hour, what is the expected value for the forward distance (in meters) that Sammy has travelled?

Solution: Let $X_i$ be the move sammy does in $i$ minute. Note that 
$$\Bbb  E[X_i]=\frac{1}{2}\cdot 1+\frac{1}{3}\cdot 0-\frac{1}{6}=\frac{1}{3}$$
So $$ \Bbb E[X]=\Bbb E[X_1+\dots +X_60]=\Bbb E[X_1]+\dots + \Bbb E[X_60]=60\cdot \frac{1}{3}=20$$

Problem 12: $25$ independent, fair coins are tossed in a row. What is the expected number of consecutive HH pairs?

Solution: So consider the consecutive pairs. Let $C_i$ denote the $i$th coin in the row.. Then we consider the pairs $$P_1=[C_1,C_2], P_2=[C_2,C_3],\dots, P_{24}=[C_{24},C_{25}].$$
Now, let $$X_i= 1 \text{ if P_i HH}, 0 \text{ else }$$
Note that $$\Bbb E[X_i]=\frac{1}{4}.$$  

Hence, even though they are dependent, by linearity of expectation,
 $$\Bbb  E[\text{ no of consecutive pair} ] =\Bbb E[X_1]+\dots +\Bbb E[X_{24}]=24\cdot \frac{1}{4}=6$$

Problem 13: Suppose that $A$ and $B$ each randomly, and independently,
choose $3$ of $10$ objects. Find the expected number of objects chosen by both $A$ and $B.$

Solution: Let $X$ be the number of objects chosen by both A and B. Then let $$X_i= 1\text{ if A and B both select i}, 0 \text{ else }.$$ 
So $$\Bbb E[X_i]=\Bbb P[ \text{ A and B select i}]=\Bbb P[ \text{A selects i }] \times \Bbb P[\text{ B selects i }]=\frac{9}{100}$$ Alternatively, we have $$\Bbb E[X_i]=\frac{\binom{9}{2}^2}{\binom{10}{3}^2}$$
So $$\Bbb E[X]=\Bbb E[X_1]+\dots \Bbb E[X_{10}]=10\cdot \Bbb E[X_i]= 10\cdot \frac{9}{100}.$$

Problem 14: At a nursery, $2006$ babies sit in a circle. Suddenly, each baby randomly pokes either the baby to its left or to its right. What is the expected value of the number of unpoked babies?

Solution: Let the babies be $B_1, B_2, \dots B_{2006}.$  
Note that any pair $$\Bbb E[X_i]= \frac{1}{4}$$  ( defining $1$ when unpoked)
And then we do linearity of Expectation. 
$$\Bbb E[x]= \Bbb E[X_1+\dots +X_{2006}]=\Bbb E[X_1]+\Bbb E[X_2]+\dots+ \Bbb E[X_{2006}]= 2006\cdot \frac{1}{4}$$

It's the famous paradox game. :P

Problem 15: You are playing a game in which prize pool starts at $1.$ On every turn, you flip a fair coin. If you flip head, then the prize pool doubles. If tails, the game ends.

Solution:  Note that $$P(T)=\frac{1}{2}, P(HT)=\frac{1}{4}, P(HHT)=\frac{1}{8},\dots $$
$$ \Bbb E(X) = \frac{1}{2}\cdot 1 + \frac{1}{4} \cdot 2 + \frac{1}{8}4  + \frac{1}{16}8 + \cdots  = 0.5 + 0.5 + 0.5 + 0.5 + \cdots = \infty $$ A paradox. Cause expected value cant be infinite :P

Problem 16: Two random, not necessarily distinct, permutations of the digits $2017$ are selected and added together. What is the expected value of this sum?

Solution:  Thanks to Pranav for the write up.
Let the permutations be $P_1,\dots, P_{24}.$ And the sums be $S_1,S_2,\dots,S_{288}.$
 Total number of permutations of $2017 = 4!$. Total number of distinct sums $= \frac{1}{2} \cdot (24)^2 = 288$. 
Let $s$ be a random variable representing sum of two permutations of $2017$ taken at random. Then, $$\Bbb{E}[s] = \sum s \cdot \Bbb{P}(s) = \sum s \cdot \frac{1}{288} = \frac{1}{288} \cdot \sum s$$. Now, we have to calculate $\sum s$. Clearly, $$s = 3! \cdot (2000 + 1000 + 7000) + 3! \cdot (200 + 100 + 700) + 3! \cdot (20 + 10 + 70) + 3! \cdot (2 + 1 + 7)$$ $$\implies s = 6 \cdot 11110 = 66660$$ $$\implies \Bbb{E}[s] = \frac{66660}{288} = 231.458\overline{3}$$

The following proof is from the calt handout! The handout is very nice!!!!

Theorem: If the probability of a variable $x$ occurring is $p,$ then the expected number of times we must repeat the event so that we get $x$ is $\frac{1}{p}$.

Proof:  Let $X$ be the number of times we would have to repeat to get $x.$

So $$\Bbb E[X]= 1\cdot \Bbb P[\text{ x occurring in 1st turn}] + 2\cdot \Bbb P[\text{ x occurring in 2nd turn}]+\dots $$ 
$$ p+2\cdot (p-1)p+3 \cdot (p-1)^2\cdot p+\dots = p( 1+ 2(p-1)+ 3 (p-1)^2+ \dots )$$
multiplying by $(1-p)$ and subtracting,
$$ \implies p\cdot  \Bbb E[X]= p(1 +( 1-p)+ (1-p)^2+\dots ) = p \frac {1}{p}$$ 
$$ \implies \Bbb E[X]= \frac{1}{p}$$


Yes!! I worked very hard on this post tbh! I think a sequel to the blogpost will come containing harder problems and the state's expected value problems. 

I hope you guys liked it! Tomorrow, I will be posting 2 blog posts, one on GT and the other on recursion! 

Sunaina 💜

Labels:

Comments

Post a Comment

Popular posts from this blog

My experiences at EGMO, IMOTC and PROMYS experience

Yes, I know. This post should have been posted like 2 months ago. Okay okay, sorry. But yeah, I was just waiting for everything to be over and I was lazy. ( sorry ) You know, the transitioning period from high school to college is very weird. I will join CMI( Chennai Mathematical  Institue) for bsc maths and cs degree. And I am very scared. Like very very scared. No, not about making new friends and all. I don't care about that part because I know a decent amount of CMI people already.  What I am scared of is whether I will be able to handle the coursework and get good grades T_T Anyways, here's my EGMO PDC, EGMO, IMOTC and PROMYS experience. Yes, a lot of stuff. My EGMO experience is a lot and I wrote a lot of details, IMOTC and PROMYS is just a few paras. Oh to those, who don't know me or are reading for the first time. I am Sunaina Pati. I was IND2 at EGMO 2023 which was held in Slovenia. I was also invited to the IMOTC or International Mathematical Olympiad Training Cam...
11 comments
Read more

How to prepare for RMO?

"Let's wait for this exam to get over".. *Proceeds to wait for 2 whole fricking years!  I always wanted to write a book recommendation list, because I have been asked so many times! But then I was always like "Let's wait for this exam to get over" and so on. Why? You see it's pretty embarrassing to write a "How to prepare for RMO/INMO" post and then proceed to "fail" i.e not qualifying.  Okay okay, you might be thinking, "Sunaina you qualified like in 10th grade itself, you will obviously qualify in 11th and 12th grade." No. It's not that easy. Plus you are talking to a very underconfident girl. I have always underestimated myself. And I think that's the worst thing one can do itself. Am I confident about myself now? Definitely not but I am learning not to self-depreciate myself little by little. Okay, I shall write more about it in the next post describing my experience in 3 different camps and 1 program.  So, I got...
7 comments
Read more

Problems with meeting people!

Yeah, I did some problems and here are a few of them! I hope you guys try them! Putnam, 2018 B3 Find all positive integers $n < 10^{100}$ for which simultaneously $n$ divides $2^n$, $n-1$ divides $2^n - 1$, and $n-2$ divides $2^n - 2$. Proof We have $$n|2^n\implies n=2^a\implies 2^a-1|2^n-1\implies a|n\implies a=2^b$$ $$\implies 2^{2^b}-2|2^{2^a}-2\implies 2^b-1|2^a-1\implies b|a\implies b=2^c.$$ Then simply bounding. USAMO 1987 Determine all solutions in non-zero integers $a$ and $b$ of the equation $$(a^2+b)(a+b^2) = (a-b)^3.$$ Proof We get $$ 2b^2+(a^2-3a)b+(a+3a^2)=0\implies b = \frac{3a-a^2\pm\sqrt{a^4-6a^3-15a^2-8a}}{4}$$ $$\implies a^4-6a^3-15a^2-8a=a(a-8)(a+1)^2\text{ a perfect square}$$ $$\implies a(a-8)=k^2\implies a^2-8a-k^2=0\implies \implies a=\frac{8\pm\sqrt{64+4k^2}}{2}=4\pm\sqrt{16+k^2}. $$ $$ 16+k^2=m^2\implies (m-k)(m+k)=16.$$ Now just bash. USAMO 1988 Suppose that the set $\{1,2,\cdots, 1998\}$ has been partitioned into disjoint pairs $\{a_i,b_i\}$ ($1...
3 comments
Read more

IMO Shortlist 2021 C1

 I am planning to do at least one ISL every day so that I do not lose my Olympiad touch (and also they are fun to think about!). Today, I tried the 2021 IMO shortlist C1.  (2021 ISL C1) Let $S$ be an infinite set of positive integers, such that there exist four pairwise distinct $a,b,c,d \in S$ with $\gcd(a,b) \neq \gcd(c,d)$. Prove that there exist three pairwise distinct $x,y,z \in S$ such that $\gcd(x,y)=\gcd(y,z) \neq \gcd(z,x)$. Suppose not. Then any $3$ elements $x,y,z\in S$ will be $(x,y)=(y,z)=(x,z)$ or $(x,y)\ne (y,z)\ne (x,z)$. There exists an infinite set $T$ such that $\forall x,y\in T,(x,y)=d,$ where $d$ is constant. Fix a random element $a$. Note that $(x,a)|a$. So $(x,a)\le a$.Since there are infinite elements and finite many possibilities for the gcd (atmost $a$). So $\exists$ set $T$ which is infinite such that $\forall b_1,b_2\in T$ $$(a,b_1)=(a,b_2)=d.$$ Note that if $(b_1,b_2)\ne d$ then we get a contradiction as we get a set satisfying the proble...
1 comment
Read more

How to prepare for INMO

Since INMO is coming up, it would be nice to write a post about it! A lot of people have been asking me for tips. To people who are visiting this site for the first time, hi! I am Sunaina Pati, an undergrad student at Chennai Mathematical Institute. I was an INMO awardee in 2021,2022,2023. I am also very grateful to be part of the India EGMO 2023 delegation. Thanks to them I got a silver medal!  I think the title of the post might be clickbait for some. What I want to convey is how I would have prepared for INMO if I were to give it again. Anyway, so here are a few tips for people! Practice, practice, practice!! I can not emphasize how important this is. This is the only way you can realise which areas ( that is combinatorics, geometry, number theory, algebra) are your strength and where you need to work on. Try the problems as much as you want, and make sure you use all the ideas you can possibly think of before looking at a hint. So rather than fixing time as a measure to dec...
9 comments
Read more

Birthday Functional Equations problems

Heyoo!!! Birthday FEs!!!!!! $11$ FEs!! Also I would be posting solutions to RG's FE handout, I am done with 10 prs :P!! Problem: Find all functions $f :\Bbb R \rightarrow \Bbb R$ such that $$2f (x) - 5f (y) = 8, \forall x, y \in \Bbb R$$ Solution: $$2f(x)-5f(y)=8$$ $$\implies 2f(x)-5f(x)=8$$ $$\implies f(x)=\frac{-8}{3}, \text{ a constant function }$$ We did this in Rohan Bhaiya's FE class..Oh btw the EGMO camp is sooo niceee! I am loving it!! It's such a big deal to be able to train and attend the camp with EGMO team members! Problem: Find all functions $f :\Bbb R \rightarrow \Bbb R$ such that $$f (x) + xf (1 -x) = x, \forall x\in \Bbb R.$$ Solution: $$f(x)+xf(1-x)=x$$ $$f(1-x)+(1-x)f(x)=1-x$$ This is actually in the linear equations in two variable form! $$x+ay=a$$ $$y+bx=b$$ Anyways,  $$f(x)+xf(1-x)=x$$ $$xf(1-x)+f(x)(1-x)x=(1-x)x$$ $$ \implies f(x)(x-x^2)-f(x)=-x^2\implies f(x)=\frac{-x^2}{x-x^2-1}=\frac{x^2}{x^2-x+1}$$ But verifying, this doesn't work. Problem: ...
7 comments
Read more

Orders and Primitive roots

 Theory  We know what Fermat's little theorem states. If $p$ is a prime number, then for any integer $a$, the number $a^p − a$ is an integer multiple of $p$. In the notation of modular arithmetic, this is expressed as \[a^{p}\equiv a{\pmod {p}}.\] So, essentially, for every $(a,m)=1$, ${a}^{\phi (m)}\equiv 1 \pmod {m}$. But $\phi (m)$ isn't necessarily the smallest exponent. For example, we know $4^{12}\equiv 1\mod 13$ but so is $4^6$. So, we care about the "smallest" exponent $d$ such that $a^d\equiv 1\mod m$ given $(a,m)=1$.  Orders Given a prime $p$, the order of an integer $a$ modulo $p$, $p\nmid a$, is the smallest positive integer $d$, such that $a^d \equiv 1 \pmod p$. This is denoted $\text{ord}_p(a) = d$. If $p$ is a primes and $p\nmid a$, let $d$ be order of $a$ mod $p$. Then $a^n\equiv 1\pmod p\implies d|n$. Let $n=pd+r, r\ll d$. Which implies $a^r\equiv 1\pmod p.$ But $d$ is the smallest natural number. So $r=0$. So $d|n$. Show that $n$ divid...
7 comments
Read more

Some NMTC sub-junior level Problems

Well.. Many people don't know but I was a part of STEM's Horizon ( Now, I have left them due to boards etc.) BTW STEM's Horizons is really great! And anyone interested in Olympiad math should join it! More info about it in below (make sure to check it out!). So here are some problems I sent to them. They are fairly easy, and most of them are repetitive ideas. But they are my first sets of problems ( I know UMO was there but still..) The solutions will be posted in another blog posts. You guys can type out sols in the comments sections too :) Problems:- 1. What is maximum possible number dividing  $x^2+x+1$ and $x^5 +x^4 +x^3 + 3x^2 +2 x +4$ for all $x\in \Bbb{N}$ 2. Let $P$ be the sum of all $x$ and $y$ satisfying $45^x-2^x=2021^y.$ What is the last two digits of $p^2+p+1.$ 3. What is the greatest value of $r$ such that $3^r$ is factor of $10^{2022}-8^{674}$. 4. Find all possible tuples $ (x,y,l)$ such that $\frac{x}{100}=\frac{20}{y}=\frac{5}{l}.$ 5. Consider the following...
13 comments
Read more

Problems done in August

  Welcome back! So today I will be sharing a few problems which I did last week and some ISLs. Easy ones I guess. Happy September 2021!  Problem[APMO 2018 P1]: Let $ABC$ be a triangle with orthocenter $H$ and let $M$ and $N$ denote the midpoints of ${AB}$ and ${AC}$. Assume $H$ lies inside quadrilateral $BMNC$, and the circumcircles of $\triangle BMH$ and $\triangle CNH$ are tangent. The line through $H$ parallel to ${BC}$ intersects $(BMH)$ and $(CNH)$ again at $K$, $L$ respectively. Let $F = {MK} \cap {NL}$, and let $J$ denote the incenter of $\triangle MHN$. Prove that $FJ = FA$. Proof:  By angle chase, we get $\angle FKL=\angle FLK.$    Hence $KL||MN\implies FM=FN.$   And we get $\angle MFN=2A\implies F$ is circumcentre if $(AMN)\implies FA=FM=FN.$   And we get $\angle MHN=180-2A$    Hence $MFHN$ is cyclic.    By fact 5, $ME=FJ=FN\implies FJ=FA.$ Problem[Shortlist 2007 G3]: Let $ABCD$ be a trapezoid whose diagonals meet at $P$....
17 comments
Read more

Just spam combo problems cause why not

This post is mainly for Rohan Bhaiya. He gave me/EGMO contestants a lot and lots of problems. Here are solutions to a very few of them.  To Rohan Bhaiya: I just wrote the sketch/proofs here cause why not :P. I did a few more extra problems so yeah.  I sort of sorted the problems into different sub-areas, but it's just better to try all of them! I did try some more combo problems outside this but I tried them in my tablet and worked there itself. So latexing was tough. Algorithms  "Just find the algorithm" they said and they died.  References:  Algorithms Pset by Abhay Bestrapalli Algorithms by Cody Johnson Problem1: Suppose the positive integer $n$ is odd. First Al writes the numbers $1, 2,\dots, 2n$ on the blackboard. Then he picks any two numbers $a, b$ erases them, and writes, instead, $|a - b|$. Prove that an odd number will remain at the end.  Proof: Well, we go $\mod 2$. Note that $$|a-b|\equiv a+b\mod 2\implies \text{ the final number is }1+2+\dots ...
2 comments
Read more