Arith / CONCEPT
Finite Fibonacci rank closure
The prime support of Fibonacci entry ranks has a bounded least closure over every finite set of primes greater than five.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES2
PROOF DEPTH7
DOCUMENT LINKS0
Bounded least closure
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
RELATED KNOWLEDGE
Structural connections
- Arith: Fibonacci Rankstructural-affinity · Closed
- Arith: Golden Apparitionstructural-affinity · Closed
- Fibonacci Divisibility and Indicesstructural-affinity · Closed
- Fibonacci Rank Euler Tailstructural-affinity · Closed
- Fibonacci Rank Weighted Prime Tailstructural-affinity · Closed
- Golden Cubic Block Ranksstructural-affinity · Closed
- Golden Fibonacci Modulus Periodstructural-affinity · Closed
- Golden Prime-Power Orderstructural-affinity · Closed
- Height of the Fibonacci rank-parent recursionstructural-affinity · Closed
- Prime-to-index Fibonacci valuationstructural-affinity · Closed
- Scale: Fib Lucas Doublestructural-affinity · Closed
- Sparse Prime-Power Fibonacci Collisionsstructural-affinity · Closed
- The classical value of the odd polygon gamestructural-affinity · Closed
Documents & exposition
None recorded in this release.
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance