Arith / CONCEPT
Sparse Prime-Power Fibonacci Collisions
An arbitrary sparse table of positive times leaves two fixed primitive states with equal complete gcd readings and arbitrarily late separation.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES0
PROOF DEPTH8
DOCUMENT LINKS1
Fixed all-time arithmetic collision
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
- Fibonacci Rank Weighted Prime Tailstructural-affinity · Closed
- Fibonacci Sampling and the Coarse Time Quotientstructural-affinity · Closed
- Finite Fibonacci rank closurestructural-affinity · Closed
- Pairwise Fibonacci Time Recoverystructural-affinity · Closed
- Prime Phase Gcd Samplingstructural-affinity · Closed
- Sharp Prime Gcd Observation Horizonstructural-affinity · Closed
- Sharp Prime-Power Fibonacci Gcd Horizonsstructural-affinity · Closed
Documents & exposition
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance