Is it possible to find $2005$ different positive square numbers such that their sum is also a square number ?

Find all ordered pairs $ (m,n)$ where $ m$ and $ n$ are positive integers such that $ \frac {n^3 \plus{} 1}{mn \minus{} 1}$ is an integer.

Find the smallest positive integer $ K$ such that every $ K$-element subset of $ \{1,2,...,50 \}$ contains two distinct elements $ a,b$ such that $ a\plus{}b$ divides $ ab$.

How many positive integers $n < 500$ exist such that its prime factors are exclusively $2$, $7$, $11$, or a combination of these?

Find all the two-digit numbers $\overline{ab}$ that squared give a result where the last two digits are $\overline{ab}$.

Find all positive integers $n$ which satisfy the following tow conditions: (a) $n$ has at least four different positive divisors; (b) for any divisors $a$ and $b$ of $n$ satisfying $1<a<b<n$, the number $b-a$ divides $n$. [i](4th Middle European Mathematical Olympiad, Individual Competition, Problem 4)[/i]

Find the greatest prime that divides $$1^2 - 2^2 + 3^2 - 4^2 +...- 98^2 + 99^2.$$

Given a positive integer whose base-$10$ representation is $\overline{d_k\ldots d_0}$ for some integer $k \geq 0$, where $d_k \neq 0$, a move consists of selecting some integers $0 \leq i \leq j \leq k$, such that the digits $d_j,\ldots,d_i$ are not all $0$, erasing them from $n$, and replacing them with a divisor of $\overline{d_j\ldots d_i}$ (this divisor need not have the same number of digits as $\overline{d_j\ldots d_i}$). Prove that for all sufficiently large even integers $n$, we may apply some sequence of moves to $n$ to transform it into $2024$. [i]Allen Wang[/i]

[b]p1.[/b] a) Given four points in the plane, no three of which lie on the same line, each subset of three points determines the vertices of a triangle. Can all these triangles have equal areas? If so, give an example of four points (in the plane) with this property, and then describe all arrangements of four joints (in the plane) which permit this. If no such arrangement exists, prove this. b) Repeat part a) with "five" replacing "four" throughout. [b]p2.[/b] Three people at the base of a long stairway begin a race up the stairs. Person A leaps five steps with each stride (landing on steps $5$, $10$, $15$, etc.). Person B leaps a little more slowly but covers six steps with each stride. Person C leaps seven steps with each stride. A picture taken near the end of the race shows all three landing simultaneously, with Person A twenty-one steps from the top, person B seven steps from the top, and Person C one step from the top. How many steps are there in the stairway? If you can find more than one answer, do so. Justify your answer. [b]p3. [/b]Let $S$ denote the sum of an infinite geometric series. Suppose the sum of the squares of the terms is $2S$, and that df the cubes is $64S/13$. Find the first three terms of the original series. [b]p4.[/b] $A$, $B$ and $C$ are three equally spaced points on a circular hoop. Prove that as the hoop rolls along the horizontal line $\ell$, the sum of the distances of the points $A, B$, and $C$ above line $\ell$ is constant. [img]https://cdn.artofproblemsolving.com/attachments/3/e/a1efd0975cf8ff3cf6acb1da56da1dce35d81e.png[/img] [b]p5.[/b] A set of $n$ numbers $x_1,x_2,x_3,...,x_n$ (where $n>1$) has the property that the $k^{th}$ number (that is, $x_k$ ) is removed from the set, the remaining $(n-1)$ numbers have a sum equal to $k$ (the subscript o $x_k$ ), and this is true for each $k = 1,2,3,...,n$. a) SoIve for these $n$ numbers b) Find whether at least one of these $n$ numbers can be an integer. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

A factorization of a positive integers is a way of writing it as a product of positive integers greater than $1$. Two factorizations are considered the same if they only differ in the order of terms in the product. For instance, $18$ has $4$ different factorizations: $18, 2\cdot 9, 3\cdot 6$ and $ 2\cdot 3\cdot 3$. For a positive integer $n$ we denote by $f(n)$ the number of distinct factorizations of $n$. By convention $f(1)=1$. Prove that $f(n)\leq n$ for all positive integers $n$.

Let $k, n$ be odd positve integers greater than $1$. Prove that if there a exists natural number $a$ such that $k|2^a+1, \ n|2^a-1$, then there is no natural number $b$ satisfying $k|2^b-1, \ n|2^b+1$.

Find all integer positive numbers $n$ such that: $n=[a,b]+[b,c]+[c,a]$, where $a,b,c$ are integer positive numbers and $[p,q]$ represents the least common multiple of numbers $p,q$.

Consider the expression $M(n, m)=|n\sqrt{n^2+a}-bm|$, where $n$ and $m$ are arbitrary positive integers and the numbers $a$ and $b$ are fixed, moreover $a$ is an odd positive integer and $b$ is a rational number with an odd denominator of its representation as an irreducible fraction. Prove that there is [b]a)[/b] no more than a finite number of pairs $(n, m)$ for which $M(n, m)=0$; [b]b)[/b] a positive constant $C$ such that the inequality $M(n, m)\geqslant0$ holds for all pairs $(n, m)$ with $M(n, m)\ne 0$.

Let $x$, $y$ be two positive integers such that $\displaystyle 3x^2+x=4y^2+y$. Prove that $x-y$ is a perfect square.

Prove that $ 7^{2^{20}} + 7^{2^{19}} + 1 $ has at least $ 21 $ distinct prime divisors.

Fix an integer $k>2$. Two players, called Ana and Banana, play the following game of numbers. Initially, some integer $n \ge k$ gets written on the blackboard. Then they take moves in turn, with Ana beginning. A player making a move erases the number $m$ just written on the blackboard and replaces it by some number $m'$ with $k \le m' < m$ that is coprime to $m$. The first player who cannot move anymore loses. An integer $n \ge k $ is called good if Banana has a winning strategy when the initial number is $n$, and bad otherwise. Consider two integers $n,n' \ge k$ with the property that each prime number $p \le k$ divides $n$ if and only if it divides $n'$. Prove that either both $n$ and $n'$ are good or both are bad.

Find all integer values of $x$ for which the value of the expression \[x^2+6x+33\] is a perfect square.

The positive integers $N$ and $N^2$ both end in the same sequence of four digits $abcd$ when written in base 10, where digit $a$ is not zero. Find the three-digit number $abc$.

[b]p1.[/b] Find the minimum value of $x^4 +2x^3 +3x^2 +2x+2$, where x can be any real number. [b]p2.[/b] A type of digit-lock has $5$ digits, each digit chosen from $\{1,2, 3, 4, 5\}$. How many different passwords are there that have an odd number of $1$'s? [b]p3.[/b] Tony is a really good Ping Pong player, or at least that is what he claims. For him, ping pong balls are very important and he can feel very easily when a ping pong ball is good and when it is not. The Ping Pong club just ordered new balls. They usually order form either PPB company or MIO company. Tony knows that PPB balls have $80\%$ chance to be good balls and MIO balls have $50\%$ chance to be good balls. I know you are thinking why would anyone order MIO balls, but they are way cheaper than PPB balls. When the box full with balls arrives (huge number of balls), Tony tries the first ball in the box and realizes it is a good ball. Given that the Ping Pong club usually orders half of the time from PPB and half of the time from MIO, what is the probability that the second ball is a good ball? [b]p4.[/b] What is the smallest positive integer that is one-ninth of its reverse? [b]p5.[/b] When Michael wakes up in the morning he is usually late for class so he has to get dressed very quickly. He has to put on a short sleeved shirt, a sweater, pants, two socks and two shoes. People usually put the sweater on after they put the short sleeved shirt on, but Michael has a different style, so he can do it both ways. Given that he puts on a shoe on a foot after he put on a sock on that foot, in how many dierent orders can Michael get dressed? [b]p6.[/b] The numbers $1, 2,..., 2015$ are written on a blackboard. At each step we choose two numbers and replace them with their nonnegative difference. We stop when we have only one number. How many possibilities are there for this last number? [b]p7.[/b] Let $A = (a_1b_1a_2b_2... a_nb_n)_{34}$ and $B = (b_1b_2... b_n)_{34}$ be two numbers written in base $34$. If the sum of the base-$34$ digits of $A$ is congruent to $15$ (mod $77$) and the sum of the base $34$ digits of $B$ is congruent to $23$ (mod $77$). Then if $(a_1b_1a_2b_2... a_nb_n)_{34} \equiv x$ (mod $77$) and $0 \le x \le 76$, what is $x$? (you can write $x$ in base $10$) [b]p8.[/b] What is the sum of the medians of all nonempty subsets of $\{1, 2,..., 9\}$? [b]p9.[/b] Tony is moving on a straight line for $6$ minutes{classic Tony. Several finitely many observers are watching him because, let's face it, you can't really trust Tony. In fact, they must watch him very closely{ so closely that he must never remain unattended for any second. But since the observers are lazy, they only watch Tony uninterruptedly for exactly one minute, and during this minute, Tony covers exactly one meter. What is the sum of the minimal and maximal possible distance Tony can walk during the six minutes? [b]p10.[/b] Find the number of nonnegative integer triplets $a, b, c$ that satisfy $$2^a3^b + 9 = c^2.$$ PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

$a+b+c \leq 3000000$ and $a\neq b \neq c \neq a$ and $a,b,c$ are naturals. Find maximum $GCD(ab+1,ac+1,bc+1)$

Denote by $\mathbb{N}$ the set of all positive integers. Find all functions $f:\mathbb{N}\rightarrow \mathbb{N}$ such that for all positive integers $m$ and $n$, the integer $f(m)+f(n)-mn$ is nonzero and divides $mf(m)+nf(n)$. [i]Proposed by Dorlir Ahmeti, Albania[/i]

Find the smallest three-digit number such that the following holds: If the order of digits of this number is reversed and the number obtained by this is added to the original number, the resulting number consists of only odd digits.

[b]p1.[/b] Evaluate $6^4 +5^4 +3^4 +2^4$. [b]p2.[/b] What digit is most frequent between $1$ and $1000$ inclusive? [b]p3.[/b] Let $n = gcd \, (2^2 \cdot 3^3 \cdot 4^4,2^4 \cdot 3^3 \cdot 4^2)$. Find the number of positive integer factors of $n$. [b]p4.[/b] Suppose $p$ and $q$ are prime numbers such that $13p +5q = 91$. Find $p +q$. [b]p5.[/b] Let $x = (5^3 -5)(4^3 -4)(3^3 -3)(2^3 -2)(1^3 -1)$. Evaluate $2018^x$ . [b]p6.[/b] Liszt the lister lists all $24$ four-digit integers that contain each of the digits $1,2,3,4$ exactly once in increasing order. What is the sum of the $20$th and $18$th numbers on Liszt’s list? [b]p7.[/b] Square $ABCD$ has center $O$. Suppose $M$ is the midpoint of $AB$ and $OM +1 =OA$. Find the area of square $ABCD$. [b]p8.[/b] How many positive $4$-digit integers have at most $3$ distinct digits? [b]p9.[/b] Find the sumof all distinct integers obtained by placing $+$ and $-$ signs in the following spaces $$2\_3\_4\_5$$ [b]p10.[/b] In triangle $ABC$, $\angle A = 2\angle B$. Let $I$ be the intersection of the angle bisectors of $B$ and $C$. Given that $AB = 12$, $BC = 14$,and $C A = 9$, find $AI$ . [b]p11.[/b] You have a $3\times 3\times 3$ cube in front of you. You are given a knife to cut the cube and you are allowed to move the pieces after each cut before cutting it again. What is the minimumnumber of cuts you need tomake in order to cut the cube into $27$ $1\times 1\times 1$ cubes? p12. How many ways can you choose $3$ distinct numbers fromthe set $\{1,2,3,...,20\}$ to create a geometric sequence? [b]p13.[/b] Find the sum of all multiples of $12$ that are less than $10^4$ and contain only $0$ and $4$ as digits. [b]p14.[/b] What is the smallest positive integer that has a different number of digits in each base from $2$ to $5$? [b]p15.[/b] Given $3$ real numbers $(a,b,c)$ such that $$\frac{a}{b +c}=\frac{b}{3a+3c}=\frac{c}{a+3b},$$ find all possible values of $\frac{a +b}{c}$. [b]p16.[/b] Let S be the set of lattice points $(x, y, z)$ in $R^3$ satisfying $0 \le x, y, z \le 2$. How many distinct triangles exist with all three vertices in $S$? [b]p17.[/b] Let $\oplus$ be an operator such that for any $2$ real numbers $a$ and $b$, $a \oplus b = 20ab -4a -4b +1$. Evaluate $$\frac{1}{10} \oplus \frac19 \oplus \frac18 \oplus \frac17 \oplus \frac16 \oplus \frac15 \oplus \frac14 \oplus \frac13 \oplus \frac12 \oplus 1.$$ [b]p18.[/b] A function $f :N \to N$ satisfies $f ( f (x)) = x$ and $f (2f (2x +16)) = f \left(\frac{1}{x+8} \right)$ for all positive integers $x$. Find $f (2018)$. [b]p19.[/b] There exists an integer divisor $d$ of $240100490001$ such that $490000 < d < 491000$. Find $d$. [b]p20.[/b] Let $a$ and $b$ be not necessarily distinct positive integers chosen independently and uniformly at random from the set $\{1,2, 3, ... ,511,512\}$. Let $x = \frac{a}{b}$ . Find the probability that $(-1)^x$ is a real number. [b]p21[/b]. In $\vartriangle ABC$ we have $AB = 4$, $BC = 6$, and $\angle ABC = 135^o$. $\angle ABC$ is trisected by rays $B_1$ and $B_2$. Ray $B_1$ intersects side $C A$ at point $F$, and ray $B_2$ intersects side $C A$ at point $G$. What is the area of $\vartriangle BFG$? [b]p22.[/b] A level number is a number which can be expressed as $x \cdot \lfloor x \rfloor \cdot \lceil x \rceil$ where $x$ is a real number. Find the number of positive integers less than or equal to $1000$ which are also level numbers. [b]p23.[/b] Triangle $\vartriangle ABC$ has sidelengths $AB = 13$, $BC = 14$, $C A = 15$ and circumcenter $O$. Let $D$ be the intersection of $AO$ and $BC$. Compute $BD/DC$. [b]p24.[/b] Let $f (x) = x^4 -3x^3 +2x^2 +5x -4$ be a quartic polynomial with roots $a,b,c,d$. Compute $$\left(a+1 +\frac{1}{a} \right)\left(b+1 +\frac{1}{b} \right)\left(c+1 +\frac{1}{c} \right)\left(d+1 +\frac{1}{d} \right).$$ [b]p25.[/b] Triangle $\vartriangle ABC$ has centroid $G$ and circumcenter $O$. Let $D$ be the foot of the altitude from $A$ to $BC$. If $AD = 2018$, $BD =20$, and $CD = 18$, find the area of triangle $\vartriangle DOG$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Determine if there exists a finite set $S$ formed by positive prime numbers so that for each integer $n\geq2$, the number $2^2 + 3^2 +...+ n^2$ is a multiple of some element of $S$.

Define the sequence $a_1 = 1, a_2, a_3, ...$ by $$a_{n+1} = a_1^2 + a_2 ^2 + a_3^2 + ... + a_n^2 + n$$ Show that $1$ is the only square in the sequence.