Skip to search.

Breaking News Visit Yahoo! News for the latest.

×Close this window

primenumbers · Prime numbers and primality testing

The Yahoo! Groups Product Blog

Check it out!

Group Information

  • Members: 1091
  • Category: Number Theory
  • Founded: Dec 27, 2000
  • Language: English
? Already a member? Sign in to Yahoo!

Yahoo! Groups Tips

Did you know...
Real people. Real stories. See how Yahoo! Groups impacts members worldwide.

Messages

Advanced
Messages Help
  Newest  |  < Newer  |  Older >  |  Oldest
Topics Messages Latest Post

hi C_twin=pi^2/12*prod(p>=5 odd primes) (1-2/(p*(p-1)))=0.66016.. You will need tens of thousands of terms to get several decimal places, but the appearance of...
7 Feb 15, 2013
5:14 pm

Jack Brennen
jbrennen
Send Email

The problem with 19 turned out to be minimal.  There is a unique (up to permutations) way to do with 19 for the first 56 primes what was done for 7 with the...
2 Feb 12, 2013
3:28 pm

James Merickel
moralforce120
Send Email

The set {11,13,17,19, 41,43,47, 71,73,79, 101,103,107,109} shows two sets of quadruplets 90 apart, and the intervening "+30" and "+60" decades have triplets...
3 Feb 11, 2013
9:12 pm

woodhodgson@...
woodhodgson...
Send Email

Dear groupmembers, The conjecture, which did not make a whole lot of sense anyway and was already showing itself unsupported empirically before the following...
6 Feb 11, 2013
5:40 pm

James Merickel
moralforce120
Send Email

Hi, folks.  Just wanted to inform you all of a little thing I have computed:   16072758981106442684006718854529251552093=   ...
1 Feb 7, 2013
8:07 pm

James Merickel
moralforce120
Send Email

Hi, congratulations to Curtis Cooper and GIMPS for finding the prime: 2^57885161-1, with 17,425,170 decimal digits. http://www.mersenne.org/ Paul...
7 Feb 6, 2013
4:59 pm

Phil Carmody
thefatphil
Send Email

Hi, I have devised a new composite test for odd n with x: gcd(x^3-x,n)==1 (mod n) kronecker(x^2-4,n)==-1 and the sub-test: (L+1)^n==-L^3+(x^2-2)*L+1 (mod n,...
26 Jan 30, 2013
9:18 pm

paulunderwooduk
Send Email

Hello, I have an issue testing the following sequence past term 129. <a href="http://oeis.org/search?q=a059459&sort=&language=english&go=Search">A059459</a> It...
1 Jan 30, 2013
10:14 am

hotprime
Send Email

Hello, This appears to be a nice group. I have an interest in primes, so I thought I would contribute. What a coincidence, I appear to have the same handle...
19 Jan 29, 2013
9:14 am

Paul Leyland
paul@...
Send Email

Hi It is known that an area close to the square root of a number does not yield any factors. Can anyone give me any references / reports of investigations into...
1 Jan 28, 2013
10:15 am

ronhallam@...
hallam_ron
Send Email

It allows you to find the gcd of two numbers. Is there a formula that predicts the maximum number of steps to get the gcd?...
3 Jan 22, 2013
3:55 pm

djbroadhurst
Send Email

The classical analysis of the GCD algorithm uses the Fibonacci sequence Theorem: If a>b.ge.0 and the Euclid's algorithm uses k.ge.1 recursive steps then...
1 Jan 22, 2013
12:47 pm

Hugo Scolnik
hugoscolnik2002
Send Email

Some subscribers to this prime numbers group may be interested in the Unsolved Problems web site at http://unsolvedproblems.org/ and/or the associated Yahoo!...
3 Jan 21, 2013
6:13 am

Tim R
tsr21
Send Email

Ron Maimon asks an interesting question here http://mathoverflow.net/questions/72451/how-many-primes-does-euclids-prime-generating-algorithm-really-produce His...
1 Jan 17, 2013
8:12 pm

WarrenS
warren_d_smi...
Send Email

I use Mathematica 7 and Windows 7. With this implementation the maximum value it can handle is PrimePi[249999999999999]=7783516108362. I don't know where they...
2 Jan 10, 2013
12:21 am

pbtoau
Send Email

Consider these 4 prime numbers namely, A= 1049681, B= 1049683, C= 1049861, D= 1049863. Some interesting facts are: One, A and B are twins. C and D are twins...
2 Jan 9, 2013
3:17 am

Jens Kruse Andersen
jkand71
Send Email

I like how when I write about adding digits in prime numbers or noticing that primes like 113 311 and 131 share a similar property I am somehow in fantasy land...
1 Jan 8, 2013
11:28 pm

mgmutch
Send Email

(Quite likely this is already well known.) Suppose we consider the integers mod M (for some modulus M>1) that are relatively prime to M. The total cardinality...
6 Jan 8, 2013
4:04 pm

djbroadhurst
Send Email

NewPGen is the fastest primorial sieve app I've every tried. I couldn't understand its sieve method for k*n#+-1 and even I tried to compete with it in the...
8 Jan 8, 2013
3:47 pm

Jens Kruse Andersen
jkand71
Send Email

I see some others have spotted the error already, but anyhow the CORRECTED THEOREM is that the residues relatively prime to modulus M form a cyclic...
2 Jan 7, 2013
4:41 pm

WarrenS
warren_d_smi...
Send Email

I am sorry to inform the list that Richard Crandall died yesterday: http://en.wikipedia.org/wiki/Richard_Crandall David Broadhurst...
4 Jan 1, 2013
3:34 am

djbroadhurst
Send Email

Let t be the smaller partner of a prime twin (t, t+2). Who has fast enough hard- and software to calculate the infinite product P t/(t-1), t=3,5,11… ? I...
24 Dec 31, 2012
11:42 am

djbroadhurst
Send Email

Finally, we got it: Prime 19-tuplet 630134041802574490482213901 + d, d = 0, 6, 10, 16, 18, 22, 28, 30, 36, 42, 46, 48, 52, 58, 60, 66, 70, 72, 76 (27 digits,...
37 Dec 31, 2012
11:35 am

Jens Kruse Andersen
jkand71
Send Email

From: Jens Franke (Tuesday, December 11, 2012 4:58 AM) We have confirmed the primality of the Leyland numbers 3110^63+63^3110 (5596 digits) and...
6 Dec 14, 2012
5:17 pm

Phil Carmody
thefatphil
Send Email

(6 x + 1) (12 x + 1) (18 x + 1) is a Carmichael number if all three factors are simultaneously prime and where x>0 is integer. I searched for other such...
6 Dec 13, 2012
10:34 pm

WarrenS
warren_d_smi...
Send Email

It seems the following concept ought to be important: "k-Generalized Carmichael numbers." DEFINITION: If N is composite and squarefree and: for all primes p...
6 Dec 12, 2012
10:28 pm

WarrenS
warren_d_smi...
Send Email

Hi, my apology to the group and especially David Broadhurst if I have presented the following composite test before. For odd n find x: gcd(x,n)==1 ...
24 Dec 12, 2012
10:23 am

djbroadhurst
Send Email

http://newfrontierslandscaping.com/wp-content/plugins/akismet/google.html [Non-text portions of this message have been removed]...
1 Dec 12, 2012
1:32 am

Robin Garcia
sopadeajo2001
Send Email

http://www.mersenneforum.org/showpost.php?p=321306&postcount=1 Paul...
1 Dec 11, 2012
1:18 pm

paulunderwooduk
Send Email

Have a look please at this family of polygonal matricially structured m x m fractals with layers of which Sierpinski Triangle and Carpet are just particular...
1 Dec 11, 2012
11:57 am

sopadeajo2001
Send Email
  Newest  |  < Newer  |  Older >  |  Oldest
Add to My Yahoo!      XML What's This?

Copyright © 2010 Yahoo! Inc. All rights reserved.
Privacy Policy - Terms of Service - Guidelines NEW - Help