Evaluate $$\int_{0}^{\pi/2}(\tan x)^a\text{d}x$$
$$\int_{0}^{\pi/2}\int_{0}^{\pi/2}\left(\frac{\sin x}{\sin y}\right)^a\text{d}x\text{d}y$$
(in particular for $a=1/2$, the answes is $\pi$.)
Solution. Use the Beta function trigonometric definition.
Determinant of arithmetic functions
Let $$f(a,b)=\sum_{d|a, \ d|b}d.$$ Let $M=(a_{i,j})_{i,j=1}^{n}$. Evaluate $\det M$.
Solution. The idea is utilization of Lower-upper triangular decomposition. Using a software (like Mathematica) one observes that for small $n$ the matrices $L$ and $U$ coulde be intepreted as - $L=(l_{i,j})_{i,j=1}^{n}$, where $$l_{i,j}=\begin{cases} 1, & \text{j divides i}\\
0, & \text{otherwise} \end{cases}$$ and $U=(u_{i,j})_{i,j=1}^{n}$ where $$u_{i,j}=\begin{cases} i, & \text{i divides j}\\
0, & \text{otherwise} \end{cases}$$
It is directly verified that this holds in general (all $n$).
Obviously $\det L=1$, while $\det U=n!$ (the diagonal elements are $1,2,\ldots,n$). Thus $\det M=n!$.
The same idea could be employed for similar looking determinants, for example the one having $\gcd(i,j)$ at place $(i,j)$.
Solution. The idea is utilization of Lower-upper triangular decomposition. Using a software (like Mathematica) one observes that for small $n$ the matrices $L$ and $U$ coulde be intepreted as - $L=(l_{i,j})_{i,j=1}^{n}$, where $$l_{i,j}=\begin{cases} 1, & \text{j divides i}\\
0, & \text{otherwise} \end{cases}$$ and $U=(u_{i,j})_{i,j=1}^{n}$ where $$u_{i,j}=\begin{cases} i, & \text{i divides j}\\
0, & \text{otherwise} \end{cases}$$
It is directly verified that this holds in general (all $n$).
Obviously $\det L=1$, while $\det U=n!$ (the diagonal elements are $1,2,\ldots,n$). Thus $\det M=n!$.
The same idea could be employed for similar looking determinants, for example the one having $\gcd(i,j)$ at place $(i,j)$.
Prime divides element with index that prime
Let $s$ be a positive integer. Let $\{a_n\}_{n=1}^{\infty}$ be a
sequence given by $$a_1=0, \ a_2=2s, \ a_3=3, \ a_{n+3}=s a_{n+1}+a_n \ \
\ \text{for} \ n\ge 1.$$
Prove that for any prime number $p$, the number $a_p$ is divisible by $p$.
Solution. Let the roots of the equation $x^3-sx-1=0$ be $x_1, x_2$ and $x_3=-x_1-x_2$ (Vieta's formulas), they are algebraic integers (by definition). One directly observes (using the initial conditions) that $a_n=x_1^n+x_2^n+(-x_1-x_2)^n$. Assume $p>2$ (the other is obvious). We have
$$a_p=x_1^p+x_2^p+(-x_1-x_2)^p=-\sum_{k=1}^{p-1}{p\choose k}x_1^kx_2^{p-k}$$
${p\choose k}$ is divisible by $p$ for $1\le k \le p-1$, so we obtain that $a_p=p A$ where $A$ is an algebraic integer, since algebraic integers form a ring. However, from here we see that $A$ is also rational, hence $A$ is integer. Thus $p$ divides $a_p$.
I would like to thank Mr. Bozhilov for finding a mistake in the original proof, and his fruitful discussion, which led to a resolution.
The problem appeared at AKHIMO 2018.
Prove that for any prime number $p$, the number $a_p$ is divisible by $p$.
Solution. Let the roots of the equation $x^3-sx-1=0$ be $x_1, x_2$ and $x_3=-x_1-x_2$ (Vieta's formulas), they are algebraic integers (by definition). One directly observes (using the initial conditions) that $a_n=x_1^n+x_2^n+(-x_1-x_2)^n$. Assume $p>2$ (the other is obvious). We have
$$a_p=x_1^p+x_2^p+(-x_1-x_2)^p=-\sum_{k=1}^{p-1}{p\choose k}x_1^kx_2^{p-k}$$
${p\choose k}$ is divisible by $p$ for $1\le k \le p-1$, so we obtain that $a_p=p A$ where $A$ is an algebraic integer, since algebraic integers form a ring. However, from here we see that $A$ is also rational, hence $A$ is integer. Thus $p$ divides $a_p$.
I would like to thank Mr. Bozhilov for finding a mistake in the original proof, and his fruitful discussion, which led to a resolution.
The problem appeared at AKHIMO 2018.
Simple one (Lucas theorem)
Consider the integers $${n \choose k}$$
for $k=0,1,\ldots,n$. It turns out that the number of those which are odd is always a power of $2$.
Proof. Direct application of Lucas theorem. $ \displaystyle {n \choose k}$ is odd exactly when the $1's$ in the binary represenation of $k$ correspond only to $1's$ in the binary representation of $n$. If $n$ has exactly $d$ $1's$ then the number of such $k$ is $2^d$.
for $k=0,1,\ldots,n$. It turns out that the number of those which are odd is always a power of $2$.
Proof. Direct application of Lucas theorem. $ \displaystyle {n \choose k}$ is odd exactly when the $1's$ in the binary represenation of $k$ correspond only to $1's$ in the binary representation of $n$. If $n$ has exactly $d$ $1's$ then the number of such $k$ is $2^d$.
Yet another solution of an old problem
Consider a problem we already solved (in a weaker setting) in a previous post.
Let $x_1,\ldots, x_n$ be complex numbers, such that $$x_1^k+\cdots +x_n^k=0$$ for all $k\in\{1,\ldots,n\}$. Prove that all of the numbers are zeros.
Here we would investigate another approach. The idea is simple. First we construct a matrix $A$ whose characteristic polynomial has as roots $x_1,\ldots, x_n$. Then we use the fact that $\text{Tr}(A^k)=x_1^k+\cdots+x_n^k$ to successively eliminate all the coefficients, hence showing that $x_1,\ldots,x_n$ are roots of $x^n=0$.
Assume $x^n-a_1 x^{n-1}-\cdots-a_{n-1}x-a_n$ is a polynomial whose roots are precisely $x_1,\ldots,x_n$. Then the matrix
$$ A= \begin{pmatrix}
a_1 & a_2 & a_3 & \dots & a_{n-1} & a_n \\
1 & 0 & 0 & \dots &0 & 0 \\
0 & 1 & 0 & \dots &0 & 0 \\
\vdots &\vdots & \vdots &\vdots &\ddots &\vdots\\
0 & 0 & 0 & \dots &1 & 0
\end{pmatrix}
$$ has this polynomial as characteristic.
Since $\text{Tr}(A)=0$ we have $a_1=0$. Now assume we have deduced that $a_1=\cdots=a_k=0$ for some $k\le n-1$. It is easy to see by induction that $$A^{k+1}=\begin{pmatrix}
a_{k+1} & a_{k+2} & a_{k+3} & \dots & \dots & a_{n} & 0 & \dots & 0\\
0 & a_{k+1} & a_{k+2} & \dots & \dots & a_{n-1} & a_n &\dots & 0\\
\vdots &\vdots &\vdots &\vdots &\vdots &\vdots &\vdots &\vdots &\vdots\\
0 & 0 & 0 & \dots &a_{k+1} & \dots & \dots & \dots & a_n \\
1 & 0 & 0 & \dots &\dots &\dots &\dots &\dots &0 \\
0 & 1 & 0 & \dots &\dots &\dots &\dots &\dots &0\\
\vdots &\vdots &\vdots &\vdots &\vdots &\vdots &\vdots&\vdots&\vdots\\
0 & 0 & \dots & 1 & 0 & \dots & \dots &\dots & 0
\end{pmatrix}$$
(the matrix may not be perfectly written, but you got the feeling)
From here is evident that $\text {Tr}(A^{k+1})=(k+1) a_{k+1}$. Hence $(k+1)a_{k+1}=0$ thus $a_{k+1}$ is zero. Thus we obtain that all the coefficients are zero. Hence the roots.
Comment. Does this solution generalizes the problem into a more abstract setting?
Let $x_1,\ldots, x_n$ be complex numbers, such that $$x_1^k+\cdots +x_n^k=0$$ for all $k\in\{1,\ldots,n\}$. Prove that all of the numbers are zeros.
Here we would investigate another approach. The idea is simple. First we construct a matrix $A$ whose characteristic polynomial has as roots $x_1,\ldots, x_n$. Then we use the fact that $\text{Tr}(A^k)=x_1^k+\cdots+x_n^k$ to successively eliminate all the coefficients, hence showing that $x_1,\ldots,x_n$ are roots of $x^n=0$.
Assume $x^n-a_1 x^{n-1}-\cdots-a_{n-1}x-a_n$ is a polynomial whose roots are precisely $x_1,\ldots,x_n$. Then the matrix
$$ A= \begin{pmatrix}
a_1 & a_2 & a_3 & \dots & a_{n-1} & a_n \\
1 & 0 & 0 & \dots &0 & 0 \\
0 & 1 & 0 & \dots &0 & 0 \\
\vdots &\vdots & \vdots &\vdots &\ddots &\vdots\\
0 & 0 & 0 & \dots &1 & 0
\end{pmatrix}
$$ has this polynomial as characteristic.
Since $\text{Tr}(A)=0$ we have $a_1=0$. Now assume we have deduced that $a_1=\cdots=a_k=0$ for some $k\le n-1$. It is easy to see by induction that $$A^{k+1}=\begin{pmatrix}
a_{k+1} & a_{k+2} & a_{k+3} & \dots & \dots & a_{n} & 0 & \dots & 0\\
0 & a_{k+1} & a_{k+2} & \dots & \dots & a_{n-1} & a_n &\dots & 0\\
\vdots &\vdots &\vdots &\vdots &\vdots &\vdots &\vdots &\vdots &\vdots\\
0 & 0 & 0 & \dots &a_{k+1} & \dots & \dots & \dots & a_n \\
1 & 0 & 0 & \dots &\dots &\dots &\dots &\dots &0 \\
0 & 1 & 0 & \dots &\dots &\dots &\dots &\dots &0\\
\vdots &\vdots &\vdots &\vdots &\vdots &\vdots &\vdots&\vdots&\vdots\\
0 & 0 & \dots & 1 & 0 & \dots & \dots &\dots & 0
\end{pmatrix}$$
(the matrix may not be perfectly written, but you got the feeling)
From here is evident that $\text {Tr}(A^{k+1})=(k+1) a_{k+1}$. Hence $(k+1)a_{k+1}=0$ thus $a_{k+1}$ is zero. Thus we obtain that all the coefficients are zero. Hence the roots.
Comment. Does this solution generalizes the problem into a more abstract setting?
Equation
Prove that for any $c\in (0,1)$ the equation $$\left(1-\left(c-cx\right)^{2/3}\right)^3=(1-c^2)x^2$$ has unique real root in $(0,1)$ and find this root.
Comment. This Problem has connection with a property of the astroid - being the curve which is obtained as a contour of the set of lines ending at the two axes and with unit length.
Comment. This Problem has connection with a property of the astroid - being the curve which is obtained as a contour of the set of lines ending at the two axes and with unit length.
Subscribe to:
Comments (Atom)