Okay thanks for the willingness to help.
P and N are #defines
The program basically chooses every combination of P dinstinct primes from a ordered list of N primes and then works out 1. The product. (easyily done) and then 2. The sum of all the products divisors and then plot the results on a loglog
BTW I know an odd perfect number can't be square free but I'm still interested in these numbers (products of dinstinst primes) and besides I'm just testing my program for more relevant searching later.
I've got two questions I'd really love to have answered :-
1. Why it runs out of memory.
You have to change N in action.c to about 3000 to see this.
2. Why the lines
don't work. I need this ATM because I can then save the results before the program crashes or if I only want to run it a certain distance.
Also, If you want to see what the program's doing, change WATCH_RESULTS to 1.
Hoping for help, Will