>>1830

To be precise, that x+n is exactly (c-1)/2.

The c=1*c factorization translates into c=((c+1)/2)^2 - ((c-1)/2)^2 as a difference of squares.

>>1912

Here you go: 299420368396866329.

This is factorable with normal means, of course, but if you just want to test your algorithm…

>>1916

Heh, okay… how about 75644981.

But yeah, recursion when you really want a loop could be problematic.

>>1932

Has the VQC grid been useful to you in doing that, or are you mostly using traditional factoring techniques?

>>2047

I'd recommend printing out the i values as it goes to see what it's doing for so long.

The bound_change feature seems to be a brute-force search in disguise.

>>2176

Looks like N for the 1cc record is equal to (c-1)(c-1)/2.

>>2187

Yep, same value I believe.