/********************************************************** Source code for: superabun1848a.c $ date Thu Dec 4 13:14:45 EST 2014 ********************************************************/ #include <stdio.h> #include <math.h> #include <stdlib.h> long double splogs[100000]; long double theta[100000]; long double prod100k[100000]; long ptr_exponents[100000]; long pts_primes[100000]; long ptr_isstep[100000]; int main(void) { long theIndex; long double euler = 0.57721566490153286060651L; long j; long numprimes; long num_new_primes; long file_offset; long jj;… Continue reading Source code for superabundant numbers computation program in C
Tag: colossally abundant numbers
My insane pursuit of highly abundant numbers …
The latest PARI/gp command-line and first few lines of ouput are copied below. Note that Keith Briggs has already published in Experimental Mathematics around 2006 on superabundant and colossally abundant numbers out to ~~~ 10^(10^10) or so, using a sieve technique to locate the first ~ 10^9 or 10^10 primes, and making use of the… Continue reading My insane pursuit of highly abundant numbers …