Talk:Chowla numbers: Difference between revisions

 

::: Does Python use a non-interpreted "language" for its BIFs?   (In particular,   '''divisors'''.)     The reason I ask is that I wrote a home-grown   '''divisors'''   REXX function that instead of finding the divisors, and then adding them (say, with a   '''sum'''   function), I modified a version of the   '''divisors'''   code to instead of creating a list of proper divisors, I had the function just add the divisors on-the-fly (eliminating the stand-alone summation part).   I then further modified the function to be aware if the target is odd or even, and adjusted the   '''do'''   loop accordingly (along with the   '''do'''   loop increment);   that doubled the speed (or halved the computation time,   pot-tay-toe, pot-tah-toe).   Essentially, I coded a   '''sigma_proper_divisors'''   function with the subtraction of unity as being built-in by starting the summation with zero instead of unity).       Do you happen to know if Python's   '''divisors'''   BIF does that?   I would suspect that it does.   In any case, this is why I included several formulas/algorithms to calculate the   '''chowla'''   function so that programmers could choose the fastest (most efficient) algorithm.     -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 23:00, 12 March 2019 (UTC)

 

== Mistakenly posted discussion on the task page ==