Re: Polroots/mod suggestion

[John Cremona <john.cremona@gmail.com>]

Thanks for that -- his comments had seemed completely stupid to me,
but I did not know that he had such a history.

Strangely enough, gmail put this email of yours into spam (but not
those of Wanless)!  I only found it by chance while looking for
something else which I though might have gone astray.

John Cremona

On Sun, Mar 13, 2011 at 12:09 PM, Phil Carmody <thefatphil@yahoo.co.uk> wrote:
> --- On Sun, 3/13/11, Bill Allombert <Bill.Allombert@math.u-bordeaux1.fr> wrote:
>> On Sun, Mar 13, 2011 at 12:53:15PM
>> +0000, James Wanless wrote:
>> > (Right, hopefully I really do mean to post to _this_ list this time :)
>> > I wonder if the devs would be interested in the following suggestion
>> > for finding roots of a general nth order polynomial, or same mod p:
>> > The idea is basically recursive completion of the square ie, solve
>> > for roots using the standard quadratic solution formula, but
>> > iterated.
>> > Each level of iteration would allow equations of up to 2^nth order
>> > to be solved, as n++
>>
>> How this is supposed to work ?
>
> I've never seen anything sensible from him on sci.math, and plenty of complete nonsense. Until he became a permanent entry in my killfile. After that he popped his head up on one of the prime number related lists I help moderate, and his gibbering of nonsense caused a swift always-moderated flag to appear next to his name there too.
>
> Let's pull some typical Wanless gibbering out of the google:
> http://www.bearnol.pwp.blueyonder.co.uk/Math/fermat.html
>
> In short - he's best ignored.
>
> Phil
>
>
>
>