Raanan continues running my program aimed at AP22 with difference divisible by 37# and here is another record: 126599504321565949 + 912*37#*n, n=0..21 (Raanan...
19473
scolnik@...
scolnik2003
Jul 3, 2008 5:58 pm
http://arxiv.org/PS_cache/arxiv/pdf/0807/0807.0090v3.pdf Hugo Scolnik A professor is one who talks in someone else's sleep. [Non-text portions of this message...
19475
Mark Underwood
marku606
Jul 5, 2008 2:55 am
... If it is true, I await the elementary version, hehe. About the only line of mathematics which I comprehended was on page 35 where it said: ...
19478
Kermit Rose
kermit1941
Jul 7, 2008 10:28 pm
It took me a long time to figure out the algorithm of the extended greatest common divisor. Now I can explain it in the way that I would have liked someone to...
19479
Sebastian Martin
sebi_sebi
Jul 8, 2008 9:49 am
Can anyone prove the following result? THEOREM: Let p(n-1), p(n), p(n+1) three consecutive prime numbers. We have: 1/2< ...
19480
Jens Kruse Andersen
jkand71
Jul 8, 2008 1:25 pm
... I suggest you get a math program (like PARI/GP used below) and do some quick experimenting before publishing alleged theorems. ? {for(n=2,1000, ...
19481
Sebastian Martin
sebi_sebi
Jul 8, 2008 3:25 pm
I have tested for n=1 to 200000 and I have new possible bounds: Let p(n-1), p(n), p(n+1) three consecutive prime numbers. We have: 1/E < ...
19482
Sebastian Martin
sebi_sebi
Jul 8, 2008 3:44 pm
Forget it, I go away to the beach, I need a few vacations. P.D. There are any bound? ... De: Sebastian Martin <sebi_sebi@...> Para: Lista de Matemáticas...
19483
Jens Kruse Andersen
jkand71
Jul 8, 2008 4:35 pm
... A good strategy can find better extremes than brute force. The prime sums p(n+1)+p(n) and p(n)+p(n-1) are both even (assuming n>2). Considering the...
19484
Jens Kruse Andersen
jkand71
Jul 8, 2008 6:51 pm
... Below is a similar case with the low value 0.14394..., close to 1/6.94684. ? p=5280767204*prod(i=1,primepi(2411),prime(i))-1; ? p1=nextprime(p-2466);...
19485
Ken Davis
kradenken
Jul 10, 2008 1:47 am
Hi All, Over the last 6 months I've been searching for a 7716 digit triple. Using a method first used by David Broadhurst I have been prping numbers of the...
19486
Dick
richard042
Jul 10, 2008 1:49 am
Hello all, I am working on a short paper on a nice little discovery I made. I'd like to ask everyone to have a look and give me feedback before I submit it....
19487
Jens Kruse Andersen
jkand71
Jul 10, 2008 2:33 am
... There is something wrong *and* you are unlucky, but not extremely unlucky. Suppose that after getting a prp for c=7, you test the four other numbers in ...
19488
Ken Davis
kradenken
Jul 10, 2008 2:42 am
... in 90 ... extremely ... unlucky. ... numbers in ... or 3 ... was. ... taken ... triple of ... So the probability of a pair yielding a triplet is 1 in 240...
19489
John W. Nicholson
reddwarf2956
Jul 10, 2008 6:02 am
Let N be a integer. How does one go about finding the largest factor, c, less than the square root of a number, N^(1/2)?...
19491
Jose Ramón Brox
ambroxius
Jul 10, 2008 10:43 pm
From: "John W. Nicholson" <reddwarf2956@...> ... If N is even, factor with 2 until you get N' odd. Once N' is odd, you can write N' as the difference of...
19493
aldrich617
Jul 12, 2008 12:25 pm
This is a Prime Chain of 128 terms, including 104 distinct primes, consisting of the output of eight equations that alternate sequentially within a procedural...
19494
aldrich617
Jul 12, 2008 12:42 pm
This is a Prime Chain of 224 terms consisting of the output of 2x^2 +29 repeated four times, alternating with these same terms in reverse within a procedural...
19495
jarek372000
Jul 17, 2008 5:41 am
I have found another SP19 record (also SP20): 28195514826922573189 + 29#*n, n=0..19 Jarek...
19496
jarek372000
Jul 18, 2008 4:16 pm
I have found another SP19 record (also SP20): 30702013451021547907 + 29#*n, n=0..19 Jarek...
19497
Sebastian Martin
sebi_sebi
Jul 19, 2008 5:40 pm
I have obtained a short equation for the prime numbers. For all n (Prime[Prime[n]]-1)*Product[Prime[Floor[(Prime[n]-1)/i]]-1,{i,1,Prime[n]-1}]= ...
19498
dkandadai
Jul 21, 2008 3:41 am
I am inteested in knowing how very large prime suspects i.e. larger than the capabality of Pollard's rho test, are tested; is it more of a probabality test? ...
19499
Phil Carmody
thefatphil
Jul 21, 2008 8:58 am
... Pollard's Rho is a factor-finding algorithm. It is impractical to use it as a primality test. For information on primality tests, just see...
19500
Chris Caldwell
primemogul
Jul 21, 2008 2:14 pm
Eric Rowland notes that if you set a(1) = 7, and for n ™ 2 set a(n) = a(n-1) + gcd(n,a(n-1)); then a(n) - a(n-1) (the "first differences") are all either 1...
19501
aldrich617
Jul 21, 2008 9:25 pm
This is a Prime Chain of 161 consecutive terms, including 155 distinct primes, consisting of the output of four well-known prime-producing equations that ...
19502
dkandadai
Jul 22, 2008 6:04 am
I will be happy if some of you could find the time to go through the item with the title above in forum-Gen questions/PG-research in Planetmath.org and offer...
19503
dkandadai
Jul 23, 2008 3:30 am
Will be glad if any member would furnish the largest known prime of the form x^2 + 1.Tks, A.K.Devaraj...
19504
Jack Brennen
jbrennen
Jul 23, 2008 4:44 am
Pretty sure that it's the number: 24518^262144+1 which seems to be #15 on the list of the largest known primes as I write this....
19505
dkandadai
Jul 25, 2008 3:21 am
In view of Jack Brennen"s info members may read the continuation of my heuristic in Planetmath.org ( forum-gen. questions/PG and research). A.K.Devaraj...
19506
Sebastian Martin
sebi_sebi
Jul 25, 2008 9:34 am
Conjecture: For all prime p>=19 we have p=3q+2r q and r are both primes. Sincerely: Sebastián Martín Ruiz ...
