Determine the sum of angles $A,B,$ where $0^\circ \leq A,B, \leq 180^\circ$ and \[ \sin A + \sin B = \sqrt{\frac{3}{2}}, \cos A + \cos B = \sqrt{\frac{1}{2}} \]

Given the parallelogram $ABCD$. The circle $S_1$ passes through the vertex $C$ and touches the sides $BA$ and $AD$ at points $P_1$ and $Q_1$, respectively. The circle $S_2$ passes through the vertex $B$ and touches the side $DC$ at points $P_2$ and $Q_2$, respectively. Let $d_1$ and $d_2$ be the distances from $C$ and $B$ to the lines $P_1Q_1$ and $P_2Q_2$, respectively. Find all possible values of the ratio $d_1:d_2$. [i](I. Voronovich)[/i]

Let $ABC$ be a triangle with $AC> BC$, and let $S$ be the circumscribed circle of the triangle. $AB$ divides $S$ into two arcs. Let $D$ be the midpoint of the arc containing $C$. (a) Show that $\angle ACB +2 \cdot \angle ACD = 180^o$. (b) Let $E$ be the foot of the altitude from $D$ on $AC$. Show that $BC +CE = AE$.

Let $ABC$ be a triangle with $\angle C=60^o$. The point $P$ is the symmetric of $A$ with respect to the point of tangency of the circle inscribed with the side $BC$ . Show that if the perpendicular bisector of the $CP$ segment intersects the line containing the angle - bisector of $\angle B$ at the point $Q$, then the triangle $CPQ$ is equilateral.

Circles centered at $ A$ and $ B$ each have radius $ 2$, as shown. Point $ O$ is the midpoint of $ \overline{AB}$, and $ OA \equal{} 2\sqrt {2}$. Segments $ OC$ and $ OD$ are tangent to the circles centered at $ A$ and $ B$, respectively, and $ EF$ is a common tangent. What is the area of the shaded region $ ECODF$? [asy]unitsize(6mm); defaultpen(fontsize(10pt)+linewidth(.8pt)); dotfactor=3; pair O=(0,0); pair A=(-2*sqrt(2),0); pair B=(2*sqrt(2),0); pair G=shift(0,2)*A; pair F=shift(0,2)*B; pair C=shift(A)*scale(2)*dir(45); pair D=shift(B)*scale(2)*dir(135); pair X=A+2*dir(-60); pair Y=B+2*dir(240); path P=C--O--D--Arc(B,2,135,90)--G--Arc(A,2,90,45)--cycle; fill(P,gray); draw(Circle(A,2)); draw(Circle(B,2)); dot(A); label("$A$",A,W); dot(B); label("$B$",B,E); dot(C); label("$C$",C,W); dot(D); label("$D$",D,E); dot(G); label("$E$",G,N); dot(F); label("$F$",F,N); dot(O); label("$O$",O,S); draw(G--F); draw(C--O--D); draw(A--B); draw(A--X); draw(B--Y); label("$2$",midpoint(A--X),SW); label("$2$",midpoint(B--Y),SE);[/asy]$ \textbf{(A)}\ \frac {8\sqrt {2}}{3}\qquad \textbf{(B)}\ 8\sqrt {2} \minus{} 4 \minus{} \pi \qquad \textbf{(C)}\ 4\sqrt {2}$ $ \textbf{(D)}\ 4\sqrt {2} \plus{} \frac {\pi}{8}\qquad \textbf{(E)}\ 8\sqrt {2} \minus{} 2 \minus{} \frac {\pi}{2}$

Find all integer solutions to the equation $x^2=y^2(x+y^4+2y^2)$ .

A bus route consists of a circular road of circumference 10 miles and a straight road of length 1 mile which runs from a terminus to the point $Q$ on the circular road (see diagram). [img]6763[/img] It is served by two buses, each of which requires 20 minutes for the round trip. Bus No. 1, upon leaving the terminus, travels along the straight road, once around the circle clockwise and returns along the straight road to the terminus. Bus No. 2, reaching the terminus 10 minutes after Bus No. 1, has a similar route except that it proceeds counterclockwise around the circle. Both buses run continuously and do not wait at any point on the route except for a negligible amount of time to pick up and discharge passengers. A man plans to wait at a point $P$ which is $x$ miles ($0\le x < 12$) from the terminus along the route of Bus No. 1 and travel to the terminus on one of the buses. Assuming that he chooses to board that bus which will bring him to his destination at the earliest moment, there is a maximum time $w(x)$ that his journey (waiting plus travel time) could take. Find $w(2)$; find $w(4)$. For what value of $x$ will the time $w(x)$ be the longest? Sketch a graph of $y = w(x)$ for $0\le x < 12$.

Draw the graph of the functions $y = | x^2 - 1 |$ and $y = x + | x^2 -1 |$. Find the number of roots of the equation $x + | x^2 - 1 | = k$, where $k$ is a real constant.

Find all positive integers $n$ with the property that the set \[\{n,n+1,n+2,n+3,n+4,n+5\}\] can be partitioned into two sets such that the product of the numbers in one set equals the product of the numbers in the other set.

Isabel wants to partition the set $\mathbb{N}$ of the positive integers into $n$ disjoint sets $A_{1}, A_{2}, \ldots, A_{n}$. Suppose that for each $i$ with $1\leq i\leq n$, given any positive integers $r, s\in A_{i}$ with $r\neq s$, we have $r+s\in A_{i}$. If $|A_{j}|=1$ for some $j$, find the greatest positive integer that may belong to $A_{j}$.

A function $f:\{1,2, \ldots, n\} \to \{1, \ldots, m\}$ is [i]multiplication-preserving[/i] if $f(i)f(j) = f(ij)$ for all $1 \le i \le j \le ij \le n$, and [i]injective[/i] if $f(i) = f(j)$ only when $i = j$. For $n = 9, m = 88$, the number of injective, multiplication-preserving functions is $N$. Find the sum of the prime factors of $N$, including multiplicity. (For example, if $N = 12$, the answer would be $2 + 2 + 3 = 7$.)

The numbers $1, 19, 199, 1999,\ldots$ are written on several cards, one card for each number. [list=a] [*]Is it possible to choose at least three cards so that the sum of the numbers on the chosen cards equals a number in which all digits, except for a single digit, are twos? [*]Suppose you have chosen several cards so that the sum of the numbers on the chosen cards equals a number, all of whose digits are twos, except for a single digit. What can this single different digit be? [/list]

Let $ m$ be a positive odd integer, $ m > 2.$ Find the smallest positive integer $ n$ such that $ 2^{1989}$ divides $ m^n \minus{} 1.$

If there are four numbers $(a,b,c,d)$ in four registers of the calculating machine, they turn into $(a-b,b-c,c-d,d-a)$ numbers whenever you press the button. Prove that if not all the initial numbers are equal, machine will obtain at least one number more than $1985$ after some number of the operations.

Does there exist an infinite set $S$ consisted of positive integers,so that for any $x,y,z,w\in S,x<y,z<w$,if $(x,y)\ne (z,w)$,then $\gcd(xy+2022,zw+2022)=1$?

For every integer $m>1$, let $p(m)$ be the least prime divisor of $m$. If $a$ and $b$ are integers greater than $1$ such that: $$a^2+b=p(a)+[p(b)]^2$$ Show that $a=b$

Let $V$ be the set of vertices of a regular $21$-gon. Given a non-empty subset $U$ of $V$ , let $m(U)$ be the number of distinct lengths that occur between two distinct vertices in $U$. What is the maximum value of $\frac{m(U)}{|U|}$ as $U$ varies over all non-empty subsets of $V$ ?