Re: To JSH: Challenge with no strings attached.
- From: mike3 <mike4ty4@xxxxxxxxx>
- Date: Fri, 17 Aug 2007 09:16:40 -0700
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?
.
- Follow-Ups:
- Re: To JSH: Challenge with no strings attached.
- From: rossum
- Re: To JSH: Challenge with no strings attached.
- References:
- To JSH: Challenge with no strings attached.
- From: mike3
- Re: To JSH: Challenge with no strings attached.
- From: mike3
- Re: To JSH: Challenge with no strings attached.
- From: rossum
- To JSH: Challenge with no strings attached.
- Prev by Date: Re: approximation by series expansion
- Next by Date: Re: Careers in mathematics?
- Previous by thread: Re: To JSH: Challenge with no strings attached.
- Next by thread: Re: To JSH: Challenge with no strings attached.
- Index(es):
Relevant Pages
|
Loading