Diophantine Representation of the Set of Prime Numbers

DOI10.2307/2318339MaRDI QIDQ4103087zbMATH OpenOpenAlexWikidataFDO

Authors James P. Jones, Daihachiro Sato, Hideo Wada, Douglas P. Wiens

Publication date 1976

Published in The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2318339

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Applications of computability and recursion theory (03D80) Primes (11A41) Linear Diophantine equations (11D04) Cubic and quartic Diophantine equations (11D25) Diophantine equations (11D99) Decidability (number-theoretic aspects) (11U05) Decidability and field theory (12L05)

Cited in

(25)

• Recursive formulae for prime numbers
• Primes are nonnegative values of a polynomial in 10 variables
• Recent developments in primality proving
• Formal foundations for the origins of human consciousness
• Infiniteness sets of primes, admitting diophantine representations in eight variables
• Definability, decidability, complexity
• On the residues of binomial coefficients and their products modulo prime powers
• Layering quantum-resistance into classical digital signature algorithms
• Prime representing polynomial
• The Bateman-Horn conjecture: heuristic, history, and applications
• Diophantine representation of the decimal expansions of e and
• Three universal representations of recursively enumerable sets
• Two conjectures on the arithmetic in \(\mathbb R\) and \(\mathbb C\)
• Complexity bounds on proofs
• Universal diophantine equation
• Extensions of Hilbert's tenth problem
• JOHN KNOPFMACHER, [ABSTRACT] ANALYTIC NUMBER THEORY, AND THE THEORY OF ARITHMETICAL FUNCTIONS
• The distribution of prime pairs differing by 2
• Mixed-integer convex representability
• Different approaches to the distribution of primes
• Prime representing polynomial with 10 unknowns -- introduction. II
• Computational considerations on the representation of number-theoretic functions by arithmetic terms
• On integer sequences in cryptography
• What can and cannot be done with Diophantine problems
• Affine linear sieve, expanders, and sum-product

This page was built for publication: Diophantine Representation of the Set of Prime Numbers

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