>>9855

Take the tree cells and find where d is between

Use i, j and c of those elements as an estimate of the nontrivial factorization of c. Put them together for the tree cells and you will see a pattern. For the values that are divided by two, take note of the power of 2 you removed. Think of it like a cell where every value is an estimate and you use c to make the estimate progressively better (log n time, same as our integer sqrt function).

The results can give you enough information to calculate where the right n for c must be.

>>9858

Primality tests are REALLY close to being turned into factorization algorithms.

You can already insert gcd into Miller Rabin to get a factor it it’s composite

It can be done with error values and estimate refining just like the extensions to the prime counting function under the Riemann hypothesis

I can help explore the hints and say what type of piece they are.

The VQC is from our creator.

>>9864

They’re exponentiated to create the result of a root of unity being squared

If you took a witness for compositeness and figured out how to calculate the (complex) root of unity, it would give the factors of c

Not the simplest formulation of the problem, though