Compute the number of $10$-bit sequences of $0$’s and $1$’s do not contain $001$ as a subsequence.

We call a number $10^3 < n < 10^6$ a [i]balanced [/i]number if the sum of its last three digits is equal to the sum of its other digits. What is the sum of all balanced numbers in $\bmod {13}$? $ \textbf{(A)}\ 0 \qquad\textbf{(B)}\ 5 \qquad\textbf{(C)}\ 7 \qquad\textbf{(D)}\ 11 \qquad\textbf{(E)}\ 12 $

A $3\times3$ square is partitioned into $9$ unit squares. Each unit square is painted either white or black with each color being equally likely, chosen independently and at random. The square is the rotated $90^\circ$ clockwise about its center, and every white square in a position formerly occupied by a black square is painted black. The colors of all other squares are left unchanged. What is the probability that the grid is now entirely black? $ \textbf{(A)}\ \dfrac{49}{512} \qquad\textbf{(B)}\ \dfrac{7}{64} \qquad\textbf{(C)}\ \dfrac{121}{1024} \qquad\textbf{(D)}\ \dfrac{81}{512} \qquad\textbf{(E)}\ \dfrac{9}{32} $

For some positive integer $n$, $(1 + i) + (1 + i)^2 + (1 + i)^3 + ... + (1 + i)^n = (n^2 - 1)(1 - i)$, where $i = \sqrt{-1}$. Compute the value of $n$.

$In$ $triangle$ $ABC$ $bisectors$ $AA_1$, $BB_1$ $and$ $CC_1$ $are$ $drawn$. $Bisectors$ $AA_1$ $and$ $CC_1$ $intersect$ $segments$ $C_1B_1$ $and$ $B_1A_1$ $at$ $points$ $M$ $and$ $N$, $respectively$. $Prove$ $that$ $\angle$$MBB_1$ = $\angle$$NBB_1$.

Points $M$, $N$, $K$ lie on the sides $BC$, $CA$, $AB$ of a triangle $ABC$, respectively, and are different from its vertices. The triangle $MNK$ is called[i] beautiful[/i] if $\angle BAC=\angle KMN$ and $\angle ABC=\angle KNM$. If in the triangle $ABC$ there are two beautiful triangles with a common vertex, prove that the triangle $ABC$ is right-angled. [i]Proposed by Nairi M. Sedrakyan, Armenia[/i]

Let $ABCD$ be a rhombus with $\angle BAD < 90^o$. The circle passing through $D$ with center $A$ intersects the line $CD$ a second time in point $E$. Let $S$ be the intersection of the lines $BE$ and $AC$. Prove that the points $A$, $S$, $D$ and $E$ lie on a circle. [i](Karl Czakler)[/i]

Given $a\in (0,1)$ and $C$ the set of increasing functions $f:[0,1]\to [0,\infty )$ such that $\int\limits_{0}^{1}{f(x)}dx=1$ . Determine: $(a)\underset{f\in C}{\mathop{\max }}\,\int\limits_{0}^{a}{f(x)dx}$ $(b)\underset{f\in C}{\mathop{\max }}\,\int\limits_{0}^{a}{{{f}^{2}}(x)dx}$

The sum of all numbers of the form $ 2k \plus{} 1$, where $ k$ takes on integral values from $ 1$ to $ n$ is: $ \textbf{(A)}\ n^2 \qquad\textbf{(B)}\ n(n \plus{} 1) \qquad\textbf{(C)}\ n(n \plus{} 2) \qquad\textbf{(D)}\ (n \plus{} 1)^2 \qquad\textbf{(E)}\ (n \plus{} 1)(n \plus{} 2)$

Juhan wants to order by weight five balls of pairwise different weight, using only a balance scale. First, he labels the balls with numbers 1 to 5 and creates a list of weighings, such that each element in the list is a pair of two balls. Then, for every pair in the list, he weighs the two balls against each other. Can Juhan sort the balls by weight, using a list with less than 10 pairs?

Given convex $ n$-gon $ A_1\ldots A_n$. Let $ P_i$ ($ i \equal{} 1,\ldots , n$) be such points on its boundary that $ A_iP_i$ bisects the area of polygon. All points $ P_i$ don't coincide with any vertex and lie on $ k$ sides of $ n$-gon. What is the maximal and the minimal value of $ k$ for each given $ n$?

The areas of rectangles $P$ and $Q$ are equal, but the diagonal of $P$ is greater. Rectangle $Q$ can be covered by two copies of $P$. Prove that $P$ can be covered by two copies of $Q$.

The value of $ \frac{3}{a\plus{}b}$ when $ a\equal{}4$ and $ b\equal{}\minus{}4$ is: $ \textbf{(A)}\ 3 \qquad \textbf{(B)}\ \frac{3}{8} \qquad \textbf{(C)}\ 0 \qquad \textbf{(D)}\ \text{any finite number} \qquad \textbf{(E)}\ \text{meaningless}$

Let the set consisting of the squares of the positive integers be called $u$; thus $u$ is the set $1, 4, 9, 16 . . .$. If a certain operation on one or more members of the set always yields a member of the set, we say that the set is closed under that operation. Then $u$ is closed under: ${{ \textbf{(A)}\ \text{Addition}\qquad\textbf{(B)}\ \text{Multiplication} \qquad\textbf{(C)}\ \text{Division} \qquad\textbf{(D)}\ \text{Extraction of a positive integral root} }\qquad\textbf{(E)} \text{None of these} } $

A list of natural numbers is written on a blackboard. The following operation is performed and repeated: choose any two numbers $a, b$, wipe them out and instead write gcd$(a, b)$ and lcm$(a, b)$. Show that the content of the list no longer changed after a certain point in time.

Solve in the real numbers the equation $ \arctan\sqrt{3^{1-2x}} +\arctan {3^x} =\frac{7\pi }{12} . $ [i]Ovidiu Țâțan[/i]

Let $\triangle ABC$ be an acute triangle, and let $D$ be the projection of $A$ on $BC$. Let $M,N$ be the midpoints of $AB$ and $AC$ respectively. Let $\Gamma_1$ and $\Gamma_2$ be the circumcircles of $\triangle BDM$ and $\triangle CDN$ respectively, and let $K$ be the other intersection point of $\Gamma_1$ and $\Gamma_2$. Let $P$ be an arbitrary point on $BC$ and $E,F$ are on $AC$ and $AB$ respectively such that $PEAF$ is a parallelogram. Prove that if $MN$ is a common tangent line of $\Gamma_1$ and $\Gamma_2$, then $K,E,A,F$ are concyclic.

Let $a_1, a_2, a_3, b_1, b_2, b_3$ be positive real numbers. Prove that \[(a_1b_2 + a_2b_1 + a_1b_3 + a_3b_1 + a_2b_3 + a_3b_2)^2 \geq 4(a_1a_2 + a_2a_3 + a_3a_1)(b_1b_2 + b_2b_3 + b_3b_1)\] and show that the two sides of the inequality are equal if and only if $\frac{a_1}{b_1} = \frac{a_2}{b_2} = \frac{a_3}{b_3}.$

There are infinitely many boxes - initially one of them contains $n$ balls and all others are empty. On a single move we take some balls from a non-empty box and put them into an empty box and on a sheet of paper we write down the product of the resulting amount of balls in the two boxes. After some moves, the sum of all numbers on the sheet of paper became $2023$. What is the smallest possible value of $n$?

How many ordered positive integer triples $(x,y,z)$ are there such that \[ \begin{array}{rcl} 3x^2-2y^2-4z^2+54 = 0 \\ 5x^2-3y^2-7z^2+74 = 0 \end{array} \] $ \textbf{(A)}\ 0 \qquad\textbf{(B)}\ 2 \qquad\textbf{(C)}\ 3 \qquad\textbf{(D)}\ \text{Infinitely Many} \qquad\textbf{(E)}\ \text{None of the options} $

In a convex quadrilateral $ABCD$ we have $AB\cdot CD=BC\cdot DA$ and $2\angle A+\angle C=180^\circ$. Point $P$ lies on the circumcircle of triangle $ABD$ and is the midpoint of the arc $BD$ not containing $A$. It is known that the point $P$ lies inside the quadrilateral $ABCD$. Prove that $\angle BCA=\angle DCP$ [i]Proposed by S. Berlov[/i]

Let $T_1$ be a triangle with sides $2011, 2012,$ and $2013$. For $n \ge 1$, if $T_n=\triangle ABC$ and $D,E,$ and $F$ are the points of tangency of the incircle of $\triangle ABC$ to the sides $AB,BC$ and $AC$, respectively, then $T_{n+1}$ is a triangle with side lengths $AD,BE,$ and $CF$, if it exists. What is the perimeter of the last triangle in the sequence $(T_n)$? $ \textbf{(A)}\ \frac{1509}{8} \qquad \textbf{(B)}\ \frac{1509}{32} \qquad \textbf{(C)}\ \frac{1509}{64} \qquad \textbf{(D)}\ \frac{1509}{128} \qquad \textbf{(E)}\ \frac{1509}{256} $

Find all real $a,b,c,d,e,f$ that satisfy the system $4a = (b + c + d + e)^4$ $4b = (c + d + e + f)^4$ $4c = (d + e + f + a)^4$ $4d = (e + f + a + b)^4$ $4e = (f + a + b + c)^4$ $4f = (a + b + c + d)^4$

It is given a convex quadrilateral $ ABCD$ in which $ \angle B\plus{}\angle C < 180^0$. Lines $ AB$ and $ CD$ intersect in point E. Prove that $ CD*CE\equal{}AC^2\plus{}AB*AE \leftrightarrow \angle B\equal{} \angle D$

A sequence of $2n + 1$ non-negative integers $a_1, a_2, ..., a_{2n + 1}$ is given. There's also a sequence of $2n + 1$ consecutive cells enumerated from $1$ to $2n + 1$ from left to right, such that initially the number $a_i$ is written on the $i$-th cell, for $i = 1, 2, ..., 2n + 1$. Starting from this initial position, we repeat the following sequence of steps, as long as it's possible: [i]Step 1[/i]: Add up the numbers written on all the cells, denote the sum as $s$. [i]Step 2[/i]: If $s$ is equal to $0$ or if it is larger than the current number of cells, the process terminates. Otherwise, remove the $s$-th cell, and shift shift all cells that are to the right of it one position to the left. Then go to Step 1. Example: $(1, 0, 1, \underline{2}, 0) \rightarrow (1, \underline{0}, 1, 0) \rightarrow (1, \underline{1}, 0) \rightarrow (\underline{1}, 0) \rightarrow (0)$. A sequence $a_1, a_2,. . . , a_{2n+1}$ of non-negative integers is called balanced, if at the end of this process there’s exactly one cell left, and it’s the cell that was initially enumerated by $(n + 1)$, i.e. the cell that was initially in the middle. Find the total number of balanced sequences as a function of $n$. [i]Proposed by Viktor Simjanoski, North Macedonia[/i]