Arith / CONCEPT
Height of the Fibonacci rank-parent recursion
Following prime factors of Fibonacci entry ranks from any prime reaches 2, 3 or 5, and every such path from p has at most log2(p - 1) steps.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES0
PROOF DEPTH8
DOCUMENT LINKS0
A rank parent is at most half of p + 1
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
None recorded in this release.
RELATED KNOWLEDGE
Structural connections
- Arith: Fibonacci Rankstructural-affinity · Closed
- Fibonacci Rank Euler Tailstructural-affinity · Closed
- Finite Fibonacci rank closurestructural-affinity · Closed
- Five-adic Fibonacci depthstructural-affinity · Closed
- Original odd-depth supportstructural-affinity · Closed
- Pairwise Fibonacci Time Recoverystructural-affinity · Closed
- Prime-to-index Fibonacci valuationstructural-affinity · Closed
- Sharp Prime Gcd Observation Horizonstructural-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