Integer Algorithms to Solver Diophantine Linear Equations and Systems

Details Integer Algorithms to Solver Diophantine Linear Equations and Systems Integer Algorithms to Solver Diophantine Linear Equations and Systems

2000-10-13

arxiv.org/abs/math/0010134v4

Mathematics

General Mathematics

57 pages. Partially included in author's M. Sc. Thesis, University of Craiova, Department of Mathematics and Computer Science,

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Integer Algorithms to Solver Diophantine Linear Equations and Systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Integer Algorithms to Solver Diophantine Linear Equations and Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Integer Algorithms to Solver Diophantine Linear Equations and Systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-725593