October 13, 2000
The present work includes some of the author's original researches on integer solutions of Diophantine liner equations and systems. The notion of "general integer solution" of a Diophantine linear equation with two unknowns is extended to Diophantine linear equations with $n$ unknowns and then to Diophantine linear systems. The proprieties of the general integer solution are determined (both for a Diophantine linear equation and for a Diophantine linear system). Seven original integer algorithms (two for Diophantine linear equations, and five for Diophantine linear systems) are exposed. The algorithms are strictly proved and an example for each of them is given. These algorithms can be easily implemented on the computer.
Similar papers 1
October 12, 2009
In this paper we propose a method of solving a Nonlinear Diophantine Equation by converting it into a System of Diophantine Linear Equations.
November 7, 2006
This note presents the basic mathematical structure of a new integer factorization method based on systems of linear Diophantine equations.
April 12, 2024
Monograph "B. Grechuk, Polynomial Diophantine equations. A systematic approach" suggests solving Diophantine equations systematically in certain order. Many hundreds of the equations are left to the reader. Here, we provide complete solutions to all these equations. The difficulties of solved equations range from elementary to research level. In the last section, we present a summary table of all solved equations ordered by their size, which makes them easy to find. As a resu...
April 12, 2024
This paper collects polynomial Diophantine equations that are amazingly simple to write down but are apparently difficult to solve.
March 13, 2010
The paper introduces particle swarm optimization as a viable strategy to find numerical solution of Diophantine equation, for which there exists no general method of finding solutions. The proposed methodology uses a population of integer particles. The candidate solutions in the feasible space are optimized to have better positions through particle best and global best positions. The methodology, which follows fully connected neighborhood topology, can offer many solutions o...
May 2, 2007
In this paper one shows if the number of natural solutions of a general linear equation is limited or not. Also, it is presented a method of solving the Diophantine equation $ax-by=c$ in the set of natural numbers, and an example of solving in $N$ a Diophantine equation with three variables.
February 21, 2014
This work determine the entire family of positive integer solutions of the diophantine equation. The solution is described in terms of $\frac{(m-1)(m+n-2)}{2} $ or $\frac{(m-1)(m+n-1)}{2}$ positive parameters depending on $n$ even or odd. We find the solution of a diophantine system of equations by using the solution of the diophantine equation. We generalized all the results of the paper [5].
October 21, 2002
This is an expository lecture on the subject of the title delivered at the Park-IAS mathematical institute in Princeton (July, 2000).
February 16, 2007
In this article we determine several theorems and methods for solving linear congruences and systems of linear congruences, and we find the number of distinct solutions. Many examples of solving congruences are given.
April 6, 2016
In this book a multitude of Diophantine equations and their partial or complete solutions are presented. How should we solve, for example, the equation {\eta}({\pi}(x)) = {\pi}({\eta}(x)), where {\eta} is the Smarandache function and {\pi} is Riemann function of counting the number of primes up to x, in the set of natural numbers? If an analytical method is not available, an idea would be to recall the empirical search for solutions. We establish a domain of searching for the...