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...
Message search is now enhanced, find messages faster. Take it for a spin.

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 20349 - 20378 of 21093   Oldest  |  < Older  |  Newer >  |  Newest
Messages: Simplify | Expand   (Group by Topic) Author Sort by Date ^
20349
... No progress has been reported since the posting by Max Alekseyev http://www.mersenneforum.org/showthread.php?p=55271#post55271 ... David...
David Broadhurst
djbroadhurst
Offline Send Email
Jun 1, 2009
8:50 am
20350
True; recall that I used the phrase " Hope to prove"; Also the improbabality indicated by me is so great that I can safely challenge anyone to produce a...
Devaraj Kandadai
dkandadai
Offline Send Email
Jun 1, 2009
9:48 am
20351
(1600616052+n*52323192)*617#+1 (n=0-9) describes a 265 digit ap10 cheers Ken Primality testing (1600616052+0*52323192)*617#+1 [N-1, Brillhart-Lehmer-Selfridge]...
Ken Davis
kradenken
Offline Send Email
Jun 1, 2009
1:56 pm
20352
... Congratulations on continuing your AP record sweep, now AP4 to AP10. http://users.cybercity.dk/~dsl522332/math/aprecords.htm is updated. -- Jens Kruse...
Jens Kruse Andersen
jkand71
Offline Send Email
Jun 1, 2009
4:47 pm
20353
Hi Jens, Thanks for the congrats I think I'll move on to something else for a while. My method is not well suited for searches above ap10 Poisson was kind to...
Ken Davis
kradenken
Offline Send Email
Jun 2, 2009
1:37 am
20354
On the other hand all the factors of a Carmichael Number can be Mangammal primes (see A123239-OEIS); example 29341. It is inteesting to note that Maxal had...
Devaraj Kandadai
dkandadai
Offline Send Email
Jun 2, 2009
5:18 am
20355
In my presentation of “Minimum Universal exponent generalisation of Fermat's theorem” at the Hawaii Intl conference in 2006 I had stated that 31 is a ...
Devaraj Kandadai
dkandadai
Offline Send Email
Jun 2, 2009
7:23 am
20356
... I didn't use PFGW, but it's easy to test. In short, your statement is correct. The two smallest factors are 31 and 817469483. If you want to...
Alan Eliasen
aeliasen
Offline Send Email
Jun 2, 2009
8:05 am
20357
Thank you very much; my knowledge of programming is limited to some elementary programming in pari. My approach is purely mathematical. By this I can find...
Devaraj Kandadai
dkandadai
Offline Send Email
Jun 2, 2009
11:38 am
20358
Hi All, ... I third that "wow". I have updated http://www.primes.viner-steward.org/andy/titans.html and http://www.primes.viner-steward.org/andy/annual.html ...
Andy Steward
jpsviking
Offline Send Email
Jun 3, 2009
1:44 pm
20359
Factor Triangle 0 1 0 4 3 0 9 8 5 0 16 15 12 7 0 25 24 21 16 9 0 36 35 32 27 20 11 To construct the triangle:...
Kermit Rose
kermit1941
Offline Send Email
Jun 3, 2009
5:49 pm
20360
The corners of the Ulam Spiral are 4n^2-2n+1 (NE) 4n^2+1 (NW) 4n^2+2n+1 (SW) and 4n^2-4n+2 (SE) [this is always divisible by 2] The first one produces good...
miltbrown@...
Send Email
Jun 3, 2009
6:21 pm
20361
For those interested, exhaustive searching has verified the 2nd HL conjecture for all widths up to 2529 integers. The bounds for the first contradiction are...
Tom
thoeng
Offline Send Email
Jun 3, 2009
7:09 pm
20362
In fact if n is the exponent in 2^n + 29, any value of n ending in 1 or 6 is divisible by 31. This has something to do with group theory. Devaraj ... ...
Devaraj Kandadai
dkandadai
Offline Send Email
Jun 4, 2009
3:07 am
20363
A QUESTION ABOUT PROGRAMMING This pertains to my post: “An indirect primality test of......” For the sake of this example let x = 1000 i.e. The prime...
Devaraj Kandadai
dkandadai
Offline Send Email
Jun 4, 2009
3:53 am
20364
... The idea is to avoid large numbers. If you write Mod( big^something ...) you did not avoid anything. If you write Mod( big, m )^something then you create...
Maximilian Hasler
maximilian_h...
Offline Send Email
Jun 4, 2009
4:21 am
20365
I've been using Google Talk and thought you might like to try it out. We can use it to call each other for free over the internet. Here's an invitation to...
Devaraj Kandadai
dkandadai
Offline Send Email
Jun 5, 2009
6:40 am
20366
Jens Kruse Andersen's very nice "Primes in Arithmetic Progression Records" page at: http://users.cybercity.dk/~dsl522332/math/aprecords.htm lists "The...
Mike Oakes
mikeoakes2
Offline Send Email
Jun 5, 2009
10:56 am
20367
I have extended the Ulam Spiral by starting with a prime number (at the center). Then a large number of primes are on the NW corner values. For 101 at the...
miltbrown@...
Send Email
Jun 5, 2009
3:35 pm
20368
... [snip] I retract yesterday's post. Further reflection and numerical experiments have shown that using "(k+3)" is no better than using "(k+4)", and it is...
Mike Oakes
mikeoakes2
Offline Send Email
Jun 6, 2009
9:48 am
20369
Hi Mike, You're right I like the second ranking better ;-) rank k d s=(k+4)*log(d) ... 1 8 1057 83.558 5 5 7009 79.695 9 7 1290 78.786 ...
Ken Davis
kradenken
Offline Send Email
Jun 7, 2009
12:28 pm
20370
VERIFICATION II The following are lists of some of the a) factors and b) non-factors of 2^(2^521-1) + 61 a) 3 and 7 b)5, 13, 23, 11, 11,31, 317, 191, 19, 37,...
Devaraj Kandadai
dkandadai
Offline Send Email
Jun 8, 2009
8:02 am
20371
Hi Mike, Having now "carefully" read your posting and while still thinking that the end result gives a good indication of difficulty I have questions about the...
Ken Davis
kradenken
Offline Send Email
Jun 9, 2009
7:10 am
20372
? for(n=1,30,print([n,ceil(sqrtn(n^2,2))])) [1, 1] [2, 2] [3, 4] [4, 4] [5, 5] [6, 7] [7, 8] [8, 8] [9, 10] [10, 11] [11, 11] [12, 12] [13, 13] [14, 15] [15,...
sopadeajo2001
Offline Send Email
Jun 9, 2009
7:11 am
20373 Paul Underwood
paulunderwooduk
Offline Send Email
Jun 9, 2009
9:19 am
20374
This is a follow-up, but taking y=x+2. Redefine: x=a-1 y=a+1 where "a" is the mean of "x" and "y". Redefine the matrices: X=[a-1,-1;1,0] Y=[a+1,-1;1,0] and ...
Paul Underwood
paulunderwooduk
Offline Send Email
Jun 9, 2009
9:19 am
20375
... Perhaps ispower() is what you're looking for? Peter -- [Name] Peter Kosinar [Quote] 2B | ~2B = exp(i*PI) [ICQ] 134813278...
Peter Kosinar
pkosinar
Offline Send Email
Jun 9, 2009
9:59 am
20376
Following are the ratios of primes to total for Extended Ulam Spiral 107: 30 .8 40 .78 50 .72 60 .67 70 .63 80 .65 90 .63 100 .64 110 .63 Does this...
miltbrown@...
Send Email
Jun 9, 2009
1:12 pm
20377
I had requested Ken (Kradenken) to test whether 2^(3^53) + 99 is eactly divisible by 107 or not. He replied that the number is too big for any...
Devaraj Kandadai
dkandadai
Offline Send Email
Jun 9, 2009
2:10 pm
20378
... If by "the number" you mean 2^(3^53)+99, then clearly it isn't too big for any computer as it can trivially be represented using only 9 characters. It's...
Phil Carmody
thefatphil
Offline Send Email
Jun 9, 2009
2:38 pm
Messages 20349 - 20378 of 21093   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