[b]p1.[/b] In triangle $ABC$, the median $BM$ is drawn. The length $|BM| = |AB|/2$. The angle $\angle ABM = 50^o$. Find the angle $\angle ABC$. [b]p2.[/b] Is there a positive integer $n$ which is divisible by each of $1, 2,3,..., 2018$ except for two numbers whose difference is$ 7$? [b]p3.[/b] Twenty numbers are placed around the circle in such a way that any number is the average of its two neighbors. Prove that all of the numbers are equal. [b]p4.[/b] A finite number of frogs occupy distinct integer points on the real line. At each turn, a single frog jumps by $1$ to the right so that all frogs again occupy distinct points. For some initial configuration, the frogs can make $n$ moves in $m$ ways. Prove that if they jump by $1$ to the left (instead of right) then the number of ways to make $n$ moves is also $m$. [b]p5.[/b] A square box of chocolates is divided into $49$ equal square cells, each containing either dark or white chocolate. At each move Alex eats two chocolates of the same kind if they are in adjacent cells (sharing a side or a vertex). What is the maximal number of chocolates Alex can eat regardless of distribution of chocolates in the box? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Determine the last four digits of a perfect square of a natural number, knowing that the last three of them are the same.

Find all triples $(x,n,p)$ of positive integers $x$ and $n$ and primes $p$ for which the following holds $x^3 + 3x + 14 = 2 p^n$

$x$ and $y$ are positive and relatively prime and $z$ is an integer. They satisfy $(5z-4x)(5z-4y)=25xy$. Show that at least one of $10z+x+y$ or quotient of this number divided by $3$ is a square number (i.e. prove that $10z+x+y$ or integer part of $\frac{10z+x+y}{3}$ is a square number).

Let $n$ be a given positive integer. We say that a positive integer $m$ is [i]$n$-good[/i] if and only if there are at most $2n$ distinct primes $p$ satisfying $p^2\mid m$. (a) Show that if two positive integers $a,b$ are coprime, then there exist positive integers $x,y$ so that $ax^n+by^n$ is $n$-good. (b) Show that for any $k$ positive integers $a_1,\ldots,a_k$ satisfying $\gcd(a_1,\ldots,a_k)=1$, there exist positive integers $x_1,\ldots,x_k$ so that $a_1x_1^n+a_2x_2^n+\cdots+a_kx_k^n$ is $n$-good. (Remark: $a_1,\ldots,a_k$ are not necessarily pairwise distinct) [i]Proposed by usjl.[/i]

The difference of fractions $\frac{2024}{2023} - \frac{2023}{2024}$ was represented as an irreducible fraction $\frac{p}{q}$. Find the value of $p$.

Determine all positive integers $n$ for which there exist positive divisors $a$, $b$, $c$ of $n$ such that $a>b>c$ and $a^2 - b^2$, $b^2 - c^2$, $a^2 - c^2$ are also divisors of $n$.

Find all functions $f:\mathbb N\to\mathbb N_0$ such that for all $m,n\in\mathbb N$, \begin{align*} f(mn)&=f(m)f(n)\\ f(m+n)&=\min(f(m),f(n))\qquad\text{if }f(m)\ne f(n)\end{align*}

Solve in non-negative integers the equation $ 2^{a}3^{b} \plus{} 9 \equal{} c^{2}$

Let $k,m,n$ be positive integers such that $k > n > 1$ and $(k,n) = 1$. If $k-n | k^m - n^{m-1}$, prove that $k \le 2n - 1$.

An [i]arithmetic sequence[/i] is an infinite sequence of the form $a_n=a_0+n\cdot d$ with $d\neq 0$. A [i]geometric sequence[/i] is an infinite sequence of the form $b_n=b_0 \cdot q^n$ where $q\neq 1,0,-1$. [list=a] [*] Does every arithmetic sequence of [b]integers[/b] have an infinite subsequence which is geometric? [*] Does every arithmetic sequence of [b]real numbers[/b] have an infinite subsequence which is geometric? [/list]

Let $r$ and $b$ be positive integers. The game of [i]Monis[/i], a variant of Tetris, consists of a single column of red and blue blocks. If two blocks of the same color ever touch each other, they both vanish immediately. A red block falls onto the top of the column exactly once every $r$ years, while a blue block falls exactly once every $b$ years. (a) Suppose that $r$ and $b$ are odd, and moreover the cycles are offset in such a way that no two blocks ever fall at exactly the same time. Consider a period of $rb$ years in which the column is initially empty. Determine, in terms of $r$ and $b$, the number of blocks in the column at the end. (b) Now suppose $r$ and $b$ are relatively prime and $r+b$ is odd. At time $t=0$, the column is initially empty. Suppose a red block falls at times $t = r, 2r, \dots, (b-1)r$ years, while a blue block falls at times $t = b, 2b, \dots, (r-1)b$ years. Prove that at time $t=rb$, the number of blocks in the column is $\left\lvert 1+2(r-1)(b+r)-8S \right\rvert$, where \[ S = \left\lfloor \frac{2r}{r+b} \right\rfloor + \left\lfloor \frac{4r}{r+b} \right\rfloor + ... + \left\lfloor \frac{(r+b-1)r}{r+b} \right\rfloor . \] [i]Proposed by Sammy Luo[/i]

Determine all naturals $n$ such that $2^n + 5$ is a perfect square.

One hundred natural numbers whose greatest common divisor is $1$ are arranged around a circle. An allowed operation is to add to a number the greatest common divisor of its two neighhbors. Prove that we can make all the numbers pairwise copirme in a finite number of moves.

Let $ p>3$ be a prime. If $ p$ divides $ x$, prove that the equation $ x^2-1=y^p$ does not have positive integer solutions.

A hexagon inscribed in a circle has three consecutive sides each of length $3$ and three consecutive sides each of length $5$. The chord of the circle that divides the hexagon into two trapezoids, one with three sides each of length $3$ and the other with three sides each of length $5$, has length equal to $\frac mn$, where $m$ and $n$ are relatively prime positive integers. Find $m + n$. $\text{(A)}\ 309 \qquad \text{(B)}\ 349 \qquad \text{(C)}\ 369 \qquad \text{(D)}\ 389\qquad \text{(E)}\ 409$

A number is called [i]Norwegian[/i] if it has three distinct positive divisors whose sum is equal to $2022$. Determine the smallest Norwegian number. (Note: The total number of positive divisors of a Norwegian number is allowed to be larger than $3$.)

i) How many integers $n$ are there such that $n$ is divisible by $9$ and $n+1$ is divisible by $25$? ii) How many integers $n$ are there such that $n$ is divisible by $21$ and $n+1$ is divisible by $165$? iii) How many integers $n$ are there such that $n$ is divisible by $9, n + 1$ is divisible by $25$, and $n + 2$ is divisible by $4$?

For $x, y$ positive integers, $x^2-4y+1$ is a multiple of $(x-2y)(1-2y)$. Prove that $|x-2y|$ is a square number.

Find all positive integers $ n$ having exactly $ 16$ divisors $ 1\equal{}d_1<d_2<...<d_{16}\equal{}n$ such that $ d_6\equal{}18$ and $ d_9\minus{}d_8\equal{}17.$

Prove that there exist infinitely many positive integers $n$ such that the largest prime divisor of $n^4 + n^2 + 1$ is equal to the largest prime divisor of $(n+1)^4 + (n+1)^2 +1$.

Find $$\sum^{100}_{i=1}i \gcd(i ,100).$$

For each positive integer $n$ we denote by $p(n)$ the greatest square less than or equal to $n$. [list=a] [*]Find all pairs of positive integers $( m,n)$, with $m\leq n$, for which \[ p( 2m+1) \cdot p( 2n+1) =400 \] [*]Determine the set $\mathcal{P}=\{ n\in\mathbb{N}^{\ast}\vert n\leq100\text{ and }\dfrac{p(n+1)}{p(n)}\notin\mathbb{N}^{\ast}\}$[/list]

[b]p1.[/b] Arrange the whole numbers $1$ through $15$ in a row so that the sum of any two adjacent numbers is a perfect square. In how many ways this can be done? [b]p2.[/b] Prove that if $p$ and $q$ are prime numbers which are greater than $3$ then $p^2 - q^2$ is divisible by $24$. [b]p3.[/b] If a polyleg has even number of legs he always tells truth. If he has an odd number of legs he always lies. Once a green polyleg told a dark-blue polyleg ”- I have $8$ legs. And you have only $6$ legs!” The offended dark-blue polyleg replied ”-It is me who has $8$ legs, and you have only $7$ legs!” A violet polyleg added ”-The dark-blue polyleg indeed has $8$ legs. But I have $9$ legs!” Then a stripped polyleg started ”None of you has $8$ legs. Only I have $8$ legs!” Which polyleg has exactly $8$ legs? [b][b]p4.[/b][/b] There is a small puncture (a point) in the wall (as shown in the figure below to the right). The housekeeper has a small flag of the following form (see the figure left). Show on the figure all the points of the wall where you can hammer in a nail such that if you hang the flag it will close up the puncture. [img]https://cdn.artofproblemsolving.com/attachments/a/f/8bb55a3fdfb0aff8e62bc4cf20a2d3436f5d90.png[/img] [b]p5.[/b] Assume $ a, b, c$ are odd integers. Show that the quadratic equation $ax^2 + bx + c = 0$ has no rational solutions. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Professor Moriarty has designed a “prime-testing trail.” The trail has $2002$ stations, labeled $1,... , 2002$. Each station is colored either red or green, and contains a table which indicates, for each of the digits $0, ..., 9$, another station number. A student is given a positive integer $n$, and then walks along the trail, starting at station $1$. The student reads the first (leftmost) digit of $n,$ and looks this digit up in station $1$’s table to get a new station location. The student then walks to this new station, reads the second digit of $n$ and looks it up in this station’s table to get yet another station location, and so on, until the last (rightmost) digit of $n$ has been read and looked up, sending the student to his or her final station. Here is an example that shows possible values for some of the tables. Suppose that $n = 19$: [img]https://cdn.artofproblemsolving.com/attachments/f/3/db47f6761ca1f350e39d53407a1250c92c4b05.png[/img] Using these tables, station $1$, digit $1$ leads to station $29$m station $29$, digit $9$ leads to station $1429$, and station $1429$ is green. Professor Moriarty claims that for any positive integer $n$, the final station (in the example, $1429$) will be green if and only if $n$ is prime. Is this possible?