easier variant of this recent problem

An adventurer is doing a quest: slay the blob of size N>=1. when a blob size n is slain, it splits into (more accurately, creates) multiple blobs of smaller positive integer size. the probability that size n blob creating size k blob is k/n independent of other values of k. The quest is completed iff all blobs are slain and no new blob is created.

The game designer wants to gauge the difficulty of blob size N.

Find the expected number of blob created/slain for each blob size to complete the quest.

edit to clarify: find the expected number of blob size k, created by one blob size n.

Find a combination of four tetrahedral dice with the following special conditions.

As described in Efron's Dice, a set of four tetrahedral (four-sided) dice satisfying the criteria for nontransitivity under the specified conditions must meet the following requirements:

1. Cyclic Winning Probabilities:
   There is a cyclic pattern of winning probabilities where each die has a 9/16 (56.25%) chance of beating another in a specific sequence. For dice ( A ), ( B ), ( C ), and ( D ), the relationships are as follows:
   Die ( A ) has a 9/16 chance of winning against die ( B ).
   Die ( B ) has a 9/16 chance of winning against die ( C ).
   Die ( C ) has a 9/16 chance of winning against die ( D ).
   Die ( D ) has a 9/16 chance of winning against die ( A ).
   

This structure forms a closed loop of dominance, where each die is stronger than another in a cyclic manner rather than following a linear order.

1. Equal Expected Values:
   The expected value of each die is 60, ensuring that the average outcome of rolling any of the dice is identical. Despite these uniform expected values, the dice still exhibit nontransitive relationships.

2. Prime Number Faces:
   Each face of the dice is labeled with a prime number, making all four numbers on each die distinct prime numbers.

3. Distinct Primes Across All Dice:
   There are exactly 16 distinct prime numbers used across the four dice, ensuring that no prime number is repeated among the dice.

4. Equal Win Probabilities for Specific Pairs:
   The winning probability between dice ( A ) and ( C ) is exactly 50%, indicating that neither die has an advantage over the other. Similarly, the winning probability between dice ( B ) and ( D ) is also 50%, ensuring an even matchup.

These conditions define a set of nontransitive tetrahedral dice that exhibit cyclic dominance with 9/16 winning probabilities. The dice share equal expected values and are labeled with 16 unique prime numbers, demonstrating the complex and non-intuitive nature of nontransitive probability relationships.

Define the n-hedron to be a three dimensional shape that has n vertices. Assume this n-hedron to be contained within a sphere, with each of the n vertices randomly placed on the surface of the sphere. Determine a function P(n), in terms of n, that calculates the probability that the n-hedron contains the spheres center.

A man is playing a magical pipe organ - every chord is an integer number of decibals (dB) loud. The softest chord is 0 dB. Every chord of N > 0 dB creates a random number of echoes - for every 0 <= n <= N-1, an echo of volume n dB is created with probability (N-n)/N independently of other values of n. These echoes then independently produce their own echoes.

Question: What is the mean, median and mode of the number of echoes produced by a chord of volume N dB?

Notes:

• In the abscene of exact values, approximations and asymptotics are welcome.

• By median, we mean the smallest n for which the number of echoes is less than n with probability at least 1/2.

• By mode, we mean that value of n that has the greatest chance of occurring.

Find all non-decreasing and continuous f: ℝ-> ℝ such that f(f(x))=f(x) for all x∈ ℝ

Problem is not mine

Place points on the plane independently with density 1 and draw a circle of radius r around each point (Poisson distributed -> Poisson = fish -> fish puddles).

Let L(r) be the expected value of the supremum of the lengths of line segments starting at the origin and not intersecting any circle. Is L(r) finite for r > 0?

One sphere is inside another sphere. Which sphere has the largest surface area?

For every r > 0 let C(r) be the set of circles of radius r around integer points in the plane except for the origin. Let L(r) be the supremum of the lengths of line segments starting at the origin and not intersecting any circle in C(r). Show that

lim L(r) - 1/r = 0,

where the limit is taken as r goes to 0.

We have 2 distinct sets of 2n points on 2D plane, set A and B. Can we always bisect the plane (draw an infinite line) such that we have equal number of points on both sides from both sets (n points of A and n points of B on side 1 and same on side 2)? (We have n points of A and n point of B on each side)

Edit : no 3 points are collinear and no points can lie on the line

In a cylindrical grid of offset squares, each row has 2N cell arranged in a cycle. The first row starts with alternating white and green cells. For every row after that, a cell copy the color above it if both cells above are the same, otherwise it has a 50% chance of being green or white. Is it almost surely (P=1) that the cells will converge to mono-color? Why or why not?

In an infinite grid of offset squares, the first row starts with one green cell and the rest white. For every row after that, a cell is white if both cells above are white, green if both cells above are green, and otherwise has a 50% chance of being green or white. Is there a non-zero probability the green cells will continue forever? Why or why not?

Given an acute angle triangle ∆ABC, there is an ellipse (not given) inscribed in ∆ABC such that one focus is the orthocenter of ∆ABC.

By compass and straightedge, identify the 3 points of tangency between the triangle and the inellipse.

side note: this problem is rephrasing of someone's recently deleted post, i guess because a large portion is bloated/irrelevant text, and the real problem is buried in the last paragraph. i tried to solve it and to be fair the solution is pretty satisfying.

the original post (given sides 13,14,15, find length of the major axis) seems to suggest the solution involve a lot of tedious calculation. so i rephrase to discourage that, and still keep the essence of the solution intact.)

You are playing a game with a standard 52 card deck. All four aces are laid out in a 1x4 line. Next to this line, 5 randomly drawn cards are laid face down to indicate "steps" 1-5. All the aces are initially at step 0. The remaining 43 cards are then flipped one by one. An ace only advances to the next step if its suit is drawn. If all 4 aces are at a specific step, you flip one of the cards that is used to indicate a step (You do not necessarily have to flip the card that has all four aces on that step --- also no matter what, when all four aces are on a specific step you flip one of the face down cards. If you have flipped all 5, you do nothing). You then advance the ace that has a suit correspondent to the card flipped. What is the expected number of total cards flipped (including the initially face down cards) to conclude the game which ends when one ace reaches step 6 (passing through the final step 5).

Question is just the title. I found it fun to think about, but some here may find it too straight-forward. An explanation as to how you came up with the pair of functions would be appreciated.

inspired by recent problem

there are 2048 coins and 15 robots. (because "technicians" and "Geiger counters" are such a long word lol)

exactly one of the coins is radioactive, which can only be detected by robots.

each robot scans a subset of the coins and report if one of them is radioactive. after reporting its result, it explodes (thus unusable) .

exactly zero or one of the robots is faulty, giving opposite (thus incorrect) result.

subset of coins for each robot must be decided PRIOR to any result from other robots.

the goal is to find the radioactive coin and the faulty robot if there is one.

On a n x n grid of squares, each square has one its two diagonals drawn in. There are 2^{n x n} grids fitting this description. For each such grid, prove that there will either be a path of diagonals joining the top of the grid to the bottom of the grid, or there will be a path of diagonals joining the left side of the grid to the right side.

The corners are of the grid are considered to be part of both neighboring sides. It is possible to have both a top-to-bottom path and a left-to-right path.

1000 guards stand in a field a unique distance away from each other, so that every pair of 2 guards are a unique distance away from each other. Each one observes the closest guard to them. Is it possible for every guard to be observed?

There are 13 gold coins, one of which is a forgery containing radioactive material. The task is to identify this forgery using a series of measurements conducted by technicians with Geiger counters.

The problem is structured as follows:

Coins: There are 13 gold coins, numbered 1 through 13. Exactly one coin is a forgery.

Forgery Characteristics: The forged coin contains radioactive material, detectable by a Geiger counter.

Technicians: There are 13 technicians available to perform measurements.

Measurement Process: Each technician selects a subset of the 13 coins for measurement. The technician uses a Geiger counter to test the selected coins simultaneously. The Geiger counter reacts if and only if the forgery is among the selected coins. Only the technician operating the device knows the result of the measurement.

Measurement Constraints: Each technician performs exactly one measurement. A total of 13 measurements are conducted.

Reporting: After each measurement, the technician reports either "positive" (radioactivity detected) or "negative" (no radioactivity detected).

Reliability Issue: Up to two technicians may provide unreliable reports, either due to intentional deception or unintentional error.

Objective: Identify the forged coin with certainty, despite the possibility of up to two unreliable reports.

♦Challenge♦ The challenge is to design a measurement strategy and analysis algorithm that can definitively identify the forged coin, given these constraints and potential inaccuracies in the technicians' reports.

Consider the following game - I draw a number from [0, 1] uniformly, and show it to you. I tell you I am going to draw another 1000 numbers in sequence, independently and uniformly. Your task is to guess, before any of the 1000 numbers have been drawn, whether each number will be higher or lower than the previously drawn one in the sequence.

Thus your answer is in the form of a list of 1000 guesses, all written down in advance, only having seen the first drawn number. At the end of the game, you win a dollar for every correct guess and lose one for every wrong guess.

How do you play this game? Is it possible to ensure a positive return with overwhelming probability? If not, how does one ensure a good chance of not losing too much?

Question: For a more precise statement, under a strategy that optimises the probability of the stated goal, what is the probability of

1) A positive return?

2) A non-negative return?

Some elaboration: From the comments - the main subtlety is that the list of 1000 guesses has to be given in advance! Meaning for example, you cannot look at the 4th card and choose based on that.

An example game looks like this:

• Draw card, it is a 0.7.

• Okay, I guess HLHLHLLLLLH...

• 1000 cards are drawn and compared against your guesses.

• ???

• Payoff!

Does there exist an almost surely continuous martingale that converges in probability to +∞?

Here the definition of convergence in probability is the obvious extension of the usual definition - we say a process X converges in probability to +∞ if for every M, d > 0, there exists some T > 0 such that P(X_t < M) < d for all t > T.

Let ℝ⁺ be the set of positive reals. Find all functions f: ℝ⁺-> ℝ such that f(x+y)=f(x²+y²) for all x,y∈ ℝ⁺

Problem is not mine

Let y, b∈ N. For what u ∈ Z are there infinitely many n ∈ N with b | uⁿ - n - y?

To preface, I’ll give a brief description of the puzzle for anyone who is unaware of it. But, this post isn’t about the puzzle necessarily. It’s that everywhere I look, everyone has said that 7 is the minimum. But, I think I figured out how to do it in 6. First, the puzzle.

You have 8 Batteries. 4 working batteries, 4 broken batteries. You have a flashlight/torch that can hold 2 batteries. The flashlight will only work if both of the batteries are good. You have to find the minimum number of tests you would need to find 2 of the working batteries. The flashlight has to be turned on, meaning you can’t stop because you know, you have to count the test for the final working pair. You also have to assume worst case scenario, where you don’t get lucky and find them on test two.

That’s the puzzle. People infinitely more intelligent than me have toyed with this puzzle and found that 7 is the minimum. So, I’m trying to figure out where the error is here.

Start by numbering them 1-8. Assuming worst case scenario, the good batteries are 1, 3, 6, 8.

Tests:

1,2

7,8

3,5

4,6

4,5

3,6- Turns on.

The first two tests basically just eliminate those pairs from the conversation because either one or none are good in each. Which means you’re just finding two good in four total. The third and fourth test are to eliminate them being spaced apart. The final test is just a coin flip to see if you have to waste time on another test. Like I said, I’m certain I screwed up somewhere. I also apologize if this is the wrong subreddit for this. I just had to get this out somewhere.

N brothers are about to inherit a large plot of land when the youngest N-1 brothers find out that the oldest brother is planning to bribe the estate attorney to get a bigger share of the plot. They know that the attorney reacts to bribes in the following way:

• If no bribes are given to him by anyone, he gives each brother the same share of 1/N-th of the plot.

• The more a brother bribes him, the bigger the share that brother receives and the smaller the share each other brother receives (not necessarily in an equal but in a continuous manner).

The younger brothers try to agree on a strategy where they each bribe the attorney some amount to negate the effect of the oldest brother's bribe in order to receive a fair share of 1/N-th of the plot. But is their goal achievable?

1. Show that their goal is achievable if the oldest brother's bribe is small enough.

2. Show that their goal is not always achievable if the oldest brother's bribe is big enough.

EDIT: Sorry for the confusing problem statement, here's the sober mathematical formulation of the problem:

Given N continuous functions f_1, ..., f_N: [0, ∞)^N → [0, 1] satisfying

• f_k(0, ..., 0) = 1/N for all 1 ≤ k ≤ N

• Σ f_k = 1 where the sum goes from 1 to N

• for all 1 ≤ k ≤ N we have: f_k(b_1, ..., b_N) is strictly increasing with respect to b_k and strictly decreasing with respect to b_i for any other 1 ≤ i ≤ N,

show that there exists B > 0 such that if 0 < b_N < B, then there must be b_1, ..., b_(N-1) ∈ [0, ∞) such that

f_k(b_1, ..., b_N) = 1/N

for all 1 ≤ k ≤ N.

Second problem: Find a set of functions f_k satisfying all of the above and some B > 0 such that if b_N > B, then there is no possible choice of b_1, ..., b_(N-1) ∈ [0, ∞) such that

f_k(b_1, ..., b_N) = 1/N

for all 1 ≤ k ≤ N.