i want to do it myself. i want to learn. if i use GMP then i will learn nothing, if i look at the GMP source, i learn nothing because it is mostly assembly. other programs writen in c are barely...
Type: Posts; User: mltngpot
i want to do it myself. i want to learn. if i use GMP then i will learn nothing, if i look at the GMP source, i learn nothing because it is mostly assembly. other programs writen in c are barely...
well, currently the largest merrsine prime is 2^30,402,457 - 1, that digit is roughly 9,152,052 dec digits long. i am not wanting to waste 30k to store the smaller primes that can be stored in 128...
sorry, not thinking, all prime numbers are odd except two.
and no prime number will have an integer sqrt, however, getting the sqrt of the number before hand will eliminate checking the sqrt...
1) your repeatedly checking the sqrt of iNum, do it once, before the loop, your wasting precious processing power.
2) your checking all numbers, even and odd, all prime numbers (except 2) are prime,...
ok, i am working on a prime number generator/counter (gee, bet ya haven't heard that one today....), i have most of my code written however, except for some of the math, in as much, i want to find...