Jump to content

Indeterminate system

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Johnjbarton (talk | contribs) at 02:37, 21 March 2025 (Conditions giving rise to indeterminacy: Actually do the delete). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In mathematics, particularly in number theory, an indeterminate system has fewer equations than unknowns but an additional a set of constraints on the unknowns, such as restrictions that the values be integers.[1]

Examples

Linear indeterminate equations

For given integers a, b and n, a linear indeterminant equation is with unknowns x and y restricted to integers. The necessary and sufficient condition for solutions is that the greatest common divisor, , is divisable by n.[1]: 11 

Finding the solution set of an indeterminate linear system

Let the system of equations be written in matrix form as

where is the coefficient matrix, is the vector of unknowns, and is an vector of constants. In which case, if the system is indeterminate, then the infinite solution set is the set of all vectors generated by[2]

where is the Moore–Penrose pseudoinverse of and is any vector.

See also

References

  1. ^ a b Hua, Luogeng (1982). "Chapter 11. Indeterminate Equations". Introduction to Number Theory. SpringerLink Bücher. Berlin, Heidelberg: Springer Berlin Heidelberg. ISBN 978-3-642-68130-1.
  2. ^ James, M., "The generalised inverse", Mathematical Gazette 62, June 1978, 109–114.

Further reading