Interesting, Jack. Thanks. ... A subset of the pseudoperfects... For example, take the number 66. 66 is pseudoperfect because it can be expressed: 66 =...
... Well done. Did you find this by searching all n up to this limit? Because if you did, I'll stop my program, since yours seems to be a bit faster. :-O If...
I've just found another couple of Carmichaels of the form n^2-n-1 n=128027658527 so n^2-n-1=16391081347778088151201 =31.(71).211.601.1171.15121.3316601 lcm of...
Lets say I have a set P = { 2,3,5, ... p }, say p is 10000 And an AP X+iY where Y is about 10^50, Is there an effective way of finding any terms on the AP that...
Hi all: ¿which is the best bound for the prime counting function Pi(x), please? Is to improve the program attached for obtain prime numbers Sincerely ...
Hi all: ¿which is the best bound for the prime counting function Pi(x), please? Is to improve the program attached for obtain prime numbers Sincerely ...
9572
David Cleaver
wraithx@...
Nov 2, 2002 7:30 pm
Hello Phil, ... As for finding the smooth values (if I remember correctly you have C&P:PNaCP) sections 3.2.5 and 3.2.6 are great at explaining a good way of...
November 2 2002 Hello, Today Vasily Danilov has informed: found m=286, k=78472588395, n=288 78472588395.2^288+1 divides F_286 I apologize, that I dispatch...
... I'm glad you did post it here. With so many interesting distributed and team searches taking place it's nice to be reminded oftheir progress every now and...
... There are two fairly good approximations that are in common use. One is just 'li': li(x) =~ 1.045+ Integral{x = 2 .. +inf} [ x/ln(x) ] (the 1.045 is...
... Yes, I also believe they exist, but they must be close to R(x). I think the difference is about O[1/log x]. Best, Andrey [Non-text portions of this message...
http://groups.yahoo.com/group/primenumbers/files/Articles/polynomials.pdf (51k) There's an interesting polynomial sequence with easy-factorable coefficients,...
... Of course, I meant smooth monotonic functions. In fact, pi0(x) = R(x) - sum(R(x^r)) + arctan(pi/logx)/pi - 1/logx, where sum is over non-trivial zeta...
... Please read F(e^u)-pi0(e^u), where F(x) is our approximating function: R(x) + arctan(pi/logx)/pi - 1/logx - sum(R(x^r), some r) ... i.e. when F(x)=R(x)...
Here is a little contribution about handwavey methods. It does not specifically deal with Carmichaels, although my first examinations are coming up with some...
... Excellent! Going back to an earlier Carmichael, viz. 29*211*281*22669*11708611 we get b^2-a^2-ab = the composite above for 16 cases, each separate. ...
... Sorry, but you're never going to persuade the person who made Bernstien's primegen twice as fast to move to a claimed O(n^(3/2)) time algorithm. You do...
9590
Max B
zen_ghost_floating@...
Nov 3, 2002 1:48 pm
9839389 = 7 * 43 * 97 * 337 Sum the primes between the smallest and largest prime factors: 7+11+13+...+331+337 = 10181, a prime. Sum the composites between the...
9591
Paul Leyland
pleyland@...
Nov 3, 2002 3:29 pm
Am I missing something? Why don't you sieve with squares of elements from P to identify those not square free (by setting the location to a large negative...
Congrats on a neat method, Richard. ... How did you rediscover Jack's 675557402^2-675557402-1 = 456377802721432201 = 29*211*281*22669*11708611 where 22669-1 =...
http://www.silkenladies.com/mirror/mirror.php?url=www.primepages.org&Submit=%A0Ok%A0 Best, Andrey [Non-text portions of this message have been removed]...
