... n/(log n) is asymptotic to n/(1+log n). Think about it. And 1) is certainly not due to Euler. 1) is an equivalent form of the prime number theorem, and so...
13937
Décio Luiz Gazzoni...
decio@...
Nov 3, 2003 7:23 pm
... Hash: SHA1 Please, man, spare us the laughters (at your cost) and go learn some basic asymptotics. I suggest you look up in particular L'Hôspital's rule...
13936
Jud McCranie
judmccr
Nov 3, 2003 6:31 pm
... A prime that is infinitely large? Show me. [Non-text portions of this message have been removed]...
The sequences related to Euclid's proof are: A000945 A000946 A002585 A005265 A005266 A051342 ( there are several new ones as well) A00945 is just the first...
13932
John Dilick
johndilick
Nov 3, 2003 4:27 pm
I hate when my brain gets ahead of my fingers... ... in ... A(x)=THE SMALLEST PRIME FACTOR of the product of all of the previous terms. John...
13931
John Dilick
johndilick
Nov 3, 2003 3:53 pm
Just a quick comment, then back I go... ... You do realize that A000945 is NOT the sequence we have been discussing (namely, the primorial plus one series),...
13930
Christ van Willegen
cvwillegen
Nov 3, 2003 10:14 am
Hi folks, this morning, Primo (2.2.0 beta 1) 'surprised' me with this: [PRIMO - Task Report] Version=2.2.0 beta 1 WebSite=http://www.ellipsa.net/ ...
13929
Jud McCranie
judmccr
Nov 3, 2003 1:40 am
... I don't think so. It will stop in a finite time. [Non-text portions of this message have been removed]...
13928
Roger Bagula
rlbagulatftn
Nov 2, 2003 8:51 pm
In working with the Euclid proof primes I found that any reasonable number past about 30 primes in the product almost never stops in the factoring step. 43...
13927
Décio Luiz Gazzoni...
decio@...
Nov 2, 2003 8:35 pm
... Hash: SHA1 ... If you assume some standard physics assumptions (Heisenberg Uncertainty Principle and finiteness of matter), then you can't build a machine...
13926
Jose Ramón Brox
ambroxius
Nov 2, 2003 7:13 pm
If we assume that you can effectively keep running your machine for infinite time, then you will have counted aleph_0 natural numbers and aleph_0 prime...
13925
Mark Rodenkirch
mgrogue
Nov 2, 2003 6:52 pm
I have a few suggestions: Get rid of gp-2_2_5_win.zip. It is over 1300 KB in size. If someone really wants PARI, then can download and build it themselves. ...
13924
chasag@...
chasag28
Nov 2, 2003 6:08 pm
Imagine a counting machine counting up and running for an infinite time ,After an eternity, a infinite large number n is reached and a very large number of ...
13923
Andrew Swallow
umistphd2003
Nov 2, 2003 5:42 pm
I have to say I agree, up to a point. His posts haven't really been off topic (mostly), but I think it's generally agreed that most of his stuff is "rubbish"....
13922
Paul Leyland
pleyland@...
Nov 2, 2003 5:04 pm
... Peace, love and tolerance. ;-) "This Bagula guy" has been mostly posting on-topic in my opinion, even though we've had harsh words for each other...
13921
Jose Ramón Brox
ambroxius
Nov 2, 2003 4:50 pm
Hi all: Sometimes the group runs out of space for storing the files. Why dont we create another group in Yahoo, only for use its files space? Something like...
13920
primenumbers@yahoogro...
Nov 2, 2003 4:41 pm
Hello, This email message is a notification to let you know that a file has been uploaded to the Files area of the primenumbers group. File :...
... You speak of infinity like it is some sort of black hole, with an event horizon, beyond which all integers get 'sucked in' to being infinite. This is not...
13916
chasag@...
chasag28
Nov 1, 2003 11:19 pm
A nearly infinite number can be defined if one cares to. Orders of infinity have been defined, so why not suborders? [Non-text portions of this message have...
13915
chasag@...
chasag28
Nov 1, 2003 11:14 pm
Ther must be very very large numbers just on the verge of infinity, After that there must be a prime gap reaching to infinity. Thus there is a finite number of...
13914
Roger Bagula
rlbagulatftn
Nov 1, 2003 8:48 pm
<http://www.research.att.com/cgi-bin/access.cgi/as/njas/sequences/eismum.cgi> Logo Greetings from the On-Line Encyclopedia of Integer Sequences ...
13913
Lawrence Hon
lj8866
Nov 1, 2003 7:54 pm
I dont think any exist besides a few trivial cases. First, p must be congruent to either 1 or 2 mod 3 because if it was congruent to 0 it would be a multiple...
13912
Adam
a_math_guy
Nov 1, 2003 7:38 pm
RE: Adam Karasek post for pythagorean triples with a and c primes and b a product of at almost four primes, I seek primes p with 2p-1 and 4p-1 simlutaneously...
13911
Chris Caldwell
primemogul
Nov 1, 2003 6:07 pm
... The wonderful text: L. J. Mordell "Diophantine Equations" Academic Press, 1969, page 124-130 includes things like: Theorem 3: Let a = p or p^2 where p =...
13910
Mike Oakes
mikeoakes2
Nov 1, 2003 1:12 pm
... of ... be ... etc. ... solutions ... The same ... is ... I expect you're right, Chris (if you correct your typo and say X = - r^n*Z ), and both the...
13909
Adam Karasek
adam_karasek
Nov 1, 2003 11:06 am
Welcome I have writed with this problem recently, but I still can not solve it. I need to solve a equation: a^2+b^2=c^2 where a and c are primes and b is a...
13908
ashok
ashok_iiit
Nov 1, 2003 10:39 am
hi, I am working on AKS algorithm. I am done with implementation of the algorithm. Can someone give me any idea as a continuation of this. I don't have much...
