At Stanford in 1988, human calculator Shakuntala Devi was asked to compute $m = \sqrt[3]{61{,}629{,}875}$ and $n = \sqrt[7]{170{,}859{,}375}$. Given that $m$ and $n$ are both integers, compute $100m+n$. [i]Proposed by Evan Chen[/i]

Hamilton Avenue has eight houses. On one side of the street are the houses numbered 1,3,5,7 and directly opposite are houses 2,4,6,8 respectively. An eccentric postman starts deliveries at house 1 and delivers letters to each of the houses, finally returning to house 1 for a cup of tea. Throughout the entire journey he must observe the following rules. The numbers of the houses delivered to must follow an odd-even-odd-even pattern throughout, each house except house 1 is visited exactly once (house 1 is visited twice) and the postman at no time is allowed to cross the road to the house directly opposite. How many different delivery sequences are possible?

The incircle of a triangle $ABC$ touches the sides $BC,CA,AB$ at points $D,E,F$, respectively. Let $X$ be a point on the incircle, different from the points $D,E,F$. The lines $XD$ and $EF,XE$ and $FD,XF$ and $DE$ meet at points $J,K,L$, respectively. Let further $M,N,P$ be points on the sides $BC,CA,AB$, respectively, such that the lines $AM,BN,CP$ are concurrent. Prove that the lines $JM,KN$ and $LP$ are concurrent. [i]Dinu Serbanescu[/i]

a. Does there exist 4 distinct positive integers such that the sum of any 3 of them is prime? b. Does there exist 5 distinct positive integers such that the sum of any 3 of them is prime?

Let $n\ge 3$ be an integer and let $A_{1}, A_{2},\dots, A_{n}$ be $n$ distinct subsets of $S=\{1, 2,\dots, n\}$. Show that there exists $x\in S$ such that the n subsets $A_{i}-\{x\}, i=1,2,\dots n$ are also disjoint. what i have is [hide="this"]we may assume that the union of the $A_{i}$s is $S$. [/hide]

Here is a problem given at the mathematical test at some school: [i]The hypotenuse of the right triangle is 12 inches. The height (distance from the opposite vertex to the hypotenuse) is 12 inches. Find the area of the triangle[/i] Everybody in the class got the answer $42$ square inches, except for the two best students. Can you explain why the two best students could not get the same answer as the majority?

Find the last three digits of the product of the positive roots of \[ \sqrt{1995}x^{\log_{1995}x}=x^2. \]

Rob is helping to build the set for a school play. For one scene, he needs to build a multi-colored tetrahedron out of cloth and bamboo. He begins by fitting three lengths of bamboo together, such that they meet at the same point, and each pair of bamboo rods meet at a right angle. Three more lengths of bamboo are then cut to connect the other ends of the first three rods. Rob then cuts out four triangular pieces of fabric: a blue piece, a red piece, a green piece, and a yellow piece. These triangular pieces of fabric just fill in the triangular spaces between the bamboo, making up the four faces of the tetrahedron. The areas in square feet of the red, yellow, and green pieces are $60$, $20$, and $15$ respectively. If the blue piece is the largest of the four sides, find the number of square feet in its area.

Let $ f$ be a function from the real numbers to the real numbers such that $ f(1) \equal{} 1, f(a\plus{}b) \equal{} f(a)\plus{}f(b)$ for all $ a, b,$ and $ f(x)f \left( \frac{1}{x} \right) \equal{} 1$ for all $ x \neq 0.$ Prove that $ f(x) \equal{} x$ for all real numbers $ x.$

Prove that for positive real numbers $x$, $y$, $z$, \[ x^3(y^2+z^2)^2 + y^3(z^2+x^2)^2+z^3(x^2+y^2)^2 \geq xyz\left[xy(x+y)^2 + yz(y+z)^2 + zx(z+x)^2\right].\] [i]Zarathustra (Zeb) Brady.[/i]

Find the sum of all positive integers $n$ such that \[ \frac{2n+1}{n(n-1)} \] has a terminating decimal representation. [i]Proposed by Evan Chen[/i]

Let $ a_0,a_1,\dots,a_{n \plus{} 1}$ be natural numbers such that $ a_0 \equal{} a_{n \plus{} 1} \equal{} 1$, $ a_i>1$ for all $ 1\leq i \leq n$, and for each $ 1\leq j\leq n$, $ a_i|a_{i \minus{} 1} \plus{} a_{i \plus{} 1}$. Prove that there exist one $ 2$ in the sequence.

Consider the region $A$ in the complex plane that consists of all points $z$ such that both $\frac{z}{40}$ and $\frac{40}{\overline{z}}$ have real and imaginary parts between $0$ and $1$, inclusive. What is the integer that is nearest the area of $A$?

Let $A$ be the largest subset of $\{1,\dots,n\}$ such that for each $x\in A$, $x$ divides at most one other element in $A$. Prove that \[\frac{2n}3\leq |A|\leq \left\lceil \frac{3n}4\right\rceil. \]

A finite set of points $P$ in the plane has the following property: Every line through two points in $P$ contains at least one more point belonging to $P$. Prove that all points in $P$ lie on a straight line. [hide="Remark."]This may be a well known theorem called "Sylvester Gallai", but I didn't find this problem (I mean, exactly this one) using search function. So please discuss about the problem here, in this topic. Thanks :) [/hide]

A right circular cone has base radius $ r$ and height $ h$. The cone lies on its side on a flat table. As the cone rolls on the surface of the table without slipping, the point where the cone's base meets the table traces a circular arc centered at the point where the vertex touches the table. The cone first returns to its original position on the table after making $ 17$ complete rotations. The value of $ h/r$ can be written in the form $ m\sqrt {n}$, where $ m$ and $ n$ are positive integers and $ n$ is not divisible by the square of any prime. Find $ m \plus{} n$.

Let $ABC$ be a triangle such that $|AC|>|AB|$. Let $X$ be on line $AB$ (closer to $A$) such that $|BX|=|AC|$ and let $Y$ be on the segment $AC$ such that $|CY|=|AB|$. Intersection of lines $XY$ and bisector of $BC$ is point $P$. Prove that $\angle BPC+\angle BAC = 180^\circ$.

Define a search algorithm called $\texttt{powSearch}$. Throughout, assume $A$ is a 1-indexed sorted array of distinct integers. To search for an integer $b$ in this array, we search the indices $2^0,2^1,\ldots$ until we either reach the end of the array or $A[2^k] > b$. If at any point we get $A[2^k] = b$ we stop and return $2^k$. Once we have $A[2^k] > b > A[2^{k-1}]$, we throw away the first $2^{k-1}$ elements of $A$, and recursively search in the same fashion. For example, for an integer which is at position $3$ we will search the locations $1, 2, 4, 3$. Define $g(x)$ to be a function which returns how many (not necessarily distinct) indices we look at when calling $\texttt{powSearch}$ with an integer $b$ at position $x$ in $A$. For example, $g(3) = 4$. If $A$ has length $64$, find \[g(1) + g(2) + \ldots + g(64).\]

[color=darkred]A circle $ \Omega_1$ is tangent outwardly to the circle $ \Omega_2$ of bigger radius. Line $ t_1$ is tangent at points $ A$ and $ D$ to the circles $ \Omega_1$ and $ \Omega_2$ respectively. Line $ t_2$, parallel to $ t_1$, is tangent to the circle $ \Omega_1$ and cuts $ \Omega_2$ at points $ E$ and $ F$. Point $ C$ belongs to the circle $ \Omega_2$ such that $ D$ and $ C$ are separated by the line $ EF$. Denote $ B$ the intersection of $ EF$ and $ CD$. Prove that circumcircle of $ ABC$ is tangent to the line $ AD$.[/color]

Let $T$ be a non-empty finite subset of positive integers $\ge 1$. A subset $S$ of $T$ is called [b]good [/b] if for every integer $t\in T$ there exists an $s$ in $S$ such that $gcd(t,s) >1$. Let \[A={(X,Y)\mid X\subseteq T,Y\subseteq T,gcd(x,y)=1 \text{for all} x\in X, y\in Y}\] Prove that : $a)$ If $X_0$ is not [b]good[/b] then the number of pairs $(X_0,Y)$ in $A$ is [b]even[/b]. $b)$ the number of good subsets of $T$ is [b]odd[/b].

Find all pairs $(a, b)$ of positive integers such that \[ 3^a = 2b^2 + 1. \]

show that $\frac1{15} < \frac12\cdot\frac34\cdots\frac{99}{100} < \frac1{10}$

A positive integer $ n$ is given. In an association consisting of $ n$ members work $ 6$ commissions. Each commission contains at least $ \large \frac{n}{4}$ persons. Prove that there exist two commissions containing at least $ \large \frac{n}{30}$ persons in common.

Prove that for any non-zero real numbers $a, b, c,$ \[\frac{(b+c-a)^2}{(b+c)^2+a^2} + \frac{(c+a-b)^2}{(c+a)^2+b^2} + \frac{(a+b-c)^2}{(a+b)^2+c^2} \geq \frac 35.\]

Let $a$ and $b$ be positive integers, $b<a$, such that $a^3+b^3+ab$ is divisible by $ab(a-b)$. Prove that $ab$ is a perfect cube.