Find $[ \sqrt{19992000}]$ where $[a]$ is the greatest integer less than or equal to $x$.

Let three lines forming a triangle $ABC$ be given. Using a two-sided ruler and drawing at most eight lines construct a point $D$ on the side $AB$ such that $\frac{AD}{BD}=\frac{BC}{AC}.$

Find the least positive integer $n$, such that there is a polynomial \[ P(x) = a_{2n}x^{2n}+a_{2n-1}x^{2n-1}+\dots+a_1x+a_0 \] with real coefficients that satisfies both of the following properties: - For $i=0,1,\dots,2n$ it is $2014 \leq a_i \leq 2015$. - There is a real number $\xi$ with $P(\xi)=0$.

[b]p1.[/b] Suppose $\frac{x}{y} = 0.\overline{ab}$ where $x$ and $y$ are relatively prime positive integers and $ab + a + b + 1$ is a multiple of $12$. Find the sum of all possible values of $y$. [b]p2.[/b] Let $A$ be the set of points $\{(0, 0), (2, 0), (0, 2),(2, 2),(3, 1),(1, 3)\}$. How many distinct circles pass through at least three points in $A$? [b]p3.[/b] Jack and Jill need to bring pails of water home. The river is the $x$-axis, Jack is initially at the point $(-5, 3)$, Jill is initially at the point $(6, 1)$, and their home is at the point $(0, h)$ where $h > 0$. If they take the shortest paths home given that each of them must make a stop at the river, they walk exactly the same total distance. What is $h$? [b]p4.[/b] What is the largest perfect square which is not a multiple of $10$ and which remains a perfect square if the ones and tens digits are replaced with zeroes? [b]p5.[/b] In convex polygon $P$, each internal angle measure (in degrees) is a distinct integer. What is the maximum possible number of sides $P$ could have? [b]p6.[/b] How many polynomials $p(x)$ of degree exactly $3$ with real coefficients satisfy $$p(0), p(1), p(2), p(3) \in \{0, 1, 2\}?$$ [b]p7.[/b] Six spheres, each with radius $4$, are resting on the ground. Their centers form a regular hexagon, and adjacent spheres are tangent. A seventh sphere, with radius $13$, rests on top of and is tangent to all six of these spheres. How high above the ground is the center of the seventh sphere? [b]p8.[/b] You have a paper square. You may fold it along any line of symmetry. (That is, the layers of paper must line up perfectly.) You then repeat this process using the folded piece of paper. If the direction of the folds does not matter, how many ways can you make exactly eight folds while following these rules? [b]p9.[/b] Quadrilateral $ABCD$ has $\overline{AB} = 40$, $\overline{CD} = 10$, $\overline{AD} = \overline{BC}$, $m\angle BAD = 20^o$, and $m \angle ABC = 70^o$. What is the area of quadrilateral $ABCD$? [b]p10.[/b] We say that a permutation $\sigma$ of the set $\{1, 2,..., n\}$ preserves divisibilty if $\sigma (a)$ divides $\sigma (b)$ whenever $a$ divides $b$. How many permutations of $\{1, 2,..., 40\}$ preserve divisibility? (A permutation of $\{1, 2,..., n\}$ is a function $\sigma$ from $\{1, 2,..., n\}$ to itself such that for any $b \in \{1, 2,..., n\}$, there exists some $a \in \{1, 2,..., n\}$ satisfying $\sigma (a) = b$.) [b]p11.[/b] In the diagram shown at right, how many ways are there to remove at least one edge so that some circle with an “A” and some circle with a “B” remain connected? [img]https://cdn.artofproblemsolving.com/attachments/8/7/fde209c63cc23f6d3482009cc6016c7cefc868.png[/img] [b]p12.[/b] Let $S$ be the set of the $125$ points in three-dimension space of the form $(x, y, z)$ where $x$, $y$, and $z$ are integers between $1$ and $5$, inclusive. A family of snakes lives at the point $(1, 1, 1)$, and one day they decide to move to the point $(5, 5, 5)$. Snakes may slither only in increments of $(1,0,0)$, $(0, 1, 0)$, and $(0, 0, 1)$. Given that at least one snake has slithered through each point of $S$ by the time the entire family has reached $(5, 5, 5)$, what is the smallest number of snakes that could be in the family? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

How do I prove that, for every $a, b, c$ positive real numbers such that $a+b+c = 1$ the following inequality holds: $\frac{a^3}{a^2+b^2} +\frac{b^3}{b^2+c^2} +\frac {c^3}{c^2+a^2} \geq \frac{1}{2}$?

Let $ABC$ be a triangle with $\angle BAC > 90 ^{\circ}$, and let $O$ be its circumcenter and $\omega$ be its circumcircle. The tangent line of $\omega$ at $A$ intersects the tangent line of $\omega$ at $B$ and $C$ respectively at point $P$ and $Q$. Let $D,E$ be the feet of the altitudes from $P,Q$ onto $BC$, respectively. $F,G$ are two points on $\overline{PQ}$ different from $A$, so that $A,F,B,E$ and $A,G,C,D$ are both concyclic. Let M be the midpoint of $\overline{DE}$. Prove that $DF,OM,EG$ are concurrent.

Find all triples $(x, y, z)$ of positive integers such that \[x^2 + 4^y = 5^z. \] [i]Proposed by Li4 and ltf0501[/i]

Let $a,b,c$ be positive reals such that $a^2+b^2+c^2=3abc$. Prove that \[\frac{a}{b^2c^2}+\frac{b}{c^2a^2}+\frac{c}{a^2b^2} \geq \frac{9}{a+b+c}\]

The price for sending a packet (a rectangular cuboid) is directly proportional to the sum of its length, width, and height. Is it possible to reduce the cost of sending a packet by putting it into a cheaper packet?

Construct a square from four points, one on each side.

Two masses are connected with spring constant $k$. The masses have magnitudes $m$ and $M$. The center-of-mass of the system is fixed. If $ k = \text {100 N/m} $ and $m=\dfrac{1}{2}M=\text{1 kg}$, let the ground state energy of the system be $E$. If $E$ can be expressed in the form $ a \times 10^p $ eV (electron-volts), find the ordered pair $(a,p)$, where $ 0 < a < 10 $, and it is rounded to the nearest positive integer and $p$ is an integer. For example, $ 4.2 \times 10^7 $ should be expressed as $(4,7)$. [i](Trung Phan, 10 points)[/i]

okay this one is from Prof. Mircea Lascu from Zalau, Romaniaand Prof. V. Cartoaje from Ploiesti, Romania. It goes like this: given being a triangle ABC for every point M inside we construct the points A[size=67]M[/size], B[size=67]M[/size], C[size=67]M[/size] on the circumcircle of the triangle ABC such that A, A[size=67]M[/size], M are collinear and so on. Find the locus of these points M for which the area of the triangle A[size=67]M[/size] B[size=67]M[/size] C[size=67]M[/size] is bigger than the area of the triangle ABC.

Let $N$ be the number of sequences of natural numbers $d_1,d_2,\dots,d_{10}$ such that the following conditions hold: $d_1|d_2$, $\dots$, $d_9|d_{10}$ and $d_{10}|6^{2018}$. Evaluate the remainder when $N$ is divided by $2017$.

Determine all pairs of prime numbers $(p, q)$ such that $p^2 + 5pq + 4q^2$ is a square of an integer.

You have a pencil, paper and an angle of $19$ degrees made out of two equal very thin sticks. Can you construct an angle of $1$ degree using only these tools?

Let $ G $ be a countably infinite, $ d $ -regular, connected, vertex-transitive graph. Show that there is a complete pairing in $ G $.

The siblings Robb, Arya and Sansa have received seven sealed bags from an unknown donor with varying number of beads. Six of the bags have labels indicating the number beads: $7, 9, 11, 13, 15, 18$, but the seventh bag lacks etiquette. The sensor has set certain requirements: Robb must have three bags and his sisters two bags each. In addition, Arya will have the bag that contains $7$ beads. The bags should be distributed so that each of the siblings get the same number of pearls (this is possible according to the donor). How many pearls are there in the bag without a label, how many pearls are there in total and how should the bags be distributed?

Suppose $S=\{1,2,3,...,2017\}$,for every subset $A$ of $S$,define a real number $f(A)\geq 0$ such that: $(1)$ For any $A,B\subset S$,$f(A\cup B)+f(A\cap B)\leq f(A)+f(B)$; $(2)$ For any $A\subset B\subset S$, $f(A)\leq f(B)$; $(3)$ For any $k,j\in S$,$$f(\{1,2,\ldots,k+1\})\geq f(\{1,2,\ldots,k\}\cup \{j\});$$ $(4)$ For the empty set $\varnothing$, $f(\varnothing)=0$. Confirm that for any three-element subset $T$ of $S$,the inequality $$f(T)\leq \frac{27}{19}f(\{1,2,3\})$$ holds.

[i]Version 1[/i]. Let $n$ be a positive integer, and set $N=2^{n}$. Determine the smallest real number $a_{n}$ such that, for all real $x$, \[ \sqrt[N]{\frac{x^{2 N}+1}{2}} \leqslant a_{n}(x-1)^{2}+x . \] [i]Version 2[/i]. For every positive integer $N$, determine the smallest real number $b_{N}$ such that, for all real $x$, \[ \sqrt[N]{\frac{x^{2 N}+1}{2}} \leqslant b_{N}(x-1)^{2}+x . \]

In the $[ABCD]$ tetrahedron having all the faces acute angled triangles, is denoted by $r_X$, $R_X$ the radius lengths of the circle inscribed and circumscribed respectively on the face opposite to the $X \in \{A,B,C,D\}$ peak, and with $R$ the length of the radius of the sphere circumscribed to the tetrahedron. Show that inequality occurs$$8R^2 \geq (r_A + R_A)^2 + (r_B + R_B)^2 + (r_C + R_C)^2 + (r_D + R_D)^2$$

We are given a triangle $ABC$ and three rectangles $R_1,R_2,R_3$ with sides parallel to two fixed perpendicular directions and such that their union covers the sides $AB,BC$, and $CA$; i.e., each point on the perimeter of $ABC$ is contained in or on at least one of the rectangles. Prove that all points inside the triangle are also covered by the union of $R_1,R_2,R_3.$

Find the integer part of $ \frac{1}{\sqrt1}+\frac{1}{\sqrt2}+\frac{1}{\sqrt3}+...+\frac{1}{\sqrt{1000}} $

Let $ABCD$ be a convex quadrilateral with $AB$ is not parallel to $CD$ Circle $\Gamma_{1}$ with center $O_1$ passes through $A$ and $B$, and touches segment $CD$ at $P$. Circle $\Gamma_{2}$ with center $O_2$ passes through $C$ and $D$, and touches segment $AB$ at $Q$. Let $E$ and $F$ be the intersection of circles $\Gamma_{1}$ and $\Gamma_{2}$. Prove that $EF$ bisects segment $PQ$ if and only if $BC$ is parallel to $AD$.

Find $A^2$, where $A$ is the sum of the absolute values of all roots of the following equation: \begin{eqnarray*}x &=& \sqrt{19} + \frac{91}{{\displaystyle \sqrt{19}+\frac{91}{{\displaystyle \sqrt{19}+\frac{91}{{\displaystyle \sqrt{19}+\frac{91}{{\displaystyle \sqrt{19}+\frac{91}{x}}}}}}}}}\end{eqnarray*}

Andover has a special weather forecast this week. On Monday, there is a $\frac{1}{2}$ chance of rain. On Tuesday, there is a $\frac{1}{3}$ chance of rain. This pattern continues all the way to Sunday, when there is a $\frac{1}{8}$ chance of rain. The probability that it doesn't rain in Andover all week can be expressed as $\frac{m}{n}$ for relatively prime positive integers $m$ and $n$. Compute $m+n$. [i]Proposed by Nathan Xiong[/i]