Determine the number of $3-$digit numbers in base $10$ having at least one $5$ and at most one $3$.

There is a $50\times 50$ grid board.. Carlos is going to write a number in each box with the following procedure. He first chooses $100$ distinct numbers that we denote $f_1,f_2,f_3,…,f_{50},c_1,c_2,c_3,…,c_{50}$ among which there are exactly $50$ that they are rational. Then he writes in each box ($i,j)$ the number $f_i \cdot c_j$ (the multiplication of $f_i$ by $c_j$). Determine the maximum number of rational numbers that the squares on the board can contain.

Let $n$ be a positive integer and $M=\{1,2,\ldots, n\}.$ A subset $T\subset M$ is called [i]heavy[/i] if each of its elements is greater or equal than $|T|.$ Let $f(n)$ denote the number of heavy subsets of $M.$ Describe a method for finding $f(n)$ and use it to calculate $f(32).$

Compute the probability that a random permutation of the letters in BERKELEY does not have the three E’s all on the same side of the Y.

Amy and Bob choose numbers from $0,1,2,\cdots,81$ in turn and Amy choose the number first. Every time the one who choose number chooses one number from the remaining numbers. When all $82$ numbers are chosen, let $A$ be the sum of all the numbers Amy chooses, and let $B$ be the sum of all the numbers Bob chooses. During the process, Amy tries to make $\gcd(A,B)$ as great as possible, and Bob tries to make $\gcd(A,B)$ as little as possible. Suppose Amy and Bob take the best strategy of each one, respectively, determine $\gcd(A,B)$ when all $82$ numbers are chosen.

A set $S=\{ s_1,s_2,...,s_k\}$ of positive real numbers is "polygonal" if $k\geq 3$ and there is a non-degenerate planar $k-$gon whose side lengths are exactly $s_1,s_2,...,s_k$; the set $S$ is multipolygonal if in every partition of $S$ into two subsets,each of which has at least three elements, exactly one of these two subsets in polygonal. Fix an integer $n\geq 7$. (a) Does there exist an $n-$element multipolygonal set, removal of whose maximal element leaves a multipolygonal set? (b) Is it possible that every $(n-1)-$element subset of an $n-$element set of positive real numbers be multipolygonal?

Determine all non empty sets $C_1, C_2, C_3, \cdots $ such that each one of them has a finite number of elements, all their elements are positive integers, and they satisfy the following property: For any positive integers $n$ and $m$, the number of elements in the set $C_n$ plus the number of elements in the set $C_m$ equals the sum of the elements in the set $C_{m + n}$. [i]Note:[/i] We denote $\lvert C_n \lvert$ the number of elements in the set $C_n$, and $S_k$ as the sum of the elements in the set $C_n$ so the problem's condition is that for every $n$ and $m$: \[\lvert C_n \lvert + \lvert C_m \lvert = S_{n + m}\] is satisfied.

$n$ is a positive integer. An equilateral triangle of side length $3n$ is split into $9n^2$ unit equilateral triangles, each colored one of red, yellow, blue, such that each color appears $3n^2$ times. We call a trapezoid formed by three unit equilateral triangles as a "standard trapezoid". If a "standard trapezoid" contains all three colors, we call it a "colorful trapezoid". Find the maximum possible number of "colorful trapezoids".

[b]p1.[/b] Find the largest $4$ digit integer that is divisible by $2$ and $5$, but not $3$. [b]p2.[/b] The diagram below shows the eight vertices of a regular octagon of side length $2$. These vertices are connected to form a path consisting of four crossing line segments and four arcs of degree measure $270^o$. Compute the area of the shaded region. [center][img]https://cdn.artofproblemsolving.com/attachments/0/0/eec34d8d2439b48bb5cca583462c289287f7d0.png[/img][/center] [b]p3.[/b] Consider the numbers formed by writing full copies of $2023$ next to each other, like so: $$2023202320232023...$$ How many copies of $2023$ are next to each other in the smallest multiple of $11$ that can be written in this way? [b]p4.[/b] A positive integer $n$ with base-$10$ representation $n = a_1a_2 ...a_k$ is called [i]powerful [/i] if the digits $a_i$ are nonzero for all $1 \le i \le k$ and $$n = a^{a_1}_1 + a^{a_2}_2 +...+ a^{a_k}_k .$$ What is the unique four-digit positive integer that is [i]powerful[/i]? [b]p5.[/b] Six $(6)$ chess players, whose names are Alice, Bob, Crystal, Daniel, Esmeralda, and Felix, are sitting in a circle to discuss future content pieces for a show. However, due to fights they’ve had, Bob can’t sit beside Alice or Crystal, and Esmeralda can’t sit beside Felix. Determine the amount of arrangements the chess players can sit in. Two arrangements are the same if they only differ by a rotation. [b]p6.[/b] Given that the infinite sum $\frac{1}{1^4} +\frac{1}{2^4} +\frac{1}{3^4} +...$ is equal to $\frac{\pi^4}{90}$, compute the value of $$\dfrac{\dfrac{1}{1^4} +\dfrac{1}{2^4} +\dfrac{1}{3^4} +...}{\dfrac{1}{1^4} +\dfrac{1}{3^4} +\dfrac{1}{5^4} +...}$$ [b]p7.[/b] Triangle $ABC$ is equilateral. There are $3$ distinct points, $X$, $Y$ , $Z$ inside $\vartriangle ABC$ that each satisfy the property that the distances from the point to the three sides of the triangle are in ratio $1 : 1 : 2$ in some order. Find the ratio of the area of $\vartriangle ABC$ to that of $\vartriangle XY Z$. [b]p8.[/b] For a fixed prime $p$, a finite non-empty set $S = \{s_1,..., s_k\}$ of integers is $p$-[i]admissible [/i] if there exists an integer $n$ for which the product $$(s_1 + n)(s_2 + n) ... (s_k + n)$$ is not divisible by $p$. For example, $\{4, 6, 8\}$ is $2$-[i]admissible[/i] since $(4+1)(6+1)(8+1) = 315$ is not divisible by $2$. Find the size of the largest subset of $\{1, 2,... , 360\}$ that is two-,three-, and five-[i]admissible[/i]. [b]p9.[/b] Kwu keeps score while repeatedly rolling a fair $6$-sided die. On his first roll he records the number on the top of the die. For each roll, if the number was prime, the following roll is tripled and added to the score, and if the number was composite, the following roll is doubled and added to the score. Once Kwu rolls a $1$, he stops rolling. For example, if the first roll is $1$, he gets a score of $1$, and if he rolls the sequence $(3, 4, 1)$, he gets a score of $3 + 3 \cdot 4 + 2 \cdot 1 = 17$. What is his expected score? [b]p10.[/b] Let $\{a_1, a_2, a_3, ...\}$ be a geometric sequence with $a_1 = 4$ and $a_{2023} = \frac14$ . Let $f(x) = \frac{1}{7(1+x^2)}$. Find $$f(a_1) + f(a_2) + ... + f(a_{2023}).$$ [b]p11.[/b] Let $S$ be the set of quadratics $x^2 + ax + b$, with $a$ and $b$ real, that are factors of $x^{14} - 1$. Let $f(x)$ be the sum of the quadratics in $S$. Find $f(11)$. [b]p12.[/b] Find the largest integer $0 < n < 100$ such that $n^2 + 2n$ divides $4(n- 1)! + n + 4$. [b]p13.[/b] Let $\omega$ be a unit circle with center $O$ and radius $OQ$. Suppose $P$ is a point on the radius $OQ$ distinct from $Q$ such that there exists a unique chord of $\omega$ through $P$ whose midpoint when rotated $120^o$ counterclockwise about $Q$ lies on $\omega$. Find $OP$. [b]p14.[/b] A sequence of real numbers $\{a_i\}$ satisfies $$n \cdot a_1 + (n - 1) \cdot a_2 + (n - 2) \cdot a_3 + ... + 2 \cdot a_{n-1} + 1 \cdot a_n = 2023^n$$ for each integer $n \ge 1$. Find the value of $a_{2023}$. [b]p15.[/b] In $\vartriangle ABC$, let $\angle ABC = 90^o$ and let $I$ be its incenter. Let line $BI$ intersect $AC$ at point $D$, and let line $CI$ intersect $AB$ at point $E$. If $ID = IE = 1$, find $BI$. [b]p16.[/b] For a positive integer $n$, let $S_n$ be the set of permutations of the first $n$ positive integers. If $p = (a_1, ..., a_n) \in S_n$, then define the bijective function $\sigma_p : \{1,..., n\} \to \{1, ..., n\}$ such that $\sigma_p (i) = a_i$ for all integers $1 \le i \le n$. For any two permutations $p, q \in S_n$, we say $p$ and $q$ are friends if there exists a third permutation $r \in S_n$ such that for all integers $1 \le i \le n$, $$\sigma_p(\sigma_r (i)) = \sigma_r(\sigma_q(i)).$$ Find the number of friends, including itself, that the permutation $(4, 5, 6, 7, 8, 9, 10, 2, 3, 1)$ has in $S_{10}$. PS. You had better use hide for answers.

There are direct routes from every city of a certain country to every other city. The prices are known in advance. Two tourists (they do not necessary start from one city) have decided to visit all the cities, using only direct travel lines. The first always chooses the cheapest ticket to the city, he has never been before (if there are several -- he chooses arbitrary destination among the cheapests). The second -- the most expensive (they do not return to the first city). Prove that the first will spend not more money for the tickets, than the second.

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 $M=\{1,2,...,n\}$. Prove that the number of pairs $(A,a)$, where $A\subset M$ and $a$ is a permutation of $M$, for which $a(A)\cap A=\emptyset $, is equal to $n!.F_{n+1}$, where $F_{n+1}$ is the $n+1$ member of the Fibonacci sequence.

Given is a binary string $0101010101$. On a move Ali changes 0 to 1 or 1 to 0. The following conditions are fulfilled: a) All the strings obtained are different. b) All the strings obtained must have at least 5 times 1. Prove that Ali can't obtain more than 555 strings.

In a given community of people, each person has at least two friends within the community. Whenever some people from this community sit on a round table such that each adjacent pair of people are friends, it happens that no non-adjacent pair of people are friends. Prove that there exist two people in this community such that each has exactly two friends and they have at least one common friend.

Determine the smallest integer $n \ge 2012$ for which it is possible to have $16$ consecutive integers on a $4 \times 4$ board so that, if we select $4$ elements of which there are not two in the same row or in the same column, the sum of them is always equal to $n$. For the $n$ found, show how to fill the board.

Graph $G$ has $n$ vertices and $mn$ edges, where $n>2m$, show that there exists a path with $m+1$ vertices. (A path is an open walk without repeating vertices )

There are $10$ cups, each having $10$ pebbles in them. Two players $A$ and $B$ play a game, repeating the following in order each move: $\bullet$ $B$ takes one pebble from each cup and redistributes them as $A$ wishes. $\bullet$ After $B$ distributes the pebbles, he tells how many pebbles are in each cup to $A$. Then $B$ destroys all the cups having no pebbles. $\bullet$ $B$ switches the places of two cups without telling $A$. After finitely many moves, $A$ can guarantee that $n$ cups are destroyed. Find the maximum possible value of $n$. (Note that $A$ doesn't see the cups while playing.) [i]Proposed by Emre Osman[/i]

On the plane $n+1$ points are marked, no three of which lie on one straight line. For what natural $k$ can they be connected by segments so that for any $n$ marked points there are exactly $k$ segments with ends at these points?

A farmer noticed that, during the last year, there were exactly as many calves born as during the two preceding years together. Even better, the number of pigs born during the last year was one larger than the number of pigs born during the two preceding years together. The farmer promised that if such a trend will continue then, after some years, at least twice as many pigs as calves will be born in his cattle, even though this far this target has not yet ever been reached. Will the farmer be able to keep his promise?

Consider a set of $2016$ distinct points in the plane, no four of which are collinear. Prove that there is a subset of $63$ points among them such that no three of these $63$ points are collinear.

There are eight rooks on a chessboard, no two attacking each other. Prove that some two of the pairwise distances between the rooks are equal. (The distance between two rooks is the distance between the centers of their cell.)

At an international event there are $100$ countries participating, each with its own flag. There are $10$ distinct flagpoles at the stadium, labelled 1,#2,...,#10 in a row. In how many ways can all the $100$ flags be hoisted on these $10$ flagpoles, such that for each $i$ from $1$ to $10$, the flagpole #i has at least $i$ flags? (Note that the vertical order of the flagpoles on each flag is important)

We call a matrix $\textsl{binary matrix}$ if all its entries equal to $0$ or $1$. A binary matrix is $\textsl{Good}$ if it simultaneously satisfies the following two conditions: (1) All the entries above the main diagonal (from left to right), not including the main diagonal, are equal. (2) All the entries below the main diagonal (from left to right), not including the main diagonal, are equal. Given positive integer $m$, prove that there exists a positive integer $M$, such that for any positive integer $n>M$ and a given $n \times n$ binary matrix $A_n$, we can select integers $1 \leq i_1 <i_2< \cdots < i_{n-m} \leq n$ and delete the $i_i$-th, $i_2$-th,$\cdots$, $i_{n-m}$-th rows and $i_i$-th, $i_2$-th,$\cdots$, $i_{n-m}$-th columns of $A_n$, then the resulting binary matrix $B_m$ is $\textsl{Good}$.

Denote every permutation of $1,2,\dots, n$ as $\sigma =(a_1,a_2,\dots,n)$. Prove that the sum $$\sum \frac{1}{(a_1)(a_1+a_2)(a_1+a_2+a_3)\dots(a_1+a_2+\dots+a_n)}$$ taken over all possible permutations $\sigma$ equals $\frac{1}{n!}$.

Let $m,n \ge 2$ be integers. The sides $A_{00}A_{0m}$ and $A_{nm}A_{n0}$ of a convex quadrilateral $A_{00}A_{0m}A_{nm}A_{n0}$ are divided into $m$ equal segments by points $A_{0j}$ and $A_{nj}$ respectively ($j = 1,...,m-1$). The other two sides are divided into $n$ equal segments by points $A_{i0}$ and $A_{im}$ ($i = 1,...,n -1$). Denote by $A_{ij}$ the intersection of lines $A_{0j}A{nj}$ and $A_{i0}A_{im}$, by $S_{ij}$ the area of quadrilateral $A_{ij}A_{i, j+1}A_{i+1, j+1}A_{i+1, j}$ and by $S$ the area of the big quadrilateral. Show that $S_{ij} +S_{n-1-i,m-1-j} = \frac{2S}{mn}$