Month: May 2015

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).… Continue reading About “var05”:

newreadtest28a.c computes the logarithms of some colossally abundant numbers: [david2@localhost eratosthenes10]$ tail newreadtest28a.txt p = 990999999973 epsilon = 3.653183885026180310242468860377e-14 sumlog = 991000328030.7521840041349258218183689 p = 991999999999 epsilon = 3.649367988977524534022013659376e-14 sumlog = 992000305969.8131669915172919502946597 p = 992999999983 epsilon = 3.645559922508440300966127655797e-14 sumlog = 993000403998.5058883802442669692510009 p = 993999999997 epsilon = 3.641759661414506257864442341368e-14 sumlog = 994000343836.5476306542283131617881152 p = 994999999999 epsilon = 3.637967182022573332237327579364e-14… Continue reading About newreadtest28a.c

#include <stdio.h> #include <quadmath.h> int smallp[1000000]; int main(void) { int j; long low, high, count, lastprime; __float128 datalog[1000]; char buf1[100]; char buf2[100]; __float128 r; __float128 epsilon; __float128 var01; __float128 var02; __float128 var03; __float128 var04; __float128 var05; int power2; long p; long smallprime; __float128 fsmallprime; __float128 deltasumlog; __float128 sumlog; int k; FILE *in; FILE *in1; FILE… Continue reading cat newreadtest28a.c