P=/=NP(RSA) Trivial Proof via Menger Dimension-Theory(DT) Fluctuations(DFS) Table and Sipser Graphic: [Analogy to Siegel(64) FLT Proof]: Algorithmic- “Complexity”(AC) = Utter-Simplicity(US): NP-Completeness(NPC) aka Siegel “FUZZYICS”/(SPD/M)!

Algorithmic-“complexity”(AC)=utter-simplicity in Siegel P=/=NP(RSA) trivial proof via Menger[Dimensiontheorie(29)]/Polya[How to Solve It(45/73)-table] dimension-theory(DT) dimensionalty-fluctuations(DFS) table and Sipser[Intro./Thy.Computations(13)-fig.#1.15!] graphic. P “=” NP aka deterministic-polynomial P “=” NP aka deterministic-polynomial “=” non-deterministic polynomial aka DP “=” NP. dim(D) “=” dim(M) because P cancels: deterministic D is serial aka dim(D)=1 VS. dim (M)=2+E(if probabilistic) aka non-deterministic =planar forking-triangles simplex: 1<2+E(if probabilistic) aka 1=/= 2+E. Ergo P=/=NP! US!(analogy to Siegel (64)[<<