Giuga number

A Giuga number is a composite number n such that for each of its distinct prime factors pi we have \( p_i | ({n \over p_i} - 1) \), or equivalently such that for each of its distinct prime factors pi we have \( p_i^2 | (n - p_i) \).

The Giuga numbers are named after the mathematician Giuseppe Giuga, and relate to his conjecture on primality.

Definitions

Alternative definition for a Giuga number due to Takashi Agoh is: a composite number n is a Giuga number if and only if the congruence

\( nB_{\varphi(n)} \equiv -1 \pmod n \)

holds true, where B is a Bernoulli number and \varphi(n) is Euler's totient function.

An equivalent formulation due to Giuseppe Giuga is: a composite number n is a Giuga number if and only if the congruence

\( \sum_{i=1}^{n-1} i^{\varphi(n)} \equiv -1 \pmod n \)

and if and only if

\( \sum_{p|n} \frac{1}{p} - \prod_{p|n} \frac{1}{p} \in \mathbb{N}. \)

All known Giuga numbers n in fact satisfy the stronger condition

\( \sum_{p|n} \frac{1}{p} - \prod_{p|n} \frac{1}{p} = 1. \)

Examples

The sequence of Giuga numbers begins

30, 858, 1722, 66198, 2214408306, … (sequence A007850 in OEIS).

For example, 30 is a Giuga number since its prime factors are 2, 3 and 5, and we can verify that

30/2 - 1 = 14, which is divisible by 2,
30/3 - 1 = 9, which is 3 squared, and
30/5 - 1 = 5, the third prime factor itself.

Properties

The prime factors of a Giuga number must be distinct. If p^2 divides n, then it follows that {n \over p} - 1 = n'-1, where n' is divisible by p. Hence, n'-1 would not be divisible by p, and thus n would not be a Giuga number.

Thus, only square-free integers can be Giuga numbers. For example, the factors of 60 are 2, 2, 3 and 5, and 60/2 - 1 = 29, which is not divisible by 2. Thus, 60 is not a Giuga number.

This rules out squares of primes, but semiprimes cannot be Giuga numbers either. For if n=p_1p_2, with p_1<p_2 primes, then {n \over p_2} - 1 =p_1 - 1 <p_2, so p_2 will not divide \({n \over p_2} - 1 \) , and thus n is not a Giuga number.

List of unsolved problems in mathematics
Are there infinitely many Giuga numbers?

All known Giuga numbers are even. If an odd Giuga number exists, it must be the product of at least 14 primes. It is not known if there are infinitely many Giuga numbers.

It has been conjectured by Paolo P. Lava (2009) that Giuga numbers are the solutions of the differential equation n'=n+1, where n' is the arithmetic derivative of n.

José Mª Grau and Antonio Oller-Marcén have shown that an integer n is a Giuga number if and only if it satisfies n'= an +1 for some integer a>0, where n' is the arithmetic derivative of n.
See also

Carmichael number
Primary pseudoperfect number

References

Weisstein, Eric W., "Giuga Number", MathWorld.
Borwein, D.; Borwein, J. M.; Borwein, P. B.; Girgensohn, R. (1996). "Giuga's Conjecture on Primality" (PDF). American Mathematical Monthly 103: 40–50. doi:10.2307/2975213. Zbl 0860.11003.
Balzarotti, Giorgio; Lava, Paolo P. (2010). Centotre curiosità matematiche. Milan: Hoepli Editore. p. 129. ISBN 978-88-203-4556-3.

Mathematics Encyclopedia