Dear Chris, In response to your "challenge" of What is the 1 digit difference from 200? The answer is: there is NO such number, because 1) As everyone knows,...
... Why the fixation with base=10? Why not base=2? Suppose that RSA gives me a large composite odd integer, N. Then with probability 99.688% [note] I can give...
Dear David, The fixation with base 10 (without going into complex calculations) is due to the obvious fact that if you have a composite number and you want to...
... So you say, but I'm sorry to say that I have limited trust in you by now. ... The numbers are prp's (probable primes). They are almost certainly prime but...
Hi all, I got your point, Jens! I will not bother anyone anymore, so goodbye to all... Joao P.S. - I guess I am in need of some lessons in scientific humility...
Please see the final paragraph (at least) of http://physics.open.ac.uk/~dbroadhu/amateur.ps Also note that the Concise Oxford Dictionary gives the leading...
... David That's a truly beautiful piece of work. (Some amateur...) I'd like to be one of the first to congratulate you on a discovery that will clearly become...
Thanks Mike, but it's not really to be mentioned in the same breath as Pocklington, BLS, KP, who can all perform well with a factorization fraction and no...
... I don't have access to a dvi-to-pdf converter that has decent fonts. If some else does, please convert http://physics.open.ac.uk/~dbroadhu/amateur.dvi to...
David Although the assertion is clearly true by sketching a graph of the cubic, I struggled a bit at the end of Section 1 when you refer to, but don't quote,...
... I quite like the teachers' notes at http://www.math.hmc.edu/funfacts/ffiles/20001.1.shtml You can see that it has an inductive proof, which indicates that...
... In fact the whole essence of CHG is explained in situ, including the recent improvements. The only thing I don't explain is LLL, since I don't use it :-) I...
Oops. This was meant to be sent to David directly. No matter, it doesn't contain any private information. It's just slightly awkward having my first public ...
... [please let me call that K*B^3+B+1] ... In the latter case, with c>1, set K=k*b^(c-2) and B=b^c to get K*B^3+B+1, which is the first case. So all cases...
Thanks for the explanation, David. Onward... John ... __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the...
... It might help to give a rationale why septic follows cubic, in the game to lower f=log(B)/log(n). The master chain is tuned to work for n=1+B+C with C...
I've rewritten my CHG certificate validator: http://physics.open.ac.uk/~dbroadhu/cert/chgcertd.gp to allow John's inspired use of Descartes' rule of signs. I'd...
Hi, I've tested "M^n==-5*Id (mod n)<==> n prime" without counterexample for all n=+-3 (mod 10) for n between 7 and 10^10; where M=[0,1;5,5]. ... and ... So my...
... This might be a bit of an underestimation -- the tests took 48 hours on my Athlon XP2000 (1800 MHz) desk top with multimedia running, newpgen and other...
... Mindblowing. I spent about 3 weeks in november looking for a simple 2/7ths proof as I was sure for about 2 weeks that I was onto something. I was not. ...
David It's still unclear to me where the hard 25% cutoff in your (and the CHG) algoritm comes from. Much of the algebra at the start of Section 3 of your paper...
... Yes! By construction, n_2(u+1) - n_1(u) = 2/(u+1) > 0 for all c>1. About u=99: with no smart tricks, the size of the matrix in the integer-valued linear...
... Above 25%, the BLS tests ensure that the smaller factor of any factorization has precisely one unknown digit in base B, where N=1 mod B. No-one has even...
As an example of a PrimeForm outside the scope of my recent algebraic work, I offer http://primes.utm.edu/primes/page.php?id=76991#comments recently proven...