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}$$

$P\left(x\right)$ is a polynomial of degree at most $6$ such that such that $P\left(1\right)$, $P\left(2\right)$, $P\left(3\right)$, $P\left(4\right)$, $P\left(5\right)$, $P\left(6\right)$, and $P\left(7\right)$ are $1$, $2$, $3$, $4$, $5$, $6$, and $7$ in some order. What is the maximum possible value of $P\left(8\right)$? [i]2018 CCA Math Bonanza Individual Round #13[/i]

Given a fixed positive integer $a\geq 9$. Prove: There exist finitely many positive integers $n$, satisfying: (1)$\tau (n)=a$ (2)$n|\phi (n)+\sigma (n)$ Note: For positive integer $n$, $\tau (n)$ is the number of positive divisors of $n$, $\phi (n)$ is the number of positive integers $\leq n$ and relatively prime with $n$, $\sigma (n)$ is the sum of positive divisors of $n$.

Let $a$ and $b$ be positive integers such that $a! + b!$ divides $a!b!$. Prove that $3a \ge 2b + 2$.

All diagonals of a convex pentagon are drawn, dividing it in one smaller pentagon and $10$ triangles. Find the maximum number of triangles with the same area that may exist in the division.

Each square of a $5 \times 5$ board is painted red or blue, in such a way that the following condition is fulfilled: “For any two rows and two columns, of the $4$ squares that are in their intersections, there are $4$, $2$ or $0$ painted red.” How many ways can the board be painted?

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 define the distance between two circles $\omega ,\omega '$by the length of the common external tangent of the circles and show it by $d(\omega , \omega ')$. If two circles doesn't have a common external tangent then the distance between them is undefined. A point is also a circle with radius $0$ and the distance between two cirlces can be zero. (a) [b]Centroid.[/b] $n$ circles $\omega_1,\dots, \omega_n$ are fixed on the plane. Prove that there exists a unique circle $\overline \omega$ such that for each circle $\omega$ on the plane the square of distance between $\omega$ and $\overline \omega$ minus the sum of squares of distances of $\omega$ from each of the $\omega_i$s $1\leq i \leq n$ is constant, in other words:\[d(\omega,\overline \omega)^2-\frac{1}{n}{\sum_{i=1}}^n d(\omega_i,\omega)^2= constant\] (b) [b]Perpendicular Bisector.[/b] Suppose that the circle $\omega$ has the same distance from $\omega_1,\omega_2$. Consider $\omega_3$ a circle tangent to both of the common external tangents of $\omega_1,\omega_2$. Prove that the distance of $\omega$ from centroid of $\omega_1 , \omega_2$ is not more than the distance of $\omega$ and $\omega_3$. (If the distances are all defined) (c) [b]Circumcentre.[/b] Let $C$ be the set of all circles that each of them has the same distance from fixed circles $\omega_1,\omega_2,\omega_3$. Prove that there exists a point on the plane which is the external homothety center of each two elements of $C$. (d) [b]Regular Tetrahedron.[/b] Does there exist 4 circles on the plane which the distance between each two of them equals to $1$? Time allowed for this problem was 150 minutes.

求最小的 $n,$ 使得对任意有 ${1000}$ 个顶点且每个顶点度均为 ${4}$ 的简单图 $G,$ 都一定可以从中取掉 ${n}$ 条边$,$ 使 ${G}$ 变为二部图$.$

Consider the parabola $C: y^{2}=4 x$ and the straight line $L: y=x+2$. Let $P$ be a variable point on $L$. Draw the two tangents from $P$ to $C$ and let $Q_{1}$ and $Q_{2}$ denote the two points of contact on $C$. Let $Q$ be the mid-point of the line segment joining $Q_{1}$ and $Q_{2}$. Find the locus of $Q$ as $P$ moves along $L$.

Let $f(x) = \sqrt{4x^2 - 4x^4}$. Let $A$ be the number of real numbers $x$ that satisfy $$f(f(f(\dots f(x)\dots ))) = x,$$ where the function $f$ is applied to $x$ 2020 times. Compute $A \pmod {1000}$. [i]Proposed by Timothy Qian[/i]

(Four Number Theorem) Let $a, b, c,$ and $d$ be positive integers such that $ab=cd$. Show that there exists positive integers $p, q, r,s$ such that \[a=pq, \;\; b=rs, \;\; c=ps, \;\; d=qr.\]

All faces of a tetrahedron are right-angled triangles. It is known that three of its edges have the same length $s$. Find the volume of the tetrahedron.

Prove that no matter how we number the vertices of a cube with integers from 1 to 8, there exists two opposite vertices in the cube (e.g. they are the endpoints of a large diagonal of the cube), united through a broken line formed with 3 edges of the cube, such that the sum of the 4 numbers written in the vertices of this broken lines is at least 21.

In a triangle $ABC$, let $D$ and $E$ be points of the sides $ BC$ and $AC$ respectively. Segments $AD$ and $BE$ intersect at $O$. Suppose that the line connecting midpoints of the triangle and parallel to $AB$, bisects the segment $DE$. Prove that the triangle $ABO$ and the quadrilateral $ODCE$ have equal areas.

In a $2\times n$ array we have positive reals s.t. the sum of the numbers in each of the $n$ columns is $1$. Show that we can select a number in each column s.t. the sum of the selected numbers in each row is at most $\frac{n+1}4$.

In the rectangle $ABCD$ with $AB> BC$, the perpendicular bisecotr of $AC$ intersects the side $CD$ at point $E$. The circle with the center at point $E$ and the radius $AE$ intersects again the side $AB$ at point $F$. If point $O$ is the orthogonal projection of point $C$ on the line $EF$, prove that points $B, O$ and $D$ are collinear.

$S_{1},S_{2},S_{3}$ are three spheres in $\mathbb R^{3}$ that their centers are not collinear. $k\leq8$ is the number of planes that touch three spheres. $A_{i},B_{i},C_{i}$ is the point that $i$-th plane touch the spheres $S_{1},S_{2},S_{3}$. Let $O_{i}$ be circumcenter of $A_{i}B_{i}C_{i}$. Prove that $O_{i}$ are collinear.

A regular octagon is drawn on the patio floor. Emiliano writes in the vertices the numbers from $1$ to $8$ in any order. Put a stone at point $1$. He walks towards point $2$, having traveled $1/2$ of the way he stops and leaves the second stone. From there he walks to point $3$, having traveled $1/3$ of the way, he stops and leaves the third stone. From there he walks to point $4$, having traveled $1/4$ of the way, he stops and leaves the fourth stone. This goes on until, after leaving the seventh stone, he walks towards point 8 and having traveled $1/8$ of the way, he leaves the eighth stone. The number of stones left in the center of the octagon depends on the order in which you wrote the numbers on the vertices. What is the greatest number of stones that can remain in that center?

If it is known that $\log_2a+\log_2b\geq 6$, then the least value that can be taken on by $a+b$ is: $\textbf{(A) }2\sqrt6\qquad \textbf{(B) }6\qquad \textbf{(C) }8\sqrt2\qquad \textbf{(D) }16\qquad \textbf{(E) }\text{none of these.}$

Let $P$ be a point inside a square $ABCD,$ such that $\angle BPC = 135^\circ $ and the area of triangle $ADP$ is twice as much as the area of triangle $PCD.$ Find $\frac {AP}{DP}.$ [i]Proposed by Andria Gvaramia, Georgia [/i]

Let $ABC$ be a triangle such that $\angle ACB=2\angle ABC$. Let $D$ be the point on the side $BC$ such that $CD=2BD$. The segment $AD$ is extended to $E$ so that $AD=DE$. Prove that \[ \angle ECB+180^{\circ }=2\angle EBC. \]

Let $(a_n)_{n = 0}^{\infty} $ be a sequence of positive integers such that for every $n \geq 0$ it is true that $$a_{n+2} = a_0 a_1 + a_1 a_2 + ... + a_n a_{n+1} - 1 $$ a) Prove that there exist a prime number which divides infinitely many $a_n$ b) Prove that there exist infinitely many such prime numbers

Let $n$ be a positive integer and let $k$ be an odd positive integer. Moreover, let $a,b$ and $c$ be integers (not necessarily positive) satisfying the equations \[a^n+kb=b^n+kc=c^n+ka \] Prove that $a=b=c$.

From the vertex $C$ in triangle $ABC$, draw a straight line that bisects the median from $A$. In what ratio does this line divide the segment $AB$? [img]https://1.bp.blogspot.com/-SxWIQ12DIvs/XzcJv5xoV0I/AAAAAAAAMY4/Ezfe8bd7W-Mfp2Qi4qE_gppbh9Fzvb4XwCLcBGAsYHQ/s0/1995%2BMohr%2Bp3.png[/img]