Greatest prime dividing the n-th cubefree number: Difference between revisions
Content deleted Content added
→resursive alternative: changed to search for count of cubefree numbers |
m →resursive alternative: correct max prime factor to test 2,642,246 |
||
Line 553:
</pre>
===resursive alternative===
Using Apéry's Constant, which is a quite good estimate.<br>Only checking powers of 10.Not willing to test prime factors >
<syntaxhighlight lang="pascal">
program CubeFree3;
Line 738:
CntDivs := 0;
check(lmt,0,true);
//new
inc(lmt,trunc(Z3*(dezlmt-cnt)));
until cnt = dezLmt;
|