Abstract
Let a stick be broken at random at n – 1 points to form n pieces. We consider three problems on forming k-gons with k out of these n pieces, 3≤ k ≤ n, and show how a statistical approach, through a linear transformation of variables, yields simple solutions that also allow fast computation.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
