Answer:
see explanation
Step-by-step explanation:
The nth term of an AP is
= a₁ + (n - 1)d
where a₁ is the first term and d the common difference
Given a₅ is double a₇ , then
a₁ + 4d = 2(a₁ + 6d) , that is
a₁ + 4d = 2a₁ + 12d ( subtract a₁ from both sides )
4d = a₁ + 12d ( subtract 12d from both sides )
- 8d = a₁
The sum of n terms of an AP is
= 
[ 2a₁ + (n - 1)d ] , substitute values
= 
( 2(- 8d) + 16d)
= 8.5(- 16d + 16d)
= 8.5 × 0
= 0
Answer:
a) False
b) False
c) True
d) False
e) False
Step-by-step explanation:
a. A single vector by itself is linearly dependent. False
If v = 0 then the only scalar c such that cv = 0 is c = 0. Hence, 1vl is linearly independent. A set consisting of a single vector v is linearly dependent if and only if v = 0. Therefore, only a single zero vector is linearly dependent, while any set consisting of a single nonzero vector is linearly independent.
b. If H= Span{b1,....bp}, then {b1,...bp} is a basis for H. False
A sets forms a basis for vector space, only if it is linearly independent and spans the space. The fact that it is a spanning set alone is not sufficient enough to form a basis.
c. The columns of an invertible n × n matrix form a basis for Rⁿ. True
If a matrix is invertible, then its columns are linearly independent and every row has a pivot element. The columns, can therefore, form a basis for Rⁿ.
d. In some cases, the linear dependence relations among the columns of a matrix can be affected by certain elementary row operations on the matrix. False
Row operations can not affect linear dependence among the columns of a matrix.
e. A basis is a spanning set that is as large as possible. False
A basis is not a large spanning set. A basis is the smallest spanning set.
I believe that the answer is 90x+27
Answer:
9 + (-8) = 1
Step-by-step explanation:
Answer:Step-by-step explanation: 13:10
