Friday, February 16, 2018

Mathematical Reflections 2017, Issue 5 - Problem O422

Problem:
Let $P(x)$ be a polynomial with integer coefficients having an integer root $k$ and $P(0) \neq 0$. Prove that if $p$ and $q$ are distinct odd primes such that $P(p)=p<2q-1$ and $P(q)=q<2p-1$, then $p$ and $q$ are twin primes.

Proposed by Alessandro Ventullo, Milan, Italy


Solution:
Assume that $k \in \mathbb{Z}$ is a root of the polynomial with integer coefficients $P$. So, $P(k)=0$, which gives $P(x)=(x-k)Q(x)$ for some polynomial with integer coefficients $Q(x)$. Hence,
$$p=P(p)=(p-k)Q(p), \qquad q=P(q)=(q-k)Q(q).$$ It follows that $(p-k) \mid p$ and $(q-k) \mid q$, so $p-k \in \{\pm 1, -p\}$ and $q-k \in \{\pm 1, -q\}$. Since $p$ and $q$ are distinct primes, then $p-k \neq q-k$ and we have seven cases.

(i) $p-k=-1$ and $q-k=1$. It follows that $q-p=2$, i.e. $q=p+2$, so $p$ and $q$ are twin primes.

(ii) $p-k=-1$ and $q-k=-q$. It follows that $p=2q-1$, contradiction.

(iii) $p-k=1$ and $q-k=-1$. It follows that $p-q=2$, i.e. $p=q+2$, so $p$ and $q$ are twin primes.

(iv) $p-k=1$ and $q-k=-q$. It follows that $p=2q+1$, contradiction.

(v) $p-k=-p$ and $q-k=-1$. It follows that $q=2p-1$, contradiction.

(vi) $p-k=-p$ and $q-k=1$. It follows that $q=2p+1$, contradiction.

(vii) $p-k=-p$ and $q-k=-q$. It follows that $p-q=-p+q$, i.e. $p=q$, contradiction.

In conclusion, $p$ and $q$ are twin primes.

Mathematical Reflections 2017, Issue 5 - Problem U425

Problem:
Let $p$ be a prime number and let $G$ be a group of order $p^3$. Define $\Gamma(G)$ as the graph whose vertices represent the noncentral conjugacy class sizes of $G$ and two vertices are joined if and only if the two associated conjugacy class sizes are not coprime. Determine the structure of $\Gamma(G)$.

Proposed by Alessandro Ventullo, Milan, Italy


Solution:
We have two cases.

(i) $G$ is abelian. In such a case, all the conjugacy classes are central, so $\Gamma(G)$ has no vertex, i.e. $\Gamma(G)$ is the null graph.

(ii) $G$ is nonabelian. Since $Z(G)$ is a subgroup of $G$, then $|Z(G)| \ | \ |G|$. Since $G$ is nonabelian, then $|Z(G)| \neq |G|$ and since $G$ is a $p$-group, then $|Z(G)| \neq 1$. It follows that $|Z(G)| \in \{p,p^2\}$. If $|Z(G)|=p^2$, then $|G/Z(G)|=p$, so $G/Z(G)$ is cyclic and this implies that $G$ is abelian, contradiction. So, it must be $|Z(G)|=p$. Now, take a noncentral conjuacy class $\textrm{Cl}(a)$. Clearly, $|\textrm{Cl}(a)| \neq 1$. By the Orbit-Stabilizer Theorem, we have that $$|\textrm{Cl}(a)|=[G:C_G(a)],$$ where $C_G(a)$ is the centralizer of $a$ in $G$. It follows that $|\textrm{Cl}(a)| \ | \ |G|$. Since $Z(G)=\bigcap_{a \in G} C_G(a)$ and $a \in C_G(a)$, but $a \notin Z(G)$, then $Z(G) \subset C_G(a)$, which gives $|Z(G)| < |C_G(a)|$. Since $C_G(a)$ is a subgroup of $G$, then $|C_G(a)| \ | \ |G|$, which implies that $|C_G(a)|=p^2$. So, $|\textrm{Cl}(a)|=p$, i.e. each noncentral conjugacy class has size $p$, so the graph is a complete graph. In order to determine the number of its vertices, we use the Conjugacy Class Equation $$|G|=|Z(G)|+\sum_{i}[G:C_G(x_i)]$$ and we get $$p^3=p+kp,$$ i.e. $k=p^2-1$. We conclude that $\Gamma(G)=K_{p^2-1}$.

Mathematical Reflections 2017, Issue 5 - Problem S423

Problem:
Let $p$ and $q$ be prime numbers such that $p^2+pq+q^2$ is a perfect square. Prove that $p^2-pq+q^2$ is prime.

Proposed by Alessandro Ventullo, Milan, Italy


First solution:
Let $p^2+pq+q^2=n^2$. Then, $(p+q)^2=n^2+pq$ where $n \in \mathbb{N}$, which gives $$(p+q-n)(p+q+n)=pq.$$ If $p=q$, then $(2p-n)(2p+n)=p^2$. Since $2p-n<2p+n$, then $2p-n=1$ and $2p+n=p^2$, i.e. $4p=1+p^2$, which gives no integer solution. If $p \neq q$, assuming without loss of generality that $p<q$, then since $p+q-n<p+q+n$, we have
$$\begin{array}{lll} p+q-n &=& 1 \\ p+q+n &=& pq, \end{array} \qquad \begin{array}{lll} p+q-n &=& p \\ p+q+n &=& q. \end{array}$$
The first system gives $2(p+q)=pq+1$, i.e. $(p-2)(q-2)=3$, which gives $p=3, q=5$. The second equation of the second system gives $p+n=0$, contradiction. So, we get $(p,q) \in \{(3,5),(5,3)\}$ and $p^2-pq+q^2=19$, which is prime.

Second solution:
Observe that $p^2<p^2+pq+q^2<(p+q)^2$ for all primes $p,q$. Hence, $$p^2+pq+q^2=(p+k)^2,$$ where $k \in \{1,2,\ldots,q-1\}$, i.e. $$pq+q^2=2kp+k^2.$$ We get
$$
p(2k-q)=(q-k)(q+k) \qquad (1)
$$
Since the right-hand side is positive, it follows that $q<2k$. Moreover, since $p$ is prime, then $p \ | \ (q-k)$ or $p \ | \ (q+k)$.

(i) If $p \ | \ (q-k)$, then $q-k=ph$ for some $h \in \mathbb{N}$, so equation (1) becomes $$2k-q=h(k+q).$$ It follows that $(k+q) \ | \ (2k-q)$. Since $2k-q=2(k+q)-3q$, then $(k+q) \ | \ 3q$. If $q=3$, there is no solution. If $q \neq 3$, we have $k+q \in \{1,3,q,3q\}$. But $1<q<k+q<2q<3q$, so it must be $k+q=3$. Since $q$ is prime, this gives $q=2$ and $k=1$, but this would imply that $p \ | \ 1$, contradiction.

(ii) If $p \ | \ (q+k)$, then $q+k=ph$ for some $h \in \mathbb{N}$, so equation (1) becomes $$2k-q=h(q-k).$$ It follows that $(q-k) \ | \ (2k-q)$. Since $2k-q=2(k-q)+q$, then $(q-k) \ | \ q$. But $q-k<q$, so $q-k=1$. Equation \eqref{first-eq} becomes $$p(q-2)=2q-1,$$ which implies $(q-2) \ | \ (2q-1)=[2(q-2)+3]$, i.e. $(q-2) \ | \ 3$. So, $q=3$ or $q=5$, which gives $p=5$ or $p=3$ respectively.

Therefore, $(p,q) \in \{(3,5),(5,3)\}$, which gives $p^2-pq+q^2=19$, which is prime.

Conjecture:
Let $k$ be a positive integer such that if $p^2+kpq+q^2$ is a perfect square, then $p^2-kpq+q^2$ is a prime. Then, $k=1$. Me and Robert Bosch tried to disprove this conjecture with Maple for small $k$, but it seems that $k$ is the only positive integer with this property.

Mathematical Reflections 2017, Issue 5 - Problem S422

Problem:
Solve in positive integers the equation $$u^2+v^2+x^2+y^2+z^2=uv+vx-xy+yz+zu+3.$$

Proposed by Proposed by Adrian Andreescu, Dallas, USA


Solution:
The given equation can be written as $$(u-v)^2+(v-x)^2+(x+y)^2+(y-z)^2+(z-u)^2=6.$$
Since $u,v,x,y,z$ are positive integers, then $x+y \geq 2$, which gives $(x+y)^2 \geq 4$. Since $(x+y)^2 \leq 6$, we conclude that $x+y=2$, so $x=y=1$ and
$$(u-v)^2+(v-1)^2+(1-z)^2+(z-u)^2=2.$$
So, exactly two of the summands on the LHS are equal to $1$ and the other are equal to $0$. We have six cases.

(i) $(u-v)^2=(v-1)^2=1$ and $(1-z)^2=(z-u)^2=0$. From the last equations we get $u=z=1$ and from the first equations we get $v=2$.

(ii) $(u-v)^2=(1-z)^2=1$ and $(v-1)^2=(z-u)^2=0$. From the last equations we get $v=1$ and $u=z$ and from the first equations we get $u=z=2$.

(iii) $(u-v)^2=(z-u)^2=1$ and $(v-1)^2=(1-z)^2=0$. From the last equations we get $v=z=1$ and from the first equations we get $u=2$.

(iv) $(v-1)^2=(1-z)^2=1$ and $(u-v)^2=(z-u)^2=0$. From the last equations we get $u=v=z$ and from the first equations we get $u=v=z=2$.

(v) $(v-1)^2=(z-u)^2=1$ and $(u-v)^2=(1-z)^2=0$. From the last equations we get $u=v$ and $z=1$ and from the first equations we get $u=v=2$.

(vi) $(1-z)^2=(z-u)^2=1$ and $(u-v)^2=(v-1)^2=0$. From the last equations we get $u=v=1$ and from the first equations we get $z=2$.

In conclusion, $$(u,v,x,y,z) \in \{(1,2,1,1,1),(2,1,1,1,2),(2,1,1,1,1),(2,2,1,1,2),(2,2,1,1,1),(1,1,1,1,2)\}.$$

Mathematical Reflections 2017, Issue 5 - Problem S421

Problem:
Let $a,b,c$ be positive numbers such that $abc=1$. Prove that $$\dfrac{a^2}{\sqrt{1+a}}+\dfrac{b^2}{\sqrt{1+b}}+\dfrac{c^2}{\sqrt{1+c}} \geq 2.$$

Proposed by Constantinos Metaxas, Athens, Greece


Solution:
We prove the stronger inequality $$\dfrac{a^2}{\sqrt{1+a}}+\dfrac{b^2}{\sqrt{1+b}}+\dfrac{c^2}{\sqrt{1+c}} \geq \dfrac{3}{\sqrt{2}}.$$
Let $f(x)=\dfrac{x^2}{\sqrt{1+x}}$. Since $f''(x)=\dfrac{3x^2+8x+8}{4(x+1)^2\sqrt{x+1}}$, then $f''(x)>0$ for all $x>0$, so $f$ is convex on $(0,+\infty)$. By Jensen's Inequality, we have
$$f\left(\dfrac{a+b+c}{3}\right) \leq \dfrac{f(a)+f(b)+f(c)}{3},$$ i.e.
$$\dfrac{a^2}{\sqrt{1+a}}+\dfrac{b^2}{\sqrt{1+b}}+\dfrac{c^2}{\sqrt{1+c}} \geq 3\cdot \dfrac{\left(\frac{a+b+c}{3}\right)^2}{\sqrt{1+\frac{a+b+c}{3}}}=\dfrac{(a+b+c)^2}{\sqrt{9+3(a+b+c)}}.$$
By the AM-GM Inequality, we have $a+b+c \geq 3\sqrt[3]{abc}=3$. Set $x=a+b+c$. Observe that the function $g(x)=\dfrac{x^2}{\sqrt{9+3x}}$ is increasing on $[3,+\infty)$, so $g(x) \geq g(3)=\dfrac{3}{\sqrt{2}}$ and the conclusion follows.

Mathematical Reflections 2017, Issue 5 - Problem J421

Problem:
Let $a$ and $b$ be positive real numbers. Prove that $$\dfrac{6ab-b^2}{8a^2+b^2}<\sqrt{\dfrac{a}{b}}.$$

Proposed by Adrian Andreescu, Dallas, USA


Solution:
Let $x=\dfrac{a}{b}$. Clearly, $x>0$. The given equality is equivalent to
$$\dfrac{6x-1}{8x^2+1}<\sqrt{x},$$ i.e. $$8x^2\sqrt{x}+\sqrt{x}+1>6x,$$ which is true by the AM-GM Inequality.

Wednesday, November 1, 2017

Mathematical Reflections 2017, Issue 4 - Problem S416

Problem:
Let $f:\mathbb{N} \to \{\pm 1\}$ be a function such that $f(mn)=f(m)f(n)$ for all $m,n \in \mathbb{N}$. Prove that
there are infinitely many $n$ such that $f(n)=f(n+1)$.

Proposed by Oleksi Klurman, University College London, UK


Solution:
Let $n \in \mathbb{N}$. As $f$ is completely multiplicative, then $f(n^2)=(f(n))^2=1$. If there are infinitely many $n$ such that $f(n^2-1)=1$, we are done. So, assume that there are only finitely many $n$ such that $f(n^2-1)=1$. Then, there are infinitely many $n$ such that $f(n^2-1)=-1$. Since $f(n^2-1)=f(n-1)f(n+1)$, then there are infinitely many pairs $\{f(n-1),f(n+1)\}=\{-1,1\}$. Since $f(n)=\pm 1$, it follows that there are infinitely many $n$ such that $f(n)=f(n+1)$.

Mathematical Reflections 2017, Issue 4 - Problem S415

Problem:
Let $$f(x)=\dfrac{(2x-1)6^x}{2^{2x-1}+3^{2x-1}}.$$
Evaluate $$f\left(\dfrac{1}{2018}\right)+f\left(\dfrac{3}{2018}\right)+\ldots+f\left(\dfrac{2017}{2018}\right).$$

Proposed by Titu Andreescu, University of Texas at Dallas, USA


Solution:
Observe that $$f(1-x)=\dfrac{(1-2x)6^{1-x}}{2^{1-2x}+3^{1-2x}}=\dfrac{(1-2x)6^x}{2^{2x-1}+3^{2x-1}}=-f(x),$$ i.e. $f(x)+f(1-x)=0$.
So,
\begin{eqnarray*}
\sum_{k=1}^{1009} f\left(\dfrac{2k-1}{2018}\right)&=&\sum_{k=1}^{504}\left(f\left(\dfrac{2k-1}{2018}\right)+f\left(\dfrac{2018-(2k-1)}{2018}\right)\right)+f\left(\dfrac{1009}{2018}\right)\\&=&f\left(\dfrac{1009}{2018}\right)\\&=&f\left(\dfrac{1}{2}\right)\\&=&0.
\end{eqnarray*}

Mathematical Reflections 2017, Issue 4 - Problem J417

Problem:
Solve in positive real numbers the equation $$\dfrac{x^2+y^2}{1+xy}=\sqrt{2-\dfrac{1}{xy}}.$$

Proposed by Adrian Andreescu, Dallas, Texas, USA


Solution:
Let $s=x+y$ and $p=xy$. Then, the given equation can be written as $$\dfrac{s^2-2p}{1+p}=\sqrt{2-\dfrac{1}{p}}.$$
By the AM-GM Inequality, we have $s^2-2p \geq 2p$, so $$\sqrt{2-\dfrac{1}{p}} \geq \dfrac{2p}{1+p} \iff \dfrac{(p-1)^2(2p+1)}{p(p+1)^2} \leq 0.$$ Since $p \geq 0$, it follows that $p=1$, which gives $s=2$. So, $x+y=2$ and $xy=1$, which yields $(x,y)=(1,1)$.

Mathematical Reflections 2017, Issue 4 - Problem J415

Problem:
Prove that for all real numbers $x,y,z$ at least one of the numbers
$$2^{3x-y}+2^{3x-z}-2^{y+z+1}$$ $$2^{3y-z}+2^{3y-x}-2^{z+x+1}$$ $$2^{3z-x}+2^{3z-y}-2^{x+y+1}$$
is nonnegative.

Proposed by Adrian Andreescu, Dallas, Texas, USA


Solution:
Let $a=2^x$, $b=2^y$, $c=2^z$. Adding the three given numbers, we get
$$\begin{array}{lll} S&=&\left(\dfrac{a^3}{b}+\dfrac{a^3}{c}-2bc\right)+\left(\dfrac{b^3}{c}+\dfrac{b^3}{a}-2ca\right)+\left(\dfrac{c^3}{a}+\dfrac{c^3}{b}-2ab\right)\\&=&\left(\dfrac{a^3}{b}+\dfrac{b^3}{a}-2ab\right)+\left(\dfrac{b^3}{c}+\dfrac{c^3}{b}-2bc\right)+\left(\dfrac{c^3}{a}+\dfrac{a^3}{c}-2ca\right). \end{array}$$
By the AM-GM Inequality, we get
$$\dfrac{a^3}{b}+\dfrac{b^3}{a} \geq 2ab, \qquad \dfrac{b^3}{c}+\dfrac{c^3}{b} \geq 2bc, \qquad \dfrac{c^3}{a}+\dfrac{a^3}{c} \geq 2ca.$$
So, $S \geq 0$ and we conclude that at least one of the three given numbers is nonnegative.