Chowla numbers: Difference between revisions

=={{header|Maple}}==

<lang Maple>ChowlaFunction := n -> NumberTheory:-SumOfDivisors(n) - n - 1;

PrintChowla := proc(n::posint) local i;

printf("Integer : Chowla Number\n");

end do;

end proc:

countPrimes := n -> nops([ListTools[SearchAll](0, map(ChowlaFunction, [seq(1 .. n)]))]);

findPerfect := proc(n::posint) local to_check, found, k;

to_check := map(ChowlaFunction, [seq(1 .. n)]);

end do;

end proc:

PrintChowla(37);

countPrimes(100);