Gaussian elimination row offset

We've changed the heuristic form of one setting: gaussian_elimination_row_multiplier used to control a floating-point multiplier on 1 plus the number of smooth primes to control how many rows (of smooth numbers) would be collected before sieving exits. I could have seen how one might argue that this multiplier could be conveniently set to some value between 1.0 and 2.0, since demands on likelihood of success might scale with the number of smooth primes as proxy for overall scope of the problem.

However, there's a better way to frame this setting that's more in line with the canonical heuristics: gaussian_elimination_row_offset is now an integer that controls how many rows greater than the count of smooth primes are saved before sieving exits. The reason this heuristic form makes more sense is that the chance of successfully identifying a solution in Gaussian elimination goes roughly or exactly like (1 - 2**(-m)) for setting of m, i.e., starting with 1 setting, the chance of successfully solving the matrix is 50%, and the chance of failure is reduced by half compounded for each additional increment of 1.

Full Changelog: v5.3.0...v6.0.0

sha1sum results:
4274bdcd2825b9a0420d31b5da21543aaec2bf31 FindAFactor-6.0.0-cp310-cp310-manylinux_2_35_x86_64.whl
b88ca83d528b51a90ec83b90e4e7deebefc77ccd FindAFactor-6.0.0-cp312-cp312-manylinux_2_39_x86_64.whl
f69ecc81a0f8fd3a7bc802dda3753a74d970037e FindAFactor-6.0.0-cp312-cp312-win_amd64.whl
49d21ea73ef387cb2f8a3f9d4df6ef6b33ea29df FindAFactor-6.0.0-cp313-cp313-macosx_13_0_x86_64.whl
5446556ee5d280daa2c8a039d82903d161683ba0 FindAFactor-6.0.0-cp313-cp313-macosx_14_0_arm64.whl
ac735821f1740ba6a767bd3fd1ea78fc6f817ed2 FindAFactor-6.0.0-cp313-cp313-macosx_15_0_arm64.whl
9d70c72d0c4cede3c2c45e70e0d0653066802268 FindAFactor-6.0.0-cp38-cp38-manylinux_2_31_x86_64.whl
a780f923b013b7249f9eb5bce682af773a28d9a6 findafactor-6.0.0.tar.gz