Let $f(n)$ be the number of points of intersection of diagonals of a $n$-dimensional hypercube that is not the vertex of the cube. For example, $f(3) = 7$ because the intersection points of a cube’s diagonals are at the centers of each face and the center of the cube. Find $f(5)$.

Given quadrilateral $ABCD$ such that $\angle BAD+2 \angle BCD=180 ^ \circ .$ Let $E$ be the intersection of $BD$ and the internal bisector of $\angle BAD$. The perpendicular bisector of $AE$ intersects $CB,CD$ at $X,Y,$ respectively. Prove that $A,C,X,Y$ are concyclic.

The first of an infinite triangular spreadsheet the line contains one number, the second line contains two numbers, the third line contains three numbers, and so on. In doing so is in any $k$-th row ($k = 1, 2, 3,...$) in the first and last place the number $k$, each other the number in the table is found, however, than in the previous row the least common of the two numbers above it multiple (the adjacent figure shows the first five rows of this table). We choose any two numbers from the table that are not in their row in the first or last place. Prove that one of the selected numbers is divisible by another. [img]https://cdn.artofproblemsolving.com/attachments/3/7/107d8999d9f04777719a0f1b1df418dbe00023.png[/img]

Let $ABCDEF$ be a convex hexagon inscribed in a circle . Prove that the diagonals $AD, BE$ and $CF$ intersect at one point if and only if $$\frac{AB}{BC} \cdot \frac{CD}{DE}\cdot \frac{EF}{FA}=1$$

A graph is called a [i]self-intersecting [/i]graph if it is isomorphic to a graph whose every edge is a segment and every two edges intersect. Notice that no edge contains a vertex except its two endings. a) Find all $ n$'s for which the cycle of length $ n$ is self-intersecting. b) Prove that in a self-intersecting graph $ |E(G)|\leq|V(G)|$. c) Find all self-intersecting graphs. [img]http://i35.tinypic.com/x43s5u.png[/img]

Alice and Bob now play a magic show. There are $101 $ different hats lie on the table and they form a circle. Firstly, Bob choose a positive integer $n$(Alice doesn’t know it). Then Bob puts a rabbit under one of the hats and Alice doesn’t know which hat contains the rabbit. Each time, she can choose a hat and see whether the rabbit is under the hat. If not, then Bob will move the rabbit from the current hat to the $n$th hat in a clockwise direction. They will repeat these steps until Alice find the rabbit. Prove that Alice can find the rabbit in $201$ steps.

Find all functions $f : R \to R$ such that $f( 2x^3 + f (y)) = y + 2x^2 f (x)$ for all real numbers $x, y$.

Aisling and Brendan take alternate moves in the following game. Before the game starts, the number $x = 2023$ is written on a piece of paper. Aisling makes the first move. A move from a positive integer $x$ consists of replacing $x$ either with $x + 1$ or with $x/p$ where $p$ is a prime factor of $x$. The winner is the first player to write $x = 1$. Determine whether Aisling or Brendan has a winning strategy for this game.

There are two urns each containing an arbitrary number of balls. We are allowed two types of operations: (a) remove an equal number of balls simultaneously from both the urns, (b) double the number of balls in any of them Show that after performing these operations finitely many times, both the urns can be made empty.

Travis Scott says "FEIN'' every $0.8$ seconds. Find the tens digit of the number of times he says "FEIN'' in $1$ minute.

The triangle $ABC$ is inscribed in the circle. Construct a point $P$ such that the points of intersection of lines $AP, BP$ and $CP$ with this circle are the vertices of an equilateral triangle. (A. Zaslavsky)

[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.

Let $A,B,C$ be non-collinear points. For each point $D$ of the ray $AC$, we denote by $E$ and $F$ the points of tangency of the incircle of $\triangle ABD$ with $AB$ and $AD$, respectively. Prove that, as point $D$ moves along the ray $AC$, the line $EF$ passes through a fixed point.

Matilda drew $12$ quadrilaterals. The first quadrilateral is an rectangle of integer sides and $7$ times more width than long. Every time she drew a quadrilateral she joined the midpoints of each pair of consecutive sides with a segment. It´s is known that the last quadrilateral Matilda drew was the first with area less than $1$. What is the maximum area possible for the first quadrilateral? [asy]size(200); pair A, B, C, D, M, N, P, Q; real base = 7; real altura = 1; A = (0, 0); B = (base, 0); C = (base, altura); D = (0, altura); M = (0.5*base, 0*altura); N = (0.5*base, 1*altura); P = (base, 0.5*altura); Q = (0, 0.5*altura); draw(A--B--C--D--cycle); // Rectángulo draw(M--P--N--Q--cycle); // Paralelogramo dot(M); dot(N); dot(P); dot(Q); [/asy] $\textbf{Note:}$ The above figure illustrates the first two quadrilaterals that Matilda drew.

A $9 \times 9$ square consists of $81$ unit squares. Some of these unit squares are painted black, and the others are painted white, such that each $2 \times 3$ rectangle and each $3 \times 2$ rectangle contain exactly 2 black unit squares and 4 white unit squares. Determine the number of black unit squares.

Somebody wrote $1953$ digits on a circle. The $1953$-digit number obtained by reading these figures clockwise, beginning at a certain point, is divisible by $27$. Prove that if one begins reading the figures at any other place, one gets another $1953$-digit number also divisible by $27$.