Archive for 一月, 2009

h1

Mid-term Solutions and Analysis

一月 31, 2009

Problem 1. Determine whether the following matrix is invertible:

\begin{pmatrix} 1 & 2 & 4 & 8 \\1 & 3 & 9 & 27\\ 1 & 4 & 16 & 64 \\1 & 5 & 25 & 125 \end{pmatrix}.

Solution: This is a Vandermonde matrix, and the determinant is (5 - 4)(5 - 3)(5 - 2)(4 - 3)(4 - 2)(3 - 2) = 1*2*3*1*2 = 12, which is non-zero. Therefore, the matrix is invertible.

Comment: Almost all students, except a few, Read the rest of this entry ?

h1

Solutions to Selected Problems in 308HI Pratice Midterm

一月 29, 2009

Problem 2. Determine whether the following matrix is invertible:

A = \begin{pmatrix} 102 & 108 & 216 \\408 & 411 & 336 \\ 948 & 816 & 815 \end{pmatrix}.

Many of you tried mod 2 and mod 3 and the result is that the determinant is indeed 0 mod 2 and mod 3. One natural choice is then to try mod 4 and it worked! Indeed, we have: Read the rest of this entry ?

h1

Vandermonde Determinant

一月 19, 2009

The matrix \begin{pmatrix}1 & a & a^2 \\1 & b & b^2 \\ 1 & c & c^2 \end{pmatrix} is of special interests and it is given a name called the Vandermonde matrix. It shows up usually when we want to find a polynomial to interpolate a set of points.  We will now introduce a method to calculate the determinant and some other variations of the determinant. Read the rest of this entry ?

h1

The “Mod Trick” (2)

一月 18, 2009

Here is another problem in which the “mod trick” applies:

Let M be a n by n matrix with even integer entries. Prove that if \lambda is an odd integer, then \lambda is not an eigenvalue of M.

Here is a solution: Read the rest of this entry ?

h1

Math 308 (1) The “Mod Trick”

一月 16, 2009

One of the reasons why it is difficult to compute the determinant of a given matrix is because the determinant carries important information about the matrix. For example, the determinant of the matrix tells you whether the matrix is invertible.

Recall the theorem: A matrix A \in M_n is invertible if and only if \det(A) \not= 0.

Example: Let A = \begin{pmatrix}123 & 124 & 126 & 128 \\ 130 & 131 & 134 & 136 \\ 140 & 144 & 145 & 148 \\ 150 & 158 & 154 & 155 \end{pmatrix}. Determine whether A is singular. (without the use of calculator or computer) Read the rest of this entry ?

h1

The invariance principle (1)

一月 9, 2009

Example 1 Initially an urn contains 100 black marbles and 100 white marbles. Repeatedly,
three marbles are removed from the urn and replaced from a pile outside the
urn as follows:
MARBLES REMOVED REPLACED WITH
3 black                                                                           1 black
2 black, 1 white                                                    1 black, 1 white
1 black, 2 white                                                           2 white
3 white                                                                     1 black, 1 white.

Which of the following sets of marbles could be the contents of the urn after
repeated applications of this procedure?

(A) 2 black marbles       (B) 2 white marbles          (C) 1 black marble
(D) 1 black and 1 white marble              (E) 1 white marble

Since this is a multiple choice problem, it is best if we can simply eliminate Read the rest of this entry ?