hermann on Thu, 10 Jul 2025 00:38:39 +0200


[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]

Re: Implementation of functions for "Integer partitions detect the primes" paper 

On 2025-07-09 22:14, Bill Allombert wrote:

That does not work:

? M1(n)=sigma(n);
? M2(n)=(sigma(n,3)-(2*n-1)*sigma(n))/8;
? T1(n)=(n^2 - 3^n + 2)*M1(n) - 8*M2(n);

                 ^^^
This should be 3*n.


Thanks, after simplification:

? T1(n) = (n^2 - n + 1) * sigma(n) - sigma(n, 3);
? T1(precprime(10^9))
0
?

Regards,

Hermann.