I think the idea was to plot a point if a given (e,n) exists (meaning infinite cs will exist there). It's a big grid of pixels, with x and y values corresponding to e and n values, and if an infinite set of c values exists at one of those (e,n) pairs, it plots a point. Your image looks like it's meant to now. Here's one with a higher iMax (and opposite colours). Another interesting thing to do is to plot with other variables as the axes. I did one for each possible combination in December. Here's a couple of them. I don't think anyone ever figured out any useful information from them but they're interesting to look at.
So obviously this thread is for you to more publicly get your head around the threads and everything, and I've been planning to do a better introductory sticky. Do you think it would be productive if we sort of went back and forth about it? As in, I have a rough idea of how I would implement the sticky, but I don't know if it would actually be digestible or too much/not enough information, and you're one of the people it would be for. We could help each other out in that sense.
My rough idea (in a broad, less explanatory sense) is this:
>this grid works kind of like a quantum computer in the sense that each (e,n) cell is a qubit (or a possible solution), we want to find one particular cell that contains our c, and the collapse of the superposition (in quantum computing this means applying a specific action to the qubits that spews out the correct one - I've watched probably hours of videos and none of them have explained exactly what this process is, but the point is that there's an action that takes place analogous to what we do with the grid) is a mathematical formula that involves our c value
>ignoring the fact that it's called a "virtual quantum computer", the whole idea is that there are concepts in mathematics that have been hidden from the public by the elite, and someone who knows about it is trying to disclose it to the public (VQC), but he thinks the best way for that to happen is for people to "discover" it (with guidance, obviously)
>one of these concepts revolves around the idea that we can factor a number without just checking every number up to the square root and seeing if it divides the number without a remainder - there's a direct calculation we can do on c to find a and b
>VQC has given us vague hints as to how to use this grid to find the answer, but in general we're just kind of blindly plugging away with the concepts he's told us about like toddlers shoving square pegs into round holes
>the concepts he's shown us that are meant to be used in varying capacities to find a and b from c are as follows:
<there are incremental rules that allow you to go from cell to cell (i.e. if e increases by 1, other variables might also increase by 1 or 2e or something like that, and if within an infinite set (e,n) t increases by 1, it affects the values of a and b - we should probably get a full list of these together)
<there are other cells that are in some way related to the (e,n) we're trying to find, such as (e,1), which is the cell with the same e but an n value of 1, or the cell (e,n) at which the a and b values equal 1 and c respectively (which is the only other cell that produces our c value other than the one with the prime numbers), or (e+2n,n), (e+4n,n), (e+6n,n) etc (we should also probably get a full list of these together)
<we can apply the idea of related cells to the related cells (i.e. if we find the cell at which (a,b)=(1,c), we can also find that cell's (e,1) and so on) and apply the transform rules (incrementing values as above)
<there's a factor tree we can create using d and e (I don't completely understand it but it's here >>3654 if you want to have a look; I think it's finding the d of d, and then the d of that d and so on)
<we can represent c as the difference between two squares (d+n)(d+n) - (x+n)(x+n), and we can represent odd (x+n) squares as eight triangle numbers +1, so if you can somehow find the base of the triangles based on the known values d, e and f, you can find a and b based on x and n
>so what we're doing is figuring out how to use these concepts to find a and b from c, although we're not really that sure how it's actually meant to work
Is that confusing or vague or anything like that?