Find all functions $f: \mathbb{N} \rightarrow \mathbb{Z}$ such that $|f(k)| \leq k$ for all positive integers $k$ and there is a prime number $p>2024$ which satisfies both of the following conditions: $1)$ For all $a \in \mathbb{N}$ we have $af(a+p) = af(a)+pf(a),$ $2)$ For all $a \in \mathbb{N}$ we have $p|a^{\frac{p+1}{2}}-f(a).$ [i]Authored by Nikola Velov[/i]

Consider a $2\times2$ square with one corner removed from $1\times1$ , leaving a shape in the form of $L$ . [asy] unitsize(0.5 cm); draw((1,0)--(1,2)--(0,2)--(0,0)--(2,0)--(2,1)--(0,1)); [/asy] We will call this figure [i]triomino[/i]. Determine all values of $m, n$ such that a rectangle of $m\times n$ can be exactly covered with triominos.

In a non-recent edition of [i]Ripley's Believe It or Not[/i], it was stated that the number $N = 526315789473684210$ is a [i]persistent number[/i], that is, if multiplied by any positive integer the resulting number always contains the ten digits $0, 1, 2, 3,..., 8, 9$ in some order with possible repetitions. a) Prove or disprove the above statement. b) Are there any persistent numbers smaller than the above number?

A sequence of integers $a_1,a_2,\ldots $ is defined by $a_1=1,a_2=2$ and for $n\geq 1$, $$a_{n+2}=\left\{\begin{array}{cl}5a_{n+1}-3a_{n}, &\text{if}\ a_n\cdot a_{n+1}\ \text{is even},\\ a_{n+1}-a_{n}, &\text{if}\ a_n\cdot a_{n+1}\ \text{is odd},\end{array}\right. $$ (a) Prove that the sequence contains infinitely many positive terms and infinitely many negative terms. (b) Prove that no term of the sequence is zero. (c) Show that if $n = 2^k - 1$ for $k\geq 2$, then $a_n$ is divisible by $7$.

The numbers from $1$ to $64$ must be written on the small squares of a chessboard, with a different number in each small square. Consider the $112$ numbers you can make by adding the numbers in two small squares which have a common edge. Is it possible to write the numbers in the squares so that these $112$ sums are all different?

Antonia and Benjamin play the following game: First, Antonia writes an integer from 1 to 2024. Then, Benjamin writes a different integer from 1 to 2024. They alternate turns, each writing a new integer different from the ones previously written, until no more numbers are left. Each time Antonia writes a number, she gains a point for each digit '2' in the number and loses a point for each digit '5'. Benjamin, on the other hand, gains a point for each digit '5' in his number and loses a point for each digit '2'. Who can guarantee victory in this game?

Let be three positive integers $ a,b,c $ and a function $ f:\mathbb{N}\longrightarrow\mathbb{N} $ defined as $$ f(n)=\left\{ \begin{matrix} n-a, & n>c\\ f\left( f(n+b) \right) ,& n\le c \end{matrix} \right. . $$ Determine the number of fixed points this function has.

Let $k\geq 2$,$n_1,n_2,\cdots ,n_k\in \mathbb{N}_+$,satisfied $n_2|2^{n_1}-1,n_3|2^{n_2}-1,\cdots ,n_k|2^{n_{k-1}}-1,n_1|2^{n_k}-1$. Prove:$n_ 1=n_ 2=\cdots=n_k=1$.

For reals $1\leq a\leq b \leq c \leq d \leq e \leq f$ prove inequality $(af + be + cd)(af + bd + ce) \leq (a + b^2 + c^3 )(d + e^2 + f^3 )$.

Let $ABC$ be a triangle with $AB < AC$, incenter $I$, and $A$ excenter $I_{A}$. The incircle meets $BC$ at $D$. Define $E = AD\cap BI_{A}$, $F = AD\cap CI_{A}$. Show that the circumcircle of $\triangle AID$ and $\triangle I_{A}EF$ are tangent to each other

Given an integer number $n \geq 3$, consider $n$ distinct points on a circle, labelled $1$ through $n$. Determine the maximum number of closed chords $[ij]$, $i \neq j$, having pairwise non-empty intersections. [i]János Pach[/i]

$A$ and $B$ travel around a circular track at uniform speeds in opposite directions, starting from diametrically opposite points. If they start at the same time, meet first after $B$ has travelled $100$ yards, and meet a second time $60$ yards before $A$ completes one lap, then the circumference of the track in yards is $\textbf{(A) }400\qquad\textbf{(B) }440\qquad\textbf{(C) }480\qquad\textbf{(D) }560\qquad \textbf{(E) }880$

People from n different countries sit at a round table. Assume that for every two members of the same country their neighbours sitting next to them on the right hand side are from different countries. Find the largest possible number of people sitting around the table?

Given the positive numbers $a$ and $b$ and the natural number $n$, find the greatest among the $n + 1$ monomials in the binomial expansion of $\left(a+b\right)^n$.

Determine the greatest number of figures congruent to [img]https://cdn.artofproblemsolving.com/attachments/c/6/343f9197bcebf6794460ed1a74ba83ec18a377.png[/img] that can be placed in a $9 \times 9$ grid (without overlapping), such that each figure covers exactly $4$ unit squares. The figures can be rotated and flipped over. For example, the picture below shows that at least $3$ such figures can be placed in a $4 \times4$ grid. [img]https://cdn.artofproblemsolving.com/attachments/1/e/d38fc34b650a1333742bb206c29985c94146aa.png[/img]

Andrew the Antelope canters along the surface of a regular icosahedron, which has twenty equilateral triangle faces and edge length 4. If he wants to move from one vertex to the opposite vertex, the minimum distance he must travel can be expressed as $\sqrt{n}$ for some integer $n$. Compute $n$.

When three different numbers from the set $ \{-3,-2,-1, 4, 5\} $ are multiplied, the largest possible product is $ \text{(A)}\ 10\qquad\text{(B)}\ 20\qquad\text{(C)}\ 30\qquad\text{(D)}\ 40\qquad\text{(E)}\ 60 $

A bank charges $ \$6$ for a loan of $ \$120$. The borrower receives $ \$114$ and repays the loan in $ 12$ installments of $ \$10$ a month. The interest rate is approximately: $ \textbf{(A)}\ 5 \% \qquad \textbf{(B)}\ 6 \% \qquad \textbf{(C)}\ 7 \% \qquad \textbf{(D)}\ 9\% \qquad \textbf{(E)}\ 15 \%$

Let $V$ be a finite set of points in three-dimensional space. Let $S_1, S_2, S_3$ be the sets consisting of the orthogonal projections of the points of $V$ onto the $yz$-plane, $zx$-plane, $xy$-plane, respectively. Prove that $| V|^2 \leq | S1|\cdot|S2|\cdot |S3|$, where $| A|$ denotes the number of elements in the finite set $A.$

Let $n$ be a positive integer. Prove that for each factor $m$ of the number $1+2+\cdots+n$ such that $m\ge n$, the set $\{1,2,\ldots,n\}$ can be partitioned into disjoint subsets, the sum of the elements of each being equal to $m$. [b]Edit[/b]:Typographical error fixed.

Find all functions $f:\mathbb{R}\rightarrow \mathbb{R}$ satisfying \[f(x+f(y))=x+f(f(y))\] for all real numbers $x$ and $y$, with the additional constraint $f(2004)=2005$.

A moving particle starts at the point $\left(4,4\right)$ and moves until it hits one of the coordinate axes for the first time. When the particle is at the point $\left(a,b\right)$, it moves at random to one of the points $\left(a-1,b\right)$, $\left(a,b-1\right)$, or $\left(a-1,b-1\right)$, each with probability $\tfrac{1}{3}$, independently of its previous moves. The probability that it will hit the coordinate axes at $\left(0,0\right)$ is $\tfrac{m}{3^n}$, where $m$ and $n$ are positive integers, and $m$ is not divisible by $3$. Find $m+n$.

Cut a rectangle into $18$ rectangles so that no two adjacent ones form a rectangle.

[hide=D stands for Descartes, L stands for Leibniz]they had two problem sets under those two names[/hide] [b]L.10[/b] Given the following system of equations where $x, y, z$ are nonzero, find $x^2 + y^2 + z^2$. $$x + 2y = xy$$ $$3y + z = yz$$ $$3x + 2z = xz$$ [u]Set 4[/u] [b]L.16 / D.23[/b] Anson, Billiam, and Connor are looking at a $3D$ figure. The figure is made of unit cubes and is sitting on the ground. No cubes are floating; in other words, each unit cube must either have another unit cube or the ground directly under it. Anson looks from the left side and says, “I see a $5 \times 5$ square.” Billiam looks from the front and says the same thing. Connor looks from the top and says the same thing. Find the absolute difference between the minimum and maximum volume of the figure. [b]L.17[/b] The repeating decimal $0.\overline{MBMT}$ is equal to $\frac{p}{q}$, where $p$ and $q$ are relatively prime positive integers, and $M, B, T$ are distinct digits. Find the minimum value of $q$. [b]L.18[/b] Annie, Bob, and Claire have a bag containing the numbers $1, 2, 3, . . . , 9$. Annie randomly chooses three numbers without replacement, then Bob chooses, then Claire gets the remaining three numbers. Find the probability that everyone is holding an arithmetic sequence. (Order does not matter, so $123$, $213$, and $321$ all count as arithmetic sequences.) [b]L.19[/b] Consider a set $S$ of positive integers. Define the operation $f(S)$ to be the smallest integer $n > 1$ such that the base $2^k$ representation of $n$ consists only of ones and zeros for all $k \in S$. Find the size of the largest set $S$ such that $f(S) < 2^{2019}$. [b]L.20 / D.25[/b] Find the largest solution to the equation $$2019(x^{2019x^{2019}-2019^2+2019})^{2019} = 2019^{x^{2019}+1}.$$ [u]Set 5[/u] [b]L.21[/b] Steven is concerned about his artistic abilities. To make himself feel better, he creates a $100 \times 100$ square grid and randomly paints each square either white or black, each with probability $\frac12$. Then, he divides the white squares into connected components, groups of white squares that are connected to each other, possibly using corners. (For example, there are three connected components in the following diagram.) What is the expected number of connected components with 1 square, to the nearest integer? [img]https://cdn.artofproblemsolving.com/attachments/e/d/c76e81cd44c3e1e818f6cf89877e56da2fc42f.png[/img] [b]L.22[/b] Let x be chosen uniformly at random from $[0, 1]$. Let n be the smallest positive integer such that $3^n x$ is at most $\frac14$ away from an integer. What is the expected value of $n$? [b]L.23[/b] Let $A$ and $B$ be two points in the plane with $AB = 1$. Let $\ell$ be a variable line through $A$. Let $\ell'$ be a line through $B$ perpendicular to $\ell$. Let X be on $\ell$ and $Y$ be on $\ell'$ with $AX = BY = 1$. Find the length of the locus of the midpoint of $XY$ . [b]L.24[/b] Each of the numbers $a_i$, where $1 \le i \le n$, is either $-1$ or $1$. Also, $$a_1a_2a_3a_4+a_2a_3a_4a_5+...+a_{n-3}a_{n-2}a_{n-1}a_n+a_{n-2}a_{n-1}a_na_1+a_{n-1}a_na_1a_2+a_na_1a_2a_3 = 0.$$ Find the number of possible values for $n$ between $4$ and $100$, inclusive. [b]L.25[/b] Let $S$ be the set of positive integers less than $3^{2019}$ that have only zeros and ones in their base $3$ representation. Find the sum of the squares of the elements of $S$. Express your answer in the form $a^b(c^d - 1)(e^f - 1)$, where $a, b, c, d, e, f$ are positive integers and $a, c, e$ are not perfect powers. PS. You should use hide for answers. D.1-15 / L1-9 problems have been collected [url=https://artofproblemsolving.com/community/c3h2790795p24541357]here [/url] and D.16-30/ L10-15 [url=https://artofproblemsolving.com/community/c3h2790818p24541688]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find all solutions of $2^n + 7 = x^2$ in which n and x are both integers . Prove that there are no other solutions.