User Portlet
| Discussions |
|---|
| Yes, that is better, I really appreciate it. |
| A back-of-the-envelope computation suggests that to get `n` digits, one requires in the ballpark of `LogIntegral[Log[10.]*10^n]` primes. For `n=10^9`, that's around 112,307,000. Quick check at 10^5. Approximate the count: In[1002]:=... |