Statistics

    

A Uniform Lower Bound for the Probability of K Players Tied for First Place Using Supertelescoping Series

Authors: Mathis Antonetti

In this note, we establish a uniform lower bound (w.r.t. the number of players) for the probability of k players tied for first place in the geometric case. To derive this bound, we introduce the concept of supertelescoping series as a generalization of telescoping series. We also provide an insight on the relationship between supertelescopic series and supermartingales.

Comments: 3 Pages.

Download: PDF

Submission history

[v1] 2024-04-13 20:44:31

Unique-IP document downloads: 239 times

Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus