Existence of Integer Solutions

Bogdan Grechuk
Additional contact information
Bogdan Grechuk: University of Leicester, School of Computing and Mathematical Sciences

Chapter Chapter 7 in Polynomial Diophantine Equations, 2024, pp 537-606 from Springer

Abstract: Abstract The size of a polynomial with integer coefficients is computed by replacing each coefficient by its absolute value and evaluating the resulting polynomial at 2. This chapter investigates whether Diophantine equations have any integer solutions at all (Hilbert 10th Problem). The chapter starts with elementary methods like the integral Hasse principle, but then proceed to more advanced methods, such as the use of Jacobi symbol or the analysis of possible prime divisors of cubic polynomials. The chapter ends with a discussion of which equations are solvable in positive integers.

Date: 2024
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-031-62949-5_7

Ordering information: This item can be ordered from
http://www.springer.com/9783031629495

DOI: 10.1007/978-3-031-62949-5_7

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().