Given two relatively prime numbers $p>0$ and $q>0$. An integer $n$ is called "good" if we can represent it as $n = px + qy$ with nonnegative integers $x$ and $y$, and "bad" in the opposite case. a) Prove that there exist integer $c$ such that in a pair $\{n, c-n\}$ always one is "good" and one is "bad". b) How many there exist "bad" numbers?

The area of the quadrilateral with vertices at the four points in three dimensional space $(0,0,0)$, $(2,6,1)$, $(-3,0,3)$ and $(-4,2,5)$ is the number $\dfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

The diagram below shows the first three figures of a sequence of figures. The first figure shows an equilateral triangle $ABC$ with side length $1$. The leading edge of the triangle going in a clockwise direction around $A$ is labeled $\overline{AB}$ and is darkened in on the figure. The second figure shows the same equilateral triangle with a square with side length $1$ attached to the leading clockwise edge of the triangle. The third figure shows the same triangle and square with a regular pentagon with side length $1$ attached to the leading clockwise edge of the square. The fourth figure in the sequence will be formed by attaching a regular hexagon with side length $1$ to the leading clockwise edge of the pentagon. The hexagon will overlap the triangle. Continue this sequence through the eighth figure. After attaching the last regular figure (a regular decagon), its leading clockwise edge will form an angle of less than $180^\circ$ with the side $\overline{AC}$ of the equilateral triangle. The degree measure of that angle can be written in the form $\tfrac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m + n$. [asy] size(250); defaultpen(linewidth(0.7)+fontsize(10)); pair x[],y[],z[]; x[0]=origin; x[1]=(5,0); x[2]=rotate(60,x[0])*x[1]; draw(x[0]--x[1]--x[2]--cycle); for(int i=0;i<=2;i=i+1) { y[i]=x[i]+(15,0); } y[3]=rotate(90,y[0])*y[2]; y[4]=rotate(-90,y[2])*y[0]; draw(y[0]--y[1]--y[2]--y[0]--y[3]--y[4]--y[2]); for(int i=0;i<=4;i=i+1) { z[i]=y[i]+(15,0); } z[5]=rotate(108,z[4])*z[2]; z[6]=rotate(108,z[5])*z[4]; z[7]=rotate(108,z[6])*z[5]; draw(z[0]--z[1]--z[2]--z[0]--z[3]--z[4]--z[2]--z[7]--z[6]--z[5]--z[4]); dot(x[2]^^y[2]^^z[2],linewidth(3)); draw(x[2]--x[0]^^y[2]--y[4]^^z[2]--z[7],linewidth(1)); label("A",(x[2].x,x[2].y-.3),S); label("B",origin,S); label("C",x[1],S);[/asy]

Find the number of positive integers $n$ satisfying $\phi(n) | n$ such that \[\sum_{m=1}^{\infty} \left( \left[ \frac nm \right] - \left[\frac{n-1}{m} \right] \right) = 1992\] What is the largest number among them? As usual, $\phi(n)$ is the number of positive integers less than or equal to $n$ and relatively prime to $n.$

Let $\mathbb N = {1, 2, 3, . . .}$. For real $x, y$, set $S(x, y) = \{s | s = [nx+y], n \in \mathbb N\}$. Prove that if $r > 1$ is a rational number, there exist real numbers $u$ and $v$ such that \[S(r, 0) \cap S(u, v) = \emptyset, S(r, 0) \cup S(u, v) = \mathbb N.\]

Square $S_{1}$ is $1\times 1.$ For $i\ge 1,$ the lengths of the sides of square $S_{i+1}$ are half the lengths of the sides of square $S_{i},$ two adjacent sides of square $S_{i}$ are perpendicular bisectors of two adjacent sides of square $S_{i+1},$ and the other two sides of square $S_{i+1},$ are the perpendicular bisectors of two adjacent sides of square $S_{i+2}.$ The total area enclosed by at least one of $S_{1}, S_{2}, S_{3}, S_{4}, S_{5}$ can be written in the form $m/n,$ where $m$ and $n$ are relatively prime positive integers. Find $m-n.$ [asy] size(250); path p=rotate(45)*polygon(4); int i; for(i=0; i<5; i=i+1) { draw(shift(2-(1/2)^(i-1),0)*scale((1/2)^i)*p); } label("$S_1$", (0,-0.75)); label("$S_2$", (1,-0.75)); label("$S_3$", (3/2,-0.75)); label("$\cdots$", (7/4, -3/4)); label("$\cdots$", (2.25, 0));[/asy]

Alan, Barb, Cory, and Doug are on the golf team, Doug, Emma, Fran, and Greg are on the swim team, and Greg, Hope, Inga, and Alan are on the tennis team. These nine people sit in a circle in random order. The probability that no two people from the same team sit next to each other is $\tfrac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m + n.$

Dragon selects three positive real numbers with sum $100$, uniformly at random. He asks Cat to copy them down, but Cat gets lazy and rounds them all to the nearest tenth during transcription. If the probability the three new numbers still sum to $100$ is $\tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers, compute $100m+n$. [i]Proposed by Aaron Lin[/i]

Let $\,n>6\,$ be an integer and $\,a_{1},a_{2},\ldots,a_{k}\,$ be all the natural numbers less than $n$ and relatively prime to $n$. If \[a_{2}-a_{1}=a_{3}-a_{2}=\cdots =a_{k}-a_{k-1}>0,\] prove that $\,n\,$ must be either a prime number or a power of $\,2$.

Let $f(x)=x^2+4x+2$. Let $r$ be the difference between the largest and smallest real solutions of the equation $f(f(f(f(x))))=0$. Then $r=a^{\frac{p}{q}}$ for some positive integers $a$, $p$, $q$ so $a$ is square-free and $p,q$ are relatively prime positive integers. Compute $a+p+q$.

For every natural number $ n $, define $ s(n) $ as the smallest natural number so that for every natural number $ a $ relatively prime to $n$, this equation holds: \[ a^{s(n)} \equiv 1 (mod n) \] Find all natural numbers $ n $ such that $ s(n) = 2010 $

When flipped, coin A shows heads $\textstyle\frac{1}{3}$ of the time, coin B shows heads $\textstyle\frac{1}{2}$ of the time, and coin C shows heads $\textstyle\frac{2}{3}$ of the time. Anna selects one of the coins at random and flips it four times, yielding three heads and one tail. The probability that Anna flipped coin A can be expressed as $\textstyle\frac{p}{q}$ for relatively prime positive integers $p$ and $q$. Compute $p + q$. [i]Proposed by Eugene Chen[/i]

If $p$ and $q$ are natural numbers so that \[ \frac{p}{q}=1-\frac{1}{2}+\frac{1}{3}-\frac{1}{4}+ \ldots -\frac{1}{1318}+\frac{1}{1319}, \] prove that $p$ is divisible with $1979$.

We have $2022$ $1s$ written on a board in a line. We randomly choose a strictly increasing sequence from ${1, 2, . . . , 2022}$ such that the last term is $2022$. If the chosen sequence is $a_1, a_2, ..., a_k$ ($k$ is not fixed), then at the $i^{th}$ step, we choose the first a$_i$ numbers on the line and change the 1s to 0s and 0s to 1s. After $k$ steps are over, we calculate the sum of the numbers on the board, say $S$. The expected value of $S$ is $\frac{a}{b}$ where $a, b$ are relatively prime positive integers. Find $a + b.$

Let $m\geq 2$ be an integer. A positive integer $n$ has the property that for any positive integer $a$ coprime with $n$, we have $a^m - 1\equiv 0 \pmod n$. Prove that $n \leq 4m(2^m-1)$. Created by Harazi, modified by Marian Andronache.

Four consecutive three-digit numbers are divided respectively by four consecutive two-digit numbers. What minimum number of different remainders can be obtained? [i](A. Golovanov)[/i]

[b]Problem:[/b]For a positive integer $ n$,let $ V(n; b)$ be the number of decompositions of $ n$ into a product of one or more positive integers greater than $ b$. For example,$ 36 \equal{} 6.6 \equal{}4.9 \equal{} 3.12 \equal{} 3 .3. 4$, so that $ V(36; 2) \equal{} 5$.Prove that for all positive integers $ n$; b it holds that $ V(n;b)<\frac{n}{b}$. :)

The coordinates of the vertices of isosceles trapezoid $ABCD$ are all integers, with $A=(20,100)$ and $D=(21,107).$ The trapezoid has no horizontal or vertical sides, and $\overline{AB}$ and $\overline{CD}$ are the only parallel sides. The sum o f the absolute values of all possible slopes for $\overline{AB}$ is $m/n,$ where $m$ and $n$ are relatively prime positive integers. Find $m+n.$

Given a positive integer $n$, let $\tau(n)$ denote the number of positive divisors of $n$ and $\varphi(n)$ denote the number of positive integers not exceeding $n$ that are relatively prime to $n$. Find all $n$ for which one of the three numbers $n,\tau(n), \varphi(n)$ is the arithmetic mean of the other two.

Let $\alpha$ and $\beta$ be the roots of the equation $x^2 + mx -1 = 0$ where $m$ is an odd integer. Let $\lambda _n = \alpha ^n + \beta ^n , n \geq 0$ Prove that (A) $\lambda _n$ is an integer (B) gcd ( $\lambda _n , \lambda_{n+1}$) = 1 .

Given an odd prime $p$, find all functions $f:Z \rightarrow Z$ satisfying the following two conditions: (i) $f(m)=f(n)$ for all $m,n \in Z$ such that $m\equiv n\pmod p$; (ii) $f(mn)=f(m)f(n)$ for all $m,n \in Z$.

Let $R=(8,6)$. The lines whose equations are $8y=15x$ and $10y=3x$ contain points $P$ and $Q$, respectively, such that $R$ is the midpoint of $\overline{PQ}$. The length of $PQ$ equals $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

Find all pairs of integers $x,y$ for which \[x^3+x^2+x=y^2+y.\]

Let $\overline{CH}$ be an altitude of $\triangle ABC$. Let $R$ and $S$ be the points where the circles inscribed in the triangles $ACH$ and $BCH$ are tangent to $\overline{CH}$. If $AB = 1995$, $AC = 1994$, and $BC = 1993$, then $RS$ can be expressed as $m/n$, where $m$ and $n$ are relatively prime integers. Find $m + n$

$ABCD$ is a rectangular sheet of paper that has been folded so that corner $B$ is matched with point $B'$ on edge $AD$. The crease is $EF$, where $E$ is on $AB$ and $F$is on $CD$. The dimensions $AE=8$, $BE=17$, and $CF=3$ are given. The perimeter of rectangle $ABCD$ is $m/n$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$. [asy] size(200); defaultpen(linewidth(0.7)+fontsize(10)); pair A=origin, B=(25,0), C=(25,70/3), D=(0,70/3), E=(8,0), F=(22,70/3), Bp=reflect(E,F)*B, Cp=reflect(E,F)*C; draw(F--D--A--E); draw(E--B--C--F, linetype("4 4")); filldraw(E--F--Cp--Bp--cycle, white, black); pair point=( 12.5, 35/3 ); label("$A$", A, dir(point--A)); label("$B$", B, dir(point--B)); label("$C$", C, dir(point--C)); label("$D$", D, dir(point--D)); label("$E$", E, dir(point--E)); label("$F$", F, dir(point--F)); label("$B^\prime$", Bp, dir(point--Bp)); label("$C^\prime$", Cp, dir(point--Cp));[/asy]