VQC !!Om5byg3jAU ID: 2fe6f6 Jan. 15, 2018, 10:49 a.m. No.2990   🗄️.is 🔗kun   >>3005 >>3010 >>3012 >>3074 >>3192

Afternoon.

As discussed previously.

One way to find a solution is to use the grid or virtual quantum computer in the following way:

Find the cell value at (e,1) where e is the remainder for c.

You are looking for a[t] = na

Remember

At that value, d[t] = na+x

Also

At that value, x[t] = x, the x value in the cell is equal to the x value at (e,n)

 

REMEMBER, the value of x at na in (e,1) is the SAME as x at (e,n)

 

REMEMBER, take d from all values of d[t] at (e,1) and there is a known patter of (n-1) as factor in these values of d[t]-d that is different (increasingly) from the pattern of factors of n in a[t]. It is THIS that gives the offset that is used to solve the problem and thus get the cell at (e,1) to do all the work for you.

VQC !!Om5byg3jAU ID: 2fe6f6 Jan. 15, 2018, 10:52 a.m. No.2991   🗄️.is 🔗kun   >>2992 >>2993 >>2996

>>2989

RSA cracking is a consequence, not an aim.

This is a math problem, not a hackathon, though people are interested in this maths problem for many reasons.

A love of math is one big one.

The true aim is to show the utilisation of P = NP and build or grow from there.