Compute the three-digit number that satisfies the following properties: $\bullet$ The hundreds digit and ones digit are the same, but the tens digit is different. $\bullet$ The number is divisible by $9$. $\bullet$ When the number is divided by $5$, the remainder is $1$.

Let $N$ be a positive integer. It is given set of weights which satisfies following conditions: $i)$ Every weight from set has some weight from $1,2,...,N$; $ii)$ For every $i\in {1,2,...,N}$ in given set there exists weight $i$; $iii)$ Sum of all weights from given set is even positive integer. Prove that set can be partitioned into two disjoint sets which have equal weight

Seated in a circle are $11$ wizards. A different positive integer not exceeding $1000$ is pasted onto the forehead of each. A wizard can see the numbers of the other $10$, but not his own. Simultaneously, each wizard puts up either his left hand or his right hand. Then each declares the number on his forehead at the same time. Is there a strategy on which the wizards can agree beforehand, which allows each of them to make the correct declaration?

In each square of the table below, we must write a different integer from $1$ to $17$, such that the sum of the numbers in each of the eight columns is the same, and the sum of the numbers in the top row is twice the sum of the numbers in the bottom row. Which number from $1$ to $17$ can be omitted? [img]https://wiki-images.artofproblemsolving.com//2/2b/Zrzut_ekranu_2023-05-22_o_10.28.33.png[/img]

Given integer $n \geq 3$. There are $n$ dots marked $1$ to $n$ clockwise on a big circle. And between every two neighboring dots, there is a light. At first, every light were dark. A and B are playing a game, A pick up $n$ pairs from $\{ (i,j)|1 \leq i < j \leq n \}$ and for every pairs $(i,j)$. B starts from the point marked $i$ and choose to walk clockwise or counterclockwise to the point marked $j$. And B invert the status of all passing lights (bright $\leftrightarrow$ dark) A hopes the number of dark light can be as much as possible while B hopes the number of bright light can be as much as possible. Suppose A, B are both smart, how many lights are bright in the end? [i]Proposed by BlessingOfHeaven[/i] [img]https://pbs.twimg.com/profile_images/1014932415201120256/u9KAaMZ4_400x400.jpg[/img]

In town $ A,$ there are $ n$ girls and $ n$ boys, and each girl knows each boy. In town $ B,$ there are $ n$ girls $ g_1, g_2, \ldots, g_n$ and $ 2n \minus{} 1$ boys $ b_1, b_2, \ldots, b_{2n\minus{}1}.$ The girl $ g_i,$ $ i \equal{} 1, 2, \ldots, n,$ knows the boys $ b_1, b_2, \ldots, b_{2i\minus{}1},$ and no others. For all $ r \equal{} 1, 2, \ldots, n,$ denote by $ A(r),B(r)$ the number of different ways in which $ r$ girls from town $ A,$ respectively town $ B,$ can dance with $ r$ boys from their own town, forming $ r$ pairs, each girl with a boy she knows. Prove that $ A(r) \equal{} B(r)$ for each $ r \equal{} 1, 2, \ldots, n.$

The natural numbers from $1$ to $50$ are written down on the blackboard. At least how many of them should be deleted, in order that the sum of any two of the remaining numbers is not a prime?

Boris plays a game in which he rolls two standard four-sided dice independently and at random, and at the end of the game receives a number of dollars equal to the product of the two rolled numbers. After the initial roll of both dice, however, he can pay two dollars to reroll one die of choice, and he is allowed to pay to reroll as many times as he wishes. If Boris plays to maximize his expected gain, how much money, in dollars, can he expect to win by playing once?

We are given $3n$ points $A_1,A_2, \ldots , A_{3n}$ in the plane, no three of them collinear. Prove that one can construct $n$ disjoint triangles with vertices at the points $A_i.$

A prime $p>3$ is given. Let $K$ be the number of such permutations $(a_1, a_2, \ldots, a_p)$ of $\{ 1, 2, \ldots, p\}$ such that $$a_1a_2+a_2a_3+\ldots + a_{p-1}a_p+a_pa_1$$ is divisible by $p$. Prove $K+p$ is divisible by $p^2$.

$ (a)$ A group of people attends a party. Each person has at most three acquaintances in the group, and if two people do not know each other, then they have a common acquaintance in the group. What is the maximum possible number of people present? $ (b)$ If, in addition, the group contains three mutual acquaintances, what is the maximum possible number of people?

We want to choose telephone numbers for a city. The numbers have $10$ digits and $0$ isn’t used in the numbers. Our aim is: We don’t choose some numbers such that every $2$ telephone numbers are different in more than one digit OR every $2$ telephone numbers are different in a digit which is more than $1$. What is the maximum number of telephone numbers which can be chosen? In how many ways, can we choose the numbers in this maximum situation?

A [i]$n$-trønder walk[/i] is a walk starting at $(0, 0)$, ending at $(2n, 0)$ with no self intersection and not leaving the first quadrant, where every step is one of the vectors $(1, 1)$, $(1, -1)$ or $(-1, 1)$. Find the number of $n$-trønder walks.

Ten points on a plane a such that any four of them lie on the boundary of some square. Is obligatory true that all ten points lie on the boundary of some square?

[b]p1.[/b] Two trains, $A$ and $B$, travel between cities $P$ and $Q$. On one occasion $A$ started from $P$ and $B$ from $Q$ at the same time and when they met $A$ had travelled $120$ miles more than $B$. It took $A$ four $(4)$ hours to complete the trip to $Q$ and B nine $(9)$ hours to reach $P$. Assuming each train travels at a constant speed, what is the distance from $P$ to $Q$? [b]p2.[/b] If $a$ and $b$ are integers, $b$ odd, prove that $x^2 + 2ax + 2b = 0$ has no rational roots. [b]p3.[/b] A diameter segment of a set of points in a plane is a segment joining two points of the set which is at least as long as any other segment joining two points of the set. Prove that any two diameter segments of a set of points in the plane must have a point in common. [b]p4.[/b] Find all positive integers $n$ for which $\frac{n(n^2 + n + 1) (n^2 + 2n + 2)}{2n + 1}$ is an integer. Prove that the set you exhibit is complete. [b]p5.[/b] $A, B, C, D$ are four points on a semicircle with diameter $AB = 1$. If the distances $\overline{AC}$, $\overline{BC}$, $\overline{AD}$, $\overline{BD}$ are all rational numbers, prove that $\overline{CD}$ is also rational. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $X$ be a non-empty and finite set, $A_1,...,A_k$ $k$ subsets of $X$, satisying: (1) $|A_i|\leq 3,i=1,2,...,k$ (2) Any element of $X$ is an element of at least $4$ sets among $A_1,....,A_k$. Show that one can select $[\frac{3k}{7}] $ sets from $A_1,...,A_k$ such that their union is $X$.

In Vila Par, all the truth coins weigh an even quantity of grams and the false coins weigh an odd quantity of grams. The eletronic device only gives the parity of the weight of a set of coins. If there are $2020$ truth coins and $2$ false coins, detemine the least $k$, such that, there exists a strategy that allows to identify the two false coins using the eletronic device, at most, $k$ times.

Anana has an ordered $n$-tuple $(a_1,a_2,...,a_n)$ if integers. Banana may make a guess on Anana's ordered integer $n$-tuple $(x_1,x_2,...,x_n)$, upon which Anana will reveal the product of differences $(a_1-x_1)(a_2-x_2)...(a_n-x_n)$. How many guesses does Banana need to figure out Anana's $n$-tuple for certain?

For each integer $n\ge 1,$ compute the smallest possible value of \[\sum_{k=1}^{n}\left\lfloor\frac{a_k}{k}\right\rfloor\] over all permutations $(a_1,\dots,a_n)$ of $\{1,\dots,n\}.$ [i]Proposed by Shahjalal Shohag, Bangladesh[/i]

We have four charged batteries, four uncharged batteries and a radio which needs two charged batteries to work. Suppose we don't know which batteries are charged and which ones are uncharged. Find the least number of attempts sufficient to make sure the radio will work. An attempt consists in putting two batteries in the radio and check if the radio works or not.

$n(>1)$ lotus leaves are arranged in a circle. A frog jumps from a particular leaf from another under the following rule: [list] [*]It always moves clockwise. [*]From starting it skips one leaf and then jumps to the next. After that it skips two leaves and jumps to the following. And the process continues. (Remember the frog might come back on a leaf twice or more.)[/list] Given that it reaches all leaves at least once. Show $n$ cannot be odd.

There are eight seats at a round table. Six adults $A_1, \ldots, A_6$ and two children sit around the table. The two children are not allowed to six next to each other. All the seating configurations where the children are not seated next to each other are equally likely. What is the probability that the adults $A_1$ and $A_2$ end up sitting next to each other?\[ \mathrm a. ~4/15\qquad \mathrm b. ~2/7 \qquad \mathrm c. ~2/9 \qquad\mathrm d. ~1/3\qquad\mathrm e. ~1/5\qquad\]

Anna and Bob are playing the following game: The number $2$ is initially written on the blackboard. With Anna playing first, they alternately double the number currently written on the blackboard or square it. The person who first writes on the blackboard a number greater than $2023^{10}$ is the winner. Determine which player has a winning strategy.

11 integers are placed along the circle. It is known that any two neighbors differ by at least 20 and sum of any two neighbors is no more than 100. Find the minimal possible sum of all numbers.

[b]Q.[/b] Consider in the plane $n>3$ different points. These have the properties, that all $3$ points can be included in a triangle with maximum area $1$. Prove that all the $n>3$ points can be included in a triangle with maximum area $4$. [i]Proposed by TuZo[/i]