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

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

Geometry ( Finally!!!)

 This is just such an unfair blog.  Like if one goes through this blog, one can notice how dominated  Algebra is!! Like 6 out of 9 blog post is Algebra dominated -_- Where as I am not a fan of Algebra, compared to other genres of Olympiad Math(as of now). And this was just injustice for Synthetic Geo. So this time , go geo!!!!!!!!!!!  These problems are randomly from A Beautiful Journey through Olympiad Geometry.  Also perhaps I will post geo after March, because I am studying combi.  Problem:  Let $ABC$ be an acute triangle where $\angle BAC = 60^{\circ}$. Prove that if the Euler’s line of $\triangle ABC$ intersects $AB$ and $AC$ at $D$ and $E$, respectively, then $\triangle ADE$ is equilateral. Solution:  Since $\angle A=60^{\circ}$ , we get $AH=2R\cos A=R=AO$. So $\angle EHA=\angle DOA.$ Also it's well known that $H$ and $O $ isogonal conjugates.$\angle OAD =\angle EAH.$ By $ASA$ congruence, we get $AE=AD.$ Hence $\triangle ADE$ is equilateral....
3 comments
Read more

IMO 2023 P2

IMO 2023 P2 Well, IMO 2023 Day 1 problems are out and I thought of trying the geometry problem which was P2.  Problem: Let $ABC$ be an acute-angled triangle with $AB < AC$. Let $\Omega$ be the circumcircle of $ABC$. Let $S$ be the midpoint of the arc $CB$ of $\Omega$ containing $A$. The perpendicular from $A$ to $BC$ meets $BS$ at $D$ and meets $\Omega$ again at $E \neq A$. The line through $D$ parallel to $BC$ meets line $BE$ at $L$. Denote the circumcircle of triangle $BDL$ by $\omega$. Let $\omega$ meet $\Omega$ again at $P \neq B$. Prove that the line tangent to $\omega$ at $P$ meets line $BS$ on the internal angle bisector of $\angle BAC$. Well, here's my proof, but I would rather call this my rough work tbh. There are comments in the end! Proof Define $A'$ as the antipode of $A$. And redefine $P=A'D\cap (ABC)$. Define $L=SP\cap (PDB)$.  Claim1: $L-B-E$ collinear Proof: Note that $$\angle SCA=\angle SCB-\angle ACB=90-A/2-C.$$ So $$\angle SPA=90-A/2-C\implies \ang...
1 comment
Read more

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

Problems I did this week [Jan8-Jan14]

Yeyy!! I am being so consistent with my posts~~ Here are a few problems I did the past week and yeah INMO going to happen soon :) All the best to everyone who is writing!  I wont be trying any new problems and will simply revise stuffs :) Some problems here are hard. Try them yourself and yeah~~Solutions (with sources) are given at the end! Problems discussed in the blog post Problem1: Let $ABC$ be a triangle whose incircle $\omega$ touches sides $BC, CA, AB$ at $D,E,F$ respectively. Let $H$ be the orthocenter of $DEF$ and let altitude $DH$ intersect $\omega$ again at $P$ and $EF$ intersect $BC$ at $L$. Let the circumcircle of $BPC$ intersect $\omega$ again at $X$. Prove that points $L,D,H,X$ are concyclic. Problem 2: Let $ ABCD$ be a convex quadrangle, $ P$ the intersection of lines $ AB$ and $ CD$, $ Q$ the intersection of lines $ AD$ and $ BC$ and $ O$ the intersection of diagonals $ AC$ and $ BD$. Show that if $ \angle POQ= 90^\circ$ then $ PO$ is the bisector of $ \angle AOD$ ...
Post a Comment
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

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

Solving Random ISLs And Sharygin Solutions! And INMO happened!!

Some of the ISLs I did before INMO :P  [2005 G3]:  Let $ABCD$ be a parallelogram. A variable line $g$ through the vertex $A$ intersects the rays $BC$ and $DC$ at the points $X$ and $Y$, respectively. Let $K$ and $L$ be the $A$-excenters of the triangles $ABX$ and $ADY$. Show that the angle $\measuredangle KCL$ is independent of the line $g$ Solution: Note that $$\Delta LDK \sim \Delta XBK$$ and $$\Delta ADY\sim \Delta XCY.$$ So we have $$\frac{BK}{DY}=\frac{XK}{LY}$$ and $$\frac{DY}{CY}=\frac{AD}{XC}=\frac{AY}{XY}.$$ Hence $$\frac{BK}{CY}=\frac{AD}{XC}\times \frac{XK}{LY}\implies \frac{BK}{BC}=\frac{CY}{XC}\times \frac{XK}{LY}=\frac{AB}{BC}\times \frac{XK}{LY} $$ $$\frac{AB}{LY}\times \frac{XK}{BK}=\frac{AB}{LY}\times \frac{LY}{DY}=\frac{AB}{DL}$$ $$\implies \Delta CBK\sim \Delta LDK$$ And we are done. We get that $$\angle KCL=360-(\angle ACB+\angle DKC+\angle BCK)=\angle DAB/2 +180-\angle DAB=180-\angle DAB/2$$ Motivation: I took a hint on this. I had other angles but I did...
4 comments
Read more

Number Theory Revise part 1

I thought to revise David Burton and try out some problems which I didn't do. It's been almost 2 years since I touched that book so let's see! Also, this set of problems/notes is quite weird since it's actually a memory lane. You will get to know on your own! I started with proving a problem, remembered another problem and then another and so on! It was quite fun cause all these questions were the ones I really wanted to solve! And this is part1 or else the post would be too long. Problem1: Prove that for $n\ge 1$  $$\binom{n}{r}<\binom{n}{r+1}$$ iff $0\le r\le \frac{n-1}{2}$ Proof: We show that $\binom{n}{r}<\binom{n}{r+1}$ for $0\le r\le \frac{n-1}{2}$ and use the fact that $$\binom{n}{n-r}=\binom{n}{r}$$ Note that $\binom{n}{r}= \frac{n!}{r!(n-r)!}, \binom{n}{r+1}=\frac{n!}{(r+1)!(n-r-1)!}$  Comparing, it's enough to show that $$\frac{1}{n-r}<\frac{1}{r+1}\text{ or show } n-r>r+1$$ which is true as $0\le r\le \frac{n-1}{2}$ Problem2: Show that the exp...
8 comments
Read more

Challenging myself? [Jan 15-Jan 27]

Ehh INMO was trash. I think I will get 17/0/0/0-1/3-5/10-14, which is def not good enough for qualifying from 12th grade. Well, I really feel sad but let's not talk about it and focus on EGMO rather.  INMO 2023 P1 Let $S$ be a finite set of positive integers. Assume that there are precisely 2023 ordered pairs $(x,y)$ in $S\times S$ so that the product $xy$ is a perfect square. Prove that one can find at least four distinct elements in $S$ so that none of their pairwise products is a perfect square. I will use Atul's sol, cause it's the exact same as mine.  Proof: Consider the graph $G$ induced by the elements of $S$ and edges being if the products are perfect squares. Note that if $xy = a^2$ and $xz = b^2$, then $yz = \left( \frac{ab}{x} \right)^2$, since its an integer and square of a rational number its a perfect square and so $yz$ is an edge too. So the graph is a bunch of disjoint cliques, say with sizes $c_1, c_2, \cdots, c_k$. Then $\sum_{i=1}^k c_i^2 = 2023$, which ...
Post a Comment
Read more