Given an integer $ n\ge 2$ and a reular 2n-gon. Color all verices of the 2n-gon with n colors such that: [b](i)[/b] Each vertice is colored by exactly one color. [b](ii)[/b] Two vertices don't have the same color. Two ways of coloring, satisfying the conditions above, are called equilavent if one obtained from the other by a rotation whose center is the center of polygon. Find the total number of mutually non-equivalent ways of coloring. [i]Alternative statement:[/i] In how many ways we can color vertices of an regular 2n-polygon using n different colors such that two adjent vertices are colored by different colors. Two colorings which can be received from each other by rotation are considered as the same.

$g(x) \colon \int_{10}^{x} \log_{10}(\log_{10}(t^2-1000t+10^{1000})) dt$ (a) Find the domain of $g(x)$ (b) Approximate the value of $g(1000)$ (c) Find $x \in [10, 1000]$ to maximize the slope of $g(x)$ (d) Find $x \in [10, 1000]$ to minimize the slope of $g(x)$ (e) Determine, if it exists, $\lim_{x \to \infty} \frac{\ln(x)}{g(x)}$

For any non-negative integer $n$, we say that a permutation $(a_0,a_1,...,a_n)$ of $\{0,1,..., n\} $ is quadratic if $k + a_k$ is a square for $k = 0, 1,...,n$. Show that for any non-negative integer $n$, there exists a quadratic permutation of $\{0,1,..., n\}$.

[b]p1.[/b] The sequence $\{x_n\}$ is defined by $$x_{n+1} = \begin{cases} 2x_n - 1, \,\, if \,\, \frac12 \le x_n < 1 \\ 2x_n, \,\, if \,\, 0 \le x_n < \frac12 \end{cases}$$ where $0 \le x_0 < 1$ and $x_7 = x_0$. Find the number of sequences satisfying these conditions. [b]p2.[/b] Let $M = \{1, . . . , 2022\}$. For any nonempty set $X \subseteq M$, let $a_X$ be the sum of the maximum and the minimum number of $X$. Find the average value of $a_X$ across all nonempty subsets $X$ of $M$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $C$ be a circunference, $O$ is your circumcenter, $AB$ is your diameter and $R$ is any point in $C$ ($R$ is different of $A$ and $B$) Let $P$ be the foot of perpendicular by $O$ to $AR$, in the line $OP$ we match a point $Q$, where $QP$ is $\frac{OP}{2}$ and the point $Q$ isn't in the segment $OP$. In $Q$, we will do a parallel line to $AB$ that cut the line $AR$ in $T$. Denote $H$ the point of intersections of the line $AQ$ and $OT$. Show that $H$, $B$ and $R$ are collinears.

What is the largest factor of $130000$ that does not contain the digit $0$ or $5$?

Consider a point $ B $ on a segment $ AC. $ Find the locus of the points $ M $ that have the property that the circumcircles of $ ABM $ and $ BCM $ have equal radii. [i]Nicolae Soare[/i]

Arpon chooses a positive real number $k$. For each positive integer $n$, he places a marker at the point $(n,nk)$ in the $(x,y)$ plane. Suppose that two markers whose $x$-coordinates differ by $4$ have distance $31$. What is the distance between the markers $(7,7k)$ and $(19,19k)$?

Let $ABC$ be an acute triangle with circumcenter $O$, orthocenter $H$, and circumcircle $\Omega$. Let $M$ be the midpoint of $AH$ and $N$ the midpoint of $BH$. Assume the points $M$, $N$, $O$, $H$ are distinct and lie on a circle $\omega$. Prove that the circles $\omega$ and $\Omega$ are internally tangent to each other. [i]Dhroova Aiylam and Evan Chen[/i]

For how many rational numbers $p$ is the area of the triangle formed by the intercepts and vertex of $f(x) = -x^2+4px-p+1$ an integer?

A set $M$ of positive integers is called [i]connected[/i] if for any element $x\in M$ at least one of the numbers $x-1,x+1$ is in $M$. Let $U_n$ be the number of the connected subsets of $\{1,2,\ldots,n\}$. a) Compute $U_7$; b) Find the smallest number $n$ such that $U_n \geq 2006$.

Let $ABC$ be an acute angles triangle with $O$ the center of the circumscribed circle. Point $Q$ lies on the circumscribed circle of $\vartriangle BOC$ so that $OQ$ is a diameter. Point $M$ lies on $CQ$ and point $N$ lies internally on line segment $BC$ so that $ANCM$ is a parallelogram. Prove that the circumscribed circle of $\vartriangle BOC$ and the lines $AQ$ and $NM$ pass through the same point.

A function \[\text{f:(0,}\infty \text{) }\to \text{(0,}\infty \text{)}\] is called contract if, for every numbers $x,y\in \text{(0,}\infty \text{)}$ we have, $\underset{n\to \infty }{\mathop{\lim }}\,\left( {{f}^{n}}\left( x \right)-{{f}^{n}}\left( y \right) \right)=0$ where ${{f}^{n}}=\underbrace{f\circ f\circ ...\circ f}_{n\ f\text{'s}}$ a) Consider \[f:\text{(0,}\infty \text{) }\to \text{(0,}\infty \text{)}\] a function contract, continue with the property that has a fixed point, that existing ${{x}_{0}}\in \text{(0,}\infty \text{) }$ there so that $f\left( {{x}_{0}} \right)={{x}_{0}}.$ Show that $f\left( x \right)>x,$ for every $x\in \text{(0,}{{x}_{0}}\text{)}\,$ and $f\left( x \right)<x$, for every $x\in \text{(}{{x}_{0}}\text{,}\infty \text{)}\,$. b) Show that the given function \[f\text{:(0,}\infty \text{) }\to \text{(0,}\infty \text{)}\] given by $f\left( x \right)=x+\frac{1}{x}$ is contracted but has no fix number.

Given positive integers $a,b,c$ which are pairwise relatively prime, show that \[2abc-ab-bc-ac \] is the biggest number that can't be expressed in the form $xbc+yca+zab$ with $x,y,z$ being natural numbers.

Determine all natural numbers $n$ for which there exists a permutation $(a_1,a_2,\ldots,a_n)$ of the numbers $0,1,\ldots,n-1$ such that, if $b_i$ is the remainder of $a_1a_2\cdots a_i$ upon division by $n$ for $i=1,\ldots,n$, then $(b_1,b_2,\ldots,b_n)$ is also a permutation of $0,1,\ldots,n-1$.

Let $M$ be the midpoint of the side $BC$ of a acute triangle $ABC$. Incircle of the triangle $ABM$ is tangent to the side $AB$ at the point $D$. Incircle of the triangle $ACM$ is tangent to the side $AC$ at the point $E$. Let $F$ be the such point, that the quadrilateral $DMEF$ is a parallelogram. Prove that $F$ lies on the bisector of $\angle BAC$.

Compute $3^{3^{\ldots^3}} \mod{333},$ where there are $3^{3^3}$ $3$'s in the exponent.

1. In right triangle $ABC$ with $\angle{A}= \textdegree{90}$, point $P$ is chosen. $D \in BC$ such that $PD \perp BC$. Let the intersection of $PD$ with $AB$ and $AC$ be $E$ and $F$ respectively. Denote by $X$ and $Y$ as the intersection of $(APE)$ and $(APF)$ with $BP$ and $CP$ respectively. Prove that $CX,BY,PD$ are concurrent.

Let $ABCD$ be a cyclic quadrilateral whose diagonals $AC$ and $BD$ meet at $E$. The extensions of the sides $AD$ and $BC$ beyond $A$ and $B$ meet at $F$. Let $G$ be the point such that $ECGD$ is a parallelogram, and let $H$ be the image of $E$ under reflection in $AD$. Prove that $D,H,F,G$ are concyclic.

Let $x,y,z \in\mathbb{Q}$,such that $(x+y+z)^3=9(x^2y+y^2z+z^2x).$ Prove that $x=y=z$

A circle is divided into $2n$ equal sectors, $n \in \mathbb{N}$. Vitya and Masha are playing the following game. At first, Vitya writes one number in every sector from the set $\{1,2,\ldots,n\}$ and every number is used exatly twice. After that Masha chooses $n$ consecutive sectors and writes $1$ in the first sector, $2$ in the second, $n$ in the last. Vitya wins if at least in one sector two equal number will be written, otherwise Masha wins. Find all $n$ for which Vitya can guarantee his win.

Let $\rho:\mathbb{R}^n\to \mathbb{R}$, $\rho(\mathbf{x})=e^{-||\mathbf{x}||^2}$, and let $K\subset \mathbb{R}^n$ be a convex body, i.e., a compact convex set with nonempty interior. Define the barycenter $\mathbf{s}_K$ of the body $K$ with respect to the weight function $\rho$ by the usual formula \[\mathbf{s}_K=\frac{\int_K\rho(\mathbf{x})\mathbf{x}d\mathbf{x}}{\int_K\rho(\mathbf{x})d\mathbf{x}}.\] Prove that the translates of the body $K$ have pairwise distinct barycenters with respect to $\rho$.

Which is the largest four-digit number that has all four of its digits among its divisors and its digits are all different?

Let $M$ be an arbitrary positive real number greater than $1$, and let $a_1,a_2,...$ be an infinite sequence of real numbers with $a_n\in [1,M]$ for any $n\in \mathbb{N}$. Show that for any $\epsilon\ge 0$, there exists a positive integer $n$ such that $$\frac{a_n}{a_{n+1}}+\frac{a_{n+1}}{a_{n+2}}+\cdots+\frac{a_{n+t-1}}{a_{n+t}}\ge t-\epsilon$$ holds for any positive integer $t$.

For an ${n\times n}$ matrix $A$, let $X_{i}$ be the set of entries in row $i$, and $Y_{j}$ the set of entries in column $j$, ${1\leq i,j\leq n}$. We say that $A$ is [i]golden[/i] if ${X_{1},\dots ,X_{n},Y_{1},\dots ,Y_{n}}$ are distinct sets. Find the least integer $n$ such that there exists a ${2004\times 2004}$ golden matrix with entries in the set ${\{1,2,\dots ,n\}}$.