It is given a plane with a coordinate system with a beginning at the point $O$. $A(n)$, when $n$ is a natural number is a count of the points with whole coordinates which distances to $O$ are less than or equal to $n$. (a) Find $$\ell=\lim_{n\to\infty}\frac{A(n)}{n^2}.$$ (b) For which $\beta$ $(1<\beta<2)$ does the following limit exist? $$\lim_{n\to\infty}\frac{A(n)-\pi n^2}{n^\beta}$$

Let $n$ be a positive integer and $x$ positive real number such that none of numbers $x,2x,\dots,nx$ and none of $\frac{1}{x},\frac{2}{x},\dots,\frac{\left\lfloor nx\right\rfloor }{x}$ is an integer. Prove that \[ \left\lfloor x\right\rfloor +\left\lfloor 2x\right\rfloor +\dots+\left\lfloor nx\right\rfloor +\left\lfloor \frac{1}{x}\right\rfloor +\left\lfloor \frac{2}{x}\right\rfloor +\dots+\left\lfloor \frac{\left\lfloor nx\right\rfloor }{x}\right\rfloor =n\left\lfloor nx\right\rfloor \]

We have eight light bulbs, placed on the eight lattice points (points with integer coordinates) in space that are $\sqrt{3}$ units away from the origin. Each light bulb can either be turned on or off. These lightbulbs are unstable, however. If two light bulbs that are at most 2 units apart are both on simultaneously, they both explode. Given that no explosions take place, how many possible configurations of on/off light bulbs exist? [i]Proposed by Lewis Chen[/i]

The diagram show $28$ lattice points, each one unit from its nearest neighbors. Segment $AB$ meets segment $CD$ at $E$. Find the length of segment $AE$. [asy] path seg1, seg2; seg1=(6,0)--(0,3); seg2=(2,0)--(4,2); dot((0,0)); dot((1,0)); fill(circle((2,0),0.1),black); dot((3,0)); dot((4,0)); dot((5,0)); fill(circle((6,0),0.1),black); dot((0,1)); dot((1,1)); dot((2,1)); dot((3,1)); dot((4,1)); dot((5,1)); dot((6,1)); dot((0,2)); dot((1,2)); dot((2,2)); dot((3,2)); fill(circle((4,2),0.1),black); dot((5,2)); dot((6,2)); fill(circle((0,3),0.1),black); dot((1,3)); dot((2,3)); dot((3,3)); dot((4,3)); dot((5,3)); dot((6,3)); draw(seg1); draw(seg2); pair [] x=intersectionpoints(seg1,seg2); fill(circle(x[0],0.1),black); label("$A$",(0,3),NW); label("$B$",(6,0),SE); label("$C$",(4,2),NE); label("$D$",(2,0),S); label("$E$",x[0],N);[/asy] $\text{(A)}\ \frac{4\sqrt5}{3}\qquad\text{(B)}\ \frac{5\sqrt5}{3}\qquad\text{(C)}\ \frac{12\sqrt5}{7}\qquad\text{(D)}\ 2\sqrt5 \qquad\text{(E)}\ \frac{5\sqrt{65}}{9}$

Let an integer $n > 1$ be given. In the space with orthogonal coordinate system $Oxyz$ we denote by $T$ the set of all points $(x, y, z)$ with $x, y, z$ are integers, satisfying the condition: $1 \leq x, y, z \leq n$. We paint all the points of $T$ in such a way that: if the point $A(x_0, y_0, z_0)$ is painted then points $B(x_1, y_1, z_1)$ for which $x_1 \leq x_0, y_1 \leq y_0$ and $z_1 \leq z_0$ could not be painted. Find the maximal number of points that we can paint in such a way the above mentioned condition is satisfied.

Given a natural number $n$, prove that the number $M(n)$ of points with integer coordinates inside the circle $(O(0, 0),\sqrt{n})$ satisfies \[\pi n - 5\sqrt{n} + 1<M(n) < \pi n+ 4\sqrt{n} + 1\]

Consider a grid of all lattice points $(m, n)$ with $m, n$ between $1$ and $125$. There exists a “path” between two lattice points $(m_1, n_1)$ and $(m_2, n_2)$ on the grid if $m_1n_1 = m_2n_2$ or if $m_1/n_1 = m_2/n_2$. For how many lattice points $(m, n)$ on the grid is there a sequence of paths that goes from $(1, 1)$ to $(m, n$)?

Three circles, each of radius 3, are drawn with centers at $(14,92)$, $(17,76)$, and $(19,84)$. A line passing through $(17,76)$ is such that the total area of the parts of the three circles to one side of the line is equal to the total area of the parts of the three circles to the other side of it. What is the absolute value of the slope of this line?

$S$ is a board containing all unit squares in the $xy$ plane whose vertices have integer coordinates and which lie entirely inside the circle $x^2 + y^2 = 1998^2$. In each square of $S$ is written $+1$. An allowed move is to change the sign of every square in $S$ in a given row, column or diagonal. Can we end up with exactly one $-1$ and $+1$ on the rest squares by a sequence of allowed moves?

Denote by $C,\ l$ the graphs of the cubic function $C: y=x^3-3x^2+2x$, the line $l: y=ax$. (1) Find the range of $a$ such that $C$ and $l$ have intersection point other than the origin. (2) Denote $S(a)$ by the area bounded by $C$ and $l$. If $a$ move in the range found in (1), then find the value of $a$ for which $S(a)$ is minimized. 50 points

Let $AC$ be a diameter of a circle $ \omega $ of radius $1$, and let $D$ be a point on $AC$ such that $CD=\frac{1}{5}$. Let $B$ be the point on $\omega$ such that $DB$ is perpendicular to $AC$, and $E$ is the midpoint of $DB$. The line tangent to $\omega$ at $B$ intersects line $CE$ at the point $X$. Compute $AX$.

Let $ r$ be the distance from the origion to a point $ P$ with coordinates $ x$ and $ y$. Designate the ratio $ \frac{y}{r}$ by $ s$ and the ratio $ \frac{x}{r}$ by $ c$. Then the values of $ s^2 \minus{} c^2$ are limited to the numbers: $ \textbf{(A)}\ \text{less than }{\minus{}1}\text{ are greater than }{\plus{}1}\text{, both excluded}\qquad\\ \textbf{(B)}\ \text{less than }{\minus{}1}\text{ are greater than }{\plus{}1}\text{, both included}\qquad \\ \textbf{(C)}\ \text{between }{\minus{}1}\text{ and }{\plus{}1}\text{, both excluded}\qquad \\ \textbf{(D)}\ \text{between }{\minus{}1}\text{ and }{\plus{}1}\text{, both included}\qquad \\ \textbf{(E)}\ {\minus{}1}\text{ and }{\plus{}1}\text{ only}$

On the coordinate plane, Let $C$ be the graph of $y=(\ln x)^2\ (x>0)$ and for $\alpha >0$, denote $L(\alpha)$ be the tangent line of $C$ at the point $(\alpha ,\ (\ln \alpha)^2).$ (1) Draw the graph. (2) Let $n(\alpha)$ be the number of the intersection points of $C$ and $L(\alpha)$. Find $n(\alpha)$. (3) For $0<\alpha <1$, let $S(\alpha)$ be the area of the region bounded by $C,\ L(\alpha)$ and the $x$-axis. Find $S(\alpha)$. 2010 Tokyo Institute of Technology entrance exam, Second Exam.

On the coordinate plane, find the area of the part enclosed by the curve $C: (a+x)y^2=(a-x)x^2\ (x\geq 0)$ for $a>0$.

Let $ABC$ be an acute-angled triangle with $AB<AC$ and let $O$ be the centre of its circumcircle $\omega$. Let $D$ be a point on the line segment $BC$ such that $\angle BAD = \angle CAO$. Let $E$ be the second point of intersection of $\omega$ and the line $AD$. If $M$, $N$ and $P$ are the midpoints of the line segments $BE$, $OD$ and $AC$, respectively, show that the points $M$, $N$ and $P$ are collinear.

Triangle $ABC$ lies in the Cartesian Plane and has an area of 70. The coordinates of $B$ and $C$ are $(12,19)$ and $(23,20)$, respectively, and the coordinates of $A$ are $(p,q)$. The line containing the median to side $BC$ has slope $-5$. Find the largest possible value of $p+q$.

Consider a square $(p-1)\times(p-1)$, where $p$ is a prime number, which is divided by squares $1\times 1$ whose sides are parallel to the initial square's sides. Show that it is possible to select $p$ vertices such that there are no three collinear vertices.

Two parabolas, $y = ax^2 + bx + c$ and $y = -ax^2- bx - c$, intersect at $x = 2$ and $x = -2$. If the $y$-intercepts of the two parabolas are exactly $2$ units apart from each other, compute $|a+b+c|$.

A frog is placed at the origin on a number line, and moves according to the following rule: in a given move, the frog advanced to either the closest integer point with a greater integer coordinate that is a multiple of 3, or to the closest integer point with a greater integer coordinate that is a multiple of 13. A [i]move sequence[/i] is a sequence of coordinates which correspond to valid moves, beginning with 0, and ending with 39. For example, 0, 3, 6, 13, 15, 26, 39 is a move sequence. How many move sequences are possible for the frog?

For how many rational numbers $p$ is the area of the triangle formed by the intercepts and vertex of $f(x) = -x^2+4px-p+1$ an integer?

In the coordinate plane with the origin $O$, consider points $P(t+2,\ 0),\ Q(0, -2t^2-2t+4)\ (t\geq 0).$ If the $y$-coordinate of $Q$ is nonnegative, then find the area of the region swept out by the line segment $PQ$. [i]2011 Ritsumeikan University entrance exam/Pharmacy[/i]

Consider two solid spherical balls, one centered at $(0, 0, \frac{21}{2} )$ with radius $6$, and the other centered at $(0, 0, 1)$ with radius $\frac 92$ . How many points $(x, y, z)$ with only integer coordinates (lattice points) are there in the intersection of the balls? $\text{(A)}\ 7 \qquad \text{(B)}\ 9 \qquad \text{(C)}\ 11 \qquad \text{(D)}\ 13 \qquad \text{(E)}\ 15$

What is the degree measure of the acute angle formed by lines with slopes $2$ and $\tfrac{1}{3}$? $\textbf{(A)}~30\qquad\textbf{(B)}~37.5\qquad\textbf{(C)}~45\qquad\textbf{(D)}~52.5\qquad\textbf{(E)}~60$

Let $ABCD$ be a square such that $AB$ lies along the line $y=x+8,$ and $C$ and $D$ lie on the parabola $y=x^2.$ Find all possible values of sidelength of the square.

$m$ and $n$ are two nonnegative integers. In the Philosopher's Chess, The chessboard is an infinite grid of identical regular hexagons and a new piece named the Donkey moves on it as follows: Starting from one of the hexagons, the Donkey moves $m$ cells in one of the $6$ directions, then it turns $60$ degrees clockwise and after that moves $n$ cells in this new direction until it reaches it's final cell. At most how many cells are in the Philosopher's chessboard such that one cannot go from anyone of them to the other with a finite number of movements of the Donkey? [i]Proposed by Shayan Dashmiz[/i]