Enregistré dans:
Détails bibliographiques
Auteurs principaux: Phan, Vu, Ugarcovici, Ilie
Format: Preprint
Publié: 2025
Sujets:
Accès en ligne:https://arxiv.org/abs/2511.20932
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
Table des matières:
  • We investigate the expected number of calls required to achieve Bingo in a generalized (n,m)-Bingo game, where each n x n card is filled by sampling n numbers from m possible values per column. Using the inclusion-exclusion principle, we derive exact formulas for the probability distribution and the expected game length. Our main theoretical result proves that the expected number of calls is a linear function of m.