Intereting Posts

How do I rotate a given point on $\mathbb{S}^n$ so that I send it to the South Pole
Advice on finding counterexamples
Identify $\sum\limits_{n=0}^\infty \left(x_n-L\right)$ where $x_{n+1}=\sqrt{1+x_n}$ and $L^3=L+1$
Example of nested closed balls with empty intersection?
Show that there is such a Sylow subgroup
Is a topological group action continuous if and only if all the stabilizers are open?
Integrating the inverse of a function.
Polynomial with a root modulo every prime but not in $\mathbb{Q}$.
2- or 3-vertex-connected cubic planar bipartite graphs with only one Hamilton cycles
remainder when $43$ divides $32002^{4200}$
If $R$ is an integral domain with unity having only finitely many subdomains (not necessarily with unity), then is $R$ finite?
Given the permutation $\sigma=\left(\begin{array}{ccccc} 1&2&3&4&5\\ 3&1&2&5&4 \end{array}\right)$
Divisibility of consecutive numbers by 6
Prove that $x^\alpha \cdot\sin(1/x)$ is absolutely continuous on $(0,1)$
inequalities with fraction problem x

Let $n\geq2$ be an integer and let $a_1,\ldots,a_n\in\mathbb Z$ with $\gcd(a_1,\ldots,a_n)=1$. Does the equation

$$\begin{vmatrix}a_1&\cdots&a_n\\x_{11}&\cdots&x_{1n}\\x_{21}&\cdots&x_{2n}\\\vdots&\ddots&\vdots\\x_{n-1,1}&\cdots&x_{n-1,n}\end{vmatrix}=1$$

always have an integer solution for the $x_{kl}$’s?

**Motivation**

Consider the following question:

- Determinant of a big matrix
- Prove positive definiteness
- Expressing the determinant of a sum of two matrices?
- Slick proof the determinant is an irreducible polynomial
- Geometric meaning of the determinant of a matrix
- What's an intuitive way to think about the determinant?

Let $(0,0)\neq(a,b)\in\mathbb Z^2$. What is the minimal area of a triangle whose vertices have coordinates $(0,0)$, $(a,b)$ and $(x,y)\in\mathbb Z^2$?

It is easily seen to be $\frac12\gcd(a,b)$, by noting that the area is given by $$\frac12\left|\begin{vmatrix}a&b\\x&y\end{vmatrix}\right|=\frac12|ay-bx|$$

and Bézout’s theorem. Note that this is the case $n=2$. We also have:

Let $(0,0,0)\neq(a_1,a_2,a_3)\in\mathbb Z^3$. The minimal volume of a tetrahedron whose vertices have integer coordinates $(0,0,0)$, $(a_1,a_2,a_3)$, $(x_1,x_2,x_3)$ and $(y_1,y_2,y_3)$ is $\frac16\gcd(a_1,a_2,a_3)$.

The proof is a bit more tedious: (source (in Dutch))

The volume is given by $\frac16\left|\begin{vmatrix}a_1&a_2&a_3\\x_1&x_2&x_3\\y_1&y_2&y_3\end{vmatrix}\right|=\frac16\left|a_1\begin{vmatrix}x_2&x_3\\y_2&y_3\end{vmatrix}+a_2\begin{vmatrix}x_1&x_3\\y_1&y_3\end{vmatrix}+a_3\begin{vmatrix}x_1&x_2\\y_1&y_2\end{vmatrix}\right|$. So it suffices to show that $\left(\begin{vmatrix}x_2&x_3\\y_2&y_3\end{vmatrix},\begin{vmatrix}x_1&x_3\\y_1&y_3\end{vmatrix},\begin{vmatrix}x_1&x_2\\y_1&y_2\end{vmatrix}\right)$ can take any value in $\mathbb Z^3$. Let $(u,v,w)\in\mathbb Z^3$. If $\gcd(v,w)=d>1$, we can solve for $(u,\frac vd,\frac wd)$ and multiply $x_1,y_1$ by $d$ to get a solution for $(u,v,w)$. Assume $\gcd(v,w)=1$. Now choose $x_1=y_1=1$, $x_2,x_3$ such that $x_2v-x_3w=u$ and $y_2=x_2+w$, $y_3=x_3+v$ to get $\left(\begin{vmatrix}x_2&x_3\\y_2&y_3\end{vmatrix},\begin{vmatrix}x_1&x_3\\y_1&y_3\end{vmatrix},\begin{vmatrix}x_1&x_2\\y_1&y_2\end{vmatrix}\right)=(u,v,w)$.

This is what made me think that these observations might generalise to higher dimensions…

- Squares of the form $x^2+y^2+xy$
- Local solutions of a Diophantine equation
- Derivation of Pythagorean Triple General Solution Starting Point:
- Inequality with four positive integers looking for upper bound
- Transforming Diophantine quadratic equation to Pell's equation
- Computing determinant of a specific matrix.
- If $(m,n)\in\mathbb Z_+^2$ satisfies $3m^2+m = 4n^2+n$ then $(m-n)$ is a perfect square.
- How many integer solutions to a linear combination, with restrictions?
- Find all $a,b,c\in\mathbb{Z}_{\neq0}$ with $\frac ab+\frac bc=\frac ca$
- Diophatine equation $x^2+y^2+z^2=t^2$

The conjecture appears true:

For any $a_1,\ldots,a_n\in\mathbb Z$, the determinant of a matrix with them in its first row can be any multiple of their $\gcd$.

It clearly suffices to handle the case in which their $\gcd$ is $1$.

I found a recursive procedure that seems to work. For $n=2$ we take

$$\begin{pmatrix}a_1&a_2\\-b_2&b_1\end{pmatrix}$$

where $b_1a_1+b_2a_2=1$. Now let $n\geq3$ and suppose we’ve constructed $M$ such that

$$\left|\begin{array}{c}a_2&\cdots&a_n\\\hline\\

&\large M\end{array}\right|=\gcd(a_2,\ldots,a_n)=a.$$

Imagine expanding this determinant along the first row. What we get is a linear combination of $a_2,\ldots,a_n$ with the $n-2\times n-2$ minors of $M$, say $m_2,\ldots,m_n$, as coefficients. Note that this implies $\gcd(m_2,\ldots,m_n)=1$, so there exist $c_2,\ldots,c_n\in\mathbb Z$ such that

$$\left|\begin{array}{c}c_2&\cdots&c_n\\\hline\\

&\large M\end{array}\right|=1.$$

Because $\gcd(a_1,a)=1$ we have $xa_1+ya=1$ for some $x,y\in\mathbb Z$. Now observe that

$$\left|\begin{array}{c|ccc}a_1&a_2&\cdots&a_n\\

-y&xc_1&\cdots&xc_n\\\hline

0\\

\vdots&&M\\

0\end{array}\right|=a_1\cdot\left|\begin{array}{c}xc_2&\cdots&xc_n\\\hline\\

&\large M\end{array}\right|+y\cdot\left|\begin{array}{c}a_2&\cdots&a_n\\\hline\\

&\large M\end{array}\right|=1.$$

**Note:** the obtained matrix will look like

$$\begin{pmatrix}a_1&a_2&a_3&\cdots&a_{n-1}&a_n\\

*&*&*&\cdots&*&*\\

0&*&*&\cdots&*&*\\

0&0&*&\cdots&*&*\\

\vdots&\ddots&\ddots&\ddots&\vdots&\vdots\\

0&0&0&\cdots&*&*\end{pmatrix},$$

which is called an upper Hessenberg matrix.

- Prove $\sum_{n=1}^\infty(e-\sum_{k=0}^n\frac1{k!})=1$
- How do you go about learning mathematics?
- $ \int_{-\infty}^{\infty} x^4 e^{-ax^2} dx$
- recurrence relations for proportional division
- When is a Morphism between Curves a Galois Extension of Function Fields
- Show that $\lim_{x \to c} x^{3}=c^{3}$
- What algebraic topology book to read after Hatcher's?
- Application of Cauchy Integral
- Why can't we quantify over propositional functions in the ZFC set theory?
- A fundamental solution for the Laplacian from a fundamental solution for the heat equation
- Probability of two people meeting in a given square grid.
- Ways to Choose Three Adjacent Elements from a Set
- Is norm $E^{1/p}$ a continous function of $p$
- Derivative of ${x^{x^2}}$
- Combinatorial Proof for Binomial Identity: $\sum_{k = 0}^n \binom{k}{p} = \binom{n+1}{p+1}$