Systems of linear equations
[26/81%]Find the general solution and one particular solution of the system of linear equations, using the Gauss method:
Investigate the system and find the general solution depending on the value of the parameter :
Find all vectors of the space that map to the vector under the linear mapping given by the matrix :
;
;
;
;
;
;
;
.
Find the general solution and a fundamental system of solutions of the system of equations:
Find some basis of the kernel of the linear mapping given by the matrix:
;
;
;
;
;
.
Using Cramer's rule, solve the system of equations:
Find a polynomial of degree two with real coefficients such that .
Find a polynomial of degree three such that .
Find a polynomial of degree four such that .
Solve the system of congruences:
Prove that if the determinant of a square matrix of order with integer entries is relatively prime to a natural number , then the system of congruences
has a unique solution modulo .
Let be an integer matrix and let be the smallest of the absolute values of its entries. Prove that if, under integer elementary transformations of the rows and columns of , the number does not decrease, then divides all entries of the matrix .
Prove that, using elementary row and column transformations over the ring , any integer matrix can be reduced to the form , where and , .
Prove that if a square integer system of linear equations has a unique solution modulo every prime number , then it also has a unique solution over the ring of integers.
Determine whether a square integer system of linear equations that is consistent modulo every prime number is necessarily consistent over the ring of integers.
Prove that the following systems of equations have a unique solution modulo all primes except finitely many of them. Solve these systems modulo the remaining primes:
Prove that every system of linear equations with real coefficients can be reduced to echelon form using only elementary transformations of type II.
Prove that under integer elementary row and column transformations of an integer matrix, the greatest common divisor of its minors of a fixed order does not change.
Prove that if an integer matrix has been reduced, by integer elementary row and column transformations, to the form , where and , then the numbers are uniquely determined (up to sign).
Two sets of unknowns are called integrally equivalent if they are related by
where is an integer matrix whose determinant is equal, in absolute value, to 1. Prove that the system of equations
where are integers, is equivalent, over the ring of integers, to a system of equations of the form
where the set of unknowns is integrally equivalent to the set .
Prove that an integer system of equations has an integer solution if and only if, for every natural number , the greatest common divisors of all minors of order in the matrix of the system and in its augmented matrix coincide.
Prove that an integer system of equations has an integer solution if and only if it has a solution modulo every prime .
Justify the following practical method for finding all integer solutions of a system of equations
with integer coefficients. Construct the matrix of size . Then, using only integer elementary transformations of the first rows and columns, reduce this matrix to the form , where , . Then the system is consistent if
and the general solution is given by the formula
where are arbitrary integers.
Find all integer solutions of the following systems of equations:
;
Let and be matrices of the same size, such that the homogeneous systems of linear equations with matrices and are equivalent. Prove that one can pass from to by elementary row transformations.
Let a system of linear complex equations be given, with a square nonsingular matrix . Suppose that the sum of the absolute values of the entries in each row of the matrix is less than 1. Let be an arbitrary column, and define inductively . Then the sequence of columns converges to the solution of the equation .