Ok Senpai. Easy Peasy. I'll work up an Excel spreadsheet to calc all the values of (e',1) and (-f',1) for each value in the c'=abq=qc chain. I have a few hours tonight, and a few more tomorrow. Will post my findings soon.
Thanks MM! I thought it was you, you have a kind and polite way with words. Hard to mistake for anyone else.
Thanks AA. so your reading of >>8834 is to use just the (-f',1) and (e',1) columns to find the solution, correct?
You correctly pointed out that VQC basically told me that creating and studying the (e,n) locations for each (small prime) factor of q is unnecessary. It seems that we need only (-f,1) (-e,1) and (-f',1) (e',1) to solve.
>Semiprime c has two (a,b) pairs, giving it two n values including BigN, only one of which we know to begin with. Multiplying c by one prime increases the number of n values to four, of which we can directly calculate two. Multiplying c by two primes increases the number of n values to eight, of which we can directly calculate four. That's what he meant about controlling n'.
So let's cook up a Method for finding what we need.
Are we comparing the BigN values from (-f,1) and (e,1) against (-f',1) (e',1) ?
Are we subtracting equivalent (e') a[t] - (-f') a[t] values to search for (prime)a ?
What methods have you tested out so far to find (n'-1) and (n') ?
A good first step would be to write code to generate the four key elements we need. Then we can analyze them for patterns.