>>8470
What do you mean "when you've made c into an"?
Is there anything we can actually do with the gaps aside from them being a stopper for any (e+2n,n) movements? "Not VQC" said "lookup in gaps" but if there aren't any cells we can generate what are we even meant to look at when it comes to the gaps?
I've updated my program that shows you everything down the factor tree. Instead of just creating a giant text dump, you can tell it what you want to see specifically (so you could just analyze the an cells for example, rather than having to look for them in a giant 6-page wall of text with every other pattern). It'll also work with bigger numbers now (probably not RSA-sized, but if the highest prime factor is maybe 7 digits long it should only take 80 seconds at most - this is because it looks for all ab pairs down the tree). Since we're on 8ch, just so nobody gets paranoid, I'll just put it here using pastebin, but I can put a jar somewhere if anyone wants.
everything.java (contains main) — https://pastebin.com/XfG1SwYN
BigCell.java (also required) — https://pastebin.com/309hK39c
The x values in the (e,1) and (f,1) cells where a[t]=BigN and BigN-1 add together to make 2d-1 (so if you took the next cell up (t+1) in one of those you’d get 2d+1 too since x iterates by 2).