Giuga number

From Number
Revision as of 00:27, 23 June 2012 by Vipul (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Definition

A composite number n is termed a Giuga number if and only if it satisfies the following equivalent conditions:

  1. For every prime number p dividing n, we have that p divides (n/p)1, or equivalently, that p2 divides np.
  2. We have the following congruence:

i=1n1iφ(n)1(modn)

where φ(n) denotes the Euler totient function of n.

Note that all prime numbers satisfy the stated condition but we deliberately exclude them by imposing the restriction of being composite.

Facts

Occurrence

Initial examples

30, 858, 1722, 66198, [SHOW MORE]

View list on OEIS