Determine all positive integers $n > 2$ , such that \[ \frac{1}{2} \varphi(n) \equiv 1 ( \bmod 6) \]

. In the isosceles triangle $ABC$ with $AC = BC$ we denote by $D$ the foot of the altitude through $C$. The midpoint of $CD$ is denoted by $M$. The line $BM$ intersects $AC$ in $E$. Prove that the length of $AC$ is three times that of $CE$.

In the expression $(x + 100) (x + 99) ... (x-99) (x-100)$, the brackets were expanded and similar terms were given. The expression $x^{201} + ...+ ax^2 + bx + c$ turned out. Find the numbers $a$ and $c$.

The figure shows an arbitrary (green) triangle in the center. White squares were built on its sides to the outside. Some of their vertices were connected by segments, white squares were built on them again to the outside, and so on. In the spaces between the squares, triangles and quadrilaterals were formed, which were painted in different colors. Prove that [list=a] [*]all colored quadrilaterals are trapezoids; [*]the areas of all polygons of the same color are equal; [*]the ratios of the bases of one-color trapezoids are equal; [*]if $S_0=1$ is the area of the original triangle, and $S_i$ is the area of the colored polygons at the $i^{\text{th}}$ step, then $S_1=1$, $S_2=5$ and for $n\geqslant 3$ the equality $S_n=5S_{n-1}-S_{n-2}$ is satisfied. [/list] [i]Proposed by F. Nilov[/i] [center][img width="40"]https://i.ibb.co/n8gt0pV/Screenshot-2023-03-09-174624.png[/img][/center]

Among $100$ points in the plane, no three collinear, exactly $4026$ pairs are connected by line segments. Each point is then randomly assigned an integer from $1$ to $100$ inclusive, each equally likely, such that no integer appears more than once. Find the expected value of the number of segments which join two points whose labels differ by at least $50$. [i]Proposed by Evan Chen[/i]

Let $p$ be a prime number such that $3p+10$ is a sum of squares of six consecutive positive integers. Prove that $p-7$ is divisible by $36$.

Sarah and Darah play the following game. Sarah puts $ n$ coins numbered with $ 1,\dots,n$ on a table (Each coin is in HEAD or TAIL position.) At each step Darah gives a coin to Sarah and she (Sarah) let him (Dara) to change the position of all coins with number multiple of a desired number $ k$. At the end, all of the coins that are in TAIL position will be given to Sarah and all of the coins with HEAD position will be given to Darah. Prove that Sarah can put the coins in a position at the beginning of the game such that she gains at least $ \Omega(n)$ coins. [hide="Hint:"]Chernov inequality![/hide]

For how many permutations $(a_1, a_2, \cdots, a_{2007})$ of the integers from $1$ to $2007$ is there exactly one $i$ between $1$ and $2006$ such that $a_i > a_{i+1}$? Express your answer as $a \** b^c + d \** e^f$ for integers $a$, $b$, $c$, $d$, $e$, and $f$ with $a \nmid b$ and $d \nmid e$.

Let $a,b,c$ be a real numbers such that this equations: $a^2x + b^2y + c^2z = 1$ $xy + yz + xz = 1$ have only one solution $(x, y, z)$ in real numbers. Prove that $a, b, c$ are sides of the triangle

A circle and an ellipse with foci $F_{1}$, $F_{2}$ lying inside it are given. Construct a chord $AB$ of the circle touching the ellipse and such that $AF_{1}F_{2}B$ is a cyclic quadrilateral. Proposed by: A.Zaslavsky

In the plane we are given the circles $\Gamma$ and $\Delta$ tangent to each other and $\Gamma$ contains $\Delta$. The radius of $\Gamma$ is $R$ and of $\Delta$ is $\frac{R}{2}$. Prove that for each positive integer $n \geq 3$, the equation: \[ (p(1) - p(n))^2 = (n-1)^2 \cdot (2 \cdot (p(1) + p(n)) - (n-1)^2 - 8) \] is the necessary and sufficient condition for $n$ to exist $n$ distinct circles $\Upsilon_1, \Upsilon_2, \ldots, \Upsilon_n$ such that all these circles are tangent to $\Gamma$ and $\Delta$ and $\Upsilon_i$ is tangent to $\Upsilon_{i+1}$, and $\Upsilon_1$ has radius $\frac{R}{p(1)}$ and $\Upsilon_n$ has radius $\frac{R}{p(n)}$.

Given an isosceles triangle $ABC$ ($AB = AC$), the inscribed circle $\omega$ touches its sides $AB$ and $AC$ at points $K$ and $L$, respectively. On the extension of the side of the base $BC$, towards $B$, an arbitrary point $M$. is chosen. Line $M$ intersects $\omega$ at the point $N$ for the second time, line $BN$ intersects the second point $\omega$ at the point $P$. On the line $PK$, there is a point $X$ such that $K$ lies between $P$ and $X$ and $KX = KM$. Determine the locus of the point $X$.

Perimeter of triangle $ABC$ is $1$. Circle $\omega$ touches side $BC$, continuation of side $AB$ at $P$ and continuation of side $AC$ in $Q$. Line through midpoints $AB$ and $AC$ intersects circumcircle of $APQ$ at $X$ and $Y$. Find length of $XY$.

A simple pendulum experiment is constructed from a point mass $m$ attached to a pivot by a massless rod of length $L$ in a constant gravitational field. The rod is released from an angle $\theta_0 < \frac{\pi}{2}$ at rest and the period of motion is found to be $T_0$. Ignore air resistance and friction. At what angle $\theta_g$ during the swing is the tension in the rod the greatest? $\textbf{(A) } \text{The tension is greatest at } \theta_g = \theta_0.\\ \textbf{(B) } \text{The tension is greatest at }\theta_g = 0.\\ \textbf{(C) } \text{The tension is greatest at an angle } 0 < \theta_g < \theta_0.\\ \textbf{(D) } \text{The tension is constant.}\\ \textbf{(E) } \text{None of the above is true for all values of } \theta_0 \text{ with } 0 < \theta_{0} < \frac{\pi}{2}$

Faith has four different integer length segments. It turned out that any three of them can form a triangle. What is the smallest total length of this set of segments?

The triangle $ABC$ is given. Let $A'$ be the midpoint of the side $BC$, $B_c{}$ be the projection of $B{}$ onto the bisector of the angle $ACB{}$ and $C_b$ be the projection of the point $C{}$ onto the bisector of the angle $ABC$. Let $A_0$ be the center of the circle passing through $A', B_c, C_b$. The points $B_0$ and $C_0$ are defined similarly. Prove that the incenter of the triangle $ABC$ coincides with the orthocenter of the triangle $A_0B_0C_0$.

Let $p$ be a prime number for which $\frac{p-1}{2}$ is also prime, and let $a,b,c$ be integers not divisible by $p$. Prove that there are at most $1+\sqrt {2p}$ positive integers $n$ such that $n<p$ and $p$ divides $a^n+b^n+c^n$.

A domino is a $2$ by $1$ rectangle . For what integers $m$ and $n$ can we cover an $m*n$ rectangle with non-overlapping dominoes???

Let $ABCD$ be a regular tetrahedron with side $a$. Take $E,E'$ on the edge $AB, F, F'$ on the edge $AC$ and $G,G'$ on the edge AD so that $AE =a/6,AE' = 5a/6,AF= a/4,AF'= 3a/4,AG = a/3,AG'= 2a/3$. Compute the volume of $EFGE'F'G'$ in term of $a$ and find the angles between the lines $AB,AC,AD$ and the plane $EFG$.

The inscribed circle $\omega$ of an equilateral $\Delta ABC$ is tangent to its sides $AB$,$BC$ and $CA$ in points $D$,$E$, and $F$, respectively. Point $H$ is the foot of the altitude from $D$ to $EF$. Let $AH\cap BC=X,BH\cap CA=Y$. It is known that $XY\cap AB=T$. Let $D$ be the center of the circumscribed circle of $\Delta BYX$. Prove that $OH\perp CT$.

Let $a$, $b$, and $c$ be real angles such that \newline \[3\sin a + 4\sin b + 5\sin c = 0\] \[3\cos a + 4\cos b + 5\cos c = 0.\] \newline The maximum value of the expression $\frac{\sin b \sin c}{\sin^2 a}$ can be expressed as $\frac{p}{q}$ for relatively prime $p,q$. Compute $p+q$.

Points $P$ and $Q$ lie respectively on sides $AB$ and $AC$ of a triangle $ABC$ and $BP=CQ$. Segments $BQ$ and $CP$ cross at $R$. Circumscribed circles of triangles $BPR$ and $CQR$ cross again at point $S$ different from $R$. Prove that point $S$ lies on the bisector of angle $BAC$.

A cubical cake with edge length $ 2$ inches is iced on the sides and the top. It is cut vertically into three pieces as shown in this top view, where $ M$ is the midpoint of a top edge. The piece whose top is triangle $ B$ contains $ c$ cubic inches of cake and $ s$ square inches of icing. What is $ c\plus{}s$? [asy]unitsize(1cm); defaultpen(linewidth(.8pt)+fontsize(8pt)); draw((-1,-1)--(1,-1)--(1,1)--(-1,1)--cycle); draw((1,1)--(-1,0)); pair P=foot((1,-1),(1,1),(-1,0)); draw((1,-1)--P); draw(rightanglemark((-1,0),P,(1,-1),4)); label("$M$",(-1,0),W); label("$C$",(-0.1,-0.3)); label("$A$",(-0.4,0.7)); label("$B$",(0.7,0.4));[/asy]$ \textbf{(A)}\ \frac{24}{5} \qquad \textbf{(B)}\ \frac{32}{5} \qquad \textbf{(C)}\ 8\plus{}\sqrt5 \qquad \textbf{(D)}\ 5\plus{}\frac{16\sqrt5}{5} \qquad \textbf{(E)}\ 10\plus{}5\sqrt5$

We have $98$ cards, in each one we will write one of the numbers: $1, 2, 3, 4,...., 97, 98$. We can order the $98$ cards, in a sequence such that two consecutive numbers $X$ and $Y$ and the number $X - Y$ is greater than $48$, determine how and how many ways we can make this sequence!!

Let $ABCD$ be an isosceles trapezoid with $AB=AD=BC, AB//CD, AB>CD$. Let $E= AC \cap BD$ and $N$ symmetric to $B$ wrt $AC$. Prove that the quadrilateral $ANDE$ is cyclic.