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...
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...
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...
... 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, ...
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...
... 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...
... 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);...
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...
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....
... 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 ...
... 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...
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...
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...
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...
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? ...
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...
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 ...
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...
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...
Having problems with message search?
Fill out this form to ensure your group is one of the first to be migrated to the new message search system.
