Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Infiniteness sets of primes, admitting diophantine representations in eight variables

From MaRDI portal
Publication:1807459
Jump to:navigation, search

DOI10.1007/BF02358993zbMath0932.11078MaRDI QIDQ1807459

Maxim Vsemirnov

Publication date: 22 November 1999

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)


zbMATH Keywords

prime numbersHilbert's tenth problemdiophantine representation


Mathematics Subject Classification ID

Decidability (number-theoretic aspects) (11U05) Recursively (computably) enumerable sets and degrees (03D25)


Related Items (1)

What can and cannot be done with Diophantine problems



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Primes in progressions to prime-power modulus
  • Infinite Sets of Primes with Fast Primality Tests and Quick Generation of Large Primes
  • An unsolvable problem in number theory
  • Universal diophantine equation
  • Diophantine Representation of the Set of Prime Numbers
  • Diophantine representation of Mersenne and Fermat primes
  • On Linnik's constant.
  • Hilbert's Tenth Problem is Unsolvable
  • Reduction of an arbitrary diophantine equation to one in 13 unknowns
  • On prime numbers in an arithmetic progression with a prime-power difference


This page was built for publication: Infiniteness sets of primes, admitting diophantine representations in eight variables

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1807459&oldid=14164429"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 10:13.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki