Giuga Number¶
A composite integer n for which every prime divisor p satisfies p dividing n/p minus 1, a restrictive factorwise congruence linked to Giuga's primality conjecture.
Core Idea¶
A Giuga number is a positive composite integer \(n\) such that, for every prime divisor \(p\) of \(n\),
Equivalently, every prime divisor satisfies \(p^2\mid n-p\). This factor-by-factor condition defines a sparse and structurally constrained class of composite numbers.
The smallest example is \(30=2\cdot3\cdot5\). For \(p=2,3,5\), the corresponding values \(30/p-1\) are \(14,9,5\), each divisible by \(p\). The test is universal over all prime divisors: satisfying it for all but one factor is failure.
Scope of Application¶
The node applies in elementary and computational number theory, studies of primality criteria, special integer sequences, congruences, reciprocal-prime identities, and arithmetic derivatives.
Its direct use is classification: after factoring a composite integer, researchers can decide membership with the factorwise congruence. Equivalent forms can support proofs and searches. The reciprocal characterization relates the local conditions to a global rational expression, while power-sum and Bernoulli-number formulations connect the class to proposed primality characterizations.
Clarity¶
For \(n=30\):
- \(30/2-1=14\), divisible by 2;
- \(30/3-1=9\), divisible by 3; and
- \(30/5-1=5\), divisible by 5.
Thus 30 passes.
For \(n=60\), the prime divisor 2 fails: \(60/2-1=29\), which is not divisible by 2. The repeated factor also triggers the general squarefreeness contradiction.
Manages Complexity¶
The definition compresses many congruence checks into a named integer class. Instead of repeatedly saying “composite, squarefree, and every prime cofactor is 1 modulo that prime,” a proof can invoke Giuga membership and use established equivalences.
It also decomposes a difficult global primality-congruence question into local arithmetic constraints. Factorwise reasoning exposes why squarefreeness follows, why semiprimes cannot work, and why intersection with Carmichael numbers is restrictive.
Abstract Reasoning¶
Squarefree inference. If \(p^2\mid n\), the cofactor \(n/p\) is divisible by \(p\), contradicting \(n/p\equiv1\pmod p\).
No semiprimes. Suppose \(n=pq\) with primes \(p<q\). Applying the condition at \(q\) requires \(q\mid p-1\), impossible because \(0<p-1<q\). Hence a Giuga number has at least three distinct prime factors.
Knowledge Transfer¶
The portable skeleton is classification by a universal local constraint: factor an object into irreducible constituents, test a cofactor relation at every constituent, and name the objects that satisfy all tests.
That skeleton appears elsewhere in algebra and computation, but literal Giuga identity is inseparable from composite integers, prime divisors, modular arithmetic, and the exact cofactor congruence. A network whose every component passes a local check is not a Giuga number.
Relationships to Other Abstractions¶
Current abstraction Giuga Number Domain-specific
Parents (1) — more general patterns this builds on
-
Giuga Number is a kind of Classification Prime
Giuga Number specializes Classification: membership is an exact predicate over composite integers, and the name packages that predicate as a mathematical class.
Hierarchy path (1) — routes to 1 parentless root
- Giuga Number → Classification
Neighborhood in Abstraction Space¶
Giuga Number sits in a sparse region of the domain-specific corpus (70th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.
Family — Computational Number Theory & Enumeration (13 abstractions)
Nearest neighbors
- Primefree Sequence — 0.88
- Divisor Function — 0.86
- Quartic reciprocity — 0.84
- Descartes Number — 0.83
- Fundamental Theorem of Arithmetic — 0.83
Computed from structural-signature embeddings · 2026-09-08