Having rolled a die $n$ times, I want to determine the probability of not getting any number twice in a row. If I wanted the probability of not getting any number three times in a row, I could use the following recursion: $$p_n=\frac{5}{6}p_{n-1}+\frac{5}{36}p_{n-2},$$ as the streak is broken $5/6$ of the time, meaning we just need to multiply by the corresponding probability for one fewer trials, and the streak is continued $1/6$ of the time, so we need to break it with probability $5/6$ and multiply by the corresponding probability for two fewer trials. However, I am having difficulties applying this method to the seemingly easier length-two streak case. Any ideas would be greatly appreciated.
2026-04-01 09:53:12.1775037192
probability of not getting same number twice in a row after n die rolls
922 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in PROBABILITY
- How to prove $\lim_{n \rightarrow\infty} e^{-n}\sum_{k=0}^{n}\frac{n^k}{k!} = \frac{1}{2}$?
- Is this a commonly known paradox?
- What's $P(A_1\cap A_2\cap A_3\cap A_4) $?
- Prove or disprove the following inequality
- Another application of the Central Limit Theorem
- Given is $2$ dimensional random variable $(X,Y)$ with table. Determine the correlation between $X$ and $Y$
- A random point $(a,b)$ is uniformly distributed in a unit square $K=[(u,v):0<u<1,0<v<1]$
- proving Kochen-Stone lemma...
- Solution Check. (Probability)
- Interpreting stationary distribution $P_{\infty}(X,V)$ of a random process
Related Questions in RECURRENCE-RELATIONS
- Recurrence Relation for Towers of Hanoi
- Solve recurrence equation: $a_{n}=(n-1)(a_{n-1}+a_{n-2})$
- General way to solve linear recursive questions
- Approximate x+1 without addition and logarithms
- Recurrence relation of the series
- first order inhomogeneous linear difference equation general solution
- Guess formula for sequence in FriCAS
- Solve the following recurrence relation: $a_{n}=10a_{n-2}$
- Find closed form for $a_n=2\frac{n-1}{n}a_{n-1}-2\frac{n-2}{n}a_{n-2}$ for all $n \ge 3$
- Young Tableaux generating function
Related Questions in DICE
- Charting the probability of die values equal to or greater than a variable with N dice
- Probability of a dice board game
- Probability of rolling at least one snake eyes (pair of two ones) with four dice, rolled 3 times
- Probability of rolling x dice
- Is this a fair game (three players throw dice)?
- Probability of rolling ≥ $x$ with $k$ out of $m$ $n$-sided dice
- Puzzling Dice Roll Probability Problem
- Probability: In n rolls of a fair die
- Probability of rolling a $6$ with $2$ dice (that both have a second $6$)
- Random number of dice with random number of faces-Probability of getting a max number provided
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
The probability of not getting two in a row in $n$ trials is $5/6$ times the probability of not getting two in a row in $n-1$ trials.
Remark: A related problem, the probability of not getting two of a specified number, like $4$, twice in a row is harder. We get a second order recurrence rather than a first-order recurrence.
Added: We find a recurrence for the "no two $4$'s in a row problem. There are $6^n$ equally likely sequences of $n$ tosses. Let $a_n$ be the number of sequences with no two $4$'s in a row. A good sequence of length $n$ either (i) does not end in a $4$ or (ii) ends in a $4$.
The Type (i) sequences are obtained by appending a non-$4$ to any good sequence of length $n-1$, So there are $5a_{n-1}$ of them.
The Type (ii) sequences are obtained by appending a $4$ to a good sequence of length $n-1$ that does not end in a $4$. These can be obtained by appending a non-$4$ to a good sequence of length $n-2$, so there are $5a_{n-2}$ of them.
We have obtained the recurrence $a_n=5a_{n-1}+5a_{n-2}$.