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 .
For , the first two derivatives are and . At they give
Use the first three Taylor expansion terms with increment :
The positive third derivative shows that this quadratic approximation underestimates the true value. The Taylor remainder is at most , since decreases on and the cubic remainder is .
The double-angle identity gives . Thus
The function is an odd function, since is even and the sine is odd. Its integral on the symmetric interval therefore cancels:
Write . It is an odd function with amplitude and period . Its zeros on the specified interval are . The maxima are at and the minima at , with values and . The middle panel of the preceding figure shows the two full oscillations.
The graph is nonnegative, tends to as and as , and vanishes only at . Its derivative is , negative before one and positive after one, so is the unique global minimum. The second derivative is : the graph is convex for and concave for , with an inflection point at . These features determine the sketch in the left panel.
Figure 1.
The squared logarithm, the half-amplitude double-frequency sine, and the directed elliptical path
. Details.
Use partial fraction decomposition:
Integrating the two logarithmic derivatives gives
This holds on each interval avoiding the two poles and , with an independent integration constant on each interval.

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact