Let $d(n)$ denote the largest odd integer divides $n$. Calculate the sum $d(1)+d(2)+d(3)+\dots+d(2^{99})$.

For any real numbers $x, y, z$ with $xyz + x + y + z = 4, $show that $$(yz + 6)^2 + (zx + 6)^2 + (xy + 6)^2 \geq 8 (xyz + 5).$$

Let $ABC$ be an acute-angled triangle with $AC > AB$, let $O$ be its circumcentre, and let $D$ be a point on the segment $BC$. The line through $D$ perpendicular to $BC$ intersects the lines $AO, AC,$ and $AB$ at $W, X,$ and $Y,$ respectively. The circumcircles of triangles $AXY$ and $ABC$ intersect again at $Z \ne A$. Prove that if $W \ne D$ and $OW = OD,$ then $DZ$ is tangent to the circle $AXY.$

At a party there are eight guests, and each participant can't talk with at most three persons. Prove that we can group the persons in four pairs such that in every pair a conversation can take place.

Given two circles $k_{1}$ and $k_{2}$ with centers $O_{1}$ and $O_{2}$ that intersect at the points $A$ and $B$.Passes through A two lines that intersect the circle $k_{1}$ at the points $N_{1}$and $M_{1}$, and the circle $k_{2}$ at the points $N_{2}$ and $M_{2}$ (points $A, N_{1},M_{1}$ in colinear). Denote the midpoints of the segments $N_{1}N_{2}$ and $M_{1}M_{2]}$ , through $N$ and $M$.Prove that: $a)$ Points $M,N,A$ and $B$ lie on a circle $b)$The center of the circle passing through $M,N,A$ and $B$ lies in the middle of the segment $O_{1}O_{2}$

Let $I_a$ be the excenter of triangle $ABC$ with respect to $A$. The line $AI_a$ intersects the circumcircle of triangle ABC at $T$. Let $X$ be a point on segment $TI_a$ such that $X I_a^2 = XA \cdot X T$ The perpendicular line from $X$ to $BC$ intersects $BC$ at $A'$. Define $B'$ and $C'$ in the same way. Prove that $AA',BB'$ and $CC'$ are concurrent.

The four faces of a tetrahedral die are labelled $0, 1, 2,$ and $3,$ and the die has the property that, when it is rolled, the die promptly vanishes, and a number of copies of itself appear equal to the number on the face the die landed on. For example, if it lands on the face labelled $0,$ it disappears. If it lands on the face labelled $1,$ nothing happens. If it lands on the face labelled $2$ or $3,$ there will then be $2$ or $3$ copies of the die, respectively (including the original). Suppose the die and all its copies are continually rolled, and let $p$ be the probability that they will all eventually disappear. Find $\left\lfloor \frac{10}{p} \right\rfloor$.

Let $n$ be a positive integer and $f:[0,1] \to \mathbb{R}$ be an integrable function. Prove that there exists a point $c \in \left[0,1- \frac{1}{n} \right],$ such that [center] $ \int\limits_c^{c+\frac{1}{n}}f(x)\mathrm{d}x=0$ or $\int\limits_0^c f(x) \mathrm{d}x=\int\limits_{c+\frac{1}{n}}^1f(x)\mathrm{d}x.$ [/center]

Let $H$ be a regular hexagon of side length $x$. Call a hexagon in the same plane a "distortion" of $H$ if and only if it can be obtained from $H$ by translating each vertex of $H$ by a distance strictly less than $1$. Determine the smallest value of $x$ for which every distortion of $H$ is necessarily convex.

Determine the remainder when $(x^4-1)(x^2-1)$ is divided by $1+x+x^2$.

A particle starts at $(0,0,0)$ in three-dimensional space. Each second, it randomly selects one of the eight lattice points a distance of $\sqrt{3}$ from its current location and moves to that point. What is the probability that, after two seconds, the particle is a distance of $2\sqrt{2}$ from its original location? [i]Proposed by Connor Gordon[/i]

Consider a triangle $ABC$ and two congruent triangles $A_1B_1C_1$ and $A_2B_2C_2$ which are respectively similar to $ABC$ and inscribed in it: $A_i,B_i,C_i$ are located on the sides of $ABC$ in such a way that the points $A_i$ are on the side opposite to $A$, the points $B_i$ are on the side opposite to $B$, and the points $C_i$ are on the side opposite to $C$ (and the angle at A are equal to angles at $A_i$ etc.). The circumcircles of $A_1B_1C_1$ and $A_2B_2C_2$ intersect at points $P$ and $Q$. Prove that the line $PQ$ passes through the orthocenter of $ABC$.

Let $ a > b > 1$ be relatively prime positive integers. Define the weight of an integer $ c$, denoted by $ w(c)$ to be the minimal possible value of $ |x| \plus{} |y|$ taken over all pairs of integers $ x$ and $ y$ such that \[ax \plus{} by \equal{} c.\] An integer $ c$ is called a [i]local champion [/i]if $ w(c) \geq w(c \pm a)$ and $ w(c) \geq w(c \pm b)$. Find all local champions and determine their number. [i]Proposed by Zoran Sunic, USA[/i]

Let $p$ be a prime number greater than $2$ and let $m, n$ be integers such that: $$\frac{m}{n}=1+\frac{1}{2}+\frac{1}{3}+...+\frac{1}{p-1}.$$ Prove that $p$ divides $m$.

For a positive integer $n$, we dene $D_n$ as the largest integer that is a divisor of $a^n + (a + 1)^n + (a + 2)^n$ for all positive integers $a$. 1. Show that for all positive integers $n$, the number $D_n$ is of the form $3^k$ with $k \ge 0$ an integer. 2. Show that for all integers $k \ge 0$ there exists a positive integer n such that $D_n = 3^k$.

Let $A$ and $B$ be sets such that there are exactly $144$ sets which are subsets of either $A$ or $B$. Determine the number of elements $A \cup B$ has.

A regular heptagon $A_1A_2A_3A_4A_5A_6A_7$ is given. Straight $A_2A_3$ and $A_5A_6$ intersect at point $X$, and straight lines $A_3A_5$ and $A_1A_6$ intersect at point $Y$. Prove that lines $A_1A_2$ and $XY$ are parallel.

The sequence $a_n$ is defined for any $n\geq 10$ by the following inductive rule: [list] [*] $a_{10}=5778$ [*] If $a_n=0$ then $a_{n+1}=0$. [*] If $a_n\neq0$ then $a_{n+1}$ is the number whose base-$(n+1)$ representation equals the base $n$ representation of the number $a_n -1$. [/list] For example, $a_{11}=5\cdot11^3+7\cdot11^2+7\cdot11^1+7\cdot11^0=7586$ $a_{12}=5\cdot12^3+7\cdot12^2+7\cdot12^1+6\cdot12^0=9738$ [list=a] [*] Does there exist $n\geq10$ for which $a_n=0$? [*] Is $a_{1,000,000}=0$? [*] Is $a_{100^{100^{100}}}=0$? [/list]

[b]p1.[/b] A triangle $ABC$ is drawn in the plane. A point $D$ is chosen inside the triangle. Show that the sum of distances $AD+BD+CD$ is less than the perimeter of the triangle. [b]p2.[/b] In a triangle $ABC$ the bisector of the angle $C$ intersects the side $AB$ at $M$, and the bisector of the angle $A$ intersects $CM$ at the point $T$. Suppose that the segments $CM$ and $AT$ divided the triangle $ABC$ into three isosceles triangles. Find the angles of the triangle $ABC$. [b]p3.[/b] You are given $100$ weights of masses $1, 2, 3,..., 99, 100$. Can one distribute them into $10$ piles having the following property: the heavier the pile, the fewer weights it contains? [b]p4.[/b] Each cell of a $10\times 10$ table contains a number. In each line the greatest number (or one of the largest, if more than one) is underscored, and in each column the smallest (or one of the smallest) is also underscored. It turned out that all of the underscored numbers are underscored exactly twice. Prove that all numbers stored in the table are equal to each other. [b]p5.[/b] Two stores have warehouses in which wheat is stored. There are $16$ more tons of wheat in the first warehouse than in the second. Every night exactly at midnight the owner of each store steals from his rival, taking a quarter of the wheat in his rival's warehouse and dragging it to his own. After $10$ days, the thieves are caught. Which warehouse has more wheat at this point and by how much? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Alice and Bob play a game on a Cartesian Coordinate Plane. At the beginning, Alice chooses a lattice point $ \left(x_{0}, y_{0}\right) $ and places a pudding. Then they plays by turns (B goes first) according to the rules a. If $ A $ places a pudding on $ \left(x,y\right) $ in the last round, then $ B $ can only place a pudding on one of $ \left(x+2, y+1\right), \left(x+2, y-1\right), \left(x-2, y+1\right), \left(x-2, y-1\right) $ b. If $ B $ places a pudding on $ \left(x,y\right) $ in the last round, then $ A $ can only place a pudding on one of $ \left(x+1, y+2\right), \left(x+1, y-2\right), \left(x-1, y+2\right), \left(x-1, y-2\right) $ Furthermore, if there is already a pudding on $ \left(a,b\right) $, then no one can place a pudding on $ \left(c,d\right) $ where $ c \equiv a \pmod{n}, d \equiv b \pmod{n} $. 1. Who has a winning strategy when $ n = 2018 $ 1. Who has a winning strategy when $ n = 2019 $

A $8\times 8$ board is divided in dominoes (rectangles with dimensions $1 \times 2$ or $2 \times 1$). [list=a] [*] Prove that the total length of the border between horizontal and vertical dominoes is at most $52$. [*] Determine the maximum possible total length of the border between horizontal and vertical dominoes. [/list] [i]Proposed by B. Frenkin, A. Zaslavsky, E. Arzhantseva[/i]

Find the number of all 6-digits numbers having exactly three odd and three even digits.

Let $n\in\mathbb{N}^*$. Prove that \[ \lim_{x\to 0}\frac{ \displaystyle (1+x^2)^{n+1}-\prod_{k=1}^n\cos kx}{ \displaystyle x\sum_{k=1}^n\sin kx}=\frac{2n^2+n+12}{6n}. \]

Every point with integer coordinates in the plane is the center of a disk with radius $1/1000$. (1) Prove that there exists an equilateral triangle whose vertices lie in different discs. (2) Prove that every equilateral triangle with vertices in different discs has side-length greater than $96$. [i]Radu Gologan, Romania[/i] [hide="Remark"] The "> 96" in [b](b)[/b] can be strengthened to "> 124". By the way, part [b](a)[/b] of this problem is the place where I used [url=http://mathlinks.ro/viewtopic.php?t=5537]the well-known "Dedekind" theorem[/url]. [/hide]

Mable and Nora play a game according to the following steps in order: 1. Mable writes down any 2015 distinct prime numbers in ascending order in a row. The product of these primes is Marble's score. 2. Nora writes down a positive integer 3. Mable draws a vertical line between two adjacent primes she has written in step 1, and compute the product of the prime(s) on the left of the vertical line 4. Nora must add the product obtained by Marble in step 3 to the number she has written in step 2, and the sum becomes Nora's score. If Marble and Nora's scores have a common factor greater than 1, Marble wins, otherwise Nora wins. Who has a winning strategy?