Every divisor positioned by total prime-exponent rankUpdates with every input
Math & Statistics
Prime Factorization Graphing Calculator
Graph the complete divisor lattice of an integer from its prime exponents, showing cover relations, lattice rank, complementary divisor pairs, square-root symmetry, and highlighted input and unit nodes.
Prime factorization-
Lattice nodes-
Cover edges-
Maximum lattice rank-
Complementary pairs-
Square-root pivot-
Perfect-square status-
Largest rank width-
DIVISIBILITY GEOMETRY
Every divisor positioned by total prime-exponent rank
Edges connect divisors that differ by one prime multiplication. Complementary divisors mirror around the square-root pivot.
RANK REGISTER
Divisors grouped by exponent-sum distance from one
Each row exposes one lattice layer, its members, complements, and the prime steps available upward.
| Rank | Divisors | Node count | Complement rank | Available prime moves |
|---|
GRAPH READING
Read upward edges as multiplication by one prime
- Enter a moderate integer so every divisor remains legible.
- Start at node one.
- Follow a colored edge to multiply by its prime label.
- Read nodes on the same row as equal rank.
- Pair d with n/d across the lattice.
EXPONENT-BOX GEOMETRY
The lattice shape is determined by exponents, not prime magnitudes
Numbers with the same exponent pattern have isomorphic divisor lattices even if their actual primes differ.
Perfect squares have a central self-complementary divisor at sqrt(n); nonsquares pair all nodes across the middle.
DIVISOR LATTICE MODEL
Treat each divisor as an exponent vector inside a finite box
For n=product p_i^a_i, every divisor chooses exponents b_i between zero and a_i. A cover edge increments exactly one b_i, so the rank is the sum of selected exponents.
Detailed calculation process and general formulas
d = product p_i^b_i, 0<=b_i<=a_irank(d) = sum b_id covers c when d/c is one primecomplement(d) = n/drank(d)+rank(n/d)=sum a_iSymbols, meanings, and units
- b_i
- prime exponent selected for divisor dcount
- rank(d)
- total selected exponent countsteps
- cover edge
- one-prime multiplication relationrelation
- n/d
- complementary paired divisorinteger
- sum a_i
- lattice heightranks
STRUCTURAL INSIGHTS
The graph reveals divisor organization at a glance
Counts and symmetry emerge from the lattice rather than a flat list.
Height
-Total prime multiplicity determines the maximum rank.
Width
-The busiest rank measures the broadest middle layer.
Complement symmetry
-Every node pairs multiplicatively to n.
Decision takeaway: Use the lattice for structure; use the prime-power ledger for scalable arithmetic.
Applied decisions
Divisor-lattice applications
Common-divisor reasoning
Two factorizations are compared through exponent-coordinate constraints.
What the result clarifies: Shared lower regions correspond to common divisors.
Poset instruction
Divisibility is introduced as a partial order.
What the result clarifies: Cover edges distinguish immediate relations from transitive ones.
Worked current scenario
Substitution, intermediate values, and reconciliation
Method references
Sources for this calculator's specific method
Scope and limitations
The graph is capped at moderate integers for readability. Dense divisor sets can still create crowded nodes on narrow screens; the exact rank table remains authoritative when labels overlap.
Prime Factorization Graphing Calculator | Divisor Lattice FAQ
Why are there no edges between every divisible pair?
The graph shows cover relations only; longer divisibility relations follow by paths.
Do larger primes appear higher?
No. Vertical rank counts exponents, not numeric magnitude.
What makes the graph symmetric?
The complement map d to n/d reverses all selected exponents.