# Tag: integer factorization

• ## My Integer Factorization Study: Hahaha!!

Advertisements I am laughing at the sheer trickiness, almost by design, of the mathematical relationships I am uncovering in my number study, and the most recent one in particular. I shared yesterday the VERY SMOOT GRAPH, suggesting to me a parabola, charting out the plot of odd integer m vs. the difference between (m+1)/2 and…

• ## Integer Factorization: Update, 10/12/2022

Advertisements Lately, I’ve just been switching back and forth between a kind of macrovision and microvision in examining properties related to my factorization study. I’ve gone back to my table of large (but not very large) discrete semiprimes, and I’ve also looked at, and added information to, my table of the smallest discrete semiprimes, all…

• ## Integer Factorization: Reestablishing Some Basic Steps

Advertisements I wrote this in an effort to restate some recent basic observations plainly. I am confident that this is no newly-discovered set of mathematical truths, but I am enjoying making these derivations piece by piece and seeing what may follow from each successive one. Perhaps someday I will end up somewhere new. Right now,…

• ## Mathematical Explorations: Maximally Composite

Advertisements It’s time for some fun and games with some square-free “maximally composite” odd numbers and all their representations as the difference of perfect squares. It’s kind of like following a growing pristine wave with patterns I didn’t expect to encounter, until it smashes into foam and chaos against a rocky shore.

• ## Integer Factorization: Quick Observation

Advertisements Examining the series of real values of x for which f(x)=x2+2cx+r is a perfect square, when m=c2-r is the number we wish to factor, c is the Ceiling Root, and r is the difference between m and the Ceiling Square, is not evidently any better – and is in fact a slower and unenlightening…

• ## Integer Factorization: When x^2+2cx+r Yields a Perfect Square

Advertisements For odd positive integer m=c2-r, define the characteristic polynomial f(x)=x2+2cx+r. We are looking for the least nonnegative integer x for which f(x) is a perfect square. Completing the square of the polynomial may give us a way to find values of x given f(x). I decided to try to determine when f(x) = 0,…

• ## Integer Factorization: A More Uniform Test, and a Similar Result

Advertisements For 100 pairs of randomly-chosen p and q less than 100,000,000: the Perl routine factor_it_4.pl performed as shown in the following scatter plot of m=pq vs. the number of iterations it required to factor m: Notice, as I mentioned in my blog post about the previous, less uniform test, that the number of iterations…

• ## My Integer Factorization Study: Leading Me Ever Back

Advertisements As I’ve previously shared, my math study seems to lead me in kind of a circular path, between periods of great excitement at potentially profound discoveries, and “letdown” periods where I realize what I “discovered” is something not only already evident, but blindingly obvious. I still want to remain happily agnostic about which of…

• ## Integer Factorization: Performance Stats/Graphs for factor_it_4.pl

Advertisements I ran factor_it_4.pl tonight on the collection of 10-digit and 12-digit discrete semiprimes I had generated earlier in my study. An image of the table I generated is below, along with scatter plots of particular behaviors. If someone wanted, I could certainly supply them with the raw data used to generate the graphs. I…

• ## My Fastest Factorization Script So Far

Advertisements This won’t set any algorithmic speed records, but I am happy with it, for now. It comes in at 48 lines of Perl code. factor_it_4.pl is definitely faster than factor_it_3.pl, and routinely gets its answer in fewer than half the iterations of factor_it_2.pl. Once again, I am not experienced with writing arbitrary-precision arithmetic scripts…