A constructive proof of scherk's theorem on the representation of primes
Jacob Shapiro, Jerry Waxman · International Journal of Computer Mathematics · 1994
All of the known proofs of Scherk's theorem are existence proofs which are non-constructive, and don't provide a procedure for choosing the signs in Scherk's representation of primes. This paper presents a constructive proof of Scherk's theorem based on an explicit algorithm for choosing the signs in time 0(n).