English

Generalizing Giuga's conjecture

Number Theory 2011-03-18 v1

Abstract

In 1950 G. Giuga studied the congruence j=1n1jn11\sum_{j=1}^{n-1} j^{n-1} \equiv -1 (mod nn) and conjectured that it was only satisfied by prime numbers. In this work we generalize Giuga's ideas considering, for each kNk \in \mathbb{N}, the congruence j=1n1jk(n1)1\sum_{j=1}^{n-1} j^{k(n-1)} \equiv -1 (mod nn). It particular, it is proved that a pair (n,k)N2(n,k)\in \mathbb{N}^2 (with composite nn) satisfies the congruence if and only if nn is a Giuga Number and λ(n)/gcd(λ(n),n1) \lambda(n)/\gcd(\lambda(n),n-1) divides kk. In passing, we establish some new characterizations of Giuga Numbers.

Keywords

Cite

@article{arxiv.1103.3483,
  title  = {Generalizing Giuga's conjecture},
  author = {José María Grau and Antonio M. Oller-Marcén},
  journal= {arXiv preprint arXiv:1103.3483},
  year   = {2011}
}
R2 v1 2026-06-21T17:41:01.606Z