Related papers: Median Area for Broken Sticks
We use the idea of the broken stick problem (which goes back to Poincare) and calculate the corresponding probabilities for the cases in which the three broken part are: the medians in a triangle, the altitudes, radii of excircles, angle…
Regard the closed interval $[0,1]$ as a stick. Partition $[0,1]$ into $n+1$ different intervals $I_1, \ \dots \ , I_{n+1},$ where $n \geq 2,$ which represent smaller sticks. The classical Broken Stick problem asks to find the probability…
Given a triangle ABC, we derive the probability distribution function and the moments of the area of an inscribed triangle RST whose vertices are uniformly distributed on AB, BC, and CA. The theoretical results are confirmed by a Monte…
Among several things, we find the side density for random triangles circumscribing the unit circle and calculate that its median is 5.5482.... An analogous exact computation for perimeter density remains open.
The broken stick problem is the following classical question. You have a segment $[0,1]$. You choose two points on this segment at random. They divide the segment into three smaller segments. Show that the probability that the three…
To generate a triangle of unit perimeter, break a stick of length 1 in two places at random, with the condition that triangle inequalities are satisfied. Is there a similarly natural method for generating triangles of unit area? Study of a…
There is well-known problem of geometric probability which can be quote as the Broken Spaghetti Problem. It addresses the following question: A stick of spaghetti breaks into three parts and all points of the stick have the same probability…
Break a stick at random at $n-1$ points to obtain $n$ pieces. We give an explicit formula for the probability that every choice of $k$ segments from this broken stick can form a $k$-gon, generalizing similar work. The method we use can be…
If a line cuts randomly two sides of a triangle, the length of the segment determined by the points of intersection is also random. The object of this study, applied to a particular case, is to calculate the probability that the length of…
We consider a random variable expressed as the Euclidean distance between an arbitrary point and a random variable uniformly distributed in a closed and bounded set of a three-dimensional Euclidean space. Four cases are considered for this…
Suppose an interval is put on a horizontal line with random roughness. With probability one it is supported at two points, one from the left, and another from the right from its center. We compute probability distribution of support points…
A variable line through the centroid G of a triangle divides the triangle into two parts each of whose lengths as a fraction of the perimeter fills a closed interval [m,1-m], with m between 0 and 1/2. We show that the range of m taken over…
Three points uniformly selected on the unit circle form a triangle containing a point $X$ at distance $r \in [0; 1]$ from its center with probability $P(r) = \frac{1}{4} - \frac{3}{2 \pi^2}\textrm{Li}_2(r^2)$, where $\textrm{Li}_2$ is the…
From among $ {n \choose 3}$ triangles with vertices chosen from $n$ points in the unit square, let $T$ be the one with the smallest area, and let $A$ be the area of $T$. Heilbronn's triangle problem asks for the maximum value assumed by $A$…
In this work, we define a triangle area number to be the area number of a triangle whose sides have integer lengths, and whose area is a rational number. In Result 3, on page 17, we prove that every triangle area number is in fact an…
It has been known that the distribution of the random distances between two uniformly distributed points within a convex polygon can be obtained based on its chord length distribution (CLD). In this report, we first verify the existing…
The fragmentation of a two-dimensional circular disc by lateral impact is investigated using a cell model of brittle solid. The disc is composed of numerous unbreakable randomly shaped convex polygons connected together by simple elastic…
We propose a discrete approach to solve problems on forming polygons from broken sticks, which is akin to counting polygons with sides of integer length subject to certain Diophantine inequalities. Namely, we use MacMahon's Partition…
Let T be a random triangle in a disk D of radius R (meaning that vertices are independent and uniform in D). We determine the bivariate density for two arbitrary sides a,b of T. In particular, we compute that E(a*b)=(0.837...)*R^2, which…
We find an upper estimate for a splitting time of a thin parallel beam for irrational triangle billiards in terms of some number-theoretic function of angles. We provide an upper estimate on this function for some class of angles.