With 80-bit floats, and a 32*32->64 integer multiply, the intel-using C/C++ and Asm programmers can without too much hassle write 62*62%62 bit mulmods. ...
A bit sketchy, in fact you'll probably hate it, but the essence is there: http://www.users.globalnet.co.uk/~perry/maths/germainprimes/germainprimes.ht m Jon...
... Yes, Marcel, that is something that I noted about both you and Jack: you seem incapable of proving false statments while several other contributors claim...
Hello all, I'm trying to come up with a new factoring method (what else is new!) but I am having troubles with some (alot?) of the ground work. My current...
Trying this in Pari: dpf(p)=local(c,n);c=0;for (n=1,length(factor(p)[,2]),c++);c jlv(n)=(-1)^dpf(n) s=2;slv=0;for (n=1,20000,slv+=jlv(n)/(1.0*n^s));print(slv) ...
Hello! Does anybody know about any tables of largest composites factored by NFS methods? Great thanks, Andrey [Non-text portions of this message have been...
Hello, Some operations which are difficult modulo n are much easier when working modulo p. For example, there are no known fast methods for taking a square...
Hello, Thanks to Thomas Hadley, Alan Wong and Phil for replying to my quiz question. 'Can you prove that p and q distinct primes are co-prime? Thomas got the...
There's little formality in the discussions that I've seen regarding the stage 1 /stage 2 division for the group order based block-GCD factoring algorithms...
The group operation for Elliptic Curves is explicitly introduced as being commutative. And of course, the multiplication in Z/Zn and other rings useful for...
David, Thanks for the information. I think that this table can be stored in the Web server in a more compressed way by storing only the factors of p-1. Then a...
Hi phil, I think Again I am facing with the same old bouncing problem. I haven't received any emails from the primenumbers group from past couple of days. Was...
From Paulo Ribenboim's The Little Book of Big Primes (c) 1991 The following is results by Ishikawa (1934) are also consequences of Tschebycheff's Theorems (see...
A new revision of "A problem on the conjecture concerning the distribution of generalized Fermat prime numbers (a new method for the search for large primes)"...
Let p=k.2^n+1 , k odd, n>2. Form k^(2^i), for i=1..n-1, or until the result is -1. If it's never -1, reject the candidate as composite. Otherwise call the...
... Trial division. ... Sure. If I can get 2637 in 2 minutes, I imagine that you can get 4000 in 5 minutes. Note that I stopped, rather arbitrarily, at 30...
Hi, I am new here. I created a homepage about graphic patterns of primes. Hope some will look at it and comment it. If somebody know a more relevant place for...
Although not about primes, I would be very happy if people would examine my new papers at: http://www.users.globalnet.co.uk/~perry/maths/othermaths.htm Namely...
Hello to all people there, I was trying to use modular factorization with WinPFGW version 20020515, with the following command line : -l -f{3779136} -s3...
Consider the sequence of integers p+1,...p+k, p a prime. The product of these integers is k! mod p. Let k=p-1, therefore k! mod p = (p-1)! mod p = -1 mod p. ...
Okay, here are some conjectures I just came up with. These might be original; I've never seen similar conjectures myself. Perhaps these can be proven -- I...
... I believe pari is interpreted, so you want to do as little work as possible. The general form is right, but you'll never beat a low level compiled language...
Quick question. Consider a plot of the 'Fibonacci curve', i.e. the extension of the Fibonacci series into the reals. Can we assume that F(x)+F(x+1)=F(x+2)...
Goes like this: Consider a run of consecutive composites, c1,...,ck, where k is even. Group these composites into pairs, such that each element is used exactly...
Can anyone prove any of the following: a) It's easier said than done b) Beauty is in the eye of the beholder c) It's impossible to teach the intelligent to be...
