Is it realistic to calculate and store the following info
For every (composite) mersenne number, if it had a factor of x bits/digits, how likely would have the factor been already discovered.
If we store by digits from 21 to 70 then there will be 50 floating point numbers for each exponent. Storing by bits for the same range will yield about 166. Either way it's not a huge demand for storage, so the only problem is to calculate it correctly.
Last fiddled with by Ensigm on 20200917 at 00:21
