Consider the set of all triangles $ OPQ$ where $ O$ is the origin and $ P$ and $ Q$ are distinct points in the plane with nonnegative integer coordinates $ (x,y)$ such that $ 41x\plus{}y \equal{} 2009$. Find the number of such distinct triangles whose area is a positive integer.

A collection of circles in the upper half-plane, all tangent to the $x$-axis, is constructed in layers as follows. Layer $L_0$ consists of two circles of radii $70^2$ and $73^2$ that are externally tangent. For $k\geq 1$, the circles in $\textstyle\bigcup_{j=0}^{k-1} L_j$ are ordered according to their points of tangency with the $x$-axis. For every pair of consecutive circles in this order, a new circle is constructed externally tangent to each of the two circles in the pair. Layer $L_k$ consists of the $2^{k-1}$ circles constructed in this way. Let $S=\textstyle\bigcup_{j=0}^6 L_j$, and for every circle $C$ denote by $r(C)$ its radius. What is \[\sum_{C\in S}\dfrac1{\sqrt{r(C)}}?\] [asy] import olympiad; size(350); defaultpen(linewidth(0.7)); // define a bunch of arrays and starting points pair[] coord = new pair[65]; int[] trav = {32,16,8,4,2,1}; coord[0] = (0,73^2); coord[64] = (2*73*70,70^2); // draw the big circles and the bottom line path arc1 = arc(coord[0],coord[0].y,260,360); path arc2 = arc(coord[64],coord[64].y,175,280); fill((coord[0].x-910,coord[0].y)--arc1--cycle,gray(0.78)); fill((coord[64].x+870,coord[64].y+425)--arc2--cycle,gray(0.78)); draw(arc1^^arc2); draw((-930,0)--(70^2+73^2+850,0)); // We now apply the findCenter function 63 times to get // the location of the centers of all 63 constructed circles. // The complicated array setup ensures that all the circles // will be taken in the right order for(int i = 0;i<=5;i=i+1) { int skip = trav[i]; for(int k=skip;k<=64 - skip; k = k + 2*skip) { pair cent1 = coord[k-skip], cent2 = coord[k+skip]; real r1 = cent1.y, r2 = cent2.y, rn=r1*r2/((sqrt(r1)+sqrt(r2))^2); real shiftx = cent1.x + sqrt(4*r1*rn); coord[k] = (shiftx,rn); } // Draw the remaining 63 circles } for(int i=1;i<=63;i=i+1) { filldraw(circle(coord[i],coord[i].y),gray(0.78)); }[/asy] $\textbf{(A) }\dfrac{286}{35}\qquad\textbf{(B) }\dfrac{583}{70}\qquad\textbf{(C) }\dfrac{715}{73}\qquad\textbf{(D) }\dfrac{143}{14}\qquad\textbf{(E) }\dfrac{1573}{146}$

A dartboard is the region B in the coordinate plane consisting of points $(x, y)$ such that $|x| + |y| \le 8$. A target T is the region where $(x^2 + y^2 - 25)^2 \le 49$. A dart is thrown at a random point in B. The probability that the dart lands in T can be expressed as $\frac{m}{n} \pi$, where $m$ and $n$ are relatively prime positive integers. What is $m + n$? $ \textbf{(A) }39 \qquad \textbf{(B) }71 \qquad \textbf{(C) }73 \qquad \textbf{(D) }75 \qquad \textbf{(E) }135 \qquad $

Let $\alpha>1$ and consider the function $f(x)=x^{\alpha}$ for $x \ge 0$. For $t>0$, define $M(t)$ as the largest area that a triangle with vertices $(0, 0), (s, f(s)), (t, f(t))$ could reach, for $s \in (0,t)$. Let $A(t)$ be the area of the region bounded by the segment with endpoints $(0, 0)$ ,$(t, f(t))$ and the graph of $y =f(x)$. (a) Show that $A(t)/M(t)$ does not depend on $t$. We denote this value by $c(\alpha)$. Find $c(\alpha)$. (b) Determine the range of values of $c(\alpha)$ when $\alpha$ varies in the interval $(1, +\infty)$. [hide=Note]Google translated from [url=http://ciim.uan.edu.co/ciim-2020-pruebas-virtuales/pruebas-virtuales]http://ciim.uan.edu.co/ciim-2020-pruebas-virtuales/pruebas-virtuales[/url][/hide]

In triangle $ABC$, $AB=\frac{20}{11} AC$. The angle bisector of $\angle A$ intersects $BC$ at point $D$, and point $M$ is the midpoint of $AD$. Let $P$ be the point of the intersection of $AC$ and $BM$. The ratio of $CP$ to $PA$ can be expressed in the form $\dfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

Jenny and Kenny are walking in the same direction, Kenny at 3 feet per second and Jenny at 1 foot per second, on parallel paths that are 200 feet apart. A tall circular building 100 feet in diameter is centered midway between the paths. At the instant when the building first blocks the line of sight between Jenny and Kenny, they are 200 feet apart. Let $t$ be the amount of time, in seconds, before Jenny and Kenny can see each other again. If $t$ is written as a fraction in lowest terms, what is the sum of the numerator and denominator?

A grasshopper is jumping about in a grid. From the point with coordinates $(a, b)$ it can jump to either $(a + 1, b),(a + 2, b),(a + 1, b + 1),(a, b + 2)$ or $(a, b + 1)$. In how many ways can it reach the line $x + y = 2014?$ Where the grasshopper starts in $(0, 0)$.

Find the sum of the x-coordinates of the distinct points of intersection of the plane curves given by $x^2 = x + y + 4$ and $y^2 = y - 15x + 36$.

The ellipsoid $E$ is contained in the simplex $S$, which is located in the unit ball B space $R^n$. Prove that the sum of the principal semi-axes of the ellipsoid $E$ is no more than units.

Sum of $m$ pairwise different positive even numbers and $n$ pairwise different positive odd numbers is equal to $1987$. Find, with proof, the maximum value of $3m+4n$.

For a function $f(x)\ (x\geq 1)$ satisfying $f(x)=(\log_e x)^2-\int_1^e \frac{f(t)}{t}dt$, answer the questions as below. (a) Find $f(x)$ and the $y$-coordinate of the inflection point of the curve $y=f(x)$. (b) Find the area of the figure bounded by the tangent line of $y=f(x)$ at the point $(e,\ f(e))$, the curve $y=f(x)$ and the line $x=1$.

We say that a real number $V$ is [i]good[/i] if there exist two closed convex subsets $X$, $Y$ of the unit cube in $\mathbb{R}^3$, with volume $V$ each, such that for each of the three coordinate planes (that is, the planes spanned by any two of the three coordinate axes), the projections of $X$ and $Y$ onto that plane are disjoint. Find $\sup \{V\mid V\ \text{is good}\}$.

The solution of the equations \begin{align*} 2x-3y&=7 \\ 4x-6y &=20 \\ \end{align*} is: $ \textbf{(A)}\ x=18, y=12 \qquad \textbf{(B)}\ x=0, y=0 \qquad \textbf{(C)}\ \text{There is no solution} \\ \textbf{(D)}\ \text{There are an unlimited number of solutions} \qquad \textbf{(E)}\ x=8, y=5$

On a blank paper there were drawn two perpendicular axes $x$ and $y$ with the same scale. The graph of a function $y=f(x)$ was drawn in this coordinate system. Then the $y$ axis and all the scale marks on the $x$ axis were erased. Provide a way how to draw again the $y$ axis using pencil, ruler and compass: (a) $f(x)= 3^x$; (b) $f(x)= \log_a x$, where $a>1$ is an unknown number.

A triangle has vertices $P=(-8,5)$, $Q=(-15,-19)$, and $R=(1,-7)$. The equation of the bisector of $\angle P$ can be written in the form $ax+2y+c=0$. Find $a+c$.

In convex hexagonal pyramid 11 edges are equal to 1.Find all possible values of 12th edge.

Functions $ f$ and $ g$ are quadratic, $ g(x) \equal{} \minus{} f(100 \minus{} x)$, and the graph of $ g$ contains the vertex of the graph of $ f$. The four $ x$-intercepts on the two graphs have $ x$-coordinates $ x_1$, $ x_2$, $ x_3$, and $ x_4$, in increasing order, and $ x_3 \minus{} x_2 \equal{} 150$. The value of $ x_4 \minus{} x_1$ is $ m \plus{} n\sqrt p$, where $ m$, $ n$, and $ p$ are positive integers, and $ p$ is not divisible by the square of any prime. What is $ m \plus{} n \plus{} p$? $ \textbf{(A)}\ 602\qquad \textbf{(B)}\ 652\qquad \textbf{(C)}\ 702\qquad \textbf{(D)}\ 752\qquad \textbf{(E)}\ 802$

Cities $A$, $B$, $C$, $D$, and $E$ are connected by roads $\widetilde{AB}$, $\widetilde{AD}$, $\widetilde{AE}$, $\widetilde{BC}$, $\widetilde{BD}$, $\widetilde{CD}$, $\widetilde{DE}$. How many different routes are there from $A$ to $B$ that use each road exactly once? (Such a route will necessarily visit cities more than once.) [asy]unitsize(10mm); defaultpen(linewidth(1.2pt)+fontsize(10pt)); dotfactor=4; pair A=(1,0), B=(4.24,0), C=(5.24,3.08), D=(2.62,4.98), E=(0,3.08); dot (A); dot (B); dot (C); dot (D); dot (E); label("$A$",A,S); label("$B$",B,SE); label("$C$",C,E); label("$D$",D,N); label("$E$",E,W); guide squiggly(path g, real stepsize, real slope=45) { real len = arclength(g); real step = len / round(len / stepsize); guide squig; for (real u = 0; u < len; u += step){ real a = arctime(g, u); real b = arctime(g, u + step / 2); pair p = point(g, a); pair q = point(g, b); pair np = unit( rotate(slope) * dir(g,a)); pair nq = unit( rotate(0 - slope) * dir(g,b)); squig = squig .. p{np} .. q{nq}; } squig = squig .. point(g, length(g)){unit(rotate(slope)*dir(g,length(g)))}; return squig; } pen pp = defaultpen + 2.718; draw(squiggly(A--B, 4.04, 30), pp); draw(squiggly(A--D, 7.777, 20), pp); draw(squiggly(A--E, 5.050, 15), pp); draw(squiggly(B--C, 5.050, 15), pp); draw(squiggly(B--D, 4.04, 20), pp); draw(squiggly(C--D, 2.718, 20), pp); draw(squiggly(D--E, 2.718, -60), pp); [/asy] $ \textbf{(A)}\ 7 \qquad \textbf{(B)}\ 9\qquad\textbf{(C)}\ 12\qquad\textbf{(D)}\ 16\qquad\textbf{(E)}\ 18 $

A set $M$ consists of $n$ elements. Find the greatest $k$ for which there is a collection of $k$ subsets of $M$ such that for any subsets $A_{1},...,A_{j}$ from the collection, there is an element belonging to an odd number of them

([b]3[/b]) Let $ \ell$ be the line through $ (0,0)$ and tangent to the curve $ y \equal{} x^3 \plus{} x \plus{} 16$. Find the slope of $ \ell$.

A piece of graph paper is folded once so that $ (0,2)$ is matched with $ (4,0)$ and $ (7,3)$ is matched with $ (m,n)$. Find $ m \plus{} n$. $ \textbf{(A)}\ 6.7\qquad \textbf{(B)}\ 6.8\qquad \textbf{(C)}\ 6.9\qquad \textbf{(D)}\ 7.0\qquad \textbf{(E)}\ 8.0$

Let $p$ be an odd prime and $n$ a positive integer. In the coordinate plane, eight distinct points with integer coordinates lie on a circle with diameter of length $p^{n}$. Prove that there exists a triangle with vertices at three of the given points such that the squares of its side lengths are integers divisible by $p^{n+1}$. [i]Proposed by Alexander Ivanov, Bulgaria[/i]

Let $ABCD$ be a convex quadrilateral with $AD\not\parallel BC$. Define the points $E=AD \cap BC$ and $I = AC\cap BD$. Prove that the triangles $EDC$ and $IAB$ have the same centroid if and only if $AB \parallel CD$ and $IC^{2}= IA \cdot AC$. [i]Virgil Nicula[/i]

Let $ S$ be the set of all points with coordinates $ (x,y,z)$, where $ x, y,$ and $ z$ are each chosen from the set $ \{ 0, 1, 2\}$. How many equilateral triangles have all their vertices in $ S$? $ \textbf{(A)}\ 72 \qquad \textbf{(B)}\ 76 \qquad \textbf{(C)}\ 80 \qquad \textbf{(D)}\ 84 \qquad \textbf{(E)}\ 88$

Let $ A$ and $ B$ be fixed distinct points on the $ X$ axis, none of which coincides with the origin $ O(0, 0),$ and let $ C$ be a point on the $ Y$ axis of an orthogonal Cartesian coordinate system. Let $ g$ be a line through the origin $ O(0, 0)$ and perpendicular to the line $ AC.$ Find the locus of the point of intersection of the lines $ g$ and $ BC$ if $ C$ varies along the $ Y$ axis. Give an equation and a description of the locus.