A Conjecture concerning the Fibonomial Triangle
Jeremiah Southwick

TL;DR
This paper investigates the structure of the fibonomial triangle modulo prime numbers, introduces a new proof technique for divisibility patterns, and proposes a conjecture for general prime divisibility based on Fibonacci entry points.
Contribution
It presents a novel proof method for fibonomial divisibility by 5 and formulates a conjecture for prime divisibility conditions based on Fibonacci entry points.
Findings
Fibonomial triangle mod 2 and 3 has a fractal structure.
The triangle exhibits recurring divisibility patterns under mod 5.
Necessary conditions for prime divisibility involve Fibonacci entry points.
Abstract
The fibonomial triangle has been shown by Chen and Sagan to have a fractal nature mod 2 and 3. Both these primes have the property that the Fibonacci entry point of is . We study the fibonomial triangle mod 5, showing with a theorem of Knuth and Wilf that the triangle has a recurring structure under divisibility by five. While this result is not new, our method of proof is new and suggests a conjecture for the divisibility of a fibonomial coefficient by a general prime . We give necessary conditions for such primes, namely that the Fibonacci entry point must be greater than or equal to , and offer numerical evidence for the validity of the conjecture. Lastly, we conclude with a discussion concerning further directions of research.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Mathematical Theories and Applications · Mathematical Dynamics and Fractals · semigroups and automata theory
