RosettaCodeData/Task/Perfect-numbers/Axiom/perfect-numbers-2.axiom

8 lines
194 B
Plaintext

)abbrev package TESTP TestPackage
TestPackage() : withma
perfect?: Integer -> Boolean
==
add
import IntegerNumberTheoryFunctions
perfect? n == reduce("+",divisors n) = 2*n