Let and be points on a plane such that , where is a positive integer. Let be the set of all points such that , where is a real number. The path that traces is continuous, and the value of is minimized. Prove that is rational for all positive integers
Some researchers are going to put you to sleep. During the two days that your sleep will last, they will briefly wake you up either once or twice, depending on the toss of a fair coin (Heads: once; Tails: twice). After each waking, they will put you back to sleep with a drug that makes you forget that waking. When you are first awakened, to what degree ought you believe that the outcome of the coin toss is Heads?
[source: Wikipedia
If you switch the rows (2, n), (3,n-1), ..., you'll get a circulant matrix and there's a formula for the determinant of circulant matrices. In your case, the answer is
The last two rows are cyclic shifts of each other, meaning one is just a shifted version of the other.
So, the last two rows are linearly dependent.
The last two rows can't be linearly dependent, since that would mean that one is a multiple of the other.
As others mentioned, there's a nice formula for the determinant of a circulant matrix, where each row is a shift of the previous: It turns out that it has eigenvalues where is any th root of unity. The corresponding eigenvectors are so that gives a nice factorization for the determinant:
Here is an anti-circulant matrix; to find a circulant matrix it is enough to consider , where is the permutation , for and the others are (note that ).
Indeed, , where is the cycle . Let .
Let ; then and . . and if and , then . Up to the signum, .
Exercise: . Finally .
This post has been edited 4 times. Last edited by loup blanc, Mar 31, 2025, 1:52 PM