One of these days I'll learn to ignore these posts, but until then... It's bad enough working out what the mirror sequence is. It's impossible from the way...
See http://primes.utm.edu/curios/includes/file.php?file=puzzio.html A whole lot of easy curios are available for searching. Limit : One per person. Enjoy!...
Hi Michael, I submitted 7777777666666555554444323213 Largest prime containing zero 0's, one 1, two 2's, three 3's, four 4's, five 5's, six 6's and seven 7's....
Rathe weak conjecture, considering that the number of primes seems to be always increasing in the sequence you've submitted. Let x=n^3, for some integer n....
I have finally posted the GUI version of MultiSieve to http://groups.yahoo.com/group/primenumbers/files/FactoringPrograms/multisieve_gui.zip Other changes in...
Related, Chris Caldwell sent a post on 10/18/01 which seemed to state that the version of this conjecture for a single prime is proven assuming the Riemman...
I guess we're coming at it from two slightly different angles. When I say the conjecture is proved, I mean for all sufficiently large cubes. There is of course...
On 1/1/04 Andy wrote: One of these days I'll learn to ignore these posts, but until then... It's bad enough working out what the mirror sequence is. It's ...
The best way to avoid torturing a mathematician is to say nothing, or maybe talk about the weather. Barring that, clarity and conciseness expressed in terms...
Hello all, I'm not sure how to write a formal proof, but I think I may have something worth looking at. Now, in order to prove that there is at least one...
Your idea is to study pi(x+x^(1/2))-pi(x), using a lower bound for pi(x). But to get a lower bound for pi(x+x^(1/2))-pi(x), you need a lower bound for...
I wrote a paper covering some aspects of this problem a while ago. To this day, no one who looked at it or received it has said anything to me about it, but I...
Hi Mark, Thanks for Multisieve-GUI ! I'm testing primes of form 10^a +/- b*10^c +/- 1 and let them factored cq prp-tested by Pfgw If Multisieve can handle this...
Happy New Year to All: Based on my Residual Factorization Method described in www.csulb.edu/~mbrown10 I can computer the first digits of RSA factors. I would...
Milton Brown
miltbrown@...
Jan 5, 2004 12:34 am
14324
... Hash: SHA1 Hello, Mr. Brown As you seen to keep blabbering about this delusion of yours, I'll present an ultimatum to you. It's pretty simple, put up or...
Décio Luiz Gazzoni...
decio@...
Jan 5, 2004 3:17 am
14325
... This has been done before (by me and others, I think). He never "put up"....
... Hash: SHA1 ... Let this be a hint to the moderators that this guy needs to be excluded from the list in that case. Décio ... Version: GnuPG v1.2.3...
Décio Luiz Gazzoni...
decio@...
Jan 5, 2004 3:44 am
14327
Mr. Filho: I am sorry that you consider my method a delusion. Perhaps you are not able to reproduce the mathematics Described in www.csulb.edu/~mbrown10. If...
Milton Brown
miltbrown@...
Jan 5, 2004 4:49 am
14328
Hi All, As one of the "moderators" I approved this post as Milton's "right of reply". However, and I am stating this publically for other members' benefit, I,...
... As far as I know, you have never shown that you method works on large numbers in which you don't know the prime factors. Show how it works on the examples...
... Hash: SHA1 ... If you mean a PowerPoint presentation that's linked on that site, the same one you mentioned a few months ago, I indeed went to the trouble...
Décio Luiz Gazzoni...
decio@...
Jan 5, 2004 5:25 am
14331
I'll have to admit that I even tried to implement Mr. Brown's algorithm, to torture-test the primality-checking routines in my programming language "Frink",...
Hi all and happy new year, I too have discovered an amazing algorithm that factorizes a composite integer N in O(log(log(Pmax))^1/2) where Pmax is the largest...
You might be interested in checking out the new number theory books at: http://numbertheorybooks.bravehost.com Thanks ... Do you Yahoo!? Yahoo! Hotjobs: Enter...
I found this method of classification of primes by a pseudofactoring method. I have 12 types : four four each of the end digits {1,3,7,9} of primes without the...
