Loading ...
Sorry, an error occurred while loading the content.

Messages List


AMD RYZEN (copy)

Hello members, have anyone of you a PFGW speed - example for me (incl. test-number , clock and RYZEN-processor type) ? That would be nice ! Best wishes Norman
Norman Luhn
Apr 23


Done.  No interest now in finding larger terms.  Just lucky it's small:  There are problems with the heuristics, but they're tiny for 13-digit numbers as
James Merickel
Apr 15

heuristics changed, and details

Still researching the same thing, but my original results were closer to correct (not sure why).  Here's the PARI program for 10- to 19-digit heuristically
James Merickel
Apr 13

Exceptional Sets of Consecutive Primes

Exceptional Sets of Consecutive Primes As used here, SOR means the sum of the 9 remainders that results, when any positive integer N is divided in order by
Apr 11

Planning work on it (recent by me) today unless ...

I'm told heavier resources are on it already. [Was dedicating my new i7 laptop to increasing the bound on the next Smarandache-Wellin prime (2357-type w/o
James Merickel
Apr 11

Comments about Euclides proof

Hello all I send a link White an article about Euclides proof of the infinitude of prime numbers  Academic paper (PDF): Comments about the Euclid's
Sebastian Martin Ruiz
Apr 9

Re: Successor-prime emirps concatenating to 8 primes (heurisic calcu

I just re-did the expected numbers of these and obtained 0.69, 2.26, and 14 for the numbers of 13-, 14- and 15-digit pairs.  I think it's all due to an
James Merickel
Apr 8

Fw: Re: Successor-prime emirps concatenating to 8 primes

Clarifying.Added note: There's something like 1/3 chance the 1st pair that can be reversed and all is a pair of 13 digits, and expectations of around 1.5 and 7
James Merickel
Apr 7

Successor-prime emirps concatenating to 8 primes

The first term of this sequence of collections of 4 emirps is within range of PARI on my laptop, but if anybody wants to beat me to it right now the comp's
James Merickel
Apr 6


... given that 3 is not needed as 1 of the primes of a Goldbach (GB) prime pair (unproven), then for all integers I=>0, there exists a palindrome for N from I
Bill Krys
Apr 5

No similar triangles in triplets of primes

A triplet of primes: (pa, p, pb) is such that d  =  p - pa  =  pb - p d > 0 Example: (11, 17, 23)   d = 6 Now (p - d)*(p + d)  =  pa * pb Or: p^2 -
Leonel Morales
Mar 21

Re: [PrimeNumbers] No Set of 5 Consecutive TPM’s Exists such that-

Out of curiosity, how did you find the five TPMs? I am trying to find two pairs of prime pairs (pa, pb) and (pa', pb') all greater than 2, such that: for n =
Leonel Morales
Mar 21

Re:_[PrimeNumbers]_No_Set_of_5_Consecutive_TPM=e2=80=99s_Exists such

I suspect that this conjecture is basically the result of the law of small numbers. But in this case, just because you can't find a small example doesn't mean
Jack Brennen
Mar 21

No Set of 5 Consecutive TPMÆs Exists such that--

As used here, TPM means (P+1), where P and (P+2) are prime. One, no set of 5 consecutive TPMÆs exists, such that the sum of each adjacent pair of TPMÆs
Mar 21

Re: Vinogradov's Goldbach Trio

The ternary Goldbach conjecture is now considered proven as of 2013. http://blogs.ams.org/mathgradblog/2013/07/03/infinitude-fermat-numbers/ - Jack On
Jack Brennen
Feb 24
View First Topic Go to View Last Topic