Thanks PMA, very clear explanation. So are we still looking for a way to verify when we arrive at the correct solution, or will this give us a match when we reach the correct u value?
BAKER=
RSA #10 —- http://archive.fo/anGD7
Solid post, PMA! I'm loving all the triangles, and they make understanding of how to deal with remainders straightforward. As usual, thanks for your work!
General Note: I'm gonna check out Topol's Discord chat, AND my home base will remain here. Also, we shouldn't have kicked Topol out of the RSA general. I've visited a few times to EZ bake, but no many others have. I enjoy his posts. Nuff Said.
Let's keep working and having fun, faggots!
Hey AA! Your analysis is accurate, and your foresight and experience kept us solid when CBTS gave us the boot. My personal conclusion is that this board is the best place to get work done, AND if people want to supplement that with chatting on Discord, then great.
At this point we’ve all been working together so long, it would be a waste to disrupt our harmonious frequencies with discord among the brethren (lol, couldn’t resist lads). Seriously tho, let’s not make this a big issue. A team needs harmony to thrive. Thanks to both AA and Topol all they have contributed. Let’s keep going!
Hello VQC! Ah, this is why why you said "this" to the division of the (x+n) square that had the sharp lines. We end up with triangle side measurements of u and u+1 for each one of the 8Tu. Primes are often created by adding or removing 1, so our u and u+1 triangles can help generate primes??
Here's some more examples from a new cell (7,8) I picked because it has odd (x+n) squares. The top two parts are just calculating out all variables for clarity.
The bottom part has the iteration process for the first element in (7,8).
You can see the solution at (x+n)^2 = 121 when n0=8. So (x+n) = 11
11 - 8 = x = 3
Then you can solve for a and b vars.
AA, you're right. But we all (VQC Anons) wish (you) could just join the Chat. Vault 7. Wikileaks. We're all compromised at the chip and boot level. Maybe you're right, but we're fighting for the freedom of the world. It doesn't matter at this point. Join Or Die.
Wow, these results look good PMA. So You're holding f constant, and finding multiple matches for a given (x+n) square? Am I reading the results correctly? So different c and d values for each example, but f and (x+n) stay the same for the purpose of the test?
Thanks for clarifying. Interesting that holding d constant produces answers with large -e values, but then pops out the correct solution! On your second example, with such a large f value, how did you decide where to begin iterating?
Thinking out loud here. Could the remainder of f-2 mod 8 limit our search to certain multiples of n? Or said another way, does the mod have a connection to the correct n, or even the parity of n?
Bantz and Shitz! Nice to see you. It’s still the best LARP ever. ;)
Hello PMA! On your examples with 3 nn-1 squares, the symmetry would be perfect if you used just nn.
Hear me out.
In nn+2d(n-1)+f-1 there are two 1's that cancel. Expanded formula is this:
nn+2d(n-1)+2d+1-e-1
so the +1 and -1 cancel.
Is this correct, anons?
Hey AA! I remember, and have been keeping an eye out. I'm honestly not too concerned about VQC, I think the timelines just keep getting bumped just like Q does. I can't spend any energy worrying about it TBH. It would be great if he could check in and let us know he's OK tho.
Wow! 50% improvement is great. That's a huge step forward, PMA.