Re: Silly Factoring Theorems
- From: Mark Atherton <htlshoqz@xxxxxxxxxxx>
- Date: Sun, 01 May 2005 08:00:13 +0100
rich burge wrote:
So how could one go about proving e<P(k)? One approach is to first find some evidence that it is true: i.e. perform some experiments! This is where "practicality matters". Is it wise to start experimenting with one of the RSA challenge numbers? No, that's dumb, and those who would offer such advise for this or any other sft are themselves being silly (or cruel).
However, at times JSH states that he has "solved the factoring problem". By which he seems to mean that he has a fast way of factoring composites. In which case suggesting that he display the factors of one of the challenge numbers is not cruel or silly, merely the quickest way to prove us all wrong.
Mark Atherton .
- Follow-Ups:
- Re: Silly Factoring Theorems
- From: rich burge
- Re: Silly Factoring Theorems
- References:
- Silly Factoring Theorems
- From: rich burge
- Silly Factoring Theorems
- Prev by Date: Re: What is the greatest error ever committed in math?
- Next by Date: Re: Dimensionality Reduction to a Circle
- Previous by thread: Silly Factoring Theorems
- Next by thread: Re: Silly Factoring Theorems
- Index(es):
Relevant Pages
|