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

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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:International journal of computer mathematics Ročník 50; číslo 3-4; s. 125 - 130
Hlavní autoři: Shapiro, Jacob, Waxman, Jerry
Médium: Journal Article
Jazyk:angličtina
Vydáno: Abingdon Gordon and Breach Science Publishers S.A 01.01.1994
Taylor and Francis
Témata:
Algebra
Algorithmics. Computability. Computer arithmetics
Algorithms in number theory
Applied sciences
Computer science; control theory; systems
Discrete mathematics
Exact sciences and technology
F.2
G.2
Logic and foundations
Mathematical logic, foundations, set theory
Mathematics
Number theory
Problem complexity
Recursion theory
representation of prime numbers
Scherk's theorem
Sciences and techniques of general use
Theoretical computing
Complexity class
Algorithm
Prime number
Number theory
ISSN:0020-7160, 1029-0265
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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).
ISSN:0020-7160
1029-0265
DOI:10.1080/00207169408804249