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...
Real people. Real stories. See how Yahoo! Groups impacts members worldwide.

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 21061 - 21090 of 21090   Oldest  |  < Older  |  Newer >  |  Newest
Messages: Simplify | Expand   (Group by Topic) Author Sort by Date ^
21061
Peter: I haven't seen your proof at all, but Bill did share his with me separately, and if his is anything like yours (claiming that a particular equation has ...
Jack Brennen
jbrennen
Offline Send Email
Oct 22, 2009
3:48 pm
21062
La somma dei triangoli rettangoli Aurii costruito nei cateti, divisi per due è uguale all'area del triagolo rettangolo costruito sull'ipotenusa o diagonali. ...
Edgar J. Delpero.
edgar_james2002
Offline Send Email
Oct 22, 2009
7:19 pm
21063
I love foreign languages and culture, but nevertheless I permit myself to remark that the home page of this group specifies: Group Information * Members: 1170...
maximilian_hasler
maximilian_h...
Offline Send Email
Oct 22, 2009
9:55 pm
21064
** Proprietary ** ** High Priority ** please produce a proof of the rational (m/n) form of the square root of 2, i.e. x * x = 2 ... ξε ν’,...
Adriano Palma
palmaaaaaa
Offline Send Email
Oct 23, 2009
6:21 am
21065
Dear Mr. Brennen, if I thought that the factors for each f1, f2, etc. were all prime, even for a second, then I wouldn't have considered the notion of proof...
Bill Bouris
leavemsg1
Offline Send Email
Oct 23, 2009
2:20 pm
21066
... In mathematics you are out first strike. Also in cricket: http://www.gap-system.org/~history/Extras/Hardy_cricket_teams.html David...
djbroadhurst
Offline Send Email
Oct 23, 2009
9:41 pm
21067
Hi all, Consider the set of natural numbers and filtering them by 3,5 and 7 (but not 2!) Within an interval of 105 I will find 15 pairs of numbers that differ...
chrisdarroch
Offline Send Email
Oct 23, 2009
11:53 pm
21068
** Proprietary ** ** High Priority ** Sir, your so-called proof is utterly incomprehensible. In order to avoid further linguistic "chaos" you are kindly...
Adriano Palma
palmaaaaaa
Offline Send Email
Oct 24, 2009
5:27 am
21069
(i) Does the following series converge or diverge? 1/a[1]+1/a[2]+1/a[3]..... Where a[n] is the nth prime in the series of primes p[1],p[2]..that have...
robert44444uk
Offline Send Email
Oct 24, 2009
7:52 am
21070
... According to the Artin conjecture, the sum diverges. ... {cp(n)=local(c=0.,pmax=prime(n));forprime(p=3,pmax, if(znorder(Mod(2,p))==p-1,c=c+1/p));c} \p15 ...
djbroadhurst
Offline Send Email
Oct 24, 2009
10:54 am
21071
4a. Convergent or divergent series? Posted by: "robert44444uk" robert_smith44@... robert44444uk Date: Sat Oct 24, 2009 12:52 am ((PDT)) (i) Does the...
Kermit Rose
kermit1941
Offline Send Email
Oct 24, 2009
4:06 pm
21072
Does PRP.exe software work only with numbers in the form k*2^n+/-1 or does it work also with other forms (example 2^n+3^n) ? Thank you Giovanni...
Di Maria Giovanni
calimero22
Offline Send Email
Oct 25, 2009
1:26 pm
21073
... Thank you David, that is quite subtle but important for the things I am looking at....
robert44444uk
Offline Send Email
Oct 25, 2009
5:19 pm
21074
"Three smooth" numbers are numbers that have at most factors of two and three. The three smooth numbers up to a thousand are ...
marku606
Offline Send Email
Oct 26, 2009
3:30 pm
21075
One thing I have often thought about is trying to build a quasi-alternating series out of the reciprocals of the primes, so that: - the reciprocal of every...
julienbenney
Offline Send Email
Oct 27, 2009
1:34 am
21076
... Here's some data: For primes up to 10^3 : sum =~.166803 10^4 : sum =~.166329 10^5 : sum =~.165365 10^6 : sum =~.165021 10^7 : sum =~.165036 10^8 : sum...
marku606
Offline Send Email
Oct 27, 2009
3:19 am
21077
Hi all, a notion occurred to me that has probably been explored, so I'm looking for references to it. Of the numbers n# +1 or n# -1 (n Primorial plus 1, or...
James J Youlton Jr
youjaes
Offline Send Email
Oct 27, 2009
10:04 pm
21078
... Try http://www.google.com/search?q="primorial primes" or http://www.research.att.com/~njas/sequences/?q=primorial+primes Maximilian...
maximilian_hasler
maximilian_h...
Offline Send Email
Oct 27, 2009
10:10 pm
21079
Re ... I can easily see that the positive terms would converge. However, there is a problem with showing that the series noted above converges absolutely. Term...
julienbenney
Offline Send Email
Oct 28, 2009
1:08 am
21080
... The sum is a variation on sum (9) at http://mathworld.wolfram.com/PrimeSums.html It starts (1/3)-(1/5)+(1/7)+(1/11)-(1/13)-(1/17) and equals 0.3349813253...
andrew_j_walker
Offline Send Email
Oct 28, 2009
8:47 am
21081
Is it a known fact that the sum of primes of a twinprime pair is always divisible by 12 ? (divisible by 4 is evident) or is there a counterexample? gr. Rob ...
Robdine
robdine2004
Offline Send Email
Oct 28, 2009
3:24 pm
21082
... Yes it's a known fact. All primes > 3 have the form 6n +/- 1. Thus a twin prime is always of the form (6n-1,6n+1) . The sum is 12n, which is divisible by...
marku606
Offline Send Email
Oct 28, 2009
3:46 pm
21083
... Here are the first 300 digits: ...
djbroadhurst
Offline Send Email
Oct 29, 2009
2:27 am
21084
... Rats, my computer doesn't know what to do with a dvi file. While in my ignorance, I can't fathom how it can take merely 174 milliseconds to compute 300...
marku606
Offline Send Email
Oct 29, 2009
6:15 am
21085
... I used only primes p < 400 {ans(A,N)=local(S=1/2.,L); forprime(p=3,A,S=S+if(p%4==1,1,-1)/p); for(s=1,N,L=if(s==1,Pi/4,if(s%2==0,zeta(s)*(1-1/2^s), ...
djbroadhurst
Offline Send Email
Oct 29, 2009
10:40 am
21086
... To obtain, 70 good decimal digits, in 9 milliseconds, it suffices to use only the first two odd primes p = 3,5. This is so fast that, to time it...
djbroadhurst
Offline Send Email
Oct 29, 2009
5:09 pm
21087
... Your intuition was good, Julien. The key to the proof of finiteness (and also to the very fast evaluation) is that you were using a Dirichlet character: ...
djbroadhurst
Offline Send Email
Oct 29, 2009
6:34 pm
21088
... Finally, here is how to obtain 70 good digits, using no odd prime at all. Observe that the formulas below involve only the numbers 2 and Pi: ...
djbroadhurst
Offline Send Email
Oct 30, 2009
3:41 pm
21089
... In fact, polling the odd primes really helps: I found 10,000 good digits in 7 minutes, by consulting the 24 odd primes p < 100. The result is in ...
djbroadhurst
Offline Send Email
Oct 30, 2009
7:46 pm
21090
A Ramanjan Prime Corollary: 2*p_(i-n) > p_i for i > k where k = primepi(p_k) = primepi(R_n). That is, p_k is the n'th Ramanujan Prime, R_n, and the k'th prime....
reddwarf2956
Offline Send Email
Oct 31, 2009
9:07 pm
Messages 21061 - 21090 of 21090   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