Findafactor

There was a more general logic problem in `getNextBatch()` and `getNextAltBatch()`. Both methods have been fixed.

**Full Changelog**: https://github.com/vm6502q/FindAFactor/compare/v1.0.6...v1.0.7

sha1sum results:
a36e429be9c8f50be3aa68690352876346477cc1 FindAFactor-1.0.7-cp310-cp310-manylinux_2_35_x86_64.whl
a85eae3feb435e9174f3eb2b0c10260eacbc889a FindAFactor-1.0.7-cp312-cp312-manylinux_2_39_x86_64.whl
2352f5fe4a405350187403588a9d63b7c501519e FindAFactor-1.0.7-cp38-cp38-manylinux_2_31_x86_64.whl
5a4e96901e066589cd0365262dbe80c7bed12a05 findafactor-1.0.7.tar.gz

This release fixes an off-by-one problem in brute force batch ID iteration.

**Full Changelog**: https://github.com/vm6502q/FindAFactor/compare/v1.0.4...v1.0.6

sha1sum results:
0e955add366f9145236ed2923f3289705b4d44ca FindAFactor-1.0.6-cp310-cp310-manylinux_2_35_x86_64.whl
d05fd4f891c943a6cbabd906d9048490667afb90 FindAFactor-1.0.6-cp312-cp312-manylinux_2_39_x86_64.whl
67bac1137bd288e0dc8a8698c88521bc219be48e FindAFactor-1.0.6-cp38-cp38-manylinux_2_31_x86_64.whl
66c201c5dad17f553ca249ccbb3ffac4636ce162 findafactor-1.0.6.tar.gz

This release introduces the micro optimization of assuming the Gaussian elimination matrix has at least `n` rows for `n` columns (filled by the primes on identity diagonal). It also "macro optimizes" by quadrupling the range of brute force tested to produce smooth partial factor batches before Gaussian elimination processing.

**Full Changelog**: https://github.com/vm6502q/FindAFactor/compare/v1.0.3...v1.0.5

sha1sum results:
c29895d831dc45698f68a654d0eeab29a75fc609 FindAFactor-1.0.5-cp310-cp310-manylinux_2_35_x86_64.whl
d840698ee079864cd41dc7f3f7c41ce912af8539 FindAFactor-1.0.5-cp312-cp312-manylinux_2_39_x86_64.whl
dacca874335743391e603431edf66d5e3c208129 FindAFactor-1.0.5-cp38-cp38-manylinux_2_31_x86_64.whl
fe5f64c4682c2fb19f8b1f7ddf7a471109c95c31 findafactor-1.0.5.tar.gz

This release (only) fixes the boundary conditions for `getNextAltBatch()` (which should help make `FindAFactor` a reliable brute-force primality prover).

**Full Changelog**: https://github.com/vm6502q/FindAFactor/compare/v1.0.3...v1.04

shasum results:
522de093794a567f694d98539c270448ce4eec06 FindAFactor-1.0.4-cp310-cp310-manylinux_2_35_x86_64.whl
90a1a8a088020c9673aa6740564add09157a128a FindAFactor-1.0.4-cp312-cp312-manylinux_2_39_x86_64.whl
ba156c90dc040cbe53a31198d8c8f18105da7f9e FindAFactor-1.0.4-cp38-cp38-manylinux_2_31_x86_64.whl
5e0e974d217f7e468f8e3f645877f716b06f7ca4 findafactor-1.0.4.tar.gz

The smooth number collection (on each and every node) should probably be seeded with the prime numbers for each column.

**Full Changelog**: https://github.com/vm6502q/FindAFactor/compare/v1.0.2...v1.0.3

sha1sum results:
479ef0b852772f0469806fecb12dc71cd80a82a3 FindAFactor-1.0.3-cp310-cp310-manylinux_2_35_x86_64.whl
ed75b62948ff2891b6842805a425cadb3e36cb90 FindAFactor-1.0.3-cp312-cp312-manylinux_2_39_x86_64.whl
f0585bbd412cc3d52986dd428e6cf558a8fa261f FindAFactor-1.0.3-cp38-cp38-manylinux_2_31_x86_64.whl
aaa589ebdbcf7ec3b9a99944d5a675eea48601fc findafactor-1.0.3.tar.gz

The change since last release is to retain one of pair from congruence of squares checks that fail. This should benefit Gaussian elimination.

**Full Changelog**: https://github.com/vm6502q/FindAFactor/compare/v1.0.1...v1.0.2

sha1sum results:
990a2fd042a511af45457ede3bdcc8c95047e464 FindAFactor-1.0.2-cp310-cp310-manylinux_2_35_x86_64.whl
c80c7f0a7ef7d183df1196db88cf4c8536f0d670 FindAFactor-1.0.2-cp312-cp312-manylinux_2_39_x86_64.whl
6ebae6a62ff17301a6daef09be0e6ed7503b2199 FindAFactor-1.0.2-cp38-cp38-manylinux_2_31_x86_64.whl
db1855150173982b797ae2f122b8615e17224882 findafactor-1.0.1.tar.gz