Month: January 2015

The program superabun3842a.out finished around January 6th. It searched for highly abundant numbers. The output was re-directed to a file. Afterwards, I wanted to check independently the values of log(N) and sigma(N)/N found by the program. Each N is given in shortened prime factorization form. In this form, adequate with non-increasing exponents for the primes,… Continue reading Colossally abundant number with prime factors 2 to 999,781,070,909

================================= step at 1 step at 2 step at 3 step at 4 step at 5 step at 6 step at 7 step at 8 step at 9 step at 12 step at 16 step at 23 step at 40 step at 88 step at 299 step at 2527 step at 203099 step at 142959989401… Continue reading Program superabun3842a.out : Job Done

================================= step at 1 step at 2 step at 3 step at 4 step at 5 step at 6 step at 7 step at 9 step at 12 step at 16 step at 23 step at 39 step at 86 step at 293 step at 2426 step at 190492 step at 125119987201 Number of big… Continue reading Eratosthenes sieving is taking time at this point cmp. to rest of work

#include <stdio.h> #include <quadmath.h> #include <stdlib.h> __float128 splogs[250000]; __float128 theta[250000]; __float128 prod100k[250000]; long ptr_exponents[250000]; long ptr_current_powers[250000]; long ptr_current_sigmas[250000]; long pts_primes[250000]; long ptr_isstep[250000]; long sivsmall_primes[150000]; unsigned char sivptr_remains[10000000]; int main(void) { long theIndex; __float128 euler = 0.5772156649015328606065120900824024Q; long j; long numprimes; long num_new_primes; long file_offset; long jj; long kij; long kijj; long numBigPrimesUsed; __float128 sum_log_cofactor; __float128… Continue reading Source code for $HOME//eratosthenes6/superabun3842a.c