Search the web
Sign In
New User? Sign Up
primenumbers · Prime numbers and primality testing
? Already a member? Sign in to Yahoo!

Yahoo! Groups Tips

Did you know...
Want your group to be featured on the Yahoo! Groups website? Add a group photo to Flickr.

Best of Y! Groups

   Check them out and nominate your group.
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.

Messages

  Messages Help
Advanced
Messages 21095 - 21125 of 21125   Oldest  |  < Older  |  Newer >  |  Newest
Messages: Simplify | Expand   (Group by Topic) Author Sort by Date ^
21095
A couple of easy counterexamples can be found, for n = 16 and n = 36, both of which meet your hypothesis, but both of which are known not to be prime....
Jack Brennen
jbrennen
Offline Send Email
Nov 11, 2009
3:55 pm
21096
Hi Bill, ... I believe you were trying to say something like this (at least that's what your sample calculation suggests): If n >= 2 and F(n) = 2^(2^n) + 1....
Peter Kosinar
pkosinar
Offline Send Email
Nov 11, 2009
7:03 pm
21097
... It also fails for n = 256: {if(Mod(2,36986355*2^258+1)^(2^256)+1==0 &&Mod(2,2^255+1)^(2^256)+2==0,print(fail))} fail David...
djbroadhurst
Offline Send Email
Nov 12, 2009
2:50 am
21098
Hi, All. It would be great if I could get some feedback on this. I have completed a third proof of the Riemann Hypothesis, this one being the only one I...
JeffC
antidyne
Offline Send Email
Nov 12, 2009
1:38 pm
21099
whoa, I got a lot of responses!; didn't have time to look at any of them. I made the correction to the typo earlier, but sent the e-mail to myself; this proof...
Bill Bouris
leavemsg1
Offline Send Email
Nov 12, 2009
2:37 pm
21101
... did you mean "if" ? But it's still wrong for n=16 (and n=36) : F(16) = -1 (mod 2^15+1) but F(16) is known to be composite, as Peter wrote, it is divisible...
maximilian_hasler
maximilian_h...
Offline Send Email
Nov 12, 2009
4:33 pm
21102
I happened to look at http://primes.utm.edu/bios/top20.php?type=person&by=PrimesRank and was struck by the fact that Bouk de Water, without needing to prove...
djbroadhurst
Offline Send Email
Nov 12, 2009
11:45 pm
21103
A quick question if I may. If a prime number does not have the same digit occuring within it more than once, what is that number called (and yes I know there...
James J Youlton Jr
youjaes
Offline Send Email
Nov 13, 2009
2:17 am
21104
... They are simply called primes with distinct digits in http://www.research.att.com/~njas/sequences/A029743 which says: "This sequence has 283086 terms, the...
Jens Kruse Andersen
jkand71
Offline Send Email
Nov 13, 2009
2:44 am
21105
Oh my, what a disappointment. I thought for sure they would have a name. Perhaps we can name them? Three possibilities among many occur to me: "Unidigital...
James J Youlton Jr
youjaes
Offline Send Email
Nov 13, 2009
2:51 am
21106
While I'm here, I'd like to invite everyone to participate in an online prime search contest. The contest "Tribal Primes" at...
James J Youlton Jr
youjaes
Offline Send Email
Nov 13, 2009
4:41 am
21107
Xeno Riddle An anthropologist and a mathematician strolled through the forest. Suddenly they came upon an extratresterial camp. The two extratresterials,...
Kermit Rose
kermit1941
Offline Send Email
Nov 13, 2009
6:13 pm
21108
That mathematician is good. All I can see is that the pattern in the first is repeated somewhere in each of the succeeding eight patterns. And, the 1st, 3rd...
marku606
Offline Send Email
Nov 14, 2009
2:18 pm
21109
Here are new AP16 & AP17 records at 42 digits:- (263013824+18107251*n)*83#+1 is prime for n=0..16 All confirmed prime with PFGW -tc Input/output statistics:- ...
mikeoakes2
Offline Send Email
Nov 14, 2009
2:52 pm
21110
... That is, indeed, rather pleasing. Best regards, David...
djbroadhurst
Offline Send Email
Nov 14, 2009
4:33 pm
21111
I have just submitted to Chris's database a pair of primes that, at 25055 digits, will come in at rank 16 on his Top-20 Twins page ...
mikeoakes2
Offline Send Email
Nov 14, 2009
6:36 pm
21112
... Congratulations! http://users.cybercity.dk/~dsl522332/math/aprecords.htm is updated. That AP17 may last a while. I'm not trying to retake it. -- Jens Kruse...
Jens Kruse Andersen
jkand71
Offline Send Email
Nov 14, 2009
7:56 pm
21113
Greetings all, let o_p(2) = order of 2 in F_p. in other words, o_p(2) = card{ 2^0 (mod p), 2^1 (mod p), ... , 2^p (mod p) } we know that it is an open...
LEGalup
Offline Send Email
Nov 15, 2009
8:44 am
21114
... Counterexample: o_137(2) = (137 - 1)/2 = 68 o_p(2) is provably a divisor of p-1 for prime p. By the Artin conjecture, it is a proper divisor of p-1 for...
djbroadhurst
Offline Send Email
Nov 15, 2009
11:49 am
21115
David, you are absolutely correct, i misstated that conjecture. the conjecture asks whether o_p(2) = p-1 for infinitely many primes. this would correspond to ...
luis galup
LEGalup
Offline Send Email
Nov 15, 2009
3:17 pm
21116
... That was as per 6 Jun. Just over 5 months on, the revised table is:- rank k d s=(k+4)*log(d) ... 1 8 1057 83.558 2 3 137514 82.817 3 12...
mikeoakes2
Offline Send Email
Nov 17, 2009
7:50 pm
21117
You might be interested in the following two variable function. Define F(m,k) recursively as follows. F(1,1) = 15 F(m+1,k) = F(m,k) + 4*(2*m + k + 2) F(m,k+1)...
Kermit Rose
kermit1941
Offline Send Email
Nov 18, 2009
12:16 am
21118
Hello Kermit, it seems that my emails can't reach you due to some unexplainable blacklist on some router near you. So I answer on the list : ... <snip> ... can...
Yann Guidon
yasep16
Offline Send Email
Nov 18, 2009
5:02 pm
21119
Given any prime expressed as a+b, is there always some a,b such that 2^a*3^b is one away from a prime? I doubt it but have yet to find a counterexample. Below...
marku606
Offline Send Email
Nov 19, 2009
3:59 pm
21120
... I expect infinitely many counter examples but there are none below 7500. I only computed one prime for each prime sum a+b. -- Jens Kruse Andersen...
Jens Kruse Andersen
jkand71
Offline Send Email
Nov 19, 2009
10:39 pm
21121
... I think you're right Jens, infinitely many. By observation, the average number of solutions for a given prime seems to be roughly constant, around 10. For...
marku606
Offline Send Email
Nov 20, 2009
4:33 am
21122
1a. Re: Composite integer function Posted by: "Yann Guidon" whygee@... yasep16 Date: Wed Nov 18, 2009 9:02 am ((PST)) Hello Kermit, it seems that my...
Kermit Rose
kermit1941
Offline Send Email
Nov 20, 2009
4:40 am
21123
... Post hoc, ergo propter hoc? ... Your nebulous "algorithm" was surpassed 2200 years ago: http://www.gap-system.org/~history/Biographies/Eratosthenes.html ...
djbroadhurst
Offline Send Email
Nov 20, 2009
5:10 am
21124
2b. Re: Composite number function(2) Posted by: "djbroadhurst" d.broadhurst@... djbroadhurst Date: Thu Nov 19, 2009 9:10 pm ((PST)) ... Hello David. ......
Kermit Rose
kermit1941
Offline Send Email
Nov 20, 2009
3:00 pm
21125
Congratulations to Henry Lifchitz for finding a record Fibonacci PrP http://www.primenumbers.net/prptop/detailprp.php?rank=5 Lélio [Non-text portions of this...
Lélio Ribeiro de P...
lelio_73
Offline Send Email
Nov 21, 2009
3:10 am
Messages 21095 - 21125 of 21125   Oldest  |  < Older  |  Newer >  |  Newest
Advanced
Add to My Yahoo!      XML What's This?

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