A constructive proof of scherk's theorem on the representation of primes

Abstract

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).

Keywords:

• Algorithms in number theory
• representation of prime numbers
• Scherk's theorem

C.R Categories:

• G.2
• Discrete mathematics
• F.2
• Problem complexity