I posted this (shortened) to Twitter tonight: (I'm https://twitter.com/aeliasen ) I got this phone number from a girl named Jenny tonight. Her 7-digit number...
... Definition: For positive integer n let p be the largest prime divisor of n*(n+1) and S(n) = log(n)/log(p) be the figure of merit for the smoothness of the ...
Hello friends. I've constructed a factoring algorithm that I call ProportionateFactor because, to factor positive integer z, it seeks to find four integers ...
24222
Paul Leyland
paul@...
Apr 23, 2012 9:09 am
... Without any information on how you propose to find the t_i it's next to impossible to give any meaningful analysis of your algorithm. Paul...
Hi, congrats to PrimeGrid for currently having about 50% of the top5000 world record primes: http://primes.utm.edu/bios/top20.php?type=project&by=PrimesRank ...
see http://oeis.org/search?q=1%2C3%2C25%2C49%2C7381 and http://en.wikipedia.org/wiki/Wolstenholme%27s_theorem Maximilian ... [Non-text portions of this message...
Ich nehme an, Sie wollten 3^(n+1)-2=p und 3^n*(3^(n+1)-2)=p schreiben, anstelle von (3^n+1)-2=p und 3^n*(3^n+1)-2=p ? Euklid's Theorem verbietet nicht, dass es...
Noting that 3*7*13*17 + 10**4 = 11**4 (=14641), is the relationship p1*p2*p4*p5 + 10**N = p3**4, where p1,p2,p3,p4,p5 are consecutive primes and N is some...
1. A criteria to distinguish primes from composite numbers: a) If and only if an odd number p > 5 has two solutions in the field of adjoined square root A with...
... You cannot determine whether this is the case without factorizing the target. Your code seems to ask for a positive kronecker symbol (which you call...
Hi, I had a methodology(may be not efficient had a intuition it will be useful) to generate all odd composite. Factors of all odd composites are predetermined...
Hi, Can anyone supply me with a reference to the proof that the Riemann Hypothesis is equivalent to the proof that for all n prod(P(n))/phi(P(n)) > e^g *...
... Bertil's super-Granville gap is indeed notable: http://primes.utm.edu/curios/page.php/1693182318746371.html How much higher might anyone have looked for...
As some of you old-timers know, this discussion list was started by "The Prime Pages" and once every year (or three) I ask for advice. My University has been...
Dear David, ... i changed the algorithm http://109.90.3.58/devalco/suf_prime_2.html First of all i limit the search for p=3 mod 4 Instead of a strong...
No response from Brian to my private email, putting to him the last question I posted here :(. If anyone else can help with that Riemann equivalence, I'm all...
... You might consider asking these non-prime questions at the web site http://math.stackexchange.com. If you word your question well, e.g., add an example to...
... Please see my draft paper at: http://www.mersenneforum.org/showpost.php?p=298027&postcount=44 (Ignore the the mix up I made with the comparison between FFT...
... I should say that the program by Jen K. Andersen is a "psp-sieve" -- it generates a list of pseudoprimes for a given base and range, where gcd(base,n)==1....
