[seqfan] Re: A new and surprisingly hard elementary number theory question
njasloane at gmail.com
Thu May 4 21:31:27 CEST 2017
John, Good point! I'll modify the sequence
Neil J. A. Sloane, President, OEIS Foundation.
11 South Adelaide Avenue, Highland Park, NJ 08904, USA.
Also Visiting Scientist, Math. Dept., Rutgers University, Piscataway, NJ.
Phone: 732 828 6098; home page: http://NeilSloane.com
Email: njasloane at gmail.com
On Thu, May 4, 2017 at 2:46 PM, <john.mason at lispa.it> wrote:
> Is it obvious that the sequence is infinite and/or without holes? Excuse me
> if this is an ingenuous question.
> Inviato da iPad
>> Il giorno 4 May 2017, alle ore 19:50, "Giovanni Resta"
> <g.resta at iit.cnr.it> ha scritto:
>> Il 04/05/2017 16:48, Jack Brennen wrote:
>>> So it might be nice to know two things... First, is 100,000,000
>>> values of tau per CPU-minute a reasonable run rate?
>> It is difficult to answer since the rate changes greatly depending on
>> the magnitude of
>> numbers and on the CPU.
>> My C program on a single thread on a i7-3930K (thats doing nothing else),
>> in neighborhood of 10^12 runs at about 1500*10^6 tau/min,
>> and near 9*10^12 at about 800*10^6 tau/min.
>> Using multiple threads these numbers become 6000*10^6 tau/m and
>> and 3000*10^6 tau/m.
>>> If so, where should one continue the search?
>> If my search for the similar sequence A075046 is correct, I've already
>> checked up to 10^13 (which is the limit of my program and also of my
>> Seqfan Mailing list - http://list.seqfan.eu/
> Seqfan Mailing list - http://list.seqfan.eu/
More information about the SeqFan