[b]p1.[/b] Let $D(n)$ denote the number of positive factors of the integer $n$. For example, $D(6) = 4$ , since the factors of $6$ are $1, 2, 3$ , and $6$ . Note that $D(n) = 2$ if and only if $n$ is a prime number. (a) Describe the set of all solutions to the equation $D(n) = 5$ . (b) Describe the set of all solutions to the equation $D(n) = 6$ . (c) Find the smallest $n$ such that $D(n) = 21$ . [b]p2.[/b] At a party with $n$ married couples present (and no one else), various people shook hands with various other people. Assume that no one shook hands with his or her spouse, and no one shook hands with the same person more than once. At the end of the evening Mr. Jones asked everyone else, including his wife, how many hands he or she had shaken. To his surprise, he got a different answer from each person. Determine the number of hands that Mr. Jones shook that evening, (a) if $n = 2$ . (b) if $n = 3$ . (c) if $n$ is an arbitrary positive integer (the answer may depend on $n$). [b]p3.[/b] Let $n$ be a positive integer. A square is divided into triangles in the following way. A line is drawn from one corner of the square to each of $n$ points along each of the opposite two sides, forming $2n + 2$ nonoverlapping triangles, one of which has a vertex at the opposite corner and the other $2n + 1$ of which have a vertex at the original corner. The figure shows the situation for $n = 2$ . Assume that each of the $2n + 1$ triangles with a vertex in the original corner has area $1$. Determine the area of the square, (a) if $n = 1$ . (b) if $n$ is an arbitrary positive integer (the answer may depend on $n$). [img]https://cdn.artofproblemsolving.com/attachments/1/1/62a54011163cc76cc8d74c73ac9f74420e1b37.png[/img] [b]p4.[/b] Arthur and Betty play a game with the following rules. Initially there are one or more piles of stones, each pile containing one or more stones. A legal move consists either of removing one or more stones from one of the piles, or, if there are at least two piles, combining two piles into one (but not removing any stones). Arthur goes first, and play alternates until a player cannot make a legal move; the player who cannot move loses. (a) Determine who will win the game if initially there are two piles, each with one stone, assuming that both players play optimally. (b) Determine who will win the game if initially there are two piles, each with $n$ stones, assuming that both players play optimally; $n$ is a positive integer, and the answer may depend on $n$ . (c) Determine who will win the game if initially there are $n$ piles, each with one stone, assuming that both players play optimally; $n$ is a positive integer, and the answer may depend on $n$ . [b]p5.[/b] Suppose $x$ and $y$ are real numbers such that $0 < x < y$. Define a sequence$ A_0 , A_1 , A_2, A_3, ...$ by-setting $A_0 = x$ , $A_1 = y$ , and then $A_n= |A_{n-1}| - A_{n-2}$ for each $n \ge 2$ (recall that $|A_{n-1}|$ means the absolute value of $A_{n-1}$ ). (a) Find all possible values for $A_6$ in terms of $x$ and $y$ . (b) Find values of $x$ and $y$ so that $A_{1987} = 1987$ and $A_{1988} = -1988$ (simultaneously). PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Which is the least positive integer $n$ for which it is possible to find a (non-degenerate) $n$-gon with sidelengths $1, 2,. . . , n$, and where all vertices have integer coordinates?

Let $\triangle ABC$ be a scalene triangle, and let $D$ and $E$ be points on sides $AB$ and $AC$ respectively such that the circumcircles of triangles $\triangle ACD$ and $\triangle ABE$ are tangent to $BC$. Let $F$ be the intersection point of $BC$ and $DE$. Prove that $AF$ is perpendicular to the Euler line of $\triangle ABC$.

[b]Problem Section #4 b) Let $A$ be a unit square. What is the largest area of a triangle whose vertices lie on the perimeter of $A$? Justify your answer.

Let $ABC$ a triangle with circumcircle $\Gamma$ and $R$ a point inside $ABC$ such that $\angle ABR=\angle RBC$. Let $\Gamma_1$ and $\Gamma_2$ the circumcircles of triangles $ARB$ and $CRB$ respectly. The parallel to $AC$ that pass through $R$, intersect $\Gamma$ in $D$ and $E$, with $D$ on the same side of $BR$ that $A$ and $E$ on the same side of $BR$ that $C$. $AD$ intersect $\Gamma_1$ in $P$ and $CE$ intersect $\Gamma_2$ in $Q$. Prove that $APQC$ is cyclic if and only if $AB=BC$

Let $ABC$ be a triangle and $A_1, B_1, C_1$ points on $BC, CA, AB$, respectively, such that the lines $AA_1, BB_1, CC_1$ meet at a single point. It is known that $A, B_1, A_1, B$ are concyclic and $B, C_1, B_1, C$ are concyclic. Prove that a) $C, A_1, C_1, A$ are concyclic, b) $AA_1,, BB_1, CC_1$ are the heights of $ABC$.

[hide=Intro]The answers to each of the ten questions in this section are integers containing only the digits $ 1$ through $ 8$, inclusive. Each answer can be written into the grid on the answer sheet, starting from the cell with the problem number, and continuing across or down until the entire answer has been written. Answers may cross dark lines. If the answers are correctly filled in, it will be uniquely possible to write an integer from $ 1$ to $ 8$ in every cell of the grid, so that each number will appear exactly once in every row, every column, and every marked $2$ by $4$ box. You will get $7$ points for every correctly filled answer, and a $15$ point bonus for filling in every gridcell. It will help to work back and forth between the grid and the problems, although every problem is uniquely solvable on its own. Please write clearly within the boxes. No points will be given for a cell without a number, with multiple numbers, or with illegible handwriting.[/hide] [img]https://cdn.artofproblemsolving.com/attachments/9/b/f4db097a9e3c2602b8608be64f06498bd9d58c.png[/img] [b]1 ACROSS:[/b] Jack puts $ 10$ red marbles, $ 8$ green marbles and 4 blue marbles in a bag. If he takes out $11$ marbles, what is the expected number of green marbles taken out? [b]2 DOWN:[/b] What is the closest integer to $6\sqrt{35}$ ? [b]3 ACROSS: [/b]Alan writes the numbers $ 1$ to $64$ in binary on a piece of paper without leading zeroes. How many more times will he have written the digit $ 1$ than the digit $0$? [b]4 ACROSS:[/b] Integers a and b are chosen such that $-50 < a, b \le 50$. How many ordered pairs $(a, b)$ satisfy the below equation? $$(a + b + 2)(a + 2b + 1) = b$$ [b]5 DOWN: [/b]Zach writes the numbers $ 1$ through $64$ in binary on a piece of paper without leading zeroes. How many times will he have written the two-digit sequence “$10$”? [b]6 ACROSS:[/b] If you are in a car that travels at $60$ miles per hour, $\$1$ is worth $121$ yen, there are $8$ pints in a gallon, your car gets $10$ miles per gallon, a cup of coffee is worth $\$2$, there are 2 cups in a pint, a gallon of gas costs $\$1.50$, 1 mile is about $1.6$ kilometers, and you are going to a coffee shop 32 kilometers away for a gallon of coffee, how much, in yen, will it cost? [b]7 DOWN:[/b] Clive randomly orders the letters of “MIXING THE LETTERS, MAN”. If $\frac{p}{m^nq}$ is the probability that he gets “LMT IS AN EXTREME THING” where p and q are odd integers, and $m$ is a prime number, then what is $m + n$? [b]8 ACROSS:[/b] Joe is playing darts. A dartboard has scores of $10, 7$, and $4$ on it. If Joe can throw $12$ darts, how many possible scores can he end up with? [b]9 ACROSS:[/b] What is the maximum number of bounded regions that $6$ overlapping ellipses can cut the plane into? [b]10 DOWN:[/b] Let $ABC$ be an equilateral triangle, such that $A$ and $B$ both lie on a unit circle with center $O$. What is the maximum distance between $O$ and $C$? Write your answer be in the form $\frac{a\sqrt{b}}{c}$ where $b$ is not divisible by the square of any prime, and $a$ and $c$ share no common factor. What is $abc$ ? PS. You had better use hide for answers.

A square of side $n$ ($n$ natural) is divided into $n^2$ squares of side $1$. Each pair of "horizontal" boundary lines and each pair of "vertical" boundary lines enclose a rectangle (a square is also considered a rectangle). A rectangle has a length and a width; the width is less than or equal to the length. (a) Prove that there are $8$ rectangles of width $n - 1$. (b) Determine the number of rectangles with width $n -k$ ($0\le k \le n -1,k$ integer). (c) Determine a formula for $1^3 + 2^3 +...+ n^3$.

Let $ABCDA'B'C'D'$ be a right parallelepiped, $E$ and $F$ the projections of $A$ on the lines $A'D$, $A'C$, respectively, and $P, Q$ the projections of $B'$ on the lines $A'C'$ and $A'C$ Prove that a) the planes $(AEF)$ and $(B'PQ)$ are parallel b) the triangles $AEF$ and $B'PQ$ are similar.

In $\triangle{ABC}$ with side lengths $AB = 13$, $AC = 12$, and $BC = 5$, let $O$ and $I$ denote the circumcenter and incenter, respectively. A circle with center $M$ is tangent to the legs $AC$ and $BC$ and to the circumcircle of $\triangle{ABC}$. What is the area of $\triangle{MOI}$? $\textbf{(A)}\ 5/2\qquad\textbf{(B)}\ 11/4\qquad\textbf{(C)}\ 3\qquad\textbf{(D)}\ 13/4\qquad\textbf{(E)}\ 7/2$

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.

Let $AB$ and $CD$ be two parallel chords in a circle with radius $5$ such that the centre $O$ lies between these chords. Suppose $AB = 6, CD = 8$. Suppose further that the area of the part of the circle lying between the chords $AB$ and $CD$ is $(m\pi + n) / k$, where $m, n, k$ are positive integers with gcd$(m, n, k) = 1$. What is the value of $m + n + k$ ?

In cyclic quadrilateral $ABCD$, $\angle A+ \angle D=\frac{\pi}{2}$. $AC$ intersects $BD$ at ${E}$. A line ${l}$ cuts segment $AB, CD, AE, DE$ at $X, Y, Z, T$ respectively. If $AZ=CE$ and $BE=DT$, prove that the diameter of the circumcircle of $\triangle EZT$ equals $XY$.

For a fixed triangle $ABC$ we choose a point $M$ on the ray $CA$ (after $A$), a point $N$ on the ray $AB$ (after $B$) and a point $P$ on the ray $BC$ (after $C$) in a way such that $AM -BC = BN- AC = CP – AB$. Prove that the angles of triangle $MNP$ do not depend on the choice of $M, N, P$ .

As the Kubiks head homeward, away from the beach in the family van, Jerry decides to take a different route away from the beach than the one they took to get there. The route involves lots of twists and turns, prompting Hannah to wonder aloud if Jerry's "shortcut" will save any time at all. Michael offers up a problem as an analogy to his father's meandering: "Suppose dad drives around, making right-angled turns after $\textit{every}$ mile. What is the farthest he could get us from our starting point after driving us $500$ miles assuming that he makes exactly $300$ right turns?" "Sounds almost like an energy efficiency problem," notes Hannah only half jokingly. Hannah is always encouraging her children to think along these lines. Let $d$ be the answer to Michael's problem. Compute $\lfloor d\rfloor$.

The bisector of $ \angle BAC $ of a triangle $ ABC $ meet the segment $ BC $ at $ D. $ Through the midpoint of $ AD $ passes aline that intersects $ AB,AC $ at $ M,N, $ respectively. Show that: $$ \frac{1}{MA}+\frac{1}{NA} =2\left( \frac{1}{AB} +\frac{1}{AC} \right) $$ [i]Toni Mihalcea[/i]

Let $ABC$ be an acute triangle with $AB<BC$. Let $I$ be the incenter of $ABC$, and let $\omega$ be the circumcircle of $ABC$. The incircle of $ABC$ is tangent to the side $BC$ at $K$. The line $AK$ meets $\omega$ again at $T$. Let $M$ be the midpoint of the side $BC$, and let $N$ be the midpoint of the arc $BAC$ of $\omega$. The segment $NT$ intersects the circumcircle of $BIC$ at $P$. Prove that $PM\parallel AK$.

On the sides of triangle \( ABC \), points \( D_1, D_2, E_1, E_2, F_1, F_2 \) are chosen such that when going around the triangle, the points occur in the order \( A, F_1, F_2, B, D_1, D_2, C, E_1, E_2 \). It is given that \[ AD_1 = AD_2 = BE_1 = BE_2 = CF_1 = CF_2. \] Prove that the perimeters of the triangles formed by the lines \( AD_1, BE_1, CF_1 \) and \( AD_2, BE_2, CF_2 \) are equal.

Let $ABC$ be a triangle. Points $D, E, F$ are on segments $BC$, $CA$, $AB$, respectively. Suppose that $AF = 10$, $F B = 10$, $BD = 12$, $DC = 17$, $CE = 11$, and $EA = 10$. Suppose that the circumcircles of $\vartriangle BFD$ and $\vartriangle CED$ intersect again at $X$. Find the circumradius of $\vartriangle EXF$.

The base of a pyramid $ABCDV$ is a rectangle $ABCD$ with the sides $AB=a$ and $BC=b$, and all lateral edges of the pyramid have length $c$. Find the area of the intersection of the pyramid with a plane that contains the diagonal $BD$ and is parallel to $VA$.

There are four circles. The chord$ AB$ is drawn in the first one, and the distance from the midpoint of the smaller of the two formed arcs to $AB$ is equal to $1$. The second, third and fourth circles are located inside the larger segment and touch the chord $AB$. The second and fourth circles touch internally the first and externally the third. The sum of the radii of the last three circles is equal to the radius of the first circle. Find the radius of the third circle if it is known that the line passing through the centers of the first and third circles is not parallel to the line passing through the centers of the other two circles.

In a triangle $ABC$ let $D$ be the intersection of the angle bisector of $\gamma$, angle at $C$, with the side $AB.$ And let $F$ be the area of the triangle $ABC.$ Prove the following inequality: \[2 \cdot \ F \cdot \left( \frac{1}{AD} -\frac{1}{BD} \right) \leq AB.\]

Given $19$ points in the plane with integer coordinates, no three collinear, show that we can always find three points whose centroid has integer coordinates.

Prove that for each $n \ge 4$ a parallelogram can be dissected in $n$ cyclic quadrilaterals.

$AB=CD,AD \parallel BC$ and $AD>BC$. $\Omega$ is circumcircle of $ABCD$. Point $E$ is on $\Omega$ such that $BE \perp AD$. Prove that $AE+BC>DE$