Anonymous user
Talk:Square form factorization: Difference between revisions
m
Added anchors
mNo edit summary |
m (Added anchors) |
||
Line 49:
Now look under the hood; m is the multiplier,
forms P# are
Each time, after just a few steps, the multiplier or some
trivial factor is returned and the principal cycle exited:
Line 80:
A9 = ( 22, 14146,-5455)</nowiki>
The pattern
the last multiplier gives:
Line 95:
augmenting the list with primes 13 through 37 all of the above
numbers eventually yield. But this is just a patch: there are many
more N beyond 50,000,000... At least it's clear that a larger set
of multipliers should be used, although I
where the problem doesn't exist.
This is what happens if the last square form is saved and we
<nowiki>N = 4558849
Line 132:
and back on the principal cycle where a proper square is
<nowiki>P14 = (-1898, 7334, 11^2)
Line 156:
turns out to be improper — a roundabout but dependable route.
To complete the picture, this is the same factorization
[[Square_Form_Factorization#FreeBASIC|applying a queue]]:
<nowiki>N = 4558849
Line 170 ⟶ 171:
A6 = (-766, 6894, 2343)
f = 383 N/f = 11903</nowiki>
—[[User_talk:Udo_e._pops|Udo e.]]
Can't say I really followed that, nevermind, a translation of the 2nd C entry fixed my problems. --[[User:Petelomax|Pete Lomax]] ([[User talk:Petelomax|talk]]) 19:23, 20 March 2021 (UTC)
| |||