The increasing substitution maps onto , with . Since sine and cosine are nonnegative there, powers combine without a sign ambiguity:
This is the trigonometric form of the beta function. The powers at the endpoints are integrable because .
In the integral for , put , so and the endpoints are interchanged. Then
Thus exchanging the positive parameters leaves the Euler beta function unchanged. Positivity ensures convergence at both endpoints of this improper integral.
Let . Taking a dot product with reduces the vector equation to . If , this determines a unique scalar and hence a unique vector:
Direct substitution verifies it, so necessity has also produced sufficiency. The formula includes , when .
If , the reduced scalar equation becomes . When , there is no solution. When , all solutions are with arbitrary : their dot product with is indeed . Since forces , this is an entire affine line, not a single point. These alternatives are the solvability of an affine rank-one vector equation.
Put and . Taking the dot product of the original equation with eliminates and gives . Thus
Next take its cross product with . The term disappears, and the vector triple product identity gives
Insert this expression back into . The two longitudinal terms cancel, leaving . Consequently
The denominator is strictly positive for every real , including . Substitution using the same triple-product identity verifies the solution and establishes uniqueness. This is the cross-product operator with a longitudinal rank-one term.
Rearrange to . A fourth root has modulus and an argument one quarter of . Therefore all four solutions are
Their arguments differ by , so they are distinct. Raising any of them to the fourth power returns .
First take . The forward object reaches at its th move, while the reverse object reaches that label at its th move. If the forward object wins after reverse moves, then . The final choice is forward; among the preceding choices, exactly are reverse. By the negative binomial stopping argument, this case has probability .
Sum these mutually exclusive cases and equate the result to part (e), using parts (b) and (d). This proves the success-failure stopping identity here:
The right side splits the same race into a special meeting at and all meetings beyond ; the left side splits it according to the number of reverse moves at the winning time.
At , both sides are zero with an empty sum and . At , the event has probability one; the right side equals . The printed left side includes and is outside the usual nonnegative-upper-index combinatorial definition. With the explicit generalized convention , its term is one and all terms vanish, so the identity also holds at that endpoint. Without this convention the displayed sum is undefined there; the zero-target race must instead be stated separately. All identities extend to by their polynomial forms.
Let be the meeting label. If , the forward-moving object has already crossed while the reverse-moving object has not yet reached it, so the forward object wins the race to . If , the reverse object passed first. If , the required event is exactly the special meeting from part (d).
These disjoint possibilities give
This includes the endpoints: for the probability is , and for it is , with the initial positions understood in the unwrapped convention.
Figure 1.
Example paths in a race between fixed success and failure targets
. Details.
For the forward-moving object to have been waiting at the meeting position, the last move must be a reverse move. The preceding choices must then contain exactly forward moves and reverse moves. Choosing their order gives
At the probability is zero, since the reverse-moving object was already at that unwrapped position initially. At the displayed formula is , consistent with the forward object waiting at its initial position throughout. Equivalently, use the binomial convention to include this endpoint in the same formula without a negative power of .
After choices, let be the number of forward moves. The two unwrapped positions are and , whose gap is . It follows that the first subsequent meeting occurs exactly at step , regardless of the order of the choices. Its position is the number of forward moves in that block.
That count has a binomial distribution with parameters . Therefore
The two endpoint labels and represent the same physical seat reached by different complete circuits; the unwrapped convention distinguishes their probabilities.
Use independent choices with constant probabilities and . Completing the entire reverse circuit while the forward-moving object never moves requires the first choices all to be reverse moves. Thus
Here and below, a zero-length product is interpreted as one, including at or .

There are unlisted articles, also show them or only show them.