P vs NP

Method or an Algorithm for Search; Simultaneous determination and verification of the prime factors of any square free positive integer

From: The computational complexity class: NP — complete
Up to: The computational complexity class: P

And this is possible with the use of the optimization parameter: 205440
which is determined, with the input or lower prime factor: 641

And this allows to obtain in linear execution time, the other prime factor:
[641 + 2. (3349888)] = 67000417

As stated by Polignac’s conjecture. Which is proven to be true. Driving all of the above to the conclusion and demonstration of:
P = NP