Look our fave 145: {1:5:12:7:5:29}
145 / 4 = 36 R1
So x + n should be even, and 7 + 5 = 12, so yep, it is. I think this property is only true for RSA numbers, i.e., product of two coprimes
Also, 145 is the stupidest possible number we could use as a favorite default, since e = 1, x + n = d in the final answer, n = a and all other manner of misleading shit
I think I speak for everyone on this: we're here because we know it's important. We will mercilessly call you and each other faggots, larpers, and worse, but mostly to sharpen steel upon steel.
All persons left here right now are true believers. Steel-on-steel has birthed us, we are ready with code, we fear not the consequences; nay we desire them!
Disclaimer: I have no idea what the fuck I'm talking about.
However, you can see here: >>4338 that it was my immediate concern as well. WTF is 5 all about? VQC has an uncanny ability to be extremely subtle, mostly because in my opinion, he's a flaming autist (and one we all love).
But, like reading scripture (not that I do it much), you are required to ask hamfisted, belligerent questions and then switch your brain into a different mode to scan for subtle clues.
Chapter and verse: >>4339
>Let's say we made it four instead of five
Ponder……. OK, choice may be arbitrary.
Ponder………. Now read: >>4340
>the base chosen to create from (f-2) is arbitrary
Hmm
>The objective is to find a base larger than n and smaller than x+n at this stage.
So 5 is a "base". The objective I think is analogous to Newton's method; you need an initial guess to get the process started. The process will transform our initial guess to be n < HERE < x + n
If I were to read further into it, I'd guess 5 is the minimum, recall exactly near where our sqrt() ran into trouble. I think what you need is: any divisor with at least a result of 8 on the other side, since we have 8 triangles (not sure what that's exactly called).
Does this make any sense?
>How would your code identify you?
// TODO: remove self portrait below//// * g o a t s e x * g o a t s e x * g o a t s e x // g g // o / \ \ / \ o// a| | \ | | a// t| . | | : t// s | | \| | s// e \ | / / \\ -- \ : e// x \ \/ _--~~ ~--| \ | x // * \ _-~ ~-_\ | // g _ \ .--------.______\| | g// o \ ______// _ ___ _ ((__ \ | o// a \ . C ) ((> | / a// t /\ | C _)/ \ (__> |/ t// s / /\| C__) | (> / \ s// e | ( C)_/ // / / \ e// x | \ |__ \______// (/ | x// * | \ _) `---- --' | *// g | _ \ / / | g// o | / | | \ | o// a | | / \ \ | a// t | / / | | \ |t// s | / / __/_/ | |s// e | / | | | |e// x | | | | | |x// * g o a t s e x * g o a t s e x * g o a t s e x *
Look what happened to this guy!
>Perhaps he simply chose 5 "arbitrarily" because it was easy to see.
Looks that way to me.
>So I have another question, is x or n larger? Is it possible to tell?
>How do we go about aiming for this n<HERE<x+n?
Look back at the triangles with the blue line. The guess "base" of this top triangle is 5. What we need to do is move the guess (the blue line) down the triangle until it is within n < HERE < x + n.
Seems to me we probably can't detect when we pass 'n' but can probably detect when we pass 'x+n', so we can use the previous iteration's result as a safe n < HERE < x + n value.
So if you think about moving the base (blue line) down, there is a bunch of space between our initial guess and the place we want to be. Apparently if we fill this space with the correct sized-objects.
>We have a method to calculate what n would be if we used our blue base […]. This n will call n0, to make it different from the value of n that will be our solution.
>We will add a method to calculate what would be missing from the triangles if we could only fill them with n0 squared and multiples of 2d.
So we have to fill a triangle with the top removed with n0^2 and 2d-sized objects, apparently this will help us move the blue line downward to the correct place.
Fucking retards didn't know
>He is able to open the scroll and its seven seals
ITS EIGHT TRIANGLE NUMBERS YOU STUPID FUCKS
Claiming quads of 4 for spiritual energy. A prayer to our ancestors: please don't let us live in a P != NP world; we need a VQC to help us (who DINDU NUFFIN) forward in life.
I hereby pronounce this day the day of 4, which has very material implications in the lives of square numbers.
Yeah, I think you solve for mod and only consider matching mod-s?
>We then know that if the base of f/40 is too small
Charitable language I think, basically f/40 is a guess, but a guess which shares something in common with the solution, probably mod
>then the number of 2d to add must have the same left over on the last d to create the final base of each triangle. THIS is key.
Iterate on chunks of 2d, looking for a matching mod value, then something probably
There are a couple of things that irritate me about VQC's posts there. The first is how 5 was pulked out of a fucking hat just because f ended in 5. The next was, magically, consideration of 5 lines through the triangle.
Are those 5's related? Is that 5 a minimum (see faulty orig sqrt func, etc, fun with BigIntegers) Is 5 the BEST or just handy for explanation? If not the best, what is? biggest? smallest? WTF?