Hello all We can also have: Theorem: Let p and q consecutive prime numbers >=7 Let m=(p+q)/2 m+3 is prime if and only if m-3 is prime. Sincerely Sebastian...
24263
Sebastian Martin Ruiz
s_m_ruiz
Jun 16, 2012 3:37 pm
Hello all: Theorem: Let p and q consecutive prime numbers >=5 Let m=(p+q)/2 m+2 is prime if and only if m-2 is prime. Sincerely Sebastian Martin Ruiz [Non-text...
24262
Maximilian Hasler
maximilian_h...
Jun 15, 2012 2:13 pm
... I found these other cases : [[403, 407, [13, 31], [11, 37]]] [[1003, 1007, [17, 59], [19, 53]]] [[110203, 110207, [193, 571], [191, 577]]] [[118003,...
24261
woodhodgson@...
woodhodgson...
Jun 14, 2012 9:34 pm
I'm referring to composite numbers ending in 1,3,7 or 9. Noting that 403=13*31, 407=11*37, and also 1003=17*59, 1007=19*53; in both cases there are adjacent...
24260
Kermit Rose
kermit1941
Jun 14, 2012 6:07 pm
Here are a few test runs of my algorithm based on the observation that often a proper factor of (A+B) is equal to a proper factor of A + a proper factor of B. ...
24259
Kermit Rose
kermit1941
Jun 14, 2012 11:52 am
Hello. I'm in the process of debugging another factoring algorithm. I'll be testing it on the Mersenne numbers, 2**p - 1. This algorithm is based on the...
24258
Norman Luhn
n.luhn
Jun 6, 2012 9:59 am
Maybe correct, but in my opinion to calculate a sum of a term from 1 to 1/2 sqrt(N) is harder than fermattest or wilson's theorem p is prime so (p-1)!+1=0...
24257
john saccuan
saccuan_john
Jun 6, 2012 9:29 am
Sir, Can you please verify this formula: http://www.primenumbersformula.com/default.htm Regards, John Saccuan [Non-text portions of this message have been...
24253
paulunderwooduk
Jun 1, 2012 2:37 am
... In FFT land, this neat version would save 2 forward transforms for each bit, compared to my rather clumsy left-to-right algorithm given in section 4, Paul...
24252
djbroadhurst
May 30, 2012 10:46 pm
... Yes. I wrote 2 + 1 for Frobenius only to paraphrase CP Algorithm 3.5.9. But batch processing should be done as 1 + 2, as per BPSW 1 + 2. Note that in your...
24251
djbroadhurst
May 30, 2012 9:53 pm
... Indeed. The decoupled version of CP Algorithm 3.5.9, with Paul's preferred parameters, is Lucas with parameters (P,Q) = (c,1); Fermat with base d = 2*x+5,...
24250
Phil Carmody
thefatphil
May 30, 2012 7:33 am
... Sounds pretty neat. One caveat with two-for-the-price-of-one deals is that the two bits you get back might not actually be independent of each other, so...
24249
paulunderwooduk
May 30, 2012 7:03 am
... I need to amend this incarnation to 2 + 1 selfridge(s) for Grantham's RQFT as is clearly stated in C&P; The Lucas chain has to be computed first -- but...
24248
djbroadhurst
May 29, 2012 9:40 pm
... Paul Underwood's preprint at http://www.mersenneforum.org/showpost.php?p=298027&postcount=44 has a rather neat observation in Section 4, which is all one ...
24247
paulunderwooduk
May 16, 2012 10:19 pm
... I should say that the program by Jen K. Andersen is a "psp-sieve" -- it generates a list of pseudoprimes for a given base and range, where gcd(base,n)==1....
24246
paulunderwooduk
May 16, 2012 9:47 pm
... Jens K. Andersen! Sorry Paul...
24245
paulunderwooduk
May 16, 2012 9:42 pm
... Please see my draft paper at: http://www.mersenneforum.org/showpost.php?p=298027&postcount=44 (Ignore the the mix up I made with the comparison between FFT...
24244
Chris Caldwell
primemogul
May 16, 2012 3:16 pm
... You might consider asking these non-prime questions at the web site http://math.stackexchange.com. If you word your question well, e.g., add an example to...
24243
Jane Sullivan
budgie692002
May 16, 2012 2:03 pm
Hi Sorry to be a nuisance, but can someone direct me to an algorithm for extracting the square root of a polynomial, please? -- Jane Beckenham...
24242
praxismax
May 13, 2012 12:10 pm
No response from Brian to my private email, putting to him the last question I posted here :(. If anyone else can help with that Riemann equivalence, I'm all...
24241
Kermit Rose
kermit1941
May 13, 2012 5:27 am
... 0 ... 0 ... 0 Looks remarkable. ... 28 Oops: Break in the pattern. Another illustration of the law of small numbers. :)...
24240
bhelmes_1
May 12, 2012 6:31 pm
Dear David, ... i changed the algorithm http://109.90.3.58/devalco/suf_prime_2.html First of all i limit the search for p=3 mod 4 Instead of a strong...
24239
Chris Caldwell
primemogul
May 10, 2012 7:26 pm
As some of you old-timers know, this discussion list was started by "The Prime Pages" and once every year (or three) I ask for advice. My University has been...
24238
djbroadhurst
May 10, 2012 12:18 am
... Bertil's super-Granville gap is indeed notable: http://primes.utm.edu/curios/page.php/1693182318746371.html How much higher might anyone have looked for...
24237
djbroadhurst
May 10, 2012 12:01 am
... I suggest that you ask Brian: http://www.aimath.org/conrey/ David...
24236
praxismax
May 9, 2012 5:15 pm
Hi, Can anyone supply me with a reference to the proof that the Riemann Hypothesis is equivalent to the proof that for all n prod(P(n))/phi(P(n)) > e^g *...
24235
Andrey Kulsha
andrey_601
May 9, 2012 12:25 pm
If there are k composites preceding Nth prime, then the proposed merit is k / (log N)^2 There are 17 known gaps with merit > 1: merit k N 1.15817 3...
24234
kadhirvel
kadickv
May 8, 2012 11:52 am
Hi, I had a methodology(may be not efficient had a intuition it will be useful) to generate all odd composite. Factors of all odd composites are predetermined...
24233
djbroadhurst
May 7, 2012 3:27 pm
... You cannot determine whether this is the case without factorizing the target. Your code seems to ask for a positive kronecker symbol (which you call...
24232
bhelmes_1
May 7, 2012 11:00 am
1. A criteria to distinguish primes from composite numbers: a) If and only if an odd number p > 5 has two solutions in the field of adjoined square root A with...
