A digital calendar displays the date: day, month, and year, with $2$ digits for the day, $2$ digits for the month, and $2$ digits for the year. For example, $01-01-01$ is January $1$, $2001$ and $05-25-23$ is May $25$, $2023$. In front of the calendar is a mirror. The digits of the calendar are as in the figure [img]https://cdn.artofproblemsolving.com/attachments/c/5/a08a4e34071fff4d33b95b23690254f55b33e1.gif[/img] If $0, 1, 2, 5$, and $8$ are reflected, respectively, in $0, 1, 5, 2$, and $8$, and the other digits lose meaning when reflected, determine how many days of the century, when reflected in the mirror, also correspond to a date.

Milos arranged the numbers $1$ through $49$ into the cells of a $7\times7$ board. Djordje wants to guess the arrangement of the numbers. He can choose a square covering some cells of the board and ask Milos which numbers are found inside that square. At least, how many questions does Djordje need so as to be able to guess the arrangement of the numbers?

In a field, $2023$ friends are standing in such a way that all distances between them are distinct. Each of them fires a water pistol at the friend that stands closest. Prove that at least one person does not get wet.

In a regular 100-gon, 41 vertices are colored black and the remaining 59 vertices are colored white. Prove that there exist 24 convex quadrilaterals $Q_{1}, \ldots, Q_{24}$ whose corners are vertices of the 100-gon, so that [list] [*] the quadrilaterals $Q_{1}, \ldots, Q_{24}$ are pairwise disjoint, and [*] every quadrilateral $Q_{i}$ has three corners of one color and one corner of the other color. [/list]

Let $n$ be a posititve integer and let $M$ the set of all all integer cordinates $(a,b,c)$ such that $0 \le a,b,c \le n$. A frog needs to go from the point $(0,0,0)$ to the point $(n,n,n)$ with the following rules: $\cdot$ The frog can jump only in points of $M$ $\cdot$ The frog can't jump more than $1$ time over the same point. $\cdot$ In each jump the frog can go from $(x,y,z)$ to $(x+1,y,z)$, $(x,y+1,z)$, $(x,y,z+1)$ or $(x,y,z-1)$ In how many ways the Frog can make his target?

The [i]traveler ant[/i] is walking over several chess boards. He only walks vertically and horizontally through the squares of the boards and does not pass two or more times over the same square of a board. a) In a $4$x$4$ board, from which squares can he begin his travel so that he can pass through all the squares of the board? b) In a $5$x$5$ board, from which squares can he begin his travel so that he can pass through all the squares of the board? c) In a $n$x$n$ board, from which squares can he begin his travel so that he can pass through all the squares of the board?

A [i]figuric [/i] is a convex polyhedron with $26^{5^{2019}}$ faces. On every face of a figuric we write down a number. When we throw two figurics (who don't necessarily have the same set of numbers on their sides) into the air, the figuric which falls on a side with the greater number wins; if this number is equal for both figurics, we repeat this process until we obtain a winner. Assume that a figuric has an equal probability of falling on any face. We say that one figuric rules over another if when throwing these figurics into the air, it has a strictly greater probability to win than the other figuric (it can be possible that given two figurics, no figuric rules over the other). Milisav and Milojka both have a blank figuric. Milisav writes some (not necessarily distinct) positive integers on the faces of his figuric so that they sum up to $27^{5^{2019}}$. After this, Milojka also writes positive integers on the faces of her figuric so that they sum up to $27^{5^{2019}}$. Is it always possible for Milojka to create a figuric that rules over Milisav's? [i]Proposed by Bojan Basic[/i]

Each face of a cube is of the same size as each square of a chessboard. The cube is coloured black and white, placed on one of the squares of the chessboard and rolled so that each square of the chessboard is visited exactly once. Can this be done in such a way that the colour of the visited square and the colour of the bottom face of the cube are always the same? (A Shapovalov)

Let $A$ be a set of $65$ integers with pairwise different remainders modulo $2016$. Prove that exists a subset $B=\{a,b,c,d\}$ of set $A$ such that $a+b-c-d$ is divisible with $2016$

$N$ cells are marked on an $n\times n$ table so that at least one marked cel is among any four cells of the table which form the figure [img]https://cdn.artofproblemsolving.com/attachments/2/2/090c32eb52df31eb81b9a86c63610e4d6531eb.png[/img] (tbe figure may be rotated). Find the smallest possible value of $N$. (E. Barabanov)

There are $n$ knights numbered $1$ to $n$ and a round table with $n$ chairs. The first knight chooses his chair, and from him, the knight number $k+1$ sits $ k$ places to the right of knight number $k$ , for all $1 \le k\le n-1$ (occupied and empty seats are counted). In particular, the second knight sits next to the first. Find all values ​​of $n$ such that the $n$ gentlemen occupy the $n$ chairs following the described procedure.

Each day $289$ students are divided into $17$ groups of $17$. No two students are ever in the same group more than once. What is the largest number of days that this can be done?

Alphonse and Beryl are playing a game. The game starts with two rectangles with integer side lengths. The players alternate turns, with Alphonse going first. On their turn, a player chooses one rectangle, and makes a cut parallel to a side, cutting the rectangle into two pieces, each of which has integer side lengths. The player then discards one of the three rectangles (either the one they did not cut, or one of the two pieces they cut) leaving two rectangles for the other player. A player loses if they cannot cut a rectangle. Determine who wins each of the following games: (a) The starting rectangles are $1 \times 2020$ and $2 \times 4040$. (b) The starting rectangles are $100 \times 100$ and $100 \times 500$.

Let $n$ be a positive integer. Every square in a $n \times n$-square grid is either white or black. How many such colourings exist, if every $2 \times 2$-square consists of exactly two white and two black squares? The squares in the grid are identified as e.g. in a chessboard, so in general colourings obtained from each other by rotation are different.

Let $n$ be an positive integer. Find the smallest integer $k$ with the following property; Given any real numbers $a_1 , \cdots , a_d $ such that $a_1 + a_2 + \cdots + a_d = n$ and $0 \le a_i \le 1$ for $i=1,2,\cdots ,d$, it is possible to partition these numbers into $k$ groups (some of which may be empty) such that the sum of the numbers in each group is at most $1$.

Let $k,n$ be positive integers with $n \geq k \geq 3$. We consider $n+1$ points on the real plane with none three of them on the same line. We colour any segment between the points with one of $k$ possibilities. We say that an angle is a "bicolour angle" iff its vertex is one of the $n+1$ points and the two segments that define it are of different colours. Show that there is always a way to colour the segments that makes more than $n \Big\lfloor{\frac{n}{k}}\Big\rfloor^2 \frac{k(k-1)}{2}$ bicolour angles.

Assume we have $95$ boxes and $19$ balls distributed in these boxes in an arbitrary manner. We take $6$ new balls at a time and place them in $6$ of the boxes, one ball in each of the six. Can we, by repeating this process a suitable number of times, achieve a situation in which each of the $95$ boxes contains an equal number of balls?

Place eight rooks on a standard $8 \times 8$ chessboard so that no two are in the same row or column. With the standard rules of chess, this means that no two rooks are attacking each other. Now paint $27$ of the remaining squares (not currently occupied by rooks) red. Prove that no matter how the rooks are arranged and which set of $27$ squares are painted, it is always possible to move some or all of the rooks so that: • All the rooks are still on unpainted squares. • The rooks are still not attacking each other (no two are in the same row or same column). • At least one formerly empty square now has a rook on it; that is, the rooks are not on the same $8$ squares as before.

[b]p1.[/b] The entrance fee the county fair is $64$ cents. Unfortunately, you only have nickels and quarters so you cannot give them exact change. Furthermore, the attendent insists that he is only allowed to change in increments of six cents. What is the least number of coins you will have to pay? [b]p2.[/b] At the county fair, there is a carnival game set up with a mouse and six cups layed out in a circle. The mouse starts at position $A$ and every ten seconds the mouse has equal probability of jumping one cup clockwise or counter-clockwise. After a minute if the mouse has returned to position $A$, you win a giant chunk of cheese. What is the probability of winning the cheese? [b]p3.[/b] A clown stops you and poses a riddle. How many ways can you distribute $21$ identical balls into $3$ different boxes, with at least $4$ balls in the first box and at least $1$ ball in the second box? [b]p4.[/b] Watch out for the pig. How many sets $S$ of positive integers are there such that the product of all the elements of the set is $125970$? [b]p5.[/b] A good word is a word consisting of two letters $A$, $B$ such that there is never a letter $B$ between any two $A$'s. Find the number of good words with length $8$. [b]p6.[/b] Evaluate $\sqrt{2 -\sqrt{2 +\sqrt{2-...}}}$ without looking. [b]p7.[/b] There is nothing wrong with being odd. Of the first $2006$ Fibonacci numbers ($F_1 = 1$, $F_2 = 1$), how many of them are even? [b]p8.[/b] Let $f$ be a function satisfying $f (x) + 2f (27- x) = x$. Find $f (11)$. [b]p9.[/b] Let $A$, $B$, $C$ denote digits in decimal representation. Given that $A$ is prime and $A -B = 4$, nd $(A,B,C)$ such that $AAABBBC$ is a prime. [b]p10.[/b] Given $\frac{x^2+y^2}{x^2-y^2} + \frac{x^2-y^2}{x^2+y^2} = k$ , find $\frac{x^8+y^8}{x^8-y^8}$ in term of $k$. [b]p11.[/b] Let $a_i \in \{-1, 0, 1\}$ for each $i = 1, 2, 3, ..., 2007$. Find the least possible value for $\sum^{2006}_{i=1}\sum^{2007}_{j=i+1} a_ia_j$. [b]p12.[/b] Find all integer solutions $x$ to $x^2 + 615 = 2^n$ for any integer $n \ge 1$. [b]p13.[/b] Suppose a parabola $y = x^2 - ax - 1$ intersects the coordinate axes at three points $A$, $B$, and $C$. The circumcircle of the triangle $ABC$ intersects the $y$ - axis again at point $D = (0, t)$. Find the value of $t$. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

In a room there are several children and a pile of 1000 sweets. The children come to the pile one after another in some order. Upon reaching the pile each of them divides the current number of sweets in the pile by the number of children in the room, rounds the result if it is not integer, takes the resulting number of sweets from the pile and leaves the room. All the boys round upwards and all the girls round downwards. The process continues until everyone leaves the room. Prove that the total number of sweets received by the boys does not depend on the order in which the children reach the pile. [i]Maxim Didin[/i]

In an $m\times n$ table there is a policeman in cell $(1,1)$, and there is a thief in cell $(i,j)$. A move is going from a cell to a neighbor (each cell has at most four neighbors). Thief makes the first move, then the policeman moves and ... For which $(i,j)$ the policeman can catch the thief?

For a given positive integer $n$, find the greatest positive integer $k$, such that there exist three sets of $k$ non-negative distinct integers, $A=\{x_1,x_2,\cdots,x_k\}, B=\{y_1,y_2,\cdots,y_k\}$ and $C=\{z_1,z_2,\cdots,z_k\}$ with $ x_j\plus{}y_j\plus{}z_j\equal{}n$ for any $ 1\leq j\leq k$. [size=85][color=#0000FF][Moderator edit: LaTeXified][/color][/size]

Let $O$ be a fixed point in the plane. We have $2024$ red points, $2024$ yellow points and $2024$ green points in the plane, where there isn't any three colinear points and all points are distinct from $O$. It is known that for any two colors, the convex hull of the points that are from any of those two colors contains $O$ (it maybe contain it in it's interior or in a side of it). We say that a red point, a yellow point and a green point make a [i]bolivian[/i] triangle if said triangle contains $O$ in its interior or in one of its sides. Determine the greatest positive integer $k$ such that, no matter how such points are located, there is always at least $k$ [i]bolivian[/i] triangles.

Consider five-dimensional Cartesian space $R^5 = \{(x_1, x_2, x_3, x_4, x_5) | x_i \in R\}$, and consider the hyperplanes with the following equations: $\bullet$ $x_i = x_j$ for every $1 \le i < j \le 5$, $\bullet$ $x_1 + x_2 + x_3 + x_4 + x_5 = -1$, $\bullet$ $x_1 + x_2 + x_3 + x_4 + x_5 = 0$, $\bullet$ $x_1 + x_2 + x_3 + x_4 + x_5 = 1$. Into how many regions do these hyperplanes divide $R^5$ ?

Each of the numbers $1, 2, ... , 10$ is colored red or blue. $5$ is red and at least one number is blue. If $m, n$ are different colors and $m+n \le 10$, then $m+n$ is blue. If $m, n$ are different colors and $mn \le 10$, then $mn$ is red. Find all the colors.