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.

Version: v5 · 2026-09-19 · History
Domain-specific #: 1937
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomains: Number Theory, Special Classes of Composite Integers → Mathematics
Aliases: Giuga composite

Core Idea¶

A Giuga number is a positive composite integer \(n\) such that, for every prime divisor \(p\) of \(n\),

\[ p\mid\left(\frac np-1\right). \]

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.

How would you explain it like I'm…

The Every-Piece Test

Some numbers can be built by multiplying smaller special numbers called primes. For example, 30 is 2 × 3 × 5. A Giuga Number passes a test for each of those pieces. Take 30 and the piece 2: 30 split by 2 is 15, take away 1 and you get 14, and 14 splits evenly into 2s. It works for 3 and 5 too, so 30 is a Giuga Number!

Numbers That Pass Every Prime

A Giuga Number is a number made by multiplying primes (not a prime itself) that passes a test for every prime that divides it. The test: divide the number by that prime, subtract 1, and check that the prime divides the result evenly. For 30 = 2 × 3 × 5: 30 ÷ 2 − 1 = 14, which 2 divides; 30 ÷ 3 − 1 = 9, which 3 divides; 30 ÷ 5 − 1 = 5, which 5 divides. So 30 is the smallest Giuga Number. If even one prime fails, the number isn't a Giuga Number.

All-Factors Divisibility Numbers

A Giuga Number is a composite positive integer n such that every prime divisor p of n divides n/p − 1. Equivalently, p² divides n − p. For example, 30 works: for p = 2, 3, 5 the values 30/p − 1 are 14, 9, 5, each divisible by its p. The condition must hold for all prime factors, and passing for all but one counts as failure. Giuga Numbers matter because of Giuga's conjecture about recognizing primes. A composite number that slipped past that conjecture's test would have to be both a Giuga Number and a Carmichael number.

A Giuga Number is a composite n with p | (n/p − 1) for every prime divisor p of n, equivalently p² | (n − p) for every such p. The condition is factorwise and universal: failing at a single prime disqualifies n. The smallest case is 30 = 2·3·5, with 30/p − 1 equal to 14, 9, 5. The class is sparse and tightly constrained. Its importance comes from Giuga's primality conjecture, which can be phrased with power sums: Borwein, Borwein, Borwein, and Girgensohn (1996) showed that a composite counterexample to the relevant congruence must be both a Carmichael number and a Giuga number. So Giuga numbers capture one of two independent factorwise conditions that a pseudoprime of this kind would need.

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) — outgoing typed relations

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 → is a kind of Classification

Neighborhood in Abstraction Space¶

Giuga Number sits in a moderately populated region (56^th percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.

Family — Integer Properties & Number-Theoretic Sets (15 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25