There are $20$ cities in the County of Newton. Their populations are shown in the bar chart below. The average population of all the cities is indicated by the horizontal dashed line. Which of the following is closest to the total population of all $20$ cities? [asy] // made by SirCalcsALot size(300); pen shortdashed=linetype(new real[] {6,6}); // axis draw((0,0)--(0,9300), linewidth(1.25)); draw((0,0)--(11550,0), linewidth(1.25)); for (int i = 2000; i < 9000; i = i + 2000) { draw((0,i)--(11550,i), linewidth(0.5)+1.5*grey); label(string(i), (0,i), W); } for (int i = 500; i < 9300; i=i+500) { draw((0,i)--(150,i),linewidth(1.25)); if (i % 2000 == 0) { draw((0,i)--(250,i),linewidth(1.25)); } } int[] data = {8750, 3800, 5000, 2900, 6400, 7500, 4100, 1400, 2600, 1470, 2600, 7100, 4070, 7500, 7000, 8100, 1900, 1600, 5850, 5750}; int data_length = 20; int r = 550; for (int i = 0; i < data_length; ++i) { fill(((i+1)*r,0)--((i+1)*r, data[i])--((i+1)*r,0)--((i+1)*r, data[i])--((i+1)*r,0)--((i+1)*r, data[i])--((i+2)*r-100, data[i])--((i+2)*r-100,0)--cycle, 1.5*grey); draw(((i+1)*r,0)--((i+1)*r, data[i])--((i+1)*r,0)--((i+1)*r, data[i])--((i+1)*r,0)--((i+1)*r, data[i])--((i+2)*r-100, data[i])--((i+2)*r-100,0)); } draw((0,4750)--(11450,4750),shortdashed); label("Cities", (11450*0.5,0), S); label(rotate(90)*"Population", (0,9000*0.5), 10*W); [/asy] $\textbf{(A) }65{,}000 \qquad \textbf{(B) }75{,}000 \qquad \textbf{(C) }85{,}000 \qquad \textbf{(D) }95{,}000 \qquad \textbf{(E) }105{,}000$

$ABC$ is an acute triangle with orthocenter $H$. Points $D$ and $E$ lie on segment $BC$. Circumcircle of $\triangle BHC$ instersects with segments $AD$,$AE$ at $P$ and $Q$, respectively. Prove that if $BD^2+CD^2=2DP\cdot DA$ and $BE^2+CE^2=2EQ\cdot EA$, then $BP=CQ$.

A unit square $ABCD$ with centre $O$ is rotated about $O$ by an angle $\alpha$. Compute the common area of the two squares.

A composite positive integer is a product $ab$ with $a$ and $b$ not necessarily distinct integers in $\{2,3,4,\dots\}$. Show that every composite positive integer is expressible as $xy+xz+yz+1$, with $x,y,z$ positive integers.

Consider points $A, B, C$. Draw a line through $A$ so that the sum of distances from $B$ and $C$ to this line is equal to the length of a given segment.

Determine all pairs $(a, b)$ of positive real numbers with $a \neq 1$ such that \[\log_a b < \log_{a+1} (b + 1).\]

Let $\mathcal{S}$ be the set of permutations of $\{1,2,\ldots,6\}$, and let $\mathcal{T}$ be the set of permutations of $\mathcal{S}$ that preserve compositions: i.e., if $F\in\mathcal{T}$ then \[F(f_2\circ f_1)=F(f_2)\circ F(f_1)\] for all $f_1,f_2\in\mathcal{S}$. Find the number of elements $F\in\mathcal{T}$ such that if $f\in\mathcal{S}$ satisfies $f(1)=2$ and $f(2)=1$, then $(F(f))(1)=2$ and $(F(f))(2)=1$.

Consider $n \geq 2$ distinct points in the plane $A_1,A_2,...,A_n$ . Color the midpoints of the segments determined by each pair of points in red. What is the minimum number of distinct red points?

At a party, a group of $20$ people needs to be seated at $4$ tables. The seating arrangement is called [i]successful [/i] if any two people at the same table are friends. It turned out that successful seating arrangements exist. In a successful seating arrangement, exactly $5$ people sit at each table. What is the greatest possible number of pairs of friends in this companies?

An irregular octahedron has eight faces that are equilateral triangles of side length $2$. However, instead of each vertex having four "neighbors" (vertices that share an edge with it) like in a regular octahedron, for this octahedron, two of the vertices have exactly three neighbors, two of the vertices have exactly four neighbors, and two of the vertices have exactly five neighbors. Compute the volume of this octahedron. [i]Proposed by Connor Gordon[/i]

Find all positive integers $A,B$ satisfying the following properties: (i) $A$ and $B$ has same digit in decimal. (ii) $2\cdot A\cdot B=\overline{AB}$ (Here $\cdot$ denotes multiplication, $\overline{AB}$ denotes we write $A$ and $B$ in turn. For example, if $A=12,B=34$, then $\overline{AB}=1234$)

Prove that for every convex function $ f(x)$ defined on the interval $ \minus{}1\leq x \leq 1$ and having absolute value at most $ 1$, there is a linear function $ h(x)$ such that \[ \int_{\minus{}1}^1|f(x)\minus{}h(x)|dx\leq 4\minus{}\sqrt{8}.\] [L. Fejes-Toth]

Consider the sequence $1, 2, 1, 2, 2, 1, 2, 2, 2, 1, 2, 2, 2, 2, 1,...$ Find $n$ such that the first $n$ terms sum up to $2010$.

Let $ABC$ be an acute angled triangle. Let $M$ be the midpoint of $BC$, and let $BE$ and $CF$ be the altitudes of the triangle. Let $D \ne M$ be a point on the circumcircle of the triangle $EFM$ such that $DE = DF$. Prove that $AD \perp BC$.

Let $n$ be a positive integer. Each point $(x,y)$ in the plane, where $x$ and $y$ are non-negative integers with $x+y<n$, is coloured red or blue, subject to the following condition: if a point $(x,y)$ is red, then so are all points $(x',y')$ with $x'\leq x$ and $y'\leq y$. Let $A$ be the number of ways to choose $n$ blue points with distinct $x$-coordinates, and let $B$ be the number of ways to choose $n$ blue points with distinct $y$-coordinates. Prove that $A=B$.

Let $ABC$ be a triangle with a right angle at $C$. Let $I$ be the incentre of triangle $ABC$, and let $D$ be the foot of the altitude from $C$ to $AB$. The incircle $\omega$ of triangle $ABC$ is tangent to sides $BC$, $CA$, and $AB$ at $A_1$, $B_1$, and $C_1$, respectively. Let $E$ and $F$ be the reflections of $C$ in lines $C_1A_1$ and $C_1B_1$, respectively. Let $K$ and $L$ be the reflections of $D$ in lines $C_1A_1$ and $C_1B_1$, respectively. Prove that the circumcircles of triangles $A_1EI$, $B_1FI$, and $C_1KL$ have a common point.

Let $\mathbb R^\ast$ denote the set of nonzero reals. Find all functions $f: \mathbb R^\ast \to \mathbb R^\ast$ satisfying \[ f(x^2+y)+1=f(x^2+1)+\frac{f(xy)}{f(x)} \] for all $x,y \in \mathbb R^\ast$ with $x^2+y\neq 0$. [i]Proposed by Ryan Alweiss[/i]

Let $a_{i}$ and $b_{i}$, where $i \in \{1,2, \dots, 2005 \}$, be real numbers such that the inequality $(a_{i}x-b_{i})^{2} \ge \sum_{j=1, j \not= i}^{2005} (a_{j}x-b_{j})$ holds for all $x \in \mathbb{R}$ and all $i \in \{1,2, \dots, 2005 \}$. Find the maximum possible number of positive numbers amongst $a_{i}$ and $b_{i}$, $i \in \{1,2, \dots, 2005 \}$.

Consider a collection of stones whose total weight is $65$ pounds and each of whose stones is at most $w$ pounds. Find the largest number $w$ for which any such collection of stones can be divided into two groups whose total weights differ by at most one pound. Note: The weights of the stones are not necessarily integers.

Let $x_1,x_2,x_3,x_4,x_5$ ve non-negative real numbers, so that $x_1\le4$ and $x_1+x_2\le13$ and $x_1+x_2+x_3\le29$ and $x_1+x_2+x_3+x_4\le54$ and $x_1+x_2+x_3+x_4+x_5\le90$. Prove that $\sqrt{x_1}+\sqrt{x_2}+\sqrt{x_3}+\sqrt{x_4}+\sqrt{x_5}\le20$.

Determine if there are $2018$ different positive integers such that the sum of their squares is a perfect cube and the sum of their cubes is a perfect square.

$\boxed{\text{A2}}$ Prove that for all Positive reals $a,b,c$ $\frac{a^2-bc}{2a^2+bc}+\frac{b^2-ca}{2b^2+ca}+\frac{c^2-ab}{2c^2+ab}\leq 0$

Let $O$ be the center of a circle circumscribed about an acute angle triangle $ABC$, $S_A$, $S_B$, $S_C$ - circles with center O, tangent to sides $BC$, $CA$, $AB$ respectively. Prove that the sum of three angles : between the tangents to $S_A$ drawn from point $A$, to $S_B$ from point $B$ and to $S_C$ - from point $C$, is equal to $180^o$.

Two equal-sized regular $n$-gons intersect to form a $2n$-gon $C$. Prove that the sum of the sides of $C$ which form part of one $n$-gon equals half the perimeter of $C$. [i]Alternative formulation:[/i] Let two equal regular $n$-gons $S$ and $T$ be located in the plane such that their intersection $S\cap T$ is a $2n$-gon (with $n\ge 3$). The sides of the polygon $S$ are coloured in red and the sides of $T$ in blue. Prove that the sum of the lengths of the blue sides of the polygon $S\cap T$ is equal to the sum of the lengths of its red sides.

At the beginning of the school year, Lisa’s goal was to earn an A on at least $ 80\%$ of her $ 50$ quizzes for the year. She earned an A on $ 22$ of the first $ 30$ quizzes. If she is to achieve her goal, on at most how many of the remaining quizzes can she earn a grade lower than an A? $ \textbf{(A)}\ 1 \qquad \textbf{(B)}\ 2 \qquad \textbf{(C)}\ 3 \qquad \textbf{(D)}\ 4 \qquad \textbf{(E)}\ 5$