Jump to content

Talk:Shanks's square forms factorization

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Wroscel (talk | contribs) at 02:17, 23 June 2006 (It needs attention). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

This algorithm is somewhat vague and seems incomplete. Furthermore, it does not seem very efficient (or perhaps I did not implement it very well; my implementation took substantially longer than a brute force simple factorization).

I could not check the external link to verify the correctness of this article. This merits review. -- Aprogressivist 19/06/2006

I think that the P's and Q's are not the same variables in the two stages of the solver. BTW, I see identifiers like a, b, n, and so on reused to mean different things wihtin the same article a lot in math articles - maybe I should make that a sub-project of Mathematics. Walt 02:17, 23 June 2006 (UTC)[reply]