Fibonacci numbers and the probability of polygon formation using random length sticks
Pith reviewed 2026-05-07 08:31 UTC · model grok-4.3
The pith
The probability that no p+1 random sticks form a (p+1)-sided polygon equals the product of reciprocals of terms built from the p-step Fibonacci numbers.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
We present two complementary proofs that, if the lengths of n sticks are sampled at random, then the probability that no p+1 sticks can form a (p+1)-sided polygon can be expressed as the product of the reciprocals of a series of terms involving the p-step Fibonacci numbers. The first proof uses matrix algebra to extend the method previously used by Sudbury et al. The second proof uses expressions for the minimum and maximum lengths of each stick compatible with the non-formation constraint and shows why the Fibonacci numbers arise; the same approach applies to any continuous distribution.
What carries the argument
The p-step Fibonacci numbers appearing in the denominators of the probability product, obtained either by matrix powers on ordered lengths or by recursive bounds on the longest stick that still prevents any p+1 from closing.
If this is right
- The same probability formula holds when lengths are sampled from any continuous distribution, not only the uniform.
- For small fixed p the product reduces to explicit rational expressions in n that recover the known triangle and quadrilateral cases.
- The matrix-algebra proof supplies a computational route to evaluate the probability for moderate n and p without numerical integration.
- The min-max length construction partitions the unit hypercube into regions whose volumes are controlled by the same recurrence that defines the p-step Fibonacci numbers.
Where Pith is reading between the lines
- The recursive length bounds suggest that the forbidden configurations are counted by the same integer sequences that arise in tiling problems or non-crossing partitions.
- The method of tracking successive minimum and maximum admissible lengths may generalize directly to constraints on random edge lengths for higher polygons or for simplices in higher dimensions.
- Because the final expression is independent of the particular continuous distribution, Monte Carlo sampling from any convenient distribution can be used to verify the closed form for larger p.
- The appearance of generalized Fibonacci numbers indicates an underlying linear recurrence in the volume of the complement of the polygon-formation set.
Load-bearing premise
Stick lengths are independent draws from a continuous probability distribution, so that the non-polygon event is defined by strict inequalities on partial sums and has probability unaffected by ties.
What would settle it
Draw thousands of independent n-tuples of lengths from a uniform distribution on [0,1], count the fraction satisfying the strict non-polygon condition for a fixed p, and test whether the empirical frequency equals the explicit product formula built from the p-step Fibonacci sequence for the same n and p.
read the original abstract
We present two complementary proofs that, if the lengths of $n$ sticks are sampled at random, then the probability that no $p+1$ sticks can form a $(p+1)$-sided polygon can be expressed as the product of the reciprocals of a series of terms involving the $p$-step Fibonacci numbers. The first proof uses matrix algebra to extend the method previously used by Sudbury et al. to derive expressions for the probabilities of not being able to form triangles and quadrilaterals. The second alternative proof uses a different approach based on expressions for the minimum and maximum lengths of each stick that are compatible with the constraint of not being able to form a $(p+1)$-sided polygon, and provides insights into the structure of the probability expressions and the underlying reason that they include the Fibonacci numbers. Furthermore, the approach is developed in a generalised way that can, in principle, be applied to sticks randomly sampled from any probability distribution.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript claims that if n stick lengths are drawn independently from a continuous distribution, the probability that no p+1 sticks satisfy the polygon inequality (i.e., no subset of p+1 lengths can form a (p+1)-gon) equals a closed-form product whose factors are reciprocals of terms built from the p-step Fibonacci sequence. Two complementary proofs are given: a matrix-algebraic counting argument that extends the recurrence method of Sudbury et al. for triangles and quadrilaterals, and an alternative derivation that first obtains per-stick minimum and maximum admissible lengths under the global no-polygon constraint and then integrates the joint density over those intervals, with the approach stated to generalize to arbitrary distributions.
Significance. If the derivations hold, the result supplies an explicit combinatorial-probabilistic connection between p-step Fibonacci numbers and the geometry of strict triangle inequalities applied to all (p+1)-subsets. The matrix proof supplies a rigorous, recurrence-based counting mechanism independent of any particular density, while the length-bound proof supplies structural insight into why the Fibonacci sequence appears. The claimed generality to any continuous distribution is a genuine strength, separating the combinatorial skeleton from the measure-theoretic details that usually dominate such calculations.
major comments (1)
- [second proof (min/max length approach)] § on the second (min/max) proof: the feasible region is the intersection, over all (p+1)-subsets, of the half-spaces defined by the polygon inequalities. Because these subsets overlap, the constraints are coupled; the volume of the intersection is not in general equal to the product of the marginal intervals [min_i, max_i] obtained for each stick separately. The manuscript must supply an explicit argument (or an inductive verification) showing that the integral of the joint density over this intersection nevertheless equals the claimed Fibonacci product; without that step the volume calculation is not justified.
minor comments (2)
- [Introduction] The definition and recurrence for the p-step Fibonacci numbers should be stated explicitly in the introduction or a preliminary section, together with the indexing convention used in the product formula.
- [Examples] A small explicit example (e.g., p=2, n=4 or p=3, n=5) with both the matrix count and the length-bound integral computed numerically would help readers verify that the two proofs agree on the same numerical value.
Simulated Author's Rebuttal
We thank the referee for their careful reading and for identifying a point that requires clarification in the second proof. We address the comment directly below and will revise the manuscript to incorporate the requested justification.
read point-by-point responses
-
Referee: [second proof (min/max length approach)] § on the second (min/max) proof: the feasible region is the intersection, over all (p+1)-subsets, of the half-spaces defined by the polygon inequalities. Because these subsets overlap, the constraints are coupled; the volume of the intersection is not in general equal to the product of the marginal intervals [min_i, max_i] obtained for each stick separately. The manuscript must supply an explicit argument (or an inductive verification) showing that the integral of the joint density over this intersection nevertheless equals the claimed Fibonacci product; without that step the volume calculation is not justified.
Authors: We agree that an explicit argument is needed to confirm that the intersection of the constraints yields precisely the product of the derived marginal intervals. The second proof correctly identifies the admissible [min_i, max_i] for each stick from the global no-(p+1)-gon condition, yet the manuscript does not spell out why overlapping subsets do not impose further volume-reducing restrictions. In the revision we will add a supporting lemma that supplies the missing inductive verification on n. The base cases (small n) are checked directly by enumerating the polygon-inequality violations; the inductive step uses the p-step Fibonacci recurrence to show that, once the first k sticks lie in their admissible product interval, the admissible interval for the (k+1)st stick is independent of the precise values inside the previous intervals. This establishes that the feasible region remains a rectangular box, so the joint integral factors as claimed. The same induction simultaneously explains the combinatorial origin of the Fibonacci factors. We believe this addition fully resolves the concern. revision: yes
Circularity Check
Two independent proofs (matrix counting and min/max bounds) derive the Fibonacci product without reducing the target probability to itself by construction or fitting
full rationale
The matrix proof extends Sudbury et al. via linear algebra on configuration counts, yielding the product of reciprocals of p-step Fibonacci terms directly from recurrence relations in the state transitions. The length-bound proof derives per-stick min/max compatible with the global no-polygon constraint and integrates the joint density, showing the volume equals the same product via the same recurrence. Neither proof assumes the closed form in advance, fits parameters to the probability, or relies on self-citation for the uniqueness of the expression. The appearance of Fibonacci numbers is a consequence of the underlying combinatorial recurrence, not a renaming or smuggling of the target result. The derivation chain is therefore self-contained against external benchmarks.
Axiom & Free-Parameter Ledger
axioms (2)
- domain assumption Stick lengths are independent and continuously distributed.
- standard math A (p+1)-sided polygon can be formed if and only if no single side is longer than or equal to the sum of the remaining sides.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.