VA !!Nf9AmQNR7I ID: 1d5a78 Jan. 30, 2018, 4:47 p.m. No.3727   🗄️.is 🔗kun   >>3729

>>3725

>>3726

I was gonna say, "Baker you forgot x's little brother t. Don't mess with our little brother, homie."

>{e:n:d:x:a:b} + c makes the VQC a 7-dimensional grid.

Plus little brother t = 8 dimensions?

VA !!Nf9AmQNR7I ID: 1d5a78 Jan. 30, 2018, 4:51 p.m. No.3728   🗄️.is 🔗kun

>>3724

Hey Teach! Can you give an example of the pythagorean triples as they relate to the number tree or the VQC? I'm interested over here to see your ideas.

VA !!Nf9AmQNR7I ID: 1d5a78 Jan. 30, 2018, 10:12 p.m. No.3743   🗄️.is 🔗kun

I'm here and able to work for the next 120 minutes. Let's work faggots. I'll check in with VQC too.

VA !!Nf9AmQNR7I ID: 1d5a78 Feb. 5, 2018, 3 p.m. No.4009   🗄️.is 🔗kun   >>4010

>>4006

I like your thinking here PMA! I'm working over here, and will post some work in progress and questions a bit later, just nothing major to report. Here's a quick fun question:

for all n>1, Floor(SQRT(Abs(f))) + what? = x

 

You know we gotta start from c.

"what?" could be a piece from the factor tree.

 

>>4005

I could care less about RSA too, just enjoying the challenge of solving a math problem. I think NSA already has this secret math, they just want release to be crowdsourced. Also, it will increase GEOTUS' Anons to Legend status and ALL THE WORLD WILL TREMBLE at our autistic Reeeeeeeeeeeeee! Think about it, it's partly a PR campaign for us.

"We the people forgot how to Play"

"We the people have the Power"

VA !!Nf9AmQNR7I ID: 1d5a78 Feb. 5, 2018, 3:28 p.m. No.4016   🗄️.is 🔗kun   >>4020

>>4010

>>4011

Hey MA! Agreed.

Only problem is we don't have n starting from c. Can we find n in the factor tree and plug it in? We get c,d,e,f to start and that's it. So the missing piece for the formula is an n approximation?? Let's find it.

VA !!Nf9AmQNR7I ID: 1d5a78 Feb. 7, 2018, 5:34 p.m. No.4105   🗄️.is 🔗kun   >>4106

Ok guys, I'm gonna take another swing at the big picture.

 

So, we start with c,d,e,f (known). n,x,a,b (unknown) What about a basic scan down the e column for matching c,d? We already know there are multiple possibilities, (1,c) [which we can calculate n for], (prime a b) and we know that they have different n values. What if there are more possibilities than just (1,c) and (prime a b)? How do we find all difference of squares that fit c and d for a given e column? Thinking out loud here. Can we write code to find all matching a b for c d? Wouldn't be log n tho :(