Anonymous user
Talk:Untouchable numbers: Difference between revisions
→reduction in the number of (counting) ranges: first failure at 300,000
(→reduction in the number of (counting) ranges: no idea were to get the right factor for checking) |
(→reduction in the number of (counting) ranges: first failure at 300,000) |
||
Line 21:
Limit //100*1000*1000;//10*1000*1000;//5*1000*1000;//1000*1000;
factor //384( to small ) ;//152;//104;//64; // search area = factor*Limit</pre>
:How about using Goldbach conjectue ( tested true > 1e18 ).All numbers are a sum of max three primes<BR>
proper div sum(p*q) = 1+p+q / p<>q and both prime and p*q <Limit
proper div sum(p*q*r) = 1+p+q+r+p*q+p*r+q*r/ p<>q<>r and all prime and p*q*r <Limit
: is limit for checks == limit^(1/3)
:<b>EDIT found earlier failure at 300,000</b> used special glasses ;-)
<pre>
//url=https://math.dartmouth.edu/~carlp/uupaper3.pdf
100000
200000 28572
300000 43515
but I get, testing fo 100,000,000 with limit 46,400,000,000 that is 154,666 x 300,000:
154,666 is bigger than 0.5 * 300,000
100,000
200,000
300,000
</pre>
▲:::Maybe Nigel can test up to 6 million one night --[[User:Horsth|Horsth]] ([[User talk:Horsth|talk]]) 09:55, 4 September 2021 (UTC)
== Number of untouchable numbers up to 1 million ==
| |||