Prove that there are infinitely many quadruplets of positive integers $(a,b,c,d)$, such that $ab+1$, $bc+16$, $cd+4$, $ad+9$ are perfect squares

Let $ABC$ be a triangle. Let $A_1$ and $A_2$ be points on side $BC, B_1$ and $B_2$ be points on side $CA$ and $C_1$ and $C_2$ be points on side $AB$ such that $A_1A_2B_1B_2C_1C_2$ is a convex hexagon and that $B,A_1,A_2$ and $C$ are located in that order on side $BC$. We say that triangles $AB_2C_1, BA_1C_2$ and $CA_2B_1$ are glueable if there exists a triangle $PQR$ and there exist $X,Y$ and $Z$ on sides $QR, RP$ and $PQ$ respectively, such that triangle $AB_2C_1$ is congruent in that order to triangle $PYZ$, triangle $BA_1C_2$ is congruent in that order to triangle $QXZ$ and triangle $CA_2B_1$ is congruent in that order to triangle $RXY$. Prove that triangles $AB_2C_1, BA_1C_2$ and $CA_2B_1$ are glueable if and only if the centroids of triangles $A_1B_1C_1$ and $A_2B_2C_2$ coincide.

Find all positive integers $n$ such that $3^n - 2^n - 1$ is a perfect square.

Let $N$ be a positive integer with $2k$ digits. Its chunks are defined by the two numbers formed by the digits from $1$ to $k$ and $k+1$ to $2k$ (e.g. the chunks of 142856 are 142 and 856). We define the $N$-reverse as the number formed by switching its chunks (e.g. the reverse of 142856 is 856142 and for 1401 it is 114). We call a number cearense is it satisfies the following conditions: Has an even number of digits Its chunks are relatively prime Divides its reverse Find the two smallest cearense integer.

A permutation of $\{1, 2 \cdots, n \}$ is magic if each element $k$ of it has at least $\left\lfloor \frac{k}{2} \right\rfloor$ numbers less to it at the left. For each $n$ find the number of magical permutations.

On a board of $8 \times 8$ exists $64$ kings, all initially placed in different squares. Alnardo and Bernaldo play alternately, with Arnaldo starting. On each move, one of the two players chooses a king and can move it one square to the right, one square up, or one square up to the right. In the event that a king is moved to an occupied square, both kings are removed from the game. The player who can remove two of the last kings or leave one last king in the upper right corner wins the game. Which of the two players can ensure victory?