Find the number of integers $n$ between $1$ and $2021$ such that $2^n+2^{n+3}$ is a perfect square.

The infinite sequence \( a_1, a_2, \ldots \) is defined by \( a_1 = 1 \) and, for each \( n \geq 1 \), the number \( a_{n+1} \) is the smallest positive integer greater than \( a_n \) that has the following property: for each \( k \in \{1, 2, \ldots, n\} \), the number \( a_{n+1} + a_k \) is not a perfect square. Prove that, for all \( n \), it holds that \( a_n \leq (n - 1)^2 + 1 \).

Find unequal integers $m, n$ such that $mn + n$ and $mn + m$ are both squares. Can you find such integers between $988$ and $1991$?

Show that any number of the form $$4444 ...44 88...8$$ where there are twice as many $4$s as $8$s is a square number.

Prove that the numbers from $1$ to $16$ can be written in a line, but cannot be written in a circle so that the sum of any two adjacent numbers is square of a natural number.

Let $n$ be a given positive integer. Determine all positive divisors $d$ of $3n^2$ such that $n^2 + d$ is the square of an integer.

For which integer \( h \), are there infinitely many positive integers \( n \) such that \( \lfloor \sqrt{h^2 + 1} \cdot n \rfloor \) is a perfect square? (Here \( \lfloor x \rfloor \) denotes the integer part of the real number \( x \)?

The teacher wrote a non-zero natural number on the board. The teacher explained students that they can delete the number written on the board and can write a number instead naturally new, whenever they want, applying one of the following each time rules: 1) Instead of the current number $n$ write $3n + 13$ 2) Instead of the current number $n$ write the number $\sqrt{n}$, if $n$ is a perfect square . a) If the number $256$ was originally written on the board, is it possible that after a finite number of steps to get the number $55$ on the board? b) If the number $55$ was originally written on the board, is it possible that after a number finished the steps to get the number $256$ on the board?

Determine whether there are infinitely many triples $(u,v,w)$ of positive integers such that $u,v,w$ form an arithmetic progression and the numbers $uv+1, vw+1$ and $wu+1$ are all perfect squares.

Let $a$ and $b$ be non-negative integers. Prove that the number $a^2 + b^2$ is the difference of two perfect squares if and only if $ab$ is even.

Find all positive integers $k$ for which there is an irrational $\alpha>1$ and a positive integer $N$ such that $\left\lfloor\alpha^{n}\right\rfloor$ is of the form $m^2-k$ com $m \in \mathbb{Z}$ for every integer $n>N$.

An integer $n$ is said to be [i]good[/i] if $|n|$ is not the square of an integer. Determine all integers $m$ with the following property: $m$ can be represented, in infinitely many ways, as a sum of three distinct good integers whose product is the square of an odd integer. [i]Proposed by Hojoo Lee, Korea[/i]

Find all functions $f :Z_{>0} \to Z_{>0}$ such that the number $xf(x) + f ^2(y) + 2xf(y)$ is a perfect square for all positive integers $x,y$.

Show that there exists a set of infinite positive integers such that the sum of an arbitrary finite subset of these is never a perfect square. What happens if we change the condition from not being a perfect square to not being a perfect power?

Let $n+1, n \geq 1$ positive integers be formed by taking the product of $n$ given prime numbers (a prime number can appear several times or also not appear at all in a product formed in this way.) Prove that among these $n+1$ one can find some numbers whose product is a perfect square.

There are pairs of square numbers with the following two properties: (1) Their decimal representations have the same number of digits, with the first digit starting is different from $0$ . (2) If one appends the second to the decimal representation of the first, the decimal representation results another square number. Example: $16$ and $81$; $1681 = 41^2$. Prove that there are infinitely many pairs of squares with these properties.

Is it possible for the least common multiple of five consecutive positive integers to be a perfect square?

It is given that n is a positive integer such that both numbers $2n + 1$ and $3n + 1$ are complete squares. Is it true that $n$ must be divisible by $40$ ? Justify your answer.

Let $a, b, c, d$ be integers. Prove that for any positive integer $n$, there are at least $\left \lfloor{\frac{n}{4}}\right \rfloor $ positive integers $m \leq n$ such that $m^5 + dm^4 + cm^3 + bm^2 + 2023m + a$ is not a perfect square. [i]Proposed by Ilir Snopce[/i]

a) Let $f(x,y) = x^3 + (3y^2+1)x^2 + (3y^4 - y^2 + 4 y - 1)x + (y^6-y^4 + 2y^3)$. Prove that if for some positive integers $a, b$ the number $f(a, b)$ is a cube of an integer then $f(a, b)$ is also a square of an integer. b) Are there infinitely many pairs of positive integers $(a, b)$ for which $f(a, b)$ is a square but not a cube ?

Prove that the number $\overline{40...0}9$ (with at least one zero) is not a perfect square. (VA Senderov)

Consider a triangle $XYZ$ and a point $O$ in its interior. Three lines through $O$ are drawn, parallel to the respective sides of the triangle. The intersections with the sides of the triangle determine six line segments from $O$ to the sides of the triangle. The lengths of these segments are integer numbers $a, b, c, d, e$ and $f$ (see figure). Prove that the product $a \cdot b \cdot c\cdot d \cdot e \cdot f$ is a perfect square. [asy] unitsize(1 cm); pair A, B, C, D, E, F, O, X, Y, Z; X = (1,4); Y = (0,0); Z = (5,1.5); O = (1.8,2.2); A = extension(O, O + Z - X, X, Y); B = extension(O, O + Y - Z, X, Y); C = extension(O, O + X - Y, Y, Z); D = extension(O, O + Z - X, Y, Z); E = extension(O, O + Y - Z, Z, X); F = extension(O, O + X - Y, Z, X); draw(X--Y--Z--cycle); draw(A--D); draw(B--E); draw(C--F); dot("$A$", A, NW); dot("$B$", B, NW); dot("$C$", C, SE); dot("$D$", D, SE); dot("$E$", E, NE); dot("$F$", F, NE); dot("$O$", O, S); dot("$X$", X, N); dot("$Y$", Y, SW); dot("$Z$", Z, dir(0)); label("$a$", (A + O)/2, SW); label("$b$", (B + O)/2, SE); label("$c$", (C + O)/2, SE); label("$d$", (D + O)/2, SW); label("$e$", (E + O)/2, SE); label("$f$", (F + O)/2, NW); [/asy]

Determine all sets $(a, b, c)$ of positive integers where one obtains $b^2$ by removing the last digit in $c^2$ and one obtains $a^2$ by removing the last digit in $b^2$. .

Prove that if the natural numbers $ a $ and $ b $ satisfy the equation $ a^2+a = 3b^2 $, then the number $ a+1 $ is the square of an integer.

Prove that if the product of four consecutive natural numbers is added one unit, the result is a perfect square.