Find the five-hundredth-smallest positive integer that can be written using only the digits $1$, $3,$ and $5$ in base $7$? [i]Proposed by CaptainFlint[/i]

Bricklayer Brenda would take $ 9$ hours to build a chimney alone, and bricklayer Brandon would take $ 10$ hours to build it alone. When they work together they talk a lot, and their combined output is decreased by $ 10$ bricks per hour. Working together, they build the chimney in $ 5$ hours. How many bricks are in the chimney? $ \textbf{(A)}\ 500 \qquad \textbf{(B)}\ 900 \qquad \textbf{(C)}\ 950 \qquad \textbf{(D)}\ 1000 \qquad \textbf{(E)}\ 1900$

Let $n$ be a given positive integer. Find the smallest positive integer $k$ for which the following statement is true: for any given simple connected graph $G$ and minimal cuts $V_1, V_2,\ldots, V_n$, at most $k$ vertices can be chosen with the property that picking any two of the chosen vertices there exists an integer $1\le i\le n$ such that $V_i$ separates the two vertices. A partition of the vertices of $G$ into two disjoint non-empty sets is called a [i]minimal cut[/i] if the number of edges crossing the partition is minimal. [i]Proposed by András Imolay, Budapest[/i]

A $1\times 2$ rectangle is inscribed in a semicircle with longer side on the diameter. What is the area of the semicircle? $\textbf{(A)}\ \frac\pi2 \qquad \textbf{(B)}\ \frac{2\pi}3 \qquad \textbf{(C)}\ \pi \qquad \textbf{(D)}\ \frac{4\pi}3 \qquad \textbf{(E)}\ \frac{5\pi}3$

Let be a natural number $ n, $ a complex number $ a, $ and two matrices $ \left( a_{pq}\right)_{1\le q\le n}^{1\le p\le n} ,\left( b_{pq}\right)_{1\le q\le n}^{1\le p\le n}\in\mathcal{M}_n(\mathbb{C} ) $ such that $$ b_{pq} =a^{p-q}\cdot a_{pq},\quad\forall p,q\in\{ 1,2,\ldots ,n\} . $$ Calculate the determinant of $ B $ (in function of $ a $ and the determinant of $ A $ ).

Write down some numbers $a_1,a_2,\ldots, a_n$ from left to right on a line. Step 1, we write $a_1+a_2$ between $a_1,a_2$; $a_2+a_3$ between $a_2,a_3$, …, $a_{n-1}+a_n$ between $a_{n-1},a_n$, and then we have new sequence $b=(a_1, a_1+a_2,a_2,a_2+a_3,a_3, \ldots, a_{n-1}, a_{n-1}+a_n, a_n)$. Step 2, we do the same thing with sequence b to have the new sequence c again…. And so on. If we do 2013 steps, count the number of the number 2013 appear on the line if a) $n=2$, $a_1=1, a_2=1000$ b) $n=1000$, $a_i=i, i=1,2\ldots, 1000$ Sorry for my bad English [color=#008000]Moderator says: alternate phrasing here: https://www.artofproblemsolving.com/Forum/viewtopic.php?f=42&t=516134[/color]

A rectangular piece of paper $ABCD$ has sides of lengths $AB = 1$, $BC = 2$. The rectangle is folded in half such that $AD$ coincides with $BC$ and $EF$ is the folding line. Then fold the paper along a line $BM$ such that the corner $A$ falls on line $EF$. How large, in degrees, is $\angle ABM$? [asy] size(180); pathpen = rgb(0,0,0.6)+linewidth(1); pointpen = black+linewidth(3); pointfontpen = fontsize(10); pen dd = rgb(0,0,0.6) + linewidth(0.7) + linetype("4 4"), dr = rgb(0.8,0,0), dg = rgb(0,0.6,0), db = rgb(0,0,0.6)+linewidth(1); pair A=(0,1), B=(0,0), C=(2,0), D=(2,1), E=A/2, F=(2,.5), M=(1/3^.5,1), N=reflect(B,M)*A; D(B--M--D("N",N,NE)--B--D("C",C,SE)--D("D",D,NE)--M); D(D("M",M,plain.N)--D("A",A,NW)--D("B",B,SW),dd); D(D("E",E,W)--D("F",F,plain.E),dd); [/asy]

A circle passing through the vertices $B$ and $D$ of quadrilateral $ABCD$ meets $AB$, $BC$, $CD$, and $DA$ at points $K$, $L$, $M$, and $N$ respectively. A circle passing through $K$ and $M$ meets $AC$ at $P$ and $Q$. Prove that $L$, $N$, $P$, and $Q$ are concyclic.

There is a frog jumping on a $ 2k \times 2k$ chessboard, composed of unit squares. The frog's jumps are $ \sqrt{1 \plus{} k^2}$ long and they carry the frog from the center of a square to the center of another square. Some $ m$ squares of the board are marked with an $ \times$, and all the squares into which the frog can jump from an $ \times$'d square (whether they carry an $ \times$ or not) are marked with an $ \circ$. There are $ n$ $ \circ$'d squares. Prove that $ n \ge m$.

Price of the book increased by $20\%$, and then decreased by $10\%$. How many percents should we decrease current price so we get a price which is $54\%$ percent of an original one?

Find all complex roots (with multiplicities) of the polynomial $$p(x)=\sum_{n=1}^{2008}(1004-|1004-n|)x^n.$$

The circle k intersects the sides $BC$, $CA$, $AB$ of triangle $ABC$ in points $A_1$, $A_2$, $B_1$, $B_2$, $C_1$, $C_2$. The perpendiculars to $BC$, $CA$, $AB$ through $A_1$, $B_1$, $C_1$, respectively, meet at a point $M$. Prove that the three perpendiculars to $BC$, $CA$, $AB$ through $A_2$, $B_2$, and $C_2$, respectively, also meet in one point.

The Bank of Pittsburgh issues coins that have a heads side and a tails side. Vera has a row of 2023 such coins alternately tails-up and heads-up, with the leftmost coin tails-up. In a [i]move[/i], Vera may flip over one of the coins in the row, subject to the following rules: [list=disc] [*] On the first move, Vera may flip over any of the $2023$ coins. [*] On all subsequent moves, Vera may only flip over a coin adjacent to the coin she flipped on the previous move. (We do not consider a coin to be adjacent to itself.) [/list] Determine the smallest possible number of moves Vera can make to reach a state in which every coin is heads-up. [i]Luke Robitaille[/i]

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.

Prove for real $x_1$, $x_2$, ....., $x_n$, $0 < x_k \leq {1\over 2}$, the inequality \[ \left( {n \over x_1 + \dots + x_n} - 1 \right)^n \leq \left( {1 \over x_1} - 1 \right) \dots \left( {1 \over x_n} - 1 \right). \]

Let $ABC$ be a triangle, let $O$ be its circumcenter, let $A'$ be the orthogonal projection of $A$ on the line $BC$, and let $X$ be a point on the open ray $AA'$ emanating from $A$. The internal bisectrix of the angle $BAC$ meets the circumcircle of $ABC$ again at $D$. Let $M$ be the midpoint of the segment $DX$. The line through $O$ and parallel to the line $AD$ meets the line $DX$ at $N$. Prove that the angles $BAM$ and $CAN$ are equal.

Given parallelogram $OABC$ in the coodinate with $O$ the origin and $A,B,C$ be lattice points. Prove that for all lattice point $P$ in the internal or boundary of $\triangle ABC$, there exists lattice points $Q,R$(can be the same) in the internal or boundary of $\triangle OAC$ with $\overrightarrow{OP}=\overrightarrow{OQ}+\overrightarrow{OR}$.

Prove that for every tetrahedron there exist two planes such that the projection areas on those planes ratio is not less than $\sqrt 2$.

Let $D$ be the footpoint of the altitude from $B$ in the triangle $ABC$ , where $AB=1$ . The incircle of triangle $BCD$ coincides with the centroid of triangle $ABC$. Find the lengths of $AC$ and $BC$.

Find all real parameters $q$ for which there is a $p\in[0,1]$ such that the equation $$x^4+2px^3+(2p^2-p)x^2+(p-1)p^2x+q=0$$has four real roots.

Let $\mathbb R_{>0}$ be the set of positive real numbers. Determine all functions $f \colon \mathbb R_{>0} \to \mathbb R_{>0}$ such that \[x \big(f(x) + f(y)\big) \geqslant \big(f(f(x)) + y\big) f(y)\] for every $x, y \in \mathbb R_{>0}$.

Let $p \geqslant 5$ be a prime and $S = \left\{ 1, 2, \ldots, p \right\}$. Define $r(x,y)$ as follows: \[ r(x,y) = \begin{cases} y - x & y \geqslant x \\ y - x + p & y < x \end{cases}.\] For a nonempty proper subset $A$ of $S$, let $$f(A) = \sum_{x \in A} \sum_{y \in A} \left( r(x,y) \right)^2.$$A [i]good[/i] subset of $S$ is a nonempty proper subset $A$ satisfying that for all subsets $B \subseteq S$ of the same size as $A$, $f(B) \geqslant f(A)$. Find the largest integer $L$ such that there exists distinct good subsets $A_1 \subseteq A_2 \subseteq \ldots \subseteq A_L$. [i]Proposed by Bin Wang[/i]

Let $\triangle ABC$ be a triangle. On side $AB$ take points $K$ and $L$ such that $AK \;=\; LB \;<\;\tfrac12\,AB,$ on side $BC$ take points $M$ and $N$ such that $BM \;=\; NC \;<\;\tfrac12\,BC,$ and on side $CA$ take points $P$ and $Q$ such that $CP \;=\; QA \;<\;\tfrac12\,CA.$ Let $R \;=\; KN\;\cap\;MQ, \quad T \;=\; KN \cap LP, $ and $ D \;=\; NP \cap LM, \quad E \;=\; NP \cap KQ.$ Prove that the lines $DR, BE, CT$ are concurrent.

Several points and planes are given in the space. It is known that for any two of given points there exactly two planes containing them, and each given plane contains at least four of given points. Is it true that all given points are collinear?

Let $n$ be a given positive integer. Prove that there is no positive divisor $d$ of $2n^2$ such that $d^2n^2+d^3$ is a square of an integer.