We define a sequence $a_n$ so that $a_0=1$ and \[a_{n+1} = \begin{cases} \displaystyle \frac{a_n}2 & \textrm { if } a_n \equiv 0 \pmod 2, \\ a_n + d & \textrm{ otherwise. } \end{cases} \] for all postive integers $n$. Find all positive integers $d$ such that there is some positive integer $i$ for which $a_i=1$.

[size=130][b]Higher Secondary: 2011[/b] [/size] Time: 4 Hours [b]Problem 1:[/b] Prove that for any non-negative integer $n$ the numbers $1, 2, 3, ..., 4n$ can be divided in tow mutually exclusive classes with equal number of members so that the sum of numbers of each class is equal. http://matholympiad.org.bd/forum/viewtopic.php?f=13&t=709 [b]Problem 2:[/b] In the first round of a chess tournament, each player plays against every other player exactly once. A player gets $3, 1$ or $-1$ points respectively for winning, drawing or losing a match. After the end of the first round, it is found that the sum of the scores of all the players is $90$. How many players were there in the tournament? http://matholympiad.org.bd/forum/viewtopic.php?f=13&t=708 [b]Problem 3:[/b] $E$ is the midpoint of side $BC$ of rectangle $ABCD$. $A$ point $X$ is chosen on $BE$. $DX$ meets extended $AB$ at $P$. Find the position of $X$ so that the sum of the areas of $\triangle BPX$ and $\triangle DXC$ is maximum with proof. http://matholympiad.org.bd/forum/viewtopic.php?f=13&t=683 [b]Problem 4:[/b] Which one is larger 2011! or, $(1006)^{2011}$? Justify your answer. http://matholympiad.org.bd/forum/viewtopic.php?f=13&t=707 [b]Problem 5:[/b] In a scalene triangle $ABC$ with $\angle A = 90^{\circ}$, the tangent line at $A$ to its circumcircle meets line $BC$ at $M$ and the incircle touches $AC$ at $S$ and $AB$ at $R$. The lines $RS$ and $BC$ intersect at $N$ while the lines $AM$ and $SR$ intersect at $U$. Prove that the triangle $UMN$ is isosceles. http://matholympiad.org.bd/forum/viewtopic.php?f=13&t=706 [b]Problem 6:[/b] $p$ is a prime and sum of the numbers from $1$ to $p$ is divisible by all primes less or equal to $p$. Find the value of $p$ with proof. http://matholympiad.org.bd/forum/viewtopic.php?f=13&t=693 [b]Problem 7:[/b] Consider a group of $n > 1$ people. Any two people of this group are related by mutual friendship or mutual enmity. Any friend of a friend and any enemy of an enemy is a friend. If $A$ and $B$ are friends/enemies then we count it as $1$ [b]friendship/enmity[/b]. It is observed that the number of friendships and number of enmities are equal in the group. Find all possible values of $n$. http://matholympiad.org.bd/forum/viewtopic.php?f=13&t=694 [b]Problem 8:[/b] $ABC$ is a right angled triangle with $\angle A = 90^{\circ}$ and $D$ be the midpoint of $BC$. A point $F$ is chosen on $AB$. $CA$ and $DF$ meet at $G$ and $GB \parallel AD$. $CF$ and $AD$ meet at $O$ and $AF = FO$. $GO$ meets $BC$ at $R$. Find the sides of $ABC$ if the area of $GDR$ is $\dfrac{2}{\sqrt{15}}$ http://matholympiad.org.bd/forum/viewtopic.php?f=13&t=704 [b]Problem 9:[/b] The repeat of a natural number is obtained by writing it twice in a row (for example, the repeat of $123$ is $123123$). Find a positive integer (if any) whose repeat is a perfect square. http://matholympiad.org.bd/forum/viewtopic.php?f=13&t=703 [b]Problem 10:[/b] Consider a square grid with $n$ rows and $n$ columns, where $n$ is odd (similar to a chessboard). Among the $n^2$ squares of the grid, $p$ are black and the others are white. The number of black squares is maximized while their arrangement is such that horizontally, vertically or diagonally neighboring black squares are separated by at least one white square between them. Show that there are infinitely many triplets of integers $(p, q, n)$ so that the number of white squares is $q^2$. http://matholympiad.org.bd/forum/viewtopic.php?f=13&t=702 The problems of the Junior categories are available in [url=http://matholympiad.org.bd/forum/]BdMO Online forum[/url]: http://matholympiad.org.bd/forum/viewtopic.php?f=25&t=678

At a certain grocery store, cookies may be bought in boxes of $10$ or $21.$ What is the minimum positive number of cookies that must be bought so that the cookies may be split evenly among $13$ people? [i]Author: Ray Li[/i]

Find all positive integers $k$ such that for the first $k$ prime numbers $2, 3, \ldots, p_k$ there exist positive integers $a$ and $n>1$, such that $2\cdot 3\cdot\ldots\cdot p_k - 1=a^n$. [i]V. Senderov[/i]

Find all primes $p$ such that $p+2$ and $p^2+2p-8$ are also primes.

Let $p$ be a prime number and let $a_1,a_2,\dots,a_k$ be distinct integers chosen from $1,2,\dots,p-1$. For $1\le i \le k$, let $f_i^{(n)}$ denote the remainder of the integer $na_1$ upon division by $p$, so $0\le f_i^{(n)}<p$. Define $S=\{n:1\le n \le p-1,f_1^{(n)}<\dots<f_k^{(n)}\}$ Show that $S$ has less than $\frac{2p}{k+1}$ elements.

Number $ 0$ is written on the board. Two players alternate writing signs and numbers to the right, where the first player always writes either $ \plus{}$ or $ \minus{}$ sign, while the second player writes one of the numbers $ 1, 2, ... , 1993$,writing each of these numbers exactly once. The game ends after $ 1993$ moves. Then the second player wins the score equal to the absolute value of the expression obtained thereby on the board. What largest score can he always win?

Let $n$ denote the product of the first $2013$ primes. Find the sum of all primes $p$ with $20 \le p \le 150$ such that (i) $\frac{p+1}{2}$ is even but is not a power of $2$, and (ii) there exist pairwise distinct positive integers $a,b,c$ for which \[ a^n(a-b)(a-c) + b^n(b-c)(b-a) + c^n(c-a)(c-b) \] is divisible by $p$ but not $p^2$. [i]Proposed by Evan Chen[/i]

For all integers $x,y,z$, let \[S(x,y,z) = (xy - xz, yz-yx, zx - zy).\] Prove that for all integers $a$, $b$ and $c$ with $abc>1$, and for every integer $n\geq n_0$, there exists integers $n_0$ and $k$ with $0<k\leq abc$ such that \[S^{n+k}(a,b,c) \equiv S^n(a,b,c) \pmod {abc}.\] ($S^1 = S$ and for every integer $m\geq 1$, $S^{m+1} = S \circ S^m.$ $(u_1, u_2, u_3) \equiv (v_1, v_2, v_3) \pmod M \Longleftrightarrow u_i \equiv v_i \pmod M (i=1,2,3).$)

Show that there exists a positive integer $ k$ such that $ k \cdot 2^{n} \plus{} 1$ is composite for all $ n \in \mathbb{N}_{0}$.

Each of the numbers in the set $N = \{1, 2, 3, \cdots, n - 1\}$, where $n \geq 3$, is colored with one of two colors, say red or black, so that: [i](i)[/i] $i$ and $n - i$ always receive the same color, and [i](ii)[/i] for some $j \in N$, relatively prime to $n$, $i$ and $|j - i|$ receive the same color for all $i \in N, i \neq j.$ Prove that all numbers in $N$ must receive the same color.

In a triangle $ABC$ with $AB<AC<BC$, the perpendicular bisectors of $AC$ and $BC$ intersect $BC$ and $AC$ at $K$ and $L$, respectively. Let $O$, $O_1$, and $O_2$ be the circumcentres of triangles $ABC$, $CKL$, and $OAB$, respectively. Prove that $OCO_1O_2$ is a parallelogram.

Let $f(x)$ be a polynomial with integer coefficients. Define a sequence $a_0, a_1, \cdots $ of integers such that $a_0=0$ and $a_{n+1}=f(a_n)$ for all $n \ge 0$. Prove that if there exists a positive integer $m$ for which $a_m=0$ then either $a_1=0$ or $a_2=0$.

Let $A, B \in M_6 (\mathbb{Z} )$ such that $A \equiv I \equiv B \text{ mod }3$ and $A^3 B^3 A^3 = B^3$. Prove that $A = I$. Here $M_6 (\mathbb{Z} )$ indicates the $6$ by $6$ matrices with integer entries, $I$ is the identity matrix, and $X \equiv Y \text{ mod }3$ means all entries of $X-Y$ are divisible by $3$.

Let $P$ be a polynomial with integer coefficients such that $P(0)=0$ and \[\gcd(P(0), P(1), P(2), \ldots ) = 1.\] Show there are infinitely many $n$ such that \[\gcd(P(n)- P(0), P(n+1)-P(1), P(n+2)-P(2), \ldots) = n.\]

Let $m$ be a positive integer. The positive integer $a$ is called a [i]golden residue[/i] modulo $m$ if $\gcd(a,m)=1$ and $x^x \equiv a \pmod m$ has a solution for $x$. Given a positive integer $n$, suppose that $a$ is a golden residue modulo $n^n$. Show that $a$ is also a golden residue modulo $n^{n^n}$. [i]Proposed by Mahyar Sefidgaran[/i]

Let $p$ be a prime such that $2^{p-1}\equiv 1 \pmod{p^2}$. Show that $(p-1)(p!+2^n)$ has at least three distinct prime divisors for each $n\in \mathbb{N}$ .

Show that the equation $ y^{37} \equal{} x^3 \plus{}11\pmod p$ is solvable for every prime $ p$, where $ p\le 100$.

For each integer $N>1$, there is a mathematical system in which two or more positive integers are defined to be congruent if they leave the same non-negative remainder when divided by $N$. If $69,90,$ and $125$ are congruent in one such system, then in that same system, $81$ is congruent to $\textbf{(A) }3\qquad\textbf{(B) }4\qquad\textbf{(C) }5\qquad\textbf{(D) }7\qquad \textbf{(E) }8$

For each positive integer $n$, let \[a_n = \frac {(n + 9)!}{(n - 1)!}.\] Let $k$ denote the smallest positive integer for which the rightmost nonzero digit of $a_k$ is odd. The rightmost nonzero digit of $a_k$ is $ \textbf{(A)}\ 1\qquad \textbf{(B)}\ 3\qquad \textbf{(C)}\ 5\qquad \textbf{(D)}\ 7\qquad \textbf{(E)}\ 9$

Find all positive integers $a$ such that for any positive integer $n\ge 5$ we have $2^n-n^2\mid a^n-n^a$.

If $p$ is an odd prime, prove that \[{k \choose p}\equiv \left\lfloor \frac{k}{p}\right\rfloor \pmod{p}.\]

Find all positive integer bases $b \ge 9$ so that the number \[ \frac{{\overbrace{11 \cdots 1}^{n-1 \ 1's}0\overbrace{77 \cdots 7}^{n-1\ 7's}8\overbrace{11 \cdots 1}^{n \ 1's}}_b}{3} \] is a perfect cube in base 10 for all sufficiently large positive integers $n$. [i]Proposed by Yang Liu[/i]

Let $ m$ and $ n$ be positive integers such that $ 1 \le m < n$. In their decimal representations, the last three digits of $ 1978^m$ are equal, respectively, to the last three digits of $ 1978^n$. Find $ m$ and $ n$ such that $ m \plus{} n$ has its least value.

Does there exist a positive integer that is a power of $2$ and we get another power of $2$ by swapping its digits? Justify your answer.