Anonymous ID: 7ae764 Dec. 17, 2017, 2:44 p.m. No.38   ๐Ÿ—„๏ธ.is ๐Ÿ”—kun   >>41

>>32

ofw not one of us sat there and stared at cells (0,1), (1,1), (2,1) , :p

 

>>35

>voice chat

working on Virtual Quantum Chatroom here, think of your favourite number, subtract the largest square and I'll meet you there

Anonymous ID: 7ae764 Dec. 17, 2017, 7:17 p.m. No.78   ๐Ÿ—„๏ธ.is ๐Ÿ”—kun   >>82 >>83

>>58

>Example, for cell (2, 1):

 

>the set of all a's for t=0 -> 10:

 

>[1, 3, 9, 19, 33, 51, 73, 99, 129, 163]

 

>The cells (2, 3), (2, 9), (2, 19), etc will all be non-empty.

 

and (2,11) where the 11 comes from the 33.

Anonymous ID: 7ae764 Dec. 17, 2017, 7:27 p.m. No.83   ๐Ÿ—„๏ธ.is ๐Ÿ”—kun   >>86

>>78

which is interesting because this has factored 33 for us. we wouldn't know what row to look in though, not just yet, if the factorization of 33 weren't known, but I think this gets at part of the mechanism by which the grid reveals factors of composites

Anonymous ID: 7ae764 Dec. 17, 2017, 7:35 p.m. No.87   ๐Ÿ—„๏ธ.is ๐Ÿ”—kun   >>89 >>90

>>82

>Unfortunately, this is not the complete pattern.

 

>It works for e < 9 and e = 10, and some other values, but not for most large e.

 

>It is still true for that all the cells will be non-empty, but others will also be non-empty, (look at e=9).

 

>See images. Sorry for small font. The first is e=3, the second is e=9.

 

explain what is violated if you don't mind. you have non-empty cells for (9,n) where n isn't a factor of the (a,b) values at (9,1)?

Anonymous ID: 7ae764 Dec. 17, 2017, 7:45 p.m. No.91   ๐Ÿ—„๏ธ.is ๐Ÿ”—kun   >>93

>>89

gotcha, yes. I pointed out earlier that n only has to be a factor of the (a,b) values. 3 divides 9, which is an a-value.

 

when 33 was an a-value, n=11 was non-empty. and this could be pretty important as it decomposes 33=113 or 9=33

 

>>86

>You can move forwards or backwards through the tree at any point.

 

>Move backwards by following a (at t=1) to (e, a).

 

>Move forwards by following a or b at any t when a or b are bigger than n for some t.

 

>Each way through this tree, x will be the same.

 

>I posted an example back in RSA #3 I think.

 

A promising approach thank you! It is hard to catch / track all of each other's insights then, I missed this in RSA 3

Anonymous ID: 7ae764 Dec. 17, 2017, 7:52 p.m. No.95   ๐Ÿ—„๏ธ.is ๐Ÿ”—kun   >>111 >>96

>>93

an even tree and an odd tree? I think it's brilliant and follows some of what VQC seemed to get at (he wanted to see some of the graphics with odd-only and even-only versions). I don't know how to set it up but worth looking at.

Anonymous ID: 7ae764 Dec. 18, 2017, 3:50 a.m. No.264   ๐Ÿ—„๏ธ.is ๐Ÿ”—kun

>>247

>>261

funny, I come here to explore a math problem and find at least a couple anons willing to be true skeptics of religion and math:

>Skeptic does not mean him who doubts, but him who investigates or researches as opposed to him who asserts and thinks that he has found. [Miguel de Unamuno, "Essays and Soliloquies," 1924]

 

If all points in space and time are and have always been connected, then naturally our hearts and minds access that all the time. Prayer and meditation work with the deeper connections, not depending on space and time. Did any anons play Final Fantasy games growing up? The myth was always: "there used to be magic, but technology took over, and now no one believes in magic. We face dark forces but we band together. Relearn magic." Grow up, find out Japanese video games prepared me. what a world.

 

I believe that one of the messages of the New Testament is an invitation to vertically evolve. Horizontal evolution is Darwinian and slow. Plugging into technology could make us faster but in a way which is (I think) a trap. Normy society already being devolved/artificialized through technology (yes it can be used for good too). Vertical evolution is tapping into what's given to us. Bible invites us to uncover. Read book of John, to me the tone is "why aren't you using what I gave you." Ok that's my side rant.

Anonymous ID: 7ae764 Dec. 18, 2017, 4:49 a.m. No.266   ๐Ÿ—„๏ธ.is ๐Ÿ”—kun   >>267 >>268

Recap of one of the current focuses: starting from any (e,n), the cells which are 2n apart in the e-direction form a sequence in which the x and n values both stay fixed (hence "small squares," (x+n)^2, are fixed), and in which a, b, and d increase by one for each jump of 2n columns to the right. You can move left into the negative columns down to a = 1.

 

{ -5: 2: 4: 3: 1: 11}

{ -1: 2: 5: 3: 2: 12}

{ 3: 2: 6: 3: 3: 13}

{ 7: 2: 7: 3: 4: 14}

{11: 2: 8: 3: 5: 15}

{15: 2: 9: 3: 6: 16}

{19: 2:10:3: 7: 17}

 

These are all products where a, b are 10 apart. The next one is missing though 818 = 144. Because it's a perfect square already so it got put in cell (0,0). What about the next one after that? For 919 the element is

{2: 1: 13: 4: 9: 19} then

{4 :1 :14: 4: 10: 20}

{6: 1: 15: 4: 11: 21}

โ€ฆ

 

so this one finishes in the top row and seems like goes on forever in that row. Wonder if I started at n=3 the sequence would do a line in row 3 then a line in row 2 then row one forever.

 

So as some of you noticed the rule isn't universal but it's there.

Anonymous ID: 7ae764 Dec. 18, 2017, 5:07 a.m. No.267   ๐Ÿ—„๏ธ.is ๐Ÿ”—kun

>>266

and as a follow-up the positive versions of the negative terms in that list are in row 3.

>{ -5: 2: 4: 3: 1: 11}

>{ -1: 2: 5: 3: 2: 12}

 

{2: 3: 3: 2: 1: 11}

{8: 3 :4 :2 :2 :12}

Anonymous ID: 7ae764 Dec. 18, 2017, 1:09 p.m. No.344   ๐Ÿ—„๏ธ.is ๐Ÿ”—kun

>>276

fastest is checking last bit. I had a CS course where we benchmarked a lot of things. For one assignment we were graded based on speed of program vs rest of students and I did pretty well though I'm a beginner coder. You can just sample the last bit, one or zero is even or odd. Don't remember commands

Anonymous ID: 7ae764 Dec. 18, 2017, 1:18 p.m. No.346   ๐Ÿ—„๏ธ.is ๐Ÿ”—kun   >>349

>>293

>>294

>>297

>>298

 

Repeat: the a and b values are usually composite (most numbers are). if you factor them, the factors will appear as valid 'n.'

 

Example: a=21. then look in rows 3 and 7 even if 3 and /or 7 are not a, b values in row 1.

 

do you copy. over.

Anonymous ID: 7ae764 Dec. 18, 2017, 9:35 p.m. No.446   ๐Ÿ—„๏ธ.is ๐Ÿ”—kun   >>447 >>448

>>419

because no one has a good answer besides the one(s) who named it Virtual Quantum Computer. most people with experience with quantum physics are going to be not just normie but supernormie, ie. guardians of status quo in which they believe they know science best, so ironically they wouldn't help either imo, they'd laugh and run. in quantum physics, probablilities are heavily involved. A superposition of states โ€“ but some more probable. In a VQC? assuming it's not a larp? Perhaps a type of superposition not involving probability. Or for all I know probability is involved.

 

Last thing โ€“ this might not matter but hey it's the truth: we associate the word 'quantum' with some of the weirdness in atomic scale physics. But the word really just means that the energy levels come in discrete quantities (associated with electron orbits for example), as opposed to being continuous. Relevance unknown.