Skip to main content

Probability is Global + Are (a,b) and [a,b] the same length?

 Hey everyone! Welcome back to my blog! 


The number of diagonals are $\binom {12}{2}-30=36$

Today we have another topic which I am very scared of, PROBABILITY! I think to overcome this fear, I should start from basics. So, I refer AOPS's introduction to counting and probability. I did till chapter seven and thought to do the rest problems in this blog as notes.

The book's pirated copy is available in zlib btw ( I don't think so I should have said this, but I think it's fine). I did the harder problems and wrote the solutions in Xournal. If you want to see them, here is the pdf.

Also both the pdf and following post has amc/ioqm type problems! So enjoy!!

Problem 1: $n$ coins are flipped simultaneously flipped. The probability that at most one of them shows tails is $\frac{3}{16}.$ Find $n.$

Solution: We have $$\frac{n+1}{2^n}=\frac{3}{16}\implies 16(n+1)=3\cdot 2^n \implies n\ge 4. $$  But the RHS grows very fast, so $n=5$ is the only solution.

Intersection of indepent events: 
If $A$ and $B$ are possible outcomes for two independent events, then $P(A \text{ and } B)=P(A)\times P(B)$

Problem 2: The Grunters and the Screamers are playing for the Grand Championship, which is a best of $7$ series. The first team to win $4$ games wins the Championship. Each team has a $\frac{3}{4}$ probability of winning any individual game. If the Grand Championship series lasts exactly $6$ games, what is the probability that the Grunters win?

Solution: Note that if game lasted till $6$ game then last game was won by $G$ and so there are $\binom{5}{3}=10$ such winning games.

The probability of Grunters winning in $6$ games is
$$P(\text{ Grunters win in $6$ games })= P(GGSGSG)+P(GSSGGG)+\dots $$( since they are mutually exclusive, we can add).

Now, $$P(GGSGSG)= P(G)\times P(G)\times P(S)\times P(G)\times P(S)\times P(G)$$
$$ = P(G)^4\times P(S)^2=\frac{3}{4}^4\times \frac{1}{4}^2= \frac{3^4}{4^6}.$$ ( As they are independent events).

And for any winning game, we have probability $\frac{3^4}{4^6}.$

So, $$P(\text{ Grunters win in $6$ games })= P(GGSGSG)+P(GSSGGG)+\dots $$
$$= \binom{5}{3}\times \frac{3^4}{4^6}= \frac{405}{2048}$$

Problem 3: The probability of getting rain on any given day in June in Capital City is $\frac{1}{10}$. What is the probability that it rains on at most $2$ days in June? 

Solution: Note that $P( \text{ rains on almost 2 days in June}) = P( \text{rains on 0 day })+ P( \text{rains on 1 day })+ P( \text{rains on 2 days })$$ 

$$= \frac{9}{10}^{30}+\frac{9}{10}^{29}\cdot \frac{1}{10}+\frac{9}{10}^{28}\cdot \frac{1}{10}^2=\frac{9^{30}+9^{29}+9^{28}}{10^{30}}$$

Probability with Dependant Events:

Problem 4: A bag has $4$ red and $6$ blue marbles. A marble is selected and not replaced, then a second is selected. What is the probability that both are the same colour?

Solution: $$P( \text{ both red })+P( \text{ both blue})=\frac{4}{10}\times \frac{3}{9} +\frac{6}{10}\times \frac{5}{9}$$

Problem 5: Sheila has been invited to a picnic tomorrow. The picnic will occur, rain or shine. If it rains, there is a $20%$  probability that Sheila will decide to go, but if it is sunny, there is an $80%$ probability that Sheila will decide to go. The forecast for tomorrow states that there is a $40%$ chance of rain. What is the probability that Sheila will attend the picnic?

Solution: The required probability is $$ P(\text{ it rains and she goes })+P(\text{ it doesn't rain and she goes })$$ 
$$ =\frac{40}{100}\cdot \frac{20}{100}+\frac{60}{100}\cdot \frac{80}{100}= \frac{56}{100}.$$

The shooting stars: ( it is a series of two problems)

Problem 6: On any given night, Becky has a 60% chance of seeing a shooting star in any given hour. If Becky watches the sky for two hours, what is the probability that becky sees a shooting star?

Solution: Note that $$P(\text{ Becky sees a shooting star })=1- P(\text{ Becky doesn't see a shooting star })$$ 
$$ 1-\frac{40}{100}\cdot \frac{40}{100}=1-\frac{16}{100}= \frac{84}{100}$$

Problem 7: On Saturday night, Becky again goes stargazing. This time, conditions are better and there's $80%$ chance that she will see a shooting star in any given hour. We assume that the probability of seeing a shooting star is uniform for the entire hour. What is the probability that becky will see a shooting star in the first $15$ minutes?

Solution: Let $p$ be the probability of seeing a shooting star in $15$ minutes. Since it's uniform, we get $p$ as the probability of seeing a shooting star in 2nd $15$ minute, and so on.
So $$P(\text{ no shooting star seen in 1 hr })=$$ 

$$ P(\text{ no shooting star is 1st 15 mins })\times P(\text{ no shooting star is 2nd 15 mins })$$ $$\times P(\text{ no shooting star is 3rd 15 mins })\times P(\text{ no shooting star is 4th 15 mins }) $$
$$ \implies \frac{20}{100}=(1-p)^4\implies p=1-\frac 15^{1/4}$$

Problem 8: The numbers $1$ through $8$ are arranged to form an eight digit number which is a multiple of $5.$ What is the probability that it is greater than $60,000,000$?

Solution: Our last digit is always $5.$ So the possible numbers which can be in first digit is $1,2,3,4,6,7,8.$ For the number to be greater than $60,000,000$ we want first digit to be $6,7,8.$

So the probability is $\frac{3}{7}.$

Problem 9: What is the probability that a random rearrangement of the letters in the word "Mathematics" will begin with the letter "Math" ?

Solution:  Total possibilities = $\frac{11!}{2!2!2!}$
Number of letter's with 'MATH' = $7!$

$$P=\frac{8}{11\times10\times 9\times 8}=\frac{1}{990}$$

Another way is, prob of M getting choose as first letter is $\frac{2}{11},$ A as second letter is $\frac{2}{10}$ and so on.

Problem 10: A $2005 \times 2005$ square consists of $(2005)^2$ unit squares. The middle square of each row is shaded. If a rectangle (of any size) is chosen at random, what is the probability that the rectangle includes a shaded square?

Solution: We do complimentary counting, first. So $$P( \text{ rectangle including a shaded square })$$
$$= 1- P(\text{ rectangle not including a shaded square })= 1- \frac{\text{ number of rectangles not including square}}{\binom{2006}{2}^2}$$
$$ = 1 - 2\frac{\binom{1003}{2}\cdot \binom{2006}{2}}{ \binom{2006}{2}^2}$$
$$ = 1- \frac{1002}{2005}=\frac{1003}{2005}$$

Geometric Probability: 

$$P(\text{ Whatever that freaking ugly problem wants })=\frac{\text{ dimension of good region }}{\text{ dimension of possible region }}$$

Problem 11: $AC$ has length $5,$ and $AB$ has length $4.$ A point $P$ is selected randomly on the segment $AC.$ What is the probability that $P$ is closer to $B$ than to $A$?

Solution: Introduce the midpoint $M$ of $AB.$ Then when $P$ is between $A$ and $M$ it is closer to $A$ than $P$ else it's closer to $B.$ So $$P= \frac{MB+BC}{AC}=\frac{3}{5}.$$

Problem 12: A real number $x$ is selected randomly such that $0\le x\le 3.$ What is the probability that $|x-1|\le \frac{1}{2}?$

Solution:  Possible range for $x$ is $[0.5,1.5],$ which has range length 1. So $$P(|x-1|\le \frac{1}{2}) = \frac{1}{3}.$$

Problem 13: A real number $x$ is chosen at random such that $0<x<100.$ What is the probability that $[\sqrt{x}]$ is even?

Solution: Since $[\sqrt{x}]$ is even, So $$x \in \{ (0,1), [4,9), [16,25), [36, 49), [ 64, 81)\}$$ 

So $$ \text{possible length is }= 1+5+ 9+13+17 =45$$

So the probability is $\frac{45}{100}.$


Okay wait... what!!!!!!! Doing the above two questions, I was like, wait. Is the length of $$(a,b),[a,b),(a,b], [a,b]$$ same? 

And turns out it is! Actually, by definition, the length of the interval is $b-a.$ Read more here!

Problem 14: Let $CD$ be a line segment of length $6.$ A point $P$ is chosen at $CD.$ What is the probability that the distance from $P$ to $C$ is smaller than the square of the distance from $P$ to $D$?

Solution: Let the distance between $CP$ be $d\implies d\le (6-d)^2\implies d\le 4. $
So $$P= \boxed{\frac{4}{6}}.$$

Problem 15: Suppose two number $x$ and $y$ are each chosen such that $0<x<1$ and $0<y<1.$ What is the probability that $x+y>\frac{3}{2}?$

Solution: Note that both $x,y $ are greater than $1/2.$  So the probability is $1/2.$

I think the following problem is just so black magic. Not my sol, but I found it so amazing :O

Problem 16: My friend and I are hoping to meet for lunch. We will each arrive at our favourite restaurant at a random time between noon and 1 pm, stay for 15 mins, then leave. What is the probability that we will meet each other while at the restaurant?

Solution: We make a graph, and black magic happens.

Problem 17: A point $P$ is randomly chosen in the interior of the right triangle $ABC.$ What is the probability $[PBC]\le \frac 12 [ABC]?$

Solution: $[ABC]=\frac 12 AC\times BC.$ And so the distance between $P$ and $BC$ must be $\le AC/2.$ 

So the probability is $\boxed{ \frac 34}.$

Then we have a well know problem :P which was in 3b1b :P

Problem 18: Three points are selected randomly on the circumference of a circle. What is the probability that the triangle formed by these three points contains the centre of the circle?




Anyways, that's it for today's probability! We actually have an integer poly lecture, so I will go and revise that! See ya! Oh and I hope, if I am not tired, then I will post GT notes!

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

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

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

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

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