18.06 Spring 2012 Problem Set 10 (not handed in/not graded)
This short extra problem set is not to be handed in. The problems are meant to help you
learn about linear transformations. The textbook problems are out of the 4th edition.
1. Do Problem 30 from
Solution Set 7, 18.06 Fall '11
n > 1.
1 or 1
Prove that the determinant of an
matrix with every entry
Solution. Consider the big sum formula for computing the determinant. It will have
n! permutations), each one equa
Solution Set 5, 18.06 Fall '11
1. Take two connected graphs
(i.e. a big graph with
(a) What is the rank of
as two disjoint parts).
CERTIFI_CATE Lu _TT_ER
This is to certify that Mr./Ms. SANDEEB kUM ,_
yOorD/O K'Agkmge" SINQH 2 isstudying
in the nal year for the degree (or prenal year dualdegree stream) of
M echanicg Q Engineemga .
Signature of Candidate With Date: 3%
Signature of the