Results 191 to 200 of about 983 (218)

Solution of Systems of Linear Diophantine Equations

2001
Two new methods to solve linear systems of Diophantine equations are proposed - modular (CRT) and p-adic (Hensel). Each of them allows to obtain solutions of a system with the size n x m with the complexity O(nsm). For quasi-square systems, the p-adic method allows to obtain solution with the complexity O(n 3), and the modular method with complexity O ...
openaire   +1 more source

Linear Diophantine Equations

2023
openaire   +2 more sources

Solution to a linear diophantine equation for nonnegative integers

Journal of Algorithms, 1988
The following problem is considered: Find integers x,y,z\(\geq 0\) that satisfy \(ax+by+cz=L\) or determine that no solution exists ...
openaire   +2 more sources

On a linear Diophantine equation

Proceedings of the Indian Academy of Sciences - Section A, 1940
openaire   +2 more sources

An alternative computational optimization technique to solve linear and nonlinear Diophantine equations using discrete WQPSO algorithm

Soft Computing, 2022
Nirmal Kumar, Kumar Nirmal
exaly  

A Linear Diophantine Equation

The American Mathematical Monthly, 1947
openaire   +1 more source

Solving a System of Linear Diophantine Equations with Lower and Upper Bounds on the Variables

Mathematics of Operations Research, 2000
Arjen K Lenstra
exaly  

Methods of solution and criteria of consistency of systems of linear diophantine equations over the set of natural numbers1

Cybernetics and Systems Analysis, 1999
Kryvyi S L, S L Kryvyi
exaly  

Showing the non-existence of solutions in systems of linear Diophantine equations

Mathematics and Computers in Simulation, 2009
A Hernando, Luis M Laita
exaly  

Algorithms for solution of systems of linear diophantine equations in residue fields

Cybernetics and Systems Analysis, 2007
Kryvyi S L, S L Kryvyi
exaly