todai-math

2018 todai-engineering-math

2 maths questions

Q2 Invariant lines and eigenvalues and vectors Properties of eigenvalues under matrix operations View
I. Suppose that $\lambda$ is an eigenvalue of a regular matrix $\boldsymbol { P }$, prove that:
  1. $\lambda$ is not zero.
  2. $\lambda ^ { - 1 }$ is an eigenvalue of $\boldsymbol { P } ^ { - 1 }$ and $\lambda ^ { n }$ is an eigenvalue of $\boldsymbol { P } ^ { n }$, where $n$ is a positive integer.

II. Suppose $\boldsymbol { P }$ is an orthogonal matrix. When the following symmetric matrix $\boldsymbol { A }$ can be diagonalized by $\boldsymbol { P }$, find the matrix $\boldsymbol { P }$ and obtain the diagonalized matrix.
$$A = \left( \begin{array} { c c c } 2 & - 1 & 1 \\ - 1 & 2 & - 1 \\ 1 & - 1 & 2 \end{array} \right)$$
III. When a matrix $\boldsymbol { P }$, and vectors $\boldsymbol { r }$ and $\boldsymbol { x }$ are given as
$$\boldsymbol { P } = \left( \begin{array} { c c c } 1 & 1 & 1 \\ p & p ^ { 2 } & p ^ { 3 } \\ q & q ^ { 2 } & q ^ { 3 } \end{array} \right) , \quad \boldsymbol { r } = \left( \begin{array} { c } r \\ r ^ { 2 } \\ r ^ { 3 } \end{array} \right) , \quad \boldsymbol { x } = \left( \begin{array} { c } x \\ y \\ z \end{array} \right) ,$$
where $p , q$, and $r$ are non-zero real numbers that differ from each other.
  1. Find the condition that $p$ and $q$ must satisfy in order for $\boldsymbol { P }$ to be a regular matrix.
  2. When $\boldsymbol { P } ^ { \mathrm { T } } \boldsymbol { x } = \boldsymbol { r }$ has a single solution, obtain $\boldsymbol { x }$. Here, $\boldsymbol { P } ^ { \mathrm { T } }$ is the transposed matrix of $\boldsymbol { P }$.

IV. The matrix $\boldsymbol { P } _ { n }$ is an $n$-th order square matrix ( $n \geq 2$ ), as shown below, where $p$ and $q$ are real numbers that differ from each other.
$$\boldsymbol { P } _ { n } = \left( \begin{array} { c c c c c c } p + q & q & 0 & \cdots & 0 & 0 \\ p & p + q & \ddots & \ddots & \vdots & \vdots \\ 0 & p & \ddots & \ddots & 0 & \vdots \\ \vdots & 0 & \ddots & \ddots & q & 0 \\ \vdots & \vdots & \ddots & \ddots & p + q & q \\ 0 & 0 & \cdots & 0 & p & p + q \end{array} \right)$$
  1. Obtain the recurrence formula satisfied by the determinant of $\boldsymbol { P } _ { n }$, $\left| \boldsymbol { P } _ { n } \right|$.
  2. Express the determinant $\left| \boldsymbol { P } _ { n } \right|$ in terms of $p , q$, and $n$, using the recurrence formula in Question IV.1.
Q6 Permutations & Arrangements Distribution of Objects into Bins/Groups View
There are $n$ children queuing in a line. You have $m$ candies and will begin handing out 1 or 2 candies to each child, starting from the first child in the line. You hand out the candies until reaching the end of the line or until there are no candies left. Answer the following questions. Note that $n$ and $m$ are positive integers.
I. Show the number of distribution patterns of candies if $n = m = 4$.
II. Show the number of distribution patterns of candies if $m \geq 2 n$.
III. Define $X _ { m }$ as the number of distribution patterns of candies if $n \geq m$. Show the recurrence formula satisfied by $X _ { m }$.
IV. Obtain $X _ { m }$ using the recurrence formula in Question III.
V. Consider the situation where the number of children is larger than the number of candies. Define $P ( m )$ as the ratio of the number of distribution patterns (where the distribution finishes by giving 2 candies) to the total number of distribution patterns. $P ( m )$ converges as $m$ increases. Compute the convergence value.
VI. Consider the situation where $m \geq 2 n$. The following rules are added to the way of handing out the candies: For the first child in the line, the probability of receiving 1 candy is $1 / 2$ and the probability of receiving 2 candies is $1 / 2$. If a child receives 1 candy, the probability of the next child receiving 1 candy is $1 / 2$ and the probability of receiving 2 candies is $1 / 2$. If a child receives 2 candies, the probability of the next child receiving 1 candy is $3 / 4$ and the probability of receiving 2 candies is $1 / 4$. Compute the probability that the $n$-th child in the line receives 2 candies.