Bertrand's paradox on a monitor

arXiv2211.06749MaRDI QIDQ6417042FDOQ6417042

Authors: Martin Klazar 

Publication date: 12 November 2022

Abstract: We investigate Bertrand's probabilistic paradox through the lens of discrete geometry and old-fashioned but reliable discrete probability. We approximate the plane unit circle with $1/n$ times $1/n$ boxes and count the pairs of boxes separated by distance more than $sqrt3$. For $noinfty$ the proportion of such pairs goes to ${\displaystyle }$ frac{1+sqrt{3}}{8}-frac{pi(2-sqrt{3})}{96}=0.33273dots;. ${\displaystyle }$

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05)

This page was built for publication: Bertrand's paradox on a monitor

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6417042)