Found problems: 521
In the square of an integer $ a$, the tens’ digit is $7$. What is the units’ digit of $a^2$?
Show that the divisors of a number $n \ge 2$ can only be divided into two groups in which the product of the numbers is the same if the product of the divisors of $n$ is a square number.
Let $N = 2 \: \: \underbrace {99… 9} _{n \,\,\text {times}} \: \: 82 \: \: \underbrace {00… 0} _{n \,\, \text {times} } \: \: 29$. Prove that $N$ can be written as the sum of the squares of $3$ consecutive natural numbers.
What is the least positive integer $m$ such that $m \cdot 2! \cdot 3! \cdot 4! \cdot 5! \cdots 16!$ is a perfect square?
$\textbf{(A) }30\qquad\textbf{(B) }30030\qquad\textbf{(C) }70\qquad\textbf{(D) }1430\qquad\textbf{(E) }1001$
Suppose that $a, b, c,d$ are pairwise distinct positive integers such that $a+b = c+d = p$ for some odd prime $p > 3$ . Prove that $abcd$ is not a perfect square.
Prove that there exists an infinite sequence of perfect squares with the following properties:
(i) The arithmetic mean of any two consecutive terms is a perfect square,
(ii) Every two consecutive terms are coprime,
(iii) The sequence is strictly increasing.
If $n$ and $n^3+2n^2+2n+4$ are both perfect squares, fi nd $n$.
Find all integers $k{}$ for which there are infinitely many triples of integers $(a,b,c)$ such that \[(a^2-k)(b^2-k)=c^2-k.\]
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]
Positive odd integers $a, b$ are such that $a^bb^a$ is a perfect square. Show that $ab$ 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 \).
Let $n \geqslant 100$ be an integer. Ivan writes the numbers $n, n+1, \ldots, 2 n$ each on different cards. He then shuffles these $n+1$ cards, and divides them into two piles. Prove that at least one of the piles contains two cards such that the sum of their numbers is a perfect square.
Prove that it is not possible that numbers $(n+1)\cdot 2^n$ and $(n+3)\cdot 2^{n+2}$ are perfect squares, where $n$ is positive integer.
Determine whether there exists an infinite sequence of nonzero digits $a_1 , a_2 , a_3 , \cdots $ and a positive integer $N$ such that for every integer $k > N$, the number $\overline{a_k a_{k-1}\cdots a_1 }$ is a perfect square.
Georg writes the numbers from $1$ to $15$ on different pieces of paper.
He attempts to sort these pieces of paper into two stacks so that none of the stacks contains two numbers whose sum is a square number.Prove that this is impossible.
(The square numbers are the numbers $0 = 0^2$, $1 = 1^2$, $4 = 2^2$, $9 = 3^2$ etc.)
Find all prime numbers $p$ for which $\frac{2^{p-1} -1}{p}$ is a perfect square.
Is there a number $n$ such that one can write $n$ as the sum of $2017$ perfect squares and (with at least) $2017$ distinct ways?
Call a pair of integers $a$ and $b$ square makers , if $ab+1$ is a perfect square.
Determine for which $n$ is it possible to divide the set $\{1,2, \dots , 2n\}$ into $n$ pairs of square makers.
Show that there is an infinite sequence $a_1,a_2,...$ of natural numbers such that $a^2_1+a^2_2+ ...+a^2_N$ is a perfect square for all $N$. Give a recurrent formula for one such sequence.
Two sets of positive integers $A, B$ are called [i]connected [/i] if they are not empty and for all $a \in A, b \in B$, number $ab + 1$ is a perfect square.
i) Given $A =\{1, 2,3, 4\}$. Prove that there does not exist any set $B$ such that $A, B$ are connected.
ii) Suppose that $A, B$ are connected with $|A|,|B| \ge 2$. For any $a_1 > a_2 \in A$ and $b_1 > b_2 \in B$, prove that $a_1b_1 > 13a_2b_2$.
Prove that the remainder of dividing the square of an integer by $3$ is different from $2$.
The last four digits of a perfect square are equal. Prove that all of them are zeros.
Determine all positive integers $n$ so that both $20n$ and $5n + 275$ are perfect squares.
(A perfect square is a number which can be expressed as $k^2$, where $k$ is an integer.)
Find all prime numbers $p$ such that $5^p + 12^p$ is a perfect square
Prove that numbers $1,2,...,16$ can be divided in sequence such that sum of any two neighboring numbers is perfect square