Tag: perl

Integer Factorization: Update for 25 September 2023
Advertisements An incidental quirk i noticed in jumpfactor.pl outputs led me to scurry to program a jumpfact2.pl based thereon, but which produced a speedup in only one out of the fifty test numbers (10 to 12 digits) of my discrete semiprime data suite. What that exciting/disappointing work caused me to pause has resumed: a more…

Integer Factorization: Revision to jumpfactor.pl, March 8, 2023
Advertisements I added a usage line, and also programmed the loop to look only at numerators which are even, cutting the number of iterations of the main loop in half. Thus repurposed variable “idx” as the Zone number, and added another variable to serve as the iteration counter. The revised code will be, and will…

Integer Factorization: New Algorithm and Routine – jumpfactor.pl
Advertisements Reality has tempered and sobered my earlier excitement, but I still think this new approach holds promise. And there’s a lot I can’t yet tell about the new Perl factorization script jumpfactor.pl just yet – it’s brand new code, after all. On the sobering side, my initial assessment that the interZone jumps grew rapidly…

Integer Factorization: It’s Getting Thrilling (Again)
Advertisements I am so excited. Yes, I’m struggling mightily to contain that excitement with a large dose of realism – nah, still VERY excited about this. I’m in the midst of programming a new factorization algorithm and Perl script, jumpfactor.pl. I’ve finished writing and initially testing the code for calculating some initial values, and will,…

Integer Factorization: A Brief Observation Before I Start Coding jumpfactor.pl
Advertisements I noticed and thought about something that bemuses me concerning the new integer factorization algorithm in my mind about to turn itself into Perl code on ChrIIstopher, my MacBook Pro: I am using both varieties of Ceiling Squares that I have developed and defined during this study: the initial one, which is the least…

Integer Factorization: Series of Ceiling Squares, Take 3 (or 4)
Advertisements I embarrassed myself twice this week, having to take down insufficiently debugged algorithms and Perl code for not testing thoroughly enough. However, I now have an algorithm I’ve once again tested, and will test some more (yes, opening the possibility that a bug will require me to correct/retract), and this one has a symmetric…

Integer Factorization: The Hive Mind, Now Automated
Advertisements I’ve written a perl script to produce the “Beehive Plots” that I am currently using to search for patterns and relationships between odd positive integers, their (Adjusted) Ceiling Squares, and their Fermat factorizations, if they have them. Remember that to each possible factorization of a positive odd integer m=ab, where a and b are…

Integer Factorization: A More Uniform Test, and a Similar Result
Advertisements For 100 pairs of randomlychosen 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…

Integer Factorization: Performance Stats/Graphs for factor_it_4.pl
Advertisements I ran factor_it_4.pl tonight on the collection of 10digit and 12digit 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 arbitraryprecision arithmetic scripts…