<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"><channel><title>Jasmer Singh Sanjotra</title><description>Blog posts and worked probability puzzle solutions.</description><link>https://thealphajas.github.io/</link><language>en</language><item><title>Party Groups (probability)</title><link>https://thealphajas.github.io/fun/probability/party-groups/</link><guid isPermaLink="true">https://thealphajas.github.io/fun/probability/party-groups/</guid><description>There are 50 guests at a party and they are making groups for a game. To do this they each write their name on a piece of paper and put it into a hat. One by one, each guest picks a name from the hat. Each guest will be a part of a group with the guest they pulled the name out of from the hat. If…</description><pubDate>Sun, 27 Sep 2026 19:33:45 GMT</pubDate><category>Probability</category><category>Expectation</category><category>Recursion</category><category>Random Permutations</category><category>Harmonic Numbers</category></item><item><title>Take and Roll II (probability)</title><link>https://thealphajas.github.io/fun/probability/take-and-roll-ii/</link><guid isPermaLink="true">https://thealphajas.github.io/fun/probability/take-and-roll-ii/</guid><description>You are given a fair 20-sided die and 100 actions in a game. The die starts with upface 1. The two options you can perform are to roll and to take. Performing a roll re-rolls the current upface of the die. Performing a take allows you to cash out the current upface of the die. Note that the game…</description><pubDate>Sun, 27 Sep 2026 19:05:25 GMT</pubDate><category>Probability</category><category>Expectation</category><category>Markov Chains</category><category>Geometric Distribution</category><category>Optimization</category></item><item><title>Decreasing Uniform Chain (probability)</title><link>https://thealphajas.github.io/fun/probability/decreasing-uniform-chain/</link><guid isPermaLink="true">https://thealphajas.github.io/fun/probability/decreasing-uniform-chain/</guid><description>Let X1, X2, … ~ Unif(0,1) IID. Let N be the first index n where Xn ≠ min {X1,…,Xn}. Find E[X_(N-1)], i.e. the smallest value among the first N-1 values selected. The answer will be in the form a + be for integers a and b, where e is Euler&apos;s constant. Find a+b.</description><pubDate>Fri, 25 Sep 2026 09:55:03 GMT</pubDate><category>Probability</category><category>Order Statistics</category><category>Record Values</category><category>Expectation</category></item><item><title>Power Grid (probability)</title><link>https://thealphajas.github.io/fun/probability/power-grid/</link><guid isPermaLink="true">https://thealphajas.github.io/fun/probability/power-grid/</guid><description>A 3 × 3 grid of light bulbs is formed. Then, each light bulb is powered on with probability 1/2. Find the probability that no two adjacent (grid cells that share a common side) light bulbs are powered on.</description><pubDate>Fri, 25 Sep 2026 09:55:03 GMT</pubDate><category>Probability</category><category>Dynamic Programming</category><category>Combinatorics</category><category>Transfer Matrix Method</category></item><item><title>Dice-Coin Paradigm (probability)</title><link>https://thealphajas.github.io/fun/probability/dice-coin-paradigm/</link><guid isPermaLink="true">https://thealphajas.github.io/fun/probability/dice-coin-paradigm/</guid><description>We flip a fair coin until we obtain our first tails. Given the first tails occurs on the nth flip, we roll a fair 6-sided die n times. Find the probability that the die value 1 is observed in the rolls.</description><pubDate>Mon, 14 Sep 2026 15:30:39 GMT</pubDate><category>Probability</category><category>Conditional Probability</category><category>Geometric Series</category><category>Infinite Series</category></item><item><title>Local Maxima (probability)</title><link>https://thealphajas.github.io/fun/probability/local-maxima/</link><guid isPermaLink="true">https://thealphajas.github.io/fun/probability/local-maxima/</guid><description>14 pieces of paper labelled 1–14 are placed in a line at random. We spot i is a local maxima if the paper at the ith position is strictly larger than all of its adjacent papers. Find the expected number of local maxima in the sequence. For example, with 6 numbers, 513246 has 3 local maxima, at the…</description><pubDate>Mon, 14 Sep 2026 15:30:39 GMT</pubDate><category>Probability</category><category>Linearity of Expectation</category><category>Symmetry</category><category>Recursion</category></item><item><title>Overlapping Subsets (probability)</title><link>https://thealphajas.github.io/fun/probability/overlapping-subsets/</link><guid isPermaLink="true">https://thealphajas.github.io/fun/probability/overlapping-subsets/</guid><description>Consider the set Ω = {1, 2, …, 20}. Two subsets A and B of Ω are uniformly at random selected from the power set of Ω, independently. It is possible that A = B. Define N = |A ∩ B|. Compute Var(N)/E[N].</description><pubDate>Mon, 14 Sep 2026 15:30:39 GMT</pubDate><category>Probability</category><category>Binomial Distribution</category><category>Generating Functions</category><category>Variance</category></item><item><title>Contracts and Pricing III (probability)</title><link>https://thealphajas.github.io/fun/probability/contracts-and-pricing-iii/</link><guid isPermaLink="true">https://thealphajas.github.io/fun/probability/contracts-and-pricing-iii/</guid><description>After being caught in an embarrassing high-profile data fabrication scandal, Calambya University decides to stop sharing data with the national college ranking organization, effective in 2023. Rival school Mahogany University is overjoyed and offers each student a tuition refund worth X thousand…</description><pubDate>Fri, 11 Sep 2026 10:56:20 GMT</pubDate><category>Probability</category><category>Expectation</category><category>Exponential Distribution</category><category>Options Pricing</category></item><item><title>Monotonic Search with Non-Uniform Priors?</title><link>https://thealphajas.github.io/fun/blogs/monotonic-search-with-non-uniform-priors/</link><guid isPermaLink="true">https://thealphajas.github.io/fun/blogs/monotonic-search-with-non-uniform-priors/</guid><description>Binary search always queries the midpoint — but that&apos;s only optimal when you&apos;re clueless about where the answer lies. Here&apos;s the information-theoretic argument for querying the median of your belief instead.</description><pubDate>Sun, 06 Sep 2026 00:00:00 GMT</pubDate><category>Blog</category><category>Information Theory</category><category>Search Algorithms</category><category>Bayesian Statistics</category></item><item><title>I showed why binary has to be the way it is.. in a way</title><link>https://thealphajas.github.io/fun/blogs/why-binary-has-to-be-the-way-it-is/</link><guid isPermaLink="true">https://thealphajas.github.io/fun/blogs/why-binary-has-to-be-the-way-it-is/</guid><description>Put three natural constraints on a place-value representation system and the powers of two are not a choice any more — they are forced.</description><pubDate>Tue, 18 Aug 2026 00:00:00 GMT</pubDate><category>Blog</category><category>Number Systems</category><category>Combinatorics</category><category>Proofs</category></item><item><title>Basketball Practice II (probability)</title><link>https://thealphajas.github.io/fun/probability/basketball-practice-ii/</link><guid isPermaLink="true">https://thealphajas.github.io/fun/probability/basketball-practice-ii/</guid><description>Frank makes his first free throw and misses his second free throw. The probability of making the nth free throw is equal to the proportion of free throws he made during his first n-1 attempts. How many free throws can Frank expect to make in 100 attempts?</description><pubDate>Wed, 12 Aug 2026 17:03:13 GMT</pubDate><category>Probability</category><category>Expectation</category><category>Conditional Expectation</category></item><item><title>Consecutive Tails (probability)</title><link>https://thealphajas.github.io/fun/probability/consecutive-tails/</link><guid isPermaLink="true">https://thealphajas.github.io/fun/probability/consecutive-tails/</guid><description>A fair coin is flipped 10 times. What is the probability that any tails which occur, occur only in consecutive pairs? For instance, THHTTHHTTH fails because of the lone tail at the start, while HHTTTTHHHH is fine — as is all heads.</description><pubDate>Wed, 12 Aug 2026 17:03:13 GMT</pubDate><category>Probability</category><category>Combinatorics</category></item><item><title>Place or Take (probability)</title><link>https://thealphajas.github.io/fun/probability/place-or-take/</link><guid isPermaLink="true">https://thealphajas.github.io/fun/probability/place-or-take/</guid><description>You are playing a one-player game with two opaque boxes. At each turn, you can choose to either &quot;place&quot; or &quot;take&quot;. &quot;Place&quot; places $1 from a third party into one box randomly. &quot;Take&quot; empties out one box randomly and that money is yours. This game consists of 100 turns where you must either place or…</description><pubDate>Wed, 12 Aug 2026 17:03:13 GMT</pubDate><category>Probability</category><category>Expectation</category><category>Series</category><category>Optimization</category></item><item><title>Show the Face (probability)</title><link>https://thealphajas.github.io/fun/probability/show-the-face/</link><guid isPermaLink="true">https://thealphajas.github.io/fun/probability/show-the-face/</guid><description>Roll a fair standard 6-sided die until a 6 appears. Given that the first 6 occurs before the first 5, find the expected number of times the die was rolled.</description><pubDate>Wed, 12 Aug 2026 17:03:13 GMT</pubDate><category>Probability</category><category>Expectation</category><category>Conditional Probability</category><category>Markov Chains</category><category>Geometric Distribution</category></item><item><title>Breaking Stick (probability)</title><link>https://thealphajas.github.io/fun/probability/breaking-stick/</link><guid isPermaLink="true">https://thealphajas.github.io/fun/probability/breaking-stick/</guid><description>A stick of length L drops and breaks at a random point distributed uniformly across the length. What is the expected length of the smaller part?</description><pubDate>Mon, 08 Dec 2025 11:44:19 GMT</pubDate><category>Probability</category><category>Expectation</category><category>Uniform Distribution</category><category>Integration</category></item><item><title>Chess Tournament I (probability)</title><link>https://thealphajas.github.io/fun/probability/chess-tournament-i/</link><guid isPermaLink="true">https://thealphajas.github.io/fun/probability/chess-tournament-i/</guid><description>A chess tournament has 128 players, each with a distinct rating. Assume that the player with the higher rating always wins against a lower rated opponent and that the winner proceeds to the subsequent round. What is the probability that the highest rated and second-highest rated players will meet…</description><pubDate>Mon, 08 Dec 2025 11:44:19 GMT</pubDate><category>Probability</category><category>Combinatorics</category></item><item><title>Comparing Flips II (probability)</title><link>https://thealphajas.github.io/fun/probability/comparing-flips-ii/</link><guid isPermaLink="true">https://thealphajas.github.io/fun/probability/comparing-flips-ii/</guid><description>You and your friend are playing a game with a fair coin, tossing it and writing down the outcomes. You win if HTH appears before HHT, else your friend wins. What is the probability that your friend wins?</description><pubDate>Mon, 08 Dec 2025 11:44:19 GMT</pubDate><category>Probability</category><category>Conditional Probability</category><category>Markov Chains</category></item><item><title>Confused Ant II (probability)</title><link>https://thealphajas.github.io/fun/probability/confused-ant-ii/</link><guid isPermaLink="true">https://thealphajas.github.io/fun/probability/confused-ant-ii/</guid><description>An ant walks the corner of a 3D cube and moves to one of the three adjacent vertices with equal probability at each step. Find the expected number of steps needed for the ant to return to the vertex it started at.</description><pubDate>Mon, 08 Dec 2025 11:44:19 GMT</pubDate><category>Probability</category><category>Expectation</category><category>Markov Chains</category><category>Random Walks</category></item><item><title>Graph Search I (probability)</title><link>https://thealphajas.github.io/fun/probability/graph-search-i/</link><guid isPermaLink="true">https://thealphajas.github.io/fun/probability/graph-search-i/</guid><description>You are given an undirected graph with 10 nodes. From every node, you are able to access any other node (including itself), all with an equal probability of 1/10. What is the expected number of steps to reach all nodes at least once (rounded to the nearest step)?</description><pubDate>Mon, 08 Dec 2025 11:44:19 GMT</pubDate><category>Probability</category><category>Expectation</category><category>Coupon Collector</category></item><item><title>Graph Search II (probability)</title><link>https://thealphajas.github.io/fun/probability/graph-search-ii/</link><guid isPermaLink="true">https://thealphajas.github.io/fun/probability/graph-search-ii/</guid><description>You are given an undirected graph with 11 nodes. From every node, you are able to access any other node (not including itself), all with an equal probability of 1/10. What is the expected number of steps to reach all nodes at least once (rounded to the nearest step)?</description><pubDate>Mon, 08 Dec 2025 11:44:19 GMT</pubDate><category>Probability</category><category>Expectation</category><category>Coupon Collector</category></item><item><title>Intersecting Chords (probability)</title><link>https://thealphajas.github.io/fun/probability/intersecting-chords/</link><guid isPermaLink="true">https://thealphajas.github.io/fun/probability/intersecting-chords/</guid><description>10 chords with uniformly randomly chosen endpoints are drawn on a circle. What is the expected number of intersections?</description><pubDate>Mon, 08 Dec 2025 11:44:19 GMT</pubDate><category>Probability</category><category>Expectation</category><category>Combinatorics</category></item><item><title>Matching Die Trio (probability)</title><link>https://thealphajas.github.io/fun/probability/matching-die-trio/</link><guid isPermaLink="true">https://thealphajas.github.io/fun/probability/matching-die-trio/</guid><description>Three fair 6−sided dice are rolled and their upfaces are recorded. Find the probability that the values showing upon rolling all three dice again is the same as the original three values recorded.</description><pubDate>Mon, 08 Dec 2025 11:44:19 GMT</pubDate><category>Probability</category><category>Combinatorics</category></item><item><title>Mean babysitter (probability)</title><link>https://thealphajas.github.io/fun/probability/mean-babysitter/</link><guid isPermaLink="true">https://thealphajas.github.io/fun/probability/mean-babysitter/</guid><description>10 kids are really hungry! Their babysitter has 12 units of food to give. However, she decides she only wants to give 4 of the children food. How many ways can she distribute the food units such that 6 of the children are hungry (receive no food), and the other 4 children receive at least 1 unit…</description><pubDate>Mon, 08 Dec 2025 11:44:19 GMT</pubDate><category>Probability</category><category>Combinatorics</category></item><item><title>Modified RNG (probability)</title><link>https://thealphajas.github.io/fun/probability/modified-rng/</link><guid isPermaLink="true">https://thealphajas.github.io/fun/probability/modified-rng/</guid><description>Jimmy picks a number uniformly at random from (0,1). If Jimmy chooses x, then Jon picks a number from (x,1) uniformly at random. If Y represents the number Jon selects, in simplest form, find E[Y]/Var(Y)</description><pubDate>Mon, 08 Dec 2025 11:44:19 GMT</pubDate><category>Probability</category><category>Conditional Expectation</category><category>Uniform Distribution</category></item><item><title>Multinomial Expansion (probability)</title><link>https://thealphajas.github.io/fun/probability/multinomial-expansion/</link><guid isPermaLink="true">https://thealphajas.github.io/fun/probability/multinomial-expansion/</guid><description>How many terms are there in the expansion of (x1 + x2 + x3 + x4 + x5 + x6)^18 after all like terms have been combined?</description><pubDate>Mon, 08 Dec 2025 11:44:19 GMT</pubDate><category>Probability</category><category>Combinatorics</category></item><item><title>Multinomial Sum (probability)</title><link>https://thealphajas.github.io/fun/probability/multinomial-sum/</link><guid isPermaLink="true">https://thealphajas.github.io/fun/probability/multinomial-sum/</guid><description>Find the sum of all multinomial coefficients: C(7; b1, b2, b3, b4) where b1 + b2 + b3 + b4 = 7 and each bi ≥ 0 is an integer.</description><pubDate>Mon, 08 Dec 2025 11:44:19 GMT</pubDate><category>Probability</category><category>Combinatorics</category></item><item><title>Optimal Bidders I (probability)</title><link>https://thealphajas.github.io/fun/probability/optimal-bidders-i/</link><guid isPermaLink="true">https://thealphajas.github.io/fun/probability/optimal-bidders-i/</guid><description>Carter has come into contact with a bounty of gold. He takes it to an auction shop. The shop tells him that every bidder will place a bid uniformly between 500 and1000. They also say they can recruit bidders for $5 per person. Carter needs to figure out the optimal number of bidders to maximize…</description><pubDate>Mon, 08 Dec 2025 11:44:19 GMT</pubDate><category>Probability</category><category>Expectation</category><category>Order Statistics</category><category>Optimization</category></item><item><title>Particle Reach (probability)</title><link>https://thealphajas.github.io/fun/probability/particle-reach/</link><guid isPermaLink="true">https://thealphajas.github.io/fun/probability/particle-reach/</guid><description>Consider a particle that performs a random walk on the integers starting at position 0. At each step, the particle moves from position i to position i+1 with probability p, while the probability it moves from i to i−1 is 1−p. If p=1/3, find the probability the particle ever reaches position 1</description><pubDate>Mon, 08 Dec 2025 11:44:19 GMT</pubDate><category>Probability</category><category>Random Walks</category><category>Conditional Probability</category></item><item><title>Pass the ball (probability)</title><link>https://thealphajas.github.io/fun/probability/pass-the-ball/</link><guid isPermaLink="true">https://thealphajas.github.io/fun/probability/pass-the-ball/</guid><description>You and 4 other people are sitting in a circle. You are given a ball to start the game. Every second of this game, the person with the ball has three choices they can make. They can either pass the ball to the left, pass the ball to the right, or keep the ball (all with equal probability). This…</description><pubDate>Mon, 08 Dec 2025 11:44:19 GMT</pubDate><category>Probability</category><category>Conditional Probability</category><category>Markov Chains</category></item><item><title>Random Angle II (probability)</title><link>https://thealphajas.github.io/fun/probability/random-angle-ii/</link><guid isPermaLink="true">https://thealphajas.github.io/fun/probability/random-angle-ii/</guid><description>A right triangle is being formed with legs labeled A and B. The random lengths of legs A and B are both IID Uniform(0,1) random variables. Let θ be the angle (in radians) opposite to side A. Find the probability that: P(θ &gt; π /3)</description><pubDate>Mon, 08 Dec 2025 11:44:19 GMT</pubDate><category>Probability</category><category>Uniform Distribution</category><category>Integration</category><category>Geometric Probability</category></item><item><title>Random Ratio (probability)</title><link>https://thealphajas.github.io/fun/probability/random-ratio/</link><guid isPermaLink="true">https://thealphajas.github.io/fun/probability/random-ratio/</guid><description>p and q are two points chosen at random between 0 and 1. What is the probability that the ratio p/q lies between 1 and 2?</description><pubDate>Mon, 08 Dec 2025 11:44:19 GMT</pubDate><category>Probability</category><category>Uniform Distribution</category><category>Integration</category><category>Geometric Probability</category></item><item><title>Russian Roulette I (probability)</title><link>https://thealphajas.github.io/fun/probability/russian-roulette-i/</link><guid isPermaLink="true">https://thealphajas.github.io/fun/probability/russian-roulette-i/</guid><description>You&apos;re playing a game of Russian Roulette with a friend. The six-chambered revolver is loaded with one bullet. Initially, the cylinder is spun to randomize the order of the chambers. The two of you take turns pulling the trigger until the person who fires the gun loses. Given that the cylinder is…</description><pubDate>Mon, 08 Dec 2025 11:44:19 GMT</pubDate><category>Probability</category><category>Conditional Probability</category></item><item><title>Russian Roulette II (probability)</title><link>https://thealphajas.github.io/fun/probability/russian-roulette-ii/</link><guid isPermaLink="true">https://thealphajas.github.io/fun/probability/russian-roulette-ii/</guid><description>You&apos;re playing a game of Russian Roulette with a friend. The six-chambered revolver is loaded with one bullet. Initially, the cylinder is spun to randomize the order of the chambers. The two of you take turns pulling the trigger until the person who fires the gun loses. Given that the cylinder is…</description><pubDate>Mon, 08 Dec 2025 11:44:19 GMT</pubDate><category>Probability</category><category>Series</category><category>Conditional Probability</category></item><item><title>Square Cross (probability)</title><link>https://thealphajas.github.io/fun/probability/square-cross/</link><guid isPermaLink="true">https://thealphajas.github.io/fun/probability/square-cross/</guid><description>A square of side length 20 is placed in front of you. You select a point uniformly at random from its interior. Then, independently, a circle of radius R ~ Unif(0,10) is formed around the selected point. What is the probability that this circle does not intersect the square at any point?</description><pubDate>Mon, 08 Dec 2025 11:44:19 GMT</pubDate><category>Probability</category><category>Uniform Distribution</category><category>Integration</category><category>Geometric Probability</category></item><item><title>Differ by 2 (probability)</title><link>https://thealphajas.github.io/fun/probability/differ-by-2/</link><guid isPermaLink="true">https://thealphajas.github.io/fun/probability/differ-by-2/</guid><description>How many times do we have to roll a fair 6-sided die till we roll two numbers in a row that differ by 2?</description><pubDate>Mon, 08 Dec 2025 11:44:19 GMT</pubDate><category>Probability</category><category>Expectation</category><category>Markov Chains</category></item><item><title>Exact 5 II (probability)</title><link>https://thealphajas.github.io/fun/probability/exact-5-ii/</link><guid isPermaLink="true">https://thealphajas.github.io/fun/probability/exact-5-ii/</guid><description>Abd continually rolls a fair 6-sided die until he obtains his first 6. What’s the expected number of times Abd rolls a 5 before he stops?</description><pubDate>Mon, 08 Dec 2025 11:44:19 GMT</pubDate><category>Probability</category><category>Expectation</category><category>Geometric Distribution</category></item></channel></rss>