Infiniteness sets of primes, admitting diophantine representations in eight variables
From MaRDI portal
Publication:1807459
DOI10.1007/BF02358993zbMATH Open0932.11078MaRDI QIDQ1807459FDOQ1807459
Authors: Maxim Vsemirnov 
Publication date: 22 November 1999
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
Recommendations
Recursively (computably) enumerable sets and degrees (03D25) Decidability (number-theoretic aspects) (11U05)
Cites Work
- Title not available (Why is that?)
- Reduction of an arbitrary diophantine equation to one in 13 unknowns
- Title not available (Why is that?)
- Title not available (Why is that?)
- Hilbert's Tenth Problem is Unsolvable
- Primes in progressions to prime-power modulus
- On prime numbers in an arithmetic progression with a prime-power difference
- Universal diophantine equation
- Diophantine Representation of the Set of Prime Numbers
- On Linnik's constant.
- Title not available (Why is that?)
- An unsolvable problem in number theory
- Diophantine representation of Mersenne and Fermat primes
- Title not available (Why is that?)
- Infinite Sets of Primes with Fast Primality Tests and Quick Generation of Large Primes
- Title not available (Why is that?)
Cited In (6)
- Prime representing polynomial with 10 unknowns -- introduction. II
- Prime representing polynomial with 10 unknowns
- Formalizing a Diophantine representation of the set of prime numbers
- Chebotarev sets
- What can and cannot be done with Diophantine problems
- On the Diophantine complexity of the set of prime numbers
This page was built for publication: Infiniteness sets of primes, admitting diophantine representations in eight variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1807459)
