The leader of an IMO team chooses positive integers $n$ and $k$ with $n > k$, and announces them to the deputy leader and a contestant. The leader then secretly tells the deputy leader an $n$-digit binary string, and the deputy leader writes down all $n$-digit binary strings which differ from the leader’s in exactly $k$ positions. (For example, if $n = 3$ and $k = 1$, and if the leader chooses $101$, the deputy leader would write down $001, 111$ and $100$.) The contestant is allowed to look at the strings written by the deputy leader and guess the leader’s string. What is the minimum number of guesses (in terms of $n$ and $k$) needed to guarantee the correct answer?

Prove that if a sphere can be inscribed in a convex polyhedron and each face of this polyhedron can be painted in one of two colors such that any two faces sharing a common edge are of different colors, then the sum of the areas of the faces of one color is equal to the sum of the areas of the faces of the other color.

How many positive integer solutions does the equation have $$\left\lfloor\frac{x}{10}\right\rfloor= \left\lfloor\frac{x}{11}\right\rfloor + 1?$$ ($\lfloor x \rfloor$ denotes the integer part of $x$, for example $\lfloor 2\rfloor = 2$, $\lfloor \pi\rfloor = 3$, $\lfloor \sqrt2 \rfloor =1$)

Find all pairs of positive integers $(n,t)$ such that $6^n+1=n^2t$, and $(n,29 \times 197)=1$

For a finite set $A$ of positive integers and its subset $B$, call $B$ a [i]half subset[/i] of $A$ when it satisfies the equation $\sum_{a\in A}a=2\sum_{b\in B}b$. For example, if $A=\{1,2,3\}$, then $\{1,2\}$ and $\{3\}$ are half subset of $A$. Determine all positive integers $n$ such that there exists a finite set $A$ which has exactly $n$ half subsets.

Given a non-negative integer \( n \), determine the values of \( c \) for which the sequence of numbers \[ a_n = 4^n c + \frac{4^n - (-1)^n}{5} \] contains at least one perfect square.

Find all functions $f,g : \mathbb{R} \times \mathbb{R} \mapsto \mathbb{R}^{+}$ such that \[ ( \sum_{j=1}^{n}a_{j}b_{j})^2 \leq (\sum_{j=1}^{n} f({a_{j},b_{j}))(\sum_{j=1}^{n} g({a_{j},b_{j})) \leq (\sum_{j=1}^{n} (a_j)^2 )(\sum_{j=1}^{n} (b_j)^2 ) }}\] for any two sets $a_j$ and $b_j$ of real numbers.

Determine all strictly increasing functions $f : R \to R$ such that for all $x \ne y$ to hold $$\frac{2\left[f(y)-f\left(\frac{x+y}{2}\right) \right]}{f(x)-f(y)}=\frac{f(x)-f(y)}{2\left[f\left(\frac{x+y}{2}\right)-f(x) \right]}$$

Hey, This problem is from the VTRMC 2006. 3. Recall that the Fibonacci numbers $ F(n)$ are defined by $ F(0) \equal{} 0$, $ F(1) \equal{} 1$ and $ F(n) \equal{} F(n \minus{} 1) \plus{} F(n \minus{} 2)$ for $ n \geq 2$. Determine the last digit of $ F(2006)$ (e.g. the last digit of 2006 is 6). As, I and a friend were working on this we noticed an interesting relationship when writing the Fibonacci numbers in "mod" notation. Consider the following, 01 = 1 mod 10 01 = 1 mod 10 02 = 2 mod 10 03 = 3 mod 10 05 = 5 mod 10 08 = 6 mod 10 13 = 3 mod 10 21 = 1 mod 10 34 = 4 mod 10 55 = 5 mod 10 89 = 9 mod 10 Now, consider that between the first appearance and second apperance of $ 5 mod 10$, there is a difference of five terms. Following from this we see that the third appearance of $ 5 mod 10$ occurs at a difference 10 terms from the second appearance. Following this pattern we can create the following relationships. $ F(55) \equal{} F(05) \plus{} 5({2}^{2})$ This is pretty much as far as we got, any ideas?

Given is an integer $n \geq 1$ and an $n \times n$ board, whose all cells are initially white. Peter the painter walks around the board and recolors the visited cells according to the following rules. Each walk of Peter starts at the bottom-left corner of the board and continues as follows: - if he is standing on a white cell, he paints it black and moves one cell up (or walks off the board if he is in the top row); - if he is standing on a black cell, he paints it white and moves one cell to the right (or walks off the board if he is in the rightmost column). Peter’s walk ends once he walks off the board. Determine the minimum positive integer $s$ with the following property: after exactly $s$ walks all the cells of the board will become white again.

For which integers $n>1$ does there exist a rectangle that can be subdivided into $n$ pairwise noncongruent rectangles similar to the original rectangle?

The five tires of a car (four road tires and a full-sized spare) were rotated so that each tire was used the same number of miles during the first $30,000$ miles the car traveled. For how many miles was each tire used? $\text{(A) }6000\qquad\text{(B) }7500\qquad\text{(C) }24,000\qquad\text{(D) }30,000\qquad\text{(E) }37,500$

Let $a$, $b$, $c$ be the lengths of the sides of a triangle. Prove that \[ \sqrt{a+b-c} + \sqrt{b+c-a} + \sqrt{c+a-b} \leq \sqrt{a} + \sqrt{b} + \sqrt{c} \] and determine when equality occurs.

Some natural numbers are marked. It is known that on every a segment of the number line of length $1999$ has a marked number. Prove that there is a pair of marked numbers, one of which is divisible by the other.

In a $k$-player tournament for $k > 1$, every player plays every other player exactly once. Find with proof the smallest value of $k$ such that it is possible that for any two players, there was a third player who beat both of them.

Let $ABC$ be a triangle , $AD$ an altitude and $AE$ a median . Assume $B,D,E,C$ lie in that order on the line $BC$ . Suppose the incentre of triangle $ABE$ lies on $AD$ and he incentre of triangle $ADC$ lies on $AE$ . Find ,with proof ,the angles of triangle $ABC$ .

Find $\int_0^x \frac{dt}{1+t^2}+\int_0^{\frac{1}{x}} \frac{dt}{1+t^2}\ (x>0).$

Which of the following cannot be equal to $x^2+y^2$, if $x^2 + xy + y^2 = 1$ where $x,y$ are real numbers? $ \textbf{a)}\ \dfrac{1}{\sqrt 2} \qquad\textbf{b)}\ \dfrac 12 \qquad\textbf{c)}\ \sqrt 2 \qquad\textbf{d)}\ 3-\sqrt 3 \qquad\textbf{e)}\ \text{None of above} $

The Tournament of Towns is held once per year. This time the year of its autumn round is divisible by the number of the tournament: $2021\div 43 = 47$. How many times more will the humanity witness such a wonderful event? [i]Alexey Zaslavsky[/i]

A rectangle has an area of $16$ and a perimeter of $18$; determine the length of the diagonal of the rectangle. [i]2015 CCA Math Bonanza Individual Round #8[/i]

The sequence $a_0, a_1, a_2, ..$ is defined by $a_0 = a, a_{n+1} = a_n + L(a_n)$, where $L(m)$ is the last digit of $m$ (eg $L(14) = 4$). Suppose that the sequence is strictly increasing. Show that infinitely many terms must be divisible by $d = 3$. For what other d is this true?

Let $x, y, z$ be nonzero real numbers with $$\frac{x + y}{z}=\frac{y + z}{x}=\frac{z + x}{y}.$$ Determine all possible values of $$\frac{(x + y)(y + z)(z + x)}{xyz}.$$ [i](Walther Janous)[/i]

A regular tetrahedron with unit edge length is given. Prove that: (a) There exist four points on the surface $S$ of the tetrahedron, such that the distance from any point of the surface to one of these four points does not exceed $1/2$; (b) There do not exist three points with this property. The distance between two points on surface $S$ is defined as the length of the shortest polygonal line going over $S$ and connecting the two points.

Let $\Gamma = \{\varepsilon,0,00,\ldots\}$ be the set of all finite strings consisting of only zeroes. We consider $\textit{six-state unary DFAs}$ $D = (F,q_0,\delta)$ where $F$ is a subset of $Q = \{1,2,3,4,5,6\}$, not necessarily strict and possibly empty; $q_0\in Q$ is some $\textit{start state}$; and $\delta: Q\rightarrow Q$ is the $\textit{transition function}$. For each such DFA $D$, we associate a set $F_D\subseteq\Gamma$ as the set of all strings $w\in\Gamma$ such that \[\underbrace{\delta(\cdots(\delta(q_0))\cdots)}_{|w|\text{ applications}}\in F,\] We say a set $\mathcal D$ of DFAs is $\textit{diverse}$ if for all $D_1,D_2\in\mathcal D$ we have $F_{D_1}\neq F_{D_2}$. What is the maximum size of a diverse set?

How many diagonals does a regular undecagon ($11$-sided polygon) have?