2^3333+1582534968299 + 6*n (n=0-3) describes a 1004 digit sexy prime quadruplet. prps found using cpapsieve Find_CPapn pfgw Primality proven using primo 3.0.9...
Hello all: I have obtained an equivalence for prime numbres: p is prime if and only if Sum {for z=1 to p^(1/2)} Floor[(z*Floor[(p+z)/z]/(p+z)] = 1 and...
p = 10000019 q = 10000079 pq = 100000980001501L For 14 digit numbers, 13# wheel is faster than trial division by primes. It takes about 2 seconds to factor...
for n = 2,3,6,8, and 14, and the unique issquare function fr^2 - gA = hS^2 associated with each of the binary quadratic forms defined by n. A,x,y,n,r,s,f,g,h :...
This is my first posting to this group but I don't want to bore you with my life story. I only want to let you know that I am German and a crystallographer by...
Hello group, some time ago I decided to make up a large table of the values of prime-counting function pi(x) with the granularity of 10^9. The computations...
Hello . I constructed simple factoring program, based on (p-1) algorithm, and applied it to 2**t - 1 until it took more than a few seconds to factor the...
From: Jens Franke Sent: Thursday, July 29, 2010 2:47 PM Subject: pi(10^24) Using an analytic method assuming (for the current calculation) the Riemann...
Hello As Phil noted. The strong probable prime test is much better than the Euler probable prime test. In the range 1001 to 9999, I found; # p = 2047...
Every Carmichael number is a member of an infinite sequence of increasing odd positive composite integers N, where for each distinct prime factor P of N, there...
Hello An Euler false witnesses for an odd composite number, M, is an integer b, such that b**( (M - 1) / 2) = Jacobi(b,M). I wrote a program to investigate ,...
Assume a and b to be the largest known twin primes. Let x be an integer from 0 to no limit. Applying the following formula a^2 - b - 6x will inevitably result...
Hello Prime number friends. I found the following to be very interesting and informative. The Multiple Polynomial Quadratic Sieve I Quote (slightly modified)...
Hello Prime Number Friends. My recently constructed prime number counting program returned the following counts. I'm not sure my program is completely...
Hans Riesel has pointed out that if we classified the integer 1 as a prime, then we would have the dilemma of primes 2,3,5, etc being the product of two...
x, y, A, B : integers; Choose a pair of integers x,y > 0 to calculate an A = 5x^2 + 5xy + y^2. Remove all of the prime factors of y that appear in A from A,...
Hello all: This is mi new web page (in spanish and english). http://www.numerosprimos.net/ sincerely Sebastián Martín Ruiz [Non-text portions of this message...
Found no reference on the web. Will this statement hold up in the realm of huge numbers? In every occurrence of positive twin prime pairs P and Q=P+2, except...
Ok.... working on what stmaddox found and what i found out myself its possible to determine in an easy way without sieving if a number is prime or not. If...
If we can probe that there is a set that always will be denser than 6ab+-a+-b then twin primes will be infinite. I asked myself if it is possible to get a...
Anexed to this email I m sending TWINS FOR KIDS an essay that was intended to demonstrate that there is a discernible pattern of distribution of twin primes...
I will apreciate if someone can give information about the website where I can get information about this issue. Kind regards Alberto Zelaya [Non-text...
I read somewhere that Hardy Littlewood stated their twin prime conjecture through analysing a few numbers and concluding that distribution of twin primes must...
Primos gemelos: salvo el caso 3 y 5 el compuesto entre gemelos es PAR y además no puede haber más de tres números consecutivos no divisible por 3. Por...
n/Pi= series 11596294498980726850709733308963 / (Pi) 3.1415926535897932384626433832795 = 3691215182124273033363941444750 [Non-text portions of this message...
Hello, I answer, even after Chris sent a great post. I'll try to be more specific. ... good points :-) personally, I'm not looking for a repetitive pattern in...
... 1 = 1 mod 5. oops. 2 = 2 mod 11. oops. So a trivial adjustment needs to be made. 1 is not = 2 or -2 mod 11 or 13. 1 is not = 3 or -3 mod 17 or 19. ...
Twin prime property. Prove that there exist arbitrarily large integers m such that m is not + or - 1 mod 5 or 7. m is not + or - 2 mod 11 or 13 m is not + or -...
