I don't think I have the math chops to solve this problem without heavy approximation, so I'm pitching it here. Here's the premise:
Suppose that you were to throw two N-sided dice. If the number rolled by the first die is less than or equal to that of the second, then the ultimate result of the dice roll is the number face-up on the first die. If the second die rolls a lower number, you must reroll both dice. You must continue rolling both dice until a definitive outcome is reached. Here are some examples of how this would play out with a 6-sided die:
First die: 4, Second die: 5 =>
4 ≤ 5 => Outcome: 4
First die: 2, Second die: 1 =>
2 > 1 => Outcome: Reroll =>
First die: 1, Second die: 6 =>
1 ≤ 6 => Outcome: 1
First die: 6, Second die: 2 =>
6 > 2 => Outcome: Reroll =>
First die: 4, Second die, 3 =>
4 > 3 => Outcome: Reroll =>
First die: 3, Second die: 3 =>
3 ≤ 3 => Outcome: 3
My question is this: For any value of N, is there a formula I could use to calculate the probability of any single possible outcome (e.g. chances of rolling a 13 when N = 20)? If so, what is that formula? Thank you!
I assume your two dice are distinguishable (for instance, they have different colors) because otherwise it doesn't make sense to talk about the "first die" and the "second die".
You pick $x$ and $y$ and throw the result out if $x > y$, so the result is equally likely to be any of the pairs $(x, y)$ with $1 \le x \le y \le n$.
The pairs with smallest value $x$ are $(x, x), (x, x+1), \ldots, (x, n)$ and there are $n - x + 1$ of them. The total number of pairs $(x, y)$ with $x \le y$ is $n(n+1)/2$. So the probability of getting $x$ with this procedure is
$${n-x+1 \over n(n+1)/2}$$
For example:
I'm guessing you have some gaming application in mind, and the idea is to have a method that's weighted towards giving the smaller numbers - if so, this works.