Do all the things like ++ or -- rants, post your own rants, comment on others' rants and build your customized dev avatarSign Up
From the creators of devRant, Pipeless lets you power real-time personalized recommendations and activity feeds using a simple APILearn More
What's the use case for this?
If you can go from p to f w/o initially knowing the initial factors, it's another method to factor a product.
I'm a bit of an idiot savant (well the former more than the latter lol), and I've just basically been throwing every possible iteration and combination of ideas at faster factorization solutions.
If you don't know where to begin, try everything.
And I'm hoping this is the solution, or part of it.
All combinations of factors?
You're probably unfamiliar but I made a sensational claim a while back (a few) to be able to factor very large numbers quickly. Admittedly I was foolhardy but this is basically the thrust of it.
If you can derive f from p, then *maybe* factoring p can be done in less than exponential time. Of course it likely trades time for memory requirements but I still don't know enough at this point.
Why? Are you familiar with the subject or math? What are you thinking?
I knew it was you after reading the first three words of this rant
@nitwhiz yes, but does it intrigue you?
Found an exception already, though it may because it is trivial.
int('100000001000000', 2) =
(we stop here because we cant divide cleanly)
3 should be the index, but in this case the correct index for 7 in a list of primes is 4 (assuming a 1's based index).
This is the kind of errors that I make that make people think I'm just fucking with them.
lolcube4891yYo wisecrack. You tryin to bruteforce math?
I'm with you