This is from the C file newreadtest28a.c .
If we look at:
var05 = floorq(var04) – 1.0Q;
deltasumlog = deltasumlog + (var05 – 1.0Q)*logq(fsmallprime);
then it’s logical that var05 has the exponent of “smallprime” (please see below) in the least colossally abundant number divisible by the prime number “p” (cf. source code two posts earlier).
Only, “var05” is declared as a __float128 floating point number.
for(k=0; k<1000000;k++)
{
smallprime = smallp[k];
fsmallprime = (__float128) smallprime;
var01 = expq((1.0Q+epsilon)*logq(fsmallprime))-1.0Q;
var02 = expq(epsilon*logq(fsmallprime))-1.0Q;
var03 = logq(var01/var02);
var04 = var03/logq(fsmallprime);
var05 = floorq(var04) – 1.0Q;
deltasumlog = deltasumlog + (var05 – 1.0Q)*logq(fsmallprime);
}