Re: To JSH: Challenge with no strings attached.

On Fri, 17 Aug 2007 09:16:40 -0700, mike3 <mike4ty4@xxxxxxxxx> wrote:

On Aug 17, 2:46 am, rossum <rossu...@xxxxxxxxxxxx> wrote:
On Thu, 16 Aug 2007 15:56:53 -0700, mike3 <mike4...@xxxxxxxxx> wrote:
*BUMP*

Why haven't you done this? Could it be that your factoring
algorithm does not work?

JAMES!!!!

I know you gave my post one star on Google since you
don't want to take mychallenge. Your algorithm, theory,
whatever it is does not work and is just another one in
a long line of failed "results" you've been posting for
all this time. Fermat's last theorem, Prime Counting,
Goldbach's conjecture, Riemann Hypothesis, now Integer
Factorization -- all of the "results" you've supposedly
obtained for these things have been proven again and
again to be bunk. When given achallengeyou refuse it,
or only go halfway (like with the RSAchallengewhere
you more-or-less just CLAIMED you could factor the
number instead of actually DOING it.).

JSH's Prime Counting method does actually work. He deserves credit
where he has actually earned it.

rossum

You sure?

Yes. I coded it up and checked it. It works. He does have a version
in his own Java code:
http://extrememathematics.googlegroups.com/web/PrimeCountH.java

I have not tested his code.

His description of the method is here:
http://groups.google.com/group/extrememathematics/web/counting-primes

rossum

.

Relevant Pages

  • Re: Prime counting example
    ... Unless you've changed the algorithm radically, it probably still works, ... The Meissel-Lehmer method, Math. ... What's the running time for your java code? ... algorithm will run faster on a faster computer. ...
    (sci.math)
  • Re: Congruence based factoring algorithm
    ... rossum wrote: ... algorithm will run faster with as small a p as possible; ... square roots will be easy). ... --Tim Smith ...
    (comp.theory)
  • Re: XOR as encryption - security considerations
    ... with sufficient computing power can recover the text. ... If you xor two or more pieces of text with the same random string, ... To answer the pevious reply from rossum. ... You also need to tell us the exact algorithm you are using. ...
    (sci.crypt)
  • Re: Prng Alvo
    ... In order to correct a problem with bad seeds then you need to show ... good mathematical understanding of your algorithm. ... at the autocorrelation problem that pubkeybreaker has pointed out. ...
    (sci.crypt)
  • Re: JSH: What is surrogate factoring? Once more.
    ... Sieve as well as James' method. ... with examining and questioning the algorithm. ...
    (sci.math)