Crystalline Numbers Primes Are Their Successors - N+1 is prime if and only if N is crystalline

A new geometric primality criterion is presented, based on a fundamental shift in perspective: prime numbers are not found by examining the primes themselves, but by identifying the crystalline numbers that precede them. Every prime is the successor of a crystalline number. For any integer N ≥ 1, I construct its N×N binary divisibility matrix M and overlay it with its 90-degree clockwise rotation M90. If all collisions (cells where both matrices have value 1) fall exclusively on the border of the matrix, N is called "crystalline." I prove that N is crystalline if and only if N+1 is prime. The candidate prime p is never divided, never factored, never examined — its primality is determined entirely from the geometry of p−1. The proof uses the "leaps argument": two divisibility positions summing to N+1 are coprime when N+1 is prime, forcing all collisions onto the border. The property holds from N=1 with no lower bound needed. Computational verification on all 10,000 integers from N=1 to N=10,000 yields 100% accuracy with zero exceptions. An independent Excel VBA implementation confirms identical results. For over two thousand years, the search for primes has focused on the primes themselves. This work shows that the signature of primality does not live in p — it lives in p−1, in the geometry of its divisibility pattern under a single rotation. The paper includes the complete proof, the formal equivalence (N is crystalline ⟺ ∀c: gcd(N−c, c+1)=1 ⟺ N+1 is prime), visual examples from the genesis (N=1 to 7) through larger matrices, and the Python verification code.Every integer N, when processed through the divisibility matrix overlay, produces a unique geometric pattern — like a QR code for that number. The position of collisions encodes the divisibility structure of N in a visual fingerprint that is different for every number. Crystalline numbers are those whose QR code is "clean": collisions on the border only, interior empty. Their successor is always [email protected]

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-04-01
DOI
https://doi.org/10.5281/zenodo.19359140
Primary Topic
Mineralogy and Gemology Studies
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Crystalline Numbers Primes Are Their Successors - N+1 is prime if and only if N is crystalline

Fabio Colombo
Zenodo (CERN European Organization for Nuclear Research)
Mineralogy and Gemology Studies
article

Crystalline Numbers Primes Are Their Successors - N+1 is prime if and only if N is crystalline

Fabio Colombo
article en

Abstract

A new geometric primality criterion is presented, based on a fundamental shift in perspective: prime numbers are not found by examining the primes themselves, but by identifying the crystalline numbers that precede them. Every prime is the successor of a crystalline number. For any integer N ≥ 1, I construct its N×N binary divisibility matrix M and overlay it with its 90-degree clockwise rotation M90. If all collisions (cells where both matrices have value 1) fall exclusively on the border of the matrix, N is called "crystalline." I prove that N is crystalline if and only if N+1 is prime. The candidate prime p is never divided, never factored, never examined — its primality is determined entirely from the geometry of p−1. The proof uses the "leaps argument": two divisibility positions summing to N+1 are coprime when N+1 is prime, forcing all collisions onto the border. The property holds from N=1 with no lower bound needed. Computational verification on all 10,000 integers from N=1 to N=10,000 yields 100% accuracy with zero exceptions. An independent Excel VBA implementation confirms identical results. For over two thousand years, the search for primes has focused on the primes themselves. This work shows that the signature of primality does not live in p — it lives in p−1, in the geometry of its divisibility pattern under a single rotation. The paper includes the complete proof, the formal equivalence (N is crystalline ⟺ ∀c: gcd(N−c, c+1)=1 ⟺ N+1 is prime), visual examples from the genesis (N=1 to 7) through larger matrices, and the Python verification code.Every integer N, when processed through the divisibility matrix overlay, produces a unique geometric pattern — like a QR code for that number. The position of collisions encodes the divisibility structure of N in a visual fingerprint that is different for every number. Crystalline numbers are those whose QR code is "clean": collisions on the border only, interior empty. Their successor is always [email protected]

Zenodo (CERN European Organization for Nuclear Research)
Openalex Percentile: Top 6%
Mineralogy and Gemology Studies
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.