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

DOI10.1080/00207169408804249zbMATH Open0983.11501OpenAlexW2154467300MaRDI QIDQ4839718FDOQ4839718

Authors: Jacob Shapiro, Jerry Waxman 

Publication date: 23 April 2002

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169408804249

Recommendations

• scientific article; zbMATH DE number 4025501
• scientific article; zbMATH DE number 5041056
• Generalizing a theorem of Schur.
• A combinatorial proof of Euler-Fermat’s theorem on the representation of the primes p=8k+3 by the quadratic form x 2+2y 2
• Primes at a (Somewhat Lengthy) Glance

zbMATH Keywords

explicit algorithmconstructive proof of Scherk's theoremScherk's representation of primes

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Primes (11A41)

Cites Work

• Note on Complete Sequences of Integers
• Proof of Scherk's Conjecture on the Representation of Primes

Cited In (2)

• Title not available (Why is that?)
• A short proof of the multidimensional Szemerédi theorem in the primes

This page was built for publication: A constructive proof of scherk's theorem on the representation of primes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4839718)