Determine all $(m,n) \in \mathbb{Z}^+ \times \mathbb{Z}^+$ which satisfy $3^m-7^n=2.$

In a ABCD cyclic quadrilateral 4 points K, L ,M, N are taken on AB , BC , CD and DA , respectively such that KLMN is a parallelogram. Lines AD, BC and KM have a common point. And also lines AB, DC and NL have a common point. Prove that KLMN is rhombus.

[b]Q.[/b] Find all polynomials $P: \mathbb{R \times R}\to\mathbb{R\times R}$ with real coefficients, such that $$P(x,y) = P(x+y,x-y), \ \forall\ x,y \in \mathbb{R}.$$ [i]Proposed by TuZo[/i]

Let $1\leq a_1 < a_2 <... < a_{2n} \leq 4n-2$ be integers, such that their sum is even. Prove that for all sufficiently large n, there exist $\varepsilon_1 , ..., \varepsilon_{2n} = \pm1$ such that $$\sum\varepsilon_i = \sum\varepsilon_i a_i = 0$$

From a group of boys and girls, $15$ girls leave. There are then left two boys for each girl. After this $45$ boys leave. There are then $5$ girls for each boy. The number of girls in the beginning was: $\textbf{(A)}\ 40 \qquad \textbf{(B)}\ 43 \qquad \textbf{(C)}\ 29 \qquad \textbf{(D)}\ 50 \qquad \textbf{(E)}\ \text{None of these}$

Calculate the minimum value of $ \text{tr} (A^tA) , $ where $ A $ in the cases where is a matrix of pairwise distinct nonnegative integers and: [b]a)[/b] $ \det A\equiv 1\pmod 2 $ [b]b)[/b] $ \det A=0 $ [i]Vlad Mihaly[/i]

[b]p1.[/b] What is the maximum possible value of $m$ such that there exist $m$ integers $a_1, a_2, ..., a_m$ where all the decimal representations of $a_1!, a_2!, ..., a_m!$ end with the same amount of zeros? [b]p2.[/b] Let $f : R \to R$ be a function such that $f(x) + f(y^2) = f(x^2 + y)$, for all $x, y \in R$. Find the sum of all possible $f(-2017)$. [b]p3. [/b] What is the sum of prime factors of $1000027$? [b]p4.[/b] Let $$\frac{1}{2!} +\frac{2}{3!} + ... +\frac{2016}{2017!} =\frac{n}{m},$$ where $n, m$ are relatively prime. Find $(m - n)$. [b]p5.[/b] Determine the number of ordered pairs of real numbers $(x, y)$ such that $\sqrt[3]{3 - x^3 - y^3} =\sqrt{2 - x^2 - y^2}$ [b]p6.[/b] Triangle $\vartriangle ABC$ has $\angle B = 120^o$, $AB = 1$. Find the largest real number $x$ such that $CA - CB > x$ for all possible triangles $\vartriangle ABC$. [b]p7. [/b]Jung and Remy are playing a game with an unfair coin. The coin has a probability of $p$ where its outcome is heads. Each round, Jung and Remy take turns to flip the coin, starting with Jung in round $ 1$. Whoever gets heads first wins the game. Given that Jung has the probability of $8/15$ , what is the value of $p$? [b]p8.[/b] Consider a circle with $7$ equally spaced points marked on it. Each point is $ 1$ unit distance away from its neighbors and labelled $0,1,2,...,6$ in that order counterclockwise. Feng is to jump around the circle, starting at the point $0$ and making six jumps counterclockwise with distinct lengths $a_1, a_2, ..., a_6$ in a way such that he will land on all other six nonzero points afterwards. Let $s$ denote the maximum value of $a_i$. What is the minimum possible value of $s$? [b]p9. [/b]Justin has a $4 \times 4 \times 4$ colorless cube that is made of $64$ unit-cubes. He then colors $m$ unit-cubes such that none of them belong to the same column or row of the original cube. What is the largest possible value of $m$? [b]p10.[/b] Yikai wants to know Liang’s secret code which is a $6$-digit integer $x$. Furthermore, let $d(n)$ denote the digital sum of a positive integer $n$. For instance, $d(14) = 5$ and $d(3) = 3$. It is given that $$x + d(x) + d(d(x)) + d(d(d(x))) = 999868.$$ Please find $x$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Suppose that $g$ and $h$ are polynomials of degree $10$ with integer coefficients such that $g(2) < h(2)$ and \[ g(x) h(x) = \sum_{k=0}^{10} \left( \binom{k+11}{k} x^{20-k} - \binom{21-k}{11} x^{k-1} + \binom{21}{11}x^{k-1} \right) \] holds for all nonzero real numbers $x$. Find $g(2)$. [i]Proposed by Yang Liu[/i]

Gwen, Eli, and Kat take turns flipping a coin in their respective order. The first one to flip heads wins. What is the probability that Kat will win?

Let U be the union of a finite number (not necessarily connected and not necessarily disjoint) of closed unit squares lying in the plane. Can the quotient of the perimeter and area of U be arbitrarily large? @below: i think "single" means "connected".

Kolya found several pairwise relatively prime integers, each of which is less than the square of any other. Prove that the sum of reciprocals of these numbers is less than $2$.

Evaluate $\frac{\log_{10}20^2 \cdot \log_{20}30^2 \cdot \log_{30}40^2 \cdot \cdot \cdot \log_{990}1000^2}{\log_{10}11^2 \cdot \log_{11}12^2 \cdot \log_{12}13^2 \cdot \cdot \cdot \log_{99}100^2}$ .

If $xy = 15$ and $x + y = 11$, calculate the value of $x^3 + y^3$.

For $a,n$ positive integers we show number of different integer 10-tuples $ (x_1,x_2,...,x_{10})$ on $ (mod n)$ satistfying $x_1x_2...x_{10}=a (mod n)$ with $f(a,n)$. Let $a,b$ given positive integers , a) Prove that there exist a positive integer $c$ such that for all $n\in \mathbb{Z^+}$ $$\frac {f(a,cn)}{f(b,cn)}$$is constant b) Find all $(a,b)$ pairs such that minumum possible value of $c$ is 27 where $c$ satisfying condition in $(a)$

For each prime $p$, construct a graph $G_p$ on $\{1,2,\ldots p\}$, where $m\neq n$ are adjacent if and only if $p$ divides $(m^{2} + 1-n)(n^{2} + 1-m)$. Prove that $G_p$ is disconnected for infinitely many $p$

Find a positive integer $n$ with 1000 digits, all distinct from zero, with the following property: it's possible to group the digits of $n$ into 500 pairs in such a way that if the two digits of each pair are multiplied and then add the 500 products, it results a number $m$ that is a divisor of $n$.

Circle $\omega_1$ and $\omega_2$ have centers $(0,6)$ and $(20,0)$, respectively. Both circles have radius $30$, and intersect at two points $X$ and $Y$. The line through $X$ and $Y$ can be written in the form $y = mx+b$. Compute $100m+b$. [i]Proposed by Evan Chen[/i]

Points $M$ and $N$ are chosen on sides $AB$ and $BC$,respectively, in a triangle $ABC$, such that point $O$ is interserction of lines $CM$ and $AN$. Given that $AM+AN=CM+CN$. Prove that $AO+AB=CO+CB$.

Find all $(m,n)$ in $\mathbb{N}^2$ such that $m\mid n^2+1$ and $n\mid m^2+1$.

In the triangle $ABC$, $|AB|=15,|BC|=12,|AC|=13$. Let the median $AM$ and bisector $BK$ intersect at point $O$, where $M\in BC,K\in AC$. Let $OL\perp AB,L\in AB$. Prove that $\angle OLK=\angle OLM$.

There are $n \ge 3$ distinct positive real numbers. Show that there are at most $n-2$ different integer power of three that can be written as the sum of three distinct elements from these $n$ numbers.

A sphere is inscribed in a cube that has a surface area of $ 24$ square meters. A second cube is then inscribed within the sphere. What is the surface area in square meters of the inner cube? $ \textbf{(A)}\ 3 \qquad \textbf{(B)}\ 6 \qquad \textbf{(C)}\ 8 \qquad \textbf{(D)}\ 9 \qquad \textbf{(E)}\ 12$

For each integer $n \geq 2$, let $F(n)$ denote the greatest prime factor of $n$. A [i]strange pair[/i] is a pair of distinct primes $p$ and $q$ such that there is no integer $n \geq 2$ for which $F(n)F(n+1)=pq$. Prove that there exist infinitely many strange pairs.

Let $x_i \in \{0, 1\} (i = 1, 2, \cdots, n)$. If the function $f = f(x_1, x_2, \cdots, x_n)$ only equals $0$ or $1$, then define $f$ as an "$n$-variable Boolean function" and denote $$D_n (f) = \{ (x_1, x_2, \cdots, x_n) | f(x_1, x_2, \cdots, x_n) = 0 \}$$. $(1)$ Determine the number of $n$-variable Boolean functions; $(2)$ Let $g$ be a $10$-variable Boolean function satisfying $$g(x_1, x_2, \cdots, x_{10}) \equiv 1 + x_1 + x_1 x_2 + x_1 x_2 x_3 + \cdots + x_1 x_2\cdots x_{10} \pmod{2}$$ Evaluate the size of the set $D_{10} (g)$ and $\sum\limits_{(x_1, x_2, \cdots, x_{10}) \in D_{10} (g)} (x_1 + x_2 + x_3 + \cdots + x_{10})$.

Dexter's Laboratory has $2024$ robots, each with a program setup by Dexter. One day, his naughty sister Dee Dee intrudes and writes an integer in $\{1, 2, \dots, 113\}$ on each of the robot's forehead. Each robot detects the numbers on all other robots' foreheads, and guess its own number base on its program, individually and simultaneously. Find the largest positive integer $k$ such that Dexter can setup the programs so that, no matter how the numbers distribute, there are always at least $k$ robots who guess their numbers right. [i]Proposed by sn6dh[/i]