Borwein, David and Borwein, Jonathan M. and Borwein, Peter and Girgensohn, Roland (1996) *Giuga's conjecture on primality.* The American Mathematical Monthly , 103 (1). pp. 40-50.

| Postscript Download (214Kb) | Preview | |

| PDF Download (188Kb) | Preview |

## Abstract

G. Giuga conjectured that if an integer n satisfies \sum\limits_{k=1}^{n-1} k^{n-1} \equiv -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) \mid (n/p-1) and p \mid (n/p-1). Using this characterization, he proved computationally that any counterexample has at least 1000 digits; equipped with more computing power, E. Bedocchi later raised this bound to 1700 digits. By improving on their method, we determine that any counterexample has at least 12000 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.

Item Type: | Article |
---|---|

Additional Information: | pubdom FALSE |

Uncontrolled Keywords: | primality, Carmichael numbers, computational number theory |

Subjects: | 11-xx Number theory > 11Axx Elementary number theory 11-xx Number theory > 11Yxx Computational number theory |

Faculty: | UNSPECIFIED |

Depositing User: | Users 1 not found. |

Date Deposited: | 17 Nov 2003 |

Last Modified: | 07 Sep 2014 21:21 |

URI: | https://docserver.carma.newcastle.edu.au/id/eprint/88 |

### Actions (login required)

View Item |