Electronic Proceedings in Theoretical Computer Science (Sep 2015)

Perfect Numbers in ACL2

  • John Cowles,
  • Ruben Gamboa

DOI
https://doi.org/10.4204/EPTCS.192.5
Journal volume & issue
Vol. 192, no. Proc. ACL2 2015
pp. 53 – 59

Abstract

Read online

A perfect number is a positive integer n such that n equals the sum of all positive integer divisors of n that are less than n. That is, although n is a divisor of n, n is excluded from this sum. Thus 6 = 1 + 2 + 3 is perfect, but 12 < 1 + 2 + 3 + 4 + 6 is not perfect. An ACL2 theory of perfect numbers is developed and used to prove, in ACL2(r), this bit of mathematical folklore: Even if there are infinitely many perfect numbers the series of the reciprocals of all perfect numbers converges.