Forum: Computer Science & Computational Number Theory
2015-11-25, 13:40
|
|
Replies: 50
Views: 14,586
|
|
Forum: Factoring
2015-09-10, 19:30
|
|
Replies: 149
Views: 16,626
Yes, I was aware of that possibility when I was...
Yes, I was aware of that possibility when I was running the calculations, but decided to just use GNFS, as I was mostly interested in learning about GNFS, how to use CADO effectively, etc. However,...
|
|
Forum: Factoring
2015-09-10, 14:12
|
|
Replies: 149
Views: 16,626
|
|
Forum: Computer Science & Computational Number Theory
2015-09-08, 12:27
|
|
Replies: 34
Views: 15,920
|
|
Forum: Computer Science & Computational Number Theory
2015-03-10, 19:10
|
|
Replies: 50
Views: 14,586
|
|
Forum: Computer Science & Computational Number Theory
2015-03-09, 13:29
|
|
Replies: 50
Views: 14,586
Thanks -- I'll fix each of these points in the...
Thanks -- I'll fix each of these points in the next version. (Yes, a node is a shared-memory computer. Multiple nodes together make a cluster. I typically use 16-core nodes with 64 or 128 GB of...
|
|
Forum: Computer Science & Computational Number Theory
2015-03-09, 02:17
|
|
Replies: 50
Views: 14,586
It's true! Thank you for noticing. I actually...
It's true! Thank you for noticing. I actually just got the notice myself, so you are exceptionally fast. If anyone finds any typos, omissions, or errors, please let me know. Again, I am really...
|
|
Forum: Computer Science & Computational Number Theory
2014-12-29, 06:00
|
|
Replies: 50
Views: 14,586
|
|
Forum: Computer Science & Computational Number Theory
2014-12-29, 02:23
|
|
Replies: 50
Views: 14,586
|
|
Forum: Computer Science & Computational Number Theory
2014-12-18, 01:14
|
|
Replies: 50
Views: 14,586
|
|
Forum: Msieve
2014-12-12, 01:52
|
|
Replies: 24
Views: 7,059
|
|
Forum: Computer Science & Computational Number Theory
2014-12-11, 13:36
|
|
Replies: 50
Views: 14,586
Honestly, I remember learning that it is...
Honestly, I remember learning that it is relatively easy to check the parity of π(x), however, I somehow didn't think of this recently. I first worked on π(x) calculations in 2007, then gave up on...
|
|
Forum: Msieve
2014-12-11, 02:49
|
|
Replies: 24
Views: 7,059
For reference, here are build instructions. ...
For reference, here are build instructions. Starting from a fresh install of Ubuntu Server 14.04.1 LTS 64-bit, the following will get you up and running with GGNFS (GitHub commit 3490572ca8, Apr....
|
|
Forum: Msieve
2014-12-11, 01:12
|
|
Replies: 24
Views: 7,059
|
|
Forum: Msieve
2014-12-10, 22:41
|
|
Replies: 24
Views: 7,059
Thank you very much. I am trying to reproduce...
Thank you very much. I am trying to reproduce your work now. I'll also try to isolate the issue with my original instructions. Two questions: Firstly, what version of Python are you using? Secondly,...
|
|
Forum: Computer Science & Computational Number Theory
2014-12-10, 14:59
|
|
Replies: 50
Views: 14,586
Also, ldesnogu, you were right on the money: I...
Also, ldesnogu, you were right on the money: I was happy to have π(281) on hand and the others in the works, in case releasing π(1026) started some kind of arms race with one or multiple of Franke,...
|
|
Forum: Computer Science & Computational Number Theory
2014-12-10, 14:33
|
|
Replies: 50
Views: 14,586
Several people have commented on the small...
Several people have commented on the small stature of 281 as compared to 1026.
The reason I hadn't calculated larger powers of two was priority. If I wanted to simultaneously release π(1026),...
|
|
Forum: Msieve
2014-12-09, 16:32
|
|
Replies: 24
Views: 7,059
|
|
Forum: Msieve
2014-12-08, 22:15
|
|
Replies: 24
Views: 7,059
|
|
Forum: Msieve
2014-12-08, 19:33
|
|
Replies: 24
Views: 7,059
Build Instructions for Ubuntu 14.04
I'm trying to write a script that will take an empty directory on Ubuntu 14.04 and perform all the steps needed to get GGNFS + Msieve + factmsieve.py playing nicely together. Here is what I have:
...
|
|
Forum: Computer Science & Computational Number Theory
2014-12-06, 00:07
|
|
Replies: 50
Views: 14,586
|
|
Forum: Computer Science & Computational Number Theory
2014-12-04, 02:13
|
|
Replies: 50
Views: 14,586
Yes, I calculated pi(2^m) for all m<=81, and...
Yes, I calculated pi(2^m) for all m<=81, and pi(10^n) for all n<=26. For pi(2^78), pi(2^79) and pi(2^80), I found the same values as were previously calculated by J. Franke, T. Kleinjung, J. Büthe...
|
|
Forum: Computer Science & Computational Number Theory
2014-12-03, 14:18
|
|
Replies: 50
Views: 14,586
|
|
Forum: Computer Science & Computational Number Theory
2014-12-02, 20:12
|
|
Replies: 50
Views: 14,586
Prime counting function records
I am pleased to announce the following computations of the prime counting function:
pi(10^26) = 1699246750872437141327603
pi(2^81) = 43860397052947409356492
These values were computed using an...
|
|
Forum: Factoring
2011-06-22, 18:32
|
|
Replies: 24
Views: 3,038
I guess the fact of the matter is that the...
I guess the fact of the matter is that the software is using a combination of interpolation and guessing. So it would be better to improve that combination. I've factored 36 numbers in the 110-130...
|
