- Title
- Giuja's conjecture on primality
- Creator
- Borwein, D.; Borwein, J. M.; Borwein, P. B.; Girgensohn, R.
- Relation
- The American Mathematical Monthly Vol. 103, Issue 1, p. 40-50
- Relation
- http://maa.org/pubs/monthly.html
- Publisher
- Mathematical Association of America (MAA)
- Resource Type
- journal article
- Date
- 1996
- Description
- G. Giuga conjectured that if an integer n satisfies n-1 / Σ / k=1 kn-1 ≡ -1 mod n, then n must be a prime. We survey what is known about this interesting and now fairly old conjecture. Giuga proved that n is a counterexample to his conjecture if and only if each prime divisor p of n satisfies (p - 1) | (n/p - 1) and p | (n/p - 1). Using this characterization, he proved computationally that any counterexample has at least 1,000 digits; equipped with more computing power, E. Bedocchi later raised this bound to 1,700 digits. By improving on their method, we determine that any counterexample has at least 13,800 digits. We also give some new results on the second of the above conditions. This leads, in our opinion, to some interesting questions about what we call Giuga numbers and Giuga sequences.
- Subject
- primality; Carmichael numbers; computational number theory
- Identifier
- http://hdl.handle.net/1959.13/1043630
- Identifier
- uon:14231
- Identifier
- ISSN:0002-9890
- Language
- eng
- Full Text
- Reviewed
- Hits: 2233
- Visitors: 2907
- Downloads: 370
Thumbnail | File | Description | Size | Format | |||
---|---|---|---|---|---|---|---|
View Details Download | ATTACHMENT01 | Publisher version (open access) | 222 KB | Adobe Acrobat PDF | View Details Download |