Integer Algorithms to Solver Diophantine Linear Equations and Systems

In this paper we suggest an implementation of Runge's method for solving Diophantine equations satisfying Runge's condition. In this implementation we avoid the use of Puiseux series and algebraic coefficients.

The subject matter of this work are the linear, three variable diophantine equation ax+by+cz=d (1), and the diophantine system ax+by+cz=d (2) ex+fy+gz=h with the coefficients a,b,c,d,e,f,g,h being integers. Introductory number theory books, typically contain only a brief outline of how to solve equation (1). Even less or no material is offered on the system (2). The purpose of this work is to fill this gap. After some preliminary, introductory material, which includes the gen...

The paper presents a new generalized integer orthogonal transformation which consists of a well known orthogonal transform followed by stretching the basis vectors maintaining the asymptotic behavior of the number of integer solutions for algebraic Diophantine equation. The author shows the properties of this transformation and he receives the algorithm for finding the matrix elements of a generalized integer orthogonal transformation for algebraic Diophantine equation of the...

In this paper we show a way to generalize the linear Diophantine equation a1x1+a2x2+...+anxn=d . We deal with the nonlinear Diophantine equation det|A X|=+-d , which generalizes the linear one, and we give a necessary and sufficient condition for its solvabiliy. We show how the linear equation can be considered as a particular case of the nonlinear equation.

The paper shows that the asymptotic density of solutions of Diophantine equations or systems of the natural numbers is 0. The author provides estimation methods and estimates number, density and probability of k- tuples $<x_1,...x_k>$ to be the solution of the algebraic equations of the first, second and higher orders in two or more variables, non-algebraic Diophantine equations and systems of Diophantine equations in the domain of the natural numbers. The estimate for the nu...

This survey article is an introduction to Diophantine Geometry at a basic undergraduate level. It focuses on Diophantine Equations and the qualitative description of their solutions rather than detailed proofs.

In this extended abstract we deal with the relations between the numerical/diophantine approximation and the symbolic/algebraic geometry approachs to solving of multivariate diophentine polynomial systems, obtaining several consecuences ranging from diophantine approximation to effective number theory.

This paper initiates a novel research direction in the theory of Diophantine equations: define an appropriate version of the equation's size, order all polynomial Diophantine equations starting from the smallest ones, and then solve the equations in that order. By combining a new computer-aided procedure with human reasoning, we solved the Hilbert's tenth problem for all polynomial Diophantine equations of size less than $31$, where the size is defined in (Zidane, 2018). In a...

Author developed a method in the paper, which, unlike the circle method of Hardy and Littlewood (CM), allows you to perform a lower estimate for the number of natural (integer) solutions of algebraic Diophantine equation with integer coefficients. It was found the lower estimate of the number of natural solutions to various types of homogeneous algebraic Diophantine equations with integer coefficients diagonal form with any number of variables using this method. Author obtain...

The paper attempts to find numerical solutions of Diophantine equations, a challenging problem as there are no general methods to find solutions of such equations. It uses the metaphor of foraging habits of real ants. The ant colony optimization based procedure starts with randomly assigned locations to a fixed number of artificial ants. Depending upon the quality of these positions, ants deposit pheromone at the nodes. A successor node is selected from the topological neighb...