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: 1090
  • Category: Number Theory
  • Founded: Dec 27, 2000
  • Language: English
? Already a member? Sign in to Yahoo!

Yahoo! Groups Tips

Did you know...
Message search is now enhanced, find messages faster. Take it for a spin.

Messages

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

A new book entitled "Number Theory from an Analytic Point of View" is out. More details at: http://free.hostdepartment.com/b/badih Thanks....
2 Jan 22, 2005
6:38 pm

badih_ghusayni
Send Email

Let p a prime. Form q=3*p-2 and r=3*p*q. If q is prime then i^((r-1)/2) = i mod r for all prime i, 3<i<r Do you think it is hard to prove?...
13 Jan 22, 2005
4:04 pm

Décio Luiz Gazzon...
deciogazzoni
Send Email

As you know 1/7 is periodic and its period length is 6. 1/17 is periodic and its period length is 16. 1/29 is periodic and its period length is 28. What 7, 17...
8 Jan 20, 2005
5:57 pm

Jud McCranie
judmccr
Send Email

I am new here and only here for one reason... To show to you my theory about the distribution of primes and to show that they are not random. It is actually...
2 Jan 20, 2005
1:04 pm

Chris Caldwell
primemogul
Send Email

Here is a primality test but I don't know if it is computationally efficient. Define the serie U by U(0)=1 and U(n+1)= U(n)*(4-2/(n+2)) The primality test is: ...
4 Jan 20, 2005
12:34 pm

Décio Luiz Gazzon...
deciogazzoni
Send Email

Let p a prime, p>5, and q=2*p+1. q is prime if and only if there exists a, a>1, such that: a^p=1 mod q. In particular, a can be any number such that...
5 Jan 20, 2005
12:03 pm

mikeoakes2@...
mikeoakes2
Send Email

I very much need all primes with 17 digits and more. Can you tell me where to get them? Or if you havethem please e-mail me....
8 Jan 20, 2005
5:01 am

Milton Brown
miltbrown@...
Send Email

Torbjörn Alm has retaken the 8-tuplet record: 97510235*421# + 322355908991 + 0, 2, 6, 8, 12, 18, 20, 26 (180 digits) I just realized it was 18 months ago I...
1 Jan 19, 2005
9:44 pm

Jens Kruse Andersen
jkand71
Send Email

There is a search going on to look at Sierpinski base 5 where the lowest k is thought to be 159986 More information is available at ...
2 Jan 19, 2005
4:43 pm

Gary Chaffey
garychaffey2
Send Email

I have made a mistake in the previous message. s has to be the SMALLEST number so that s is prime and s> r+1...
2 Jan 18, 2005
8:56 pm

jbrennen
Send Email

let p be a prime number and r is product of all primes from2 including p r=2*3*5*7*......*p s is anumber so that s>r+1 and s is prime. If t=s-r then t is...
4 Jan 18, 2005
8:09 pm

mikeoakes2@...
mikeoakes2
Send Email

Hello ! I found (perhaps) that 2^p-1 is mersenne prime, if a^p-1 <> 0 (mod 2^p-1) for all a , a<>2^n, n element N. Is it trival ? 2^11-1 not prime -> 39^11-1 =...
1 Jan 17, 2005
8:33 pm

Norman Luhn
nluhn
Send Email

Hi All, Being particularly interested in Multifactorials I noticed the above recent addition to the top 5000. I manage a search for multifactorial primes ...
3 Jan 16, 2005
1:15 pm

Ken Davis
kraden
Send Email

It has taken me several days to figure it out, but I now understand why the first relationship (X+4) works. However I'm totally mystified as to how/why the...
3 Jan 15, 2005
2:44 pm

J_M_Berg
Send Email

does anybody know where to find such k's for which neither 6k-1 nor 6k+1 is prime or a program that finds such k's. please e-mail me if you have such...
3 Jan 14, 2005
7:21 pm

LALGUDI BALASUNDARAM
lalgudibalas...
Send Email

Hi all, What can I use to sieve for N=35*10^k - 1? And, would this form be considered near-repunit? I did not see this form in Multisieve, but I suspect that...
5 Jan 14, 2005
7:09 pm

Mark Rodenkirch
mgrogue
Send Email

14.1.05 I have a growing interest in prime numbers and recently read Prof Marcus du Sautoy book the music of primes. In his book he mentions Eulers formula x2...
2 Jan 14, 2005
3:36 pm

mikeoakes2@...
mikeoakes2
Send Email

Is it possible to find such a and b that for all c's ( a<c<b and c is multiple of 6) either c-1 or c+1 is prime? I am interested in very big a and b. Also...
2 Jan 13, 2005
11:12 pm

Jens Kruse Andersen
jkand71
Send Email

Lets s(n) be sum of first n primes. For which n is s(n) prime? It is clear that n has to be even. Can you tell me where to find information about this subject?...
2 Jan 13, 2005
5:15 pm

jbrennen
Send Email

1 REM This is a program showing that below every even number y the superficial prime pairs fulfils Goldbach's conjecture:as y increases the number of even...
1 Jan 12, 2005
10:48 am

zaljohar
Send Email

Congratulations to Predrag Minovic for finding a new record Sophie Germain Prime pair. 7068555 · 2121302-1 36523 L100 2005 Sophie Germain (2p+1) 7068555 ·...
2 Jan 11, 2005
10:31 pm

pminovic
Send Email

The actual number is (2^226749-1)^2-2 with 136517 digits. Steven Harvey...
1 Jan 11, 2005
8:55 pm

harvey563@...
harvey563
Send Email

I'm announcing the discovery of the 38th Carol prime, (2^227493-1)^2- 2 by me this 11th of January. Steven Harvey...
2 Jan 11, 2005
8:46 pm

Cletus Emmanuel
cemmanu
Send Email

Guys, I've been looking at the following equation; R=4^k +/- P*2^(k-1) - 1, where k = 2,3,4 ... and P is a prime number. The two (or four) most interesting...
2 Jan 11, 2005
3:10 pm

Rob Binnekamp
robdine2004
Send Email

This program is a rough test for the solution of Goldbach's conjecture presented in the message titled: final corrected version of trying solving goldbach's...
1 Jan 9, 2005
3:21 pm

zaljohar
Send Email

hi, Consider 1. If p is prime and p+k is prime then p+k divides p^(p+k) + k. 2. the converse If p is prime and p+k is composite and p+k divides p^(p+k) +k,...
1 Jan 9, 2005
8:23 am

cino hilliard
hillcino368
Send Email

Hello! I have created a ms EXCEL macro to create a colorful graphic using a sequential list of prime numbers 2 through 19997 (about 2262 in the list). The...
1 Jan 8, 2005
9:28 am

slarom69
Send Email

If I'm given a fraction x/y = a_0 + 1/(a_1 + 1/(a_2 + ... + 1/(a_n)...)), what is the fastest way to compute w/z = a_0 + 1/(a_1 + 1/(a_2 + ... + ...
1 Jan 8, 2005
4:10 am

Décio Luiz Gazzon...
deciogazzoni
Send Email

I've recently discovered primes and find it fashinating, i'm currently trying to find as many primes as possible that follow the pattern of (x^x)+1 = prime. So...
3 Jan 8, 2005
2:50 am

cino hilliard
hillcino368
Send Email

I want to try and get the follow congruencies to combine it with Proth's theorem. Any suggestions? 1) Let N = the number to test a^(2*N) - a^(N-1)*(a^2+1) + 1...
1 Jan 7, 2005
4:26 am

John W. Nicholson
reddwarf2956
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