Danica drove her new car on a trip for a whole number of hours, averaging $55$ miles per hour. At the beginning of the trip, $abc$ miles were displayed on the odometer, where $abc$ is a 3-digit number with $a \ge 1$ and $a+b+c \le 7$. At the end of the trip, where the odometer showed $cba$ miles. What is $a^2+b^2+c^2$? $ \textbf{(A) } 26 \qquad\textbf{(B) }27\qquad\textbf{(C) }36\qquad\textbf{(D) }37\qquad\textbf{(E) }41\qquad $

Let $x_1,x_2,\cdots,x_n$ be postive real numbers such that $x_1x_2\cdots x_n=1$ ,$S=x^3_1+x^3_2+\cdots+x^3_n$.Find the maximum of $\frac{x_1}{S-x^3_1+x^2_1}+\frac{x_2}{S-x^3_2+x^2_2}+\cdots+\frac{x_n}{S-x^3_n+x^2_n}$

Positive integers $a, b, c$ satisfy $\frac{ab}{a - b} = c .$ what is the largest possible value of $a+ b+ c$ not exceeding $99$?

Let $a,b,c$ be nonnegative real numbers such that $(a+b)(b+c)(c+a) \neq0$. Find the minimum of $(a+b+c)^{2016}(\frac{1}{a^{2016}+b^{2016}}+\frac{1}{b^{2016}+c^{2016}}+\frac{1}{c^{2016}+a^{2016}})$.

Let $n \ge 3$ be an integer, and consider a circle with $n + 1$ equally spaced points marked on it. Consider all labellings of these points with the numbers $0, 1, ... , n$ such that each label is used exactly once; two such labellings are considered to be the same if one can be obtained from the other by a rotation of the circle. A labelling is called [i]beautiful[/i] if, for any four labels $a < b < c < d$ with $a + d = b + c$, the chord joining the points labelled $a$ and $d$ does not intersect the chord joining the points labelled $b$ and $c$. Let $M$ be the number of beautiful labelings, and let N be the number of ordered pairs $(x, y)$ of positive integers such that $x + y \le n$ and $\gcd(x, y) = 1$. Prove that $$M = N + 1.$$

In $\triangle ABC$, $AB = 6$, $BC = 7$, and $CA = 8$. Point $D$ lies on $\overline{BC}$, and $\overline{AD}$ bisects $\angle BAC$. Point $E$ lies on $\overline{AC}$, and $\overline{BE}$ bisects $\angle ABC$. The bisectors intersect at $F$. What is the ratio $AF$ : $FD$? [asy] pair A = (0,0), B=(6,0), C=intersectionpoints(Circle(A,8),Circle(B,7))[0], F=incenter(A,B,C), D=extension(A,F,B,C),E=extension(B,F,A,C); draw(A--B--C--A--D^^B--E); label("$A$",A,SW); label("$B$",B,SE); label("$C$",C,N); label("$D$",D,NE); label("$E$",E,NW); label("$F$",F,1.5*N); [/asy] $\textbf{(A)}\ 3:2\qquad\textbf{(B)}\ 5:3\qquad\textbf{(C)}\ 2:1\qquad\textbf{(D)}\ 7:3\qquad\textbf{(E)}\ 5:2$

In triangle $ABC$ let $A'$, $B'$, $C'$ respectively be the midpoints of the sides $BC$, $CA$, $AB$. Furthermore let $L$, $M$, $N$ be the projections of the orthocenter on the three sides $BC$, $CA$, $AB$, and let $k$ denote the nine-point circle. The lines $AA'$, $BB'$, $CC'$ intersect $k$ in the points $D$, $E$, $F$. The tangent lines on $k$ in $D$, $E$, $F$ intersect the lines $MN$, $LN$ and $LM$ in the points $P$, $Q$, $R$. Prove that $P$, $Q$ and $R$ are collinear.

Three real numbers $ a,b,c$ satisfy the equations $ a\plus{}b\plus{}c\equal{}3, a^2\plus{}b^2\plus{}c^2\equal{}9, a^3\plus{}b^3\plus{}c^3\equal{}24.$ Find $ a^4\plus{}b^4\plus{}c^4$.

A factorization of a positive integers is a way of writing it as a product of positive integers greater than $1$. Two factorizations are considered the same if they only differ in the order of terms in the product. For instance, $18$ has $4$ different factorizations: $18, 2\cdot 9, 3\cdot 6$ and $ 2\cdot 3\cdot 3$. For a positive integer $n$ we denote by $f(n)$ the number of distinct factorizations of $n$. By convention $f(1)=1$. Prove that $f(n)\leq n$ for all positive integers $n$.

Let $ABCD$ be a convex quadrilateral whose vertices do not lie on a circle. Let $A'B'C'D'$ be a quadrangle such that $A',B', C',D'$ are the centers of the circumcircles of triangles $BCD,ACD,ABD$, and $ABC$. We write $T (ABCD) = A'B'C'D'$. Let us define $A''B''C''D'' = T (A'B'C'D') = T (T (ABCD)).$ [b](a)[/b] Prove that $ABCD$ and $A''B''C''D''$ are similar. [b](b) [/b]The ratio of similitude depends on the size of the angles of $ABCD$. Determine this ratio.

[b](a)[/b]Prove that every pentagon with integral coordinates has at least two vertices , whose respective coordinates have the same parity. [b](b)[/b]What is the smallest area possible of pentagons with integral coordinates. Albanian National Mathematical Olympiad 2010---12 GRADE Question 3.

Let $ x_1,...,x_n$ be positive real numbers. Prove that: $ \displaystyle\sum_{k\equal{}1}^{n}x_k\plus{}\sqrt{\displaystyle\sum_{k\equal{}1}^{n}x_k^2} \le \frac{n\plus{}\sqrt{n}}{n^2} \left( \displaystyle\sum_{k\equal{}1}^{n} \frac{1}{x_k} \right) \left( \displaystyle\sum_{k\equal{}1}^{n} x_k^2 \right).$

Six trees are equally spaced along one side of a straight road. The distance from the first tree to the fourth is 60 feet. What is the distance in feet between the first and last trees? $ \text{(A)}\ 90\qquad\text{(B)}\ 100\qquad\text{(C)}\ 105\qquad\text{(D)}\ 120\qquad\text{(E)}\ 140 $

Let $S_n$ and $T_n$ be the respective sums of the first $n$ terms of two arithmetic series. If $S_n:T_n=(7n+1):(4n+27)$ for all $n$, the ratio of the eleventh term of the first series to the eleventh term of the second series is: $\textbf{(A) }4:3\qquad \textbf{(B) }3:2\qquad \textbf{(C) }7:4\qquad \textbf{(D) }78:71\qquad \textbf{(E) }\text{undetermined}$

A company sells peanut butter in cylindrical jars. Marketing research suggests that using wider jars will increase sales. If the diameter of the jars is increased by $ 25\%$ without altering the volume, by what percent must the height be decreased? $ \textbf{(A)}\ 10 \qquad \textbf{(B)}\ 25 \qquad \textbf{(C)}\ 36 \qquad \textbf{(D)}\ 50 \qquad \textbf{(E)}\ 60$

Let $ABCD$ be a cyclic quadrilateral with circumcenter $O$. The internal angle bisectors of \(\angle DAB\), \(\angle ABC\), \(\angle BCD\), \(\angle CDA\) create a convex quadrilateral $Q_1$. The external bisectors of the same angles create another convex quadrilateral $Q_2$. Prove $Q_1$, $Q_2$ are cyclic, and that $O$ is the midpoint of their circumcenters.

Alan, Jason, and Shervin are playing a game with MafsCounts questions. They each start with $2$ tokens. In each round, they are given the same MafsCounts question. The first person to solve the MafsCounts question wins the round and steals one token from each of the other players in the game. They all have the same probability of winning any given round. If a player runs out of tokens, they are removed from the game. The last player remaining wins the game. If Alan wins the first round but does not win the second round, what is the probability that he wins the game? [i]2020 CCA Math Bonanza Individual Round #4[/i]

Allen flips a fair two sided coin and rolls a fair $6$ sided die with faces numbered $1$ through $6$. What is the probability that the coin lands on heads and he rolls a number that is a multiple of $5$? $\textbf{(A) }\dfrac1{24}\qquad\textbf{(B) }\dfrac1{12}\qquad\textbf{(C) }\dfrac16\qquad\textbf{(D) }\dfrac14\qquad\textbf{(E) }\dfrac13$

Let $ABC$ be a triangle with height $AH$. $P$ lies on the circle over 3 midpoint of $AB,BC,CA$ ($P \notin BC$). Prove that the line connect 2 center of $(PBH)$ and $(PCH)$ go through a fixed point. (where $(XYZ)$ be a circumscribed circle of triangle $XYZ$)

Let $ a$ be the greatest positive root of the equation $ x^3 \minus{} 3 \cdot x^2 \plus{} 1 \equal{} 0.$ Show that $ \left[a^{1788} \right]$ and $ \left[a^{1988} \right]$ are both divisible by 17. Here $ [x]$ denotes the integer part of $ x.$

Convex pentagon $ABCDE$ is inscribed in circle $\gamma$. Suppose that $AB=14$, $BE=10$, $BC=CD=DE$, and $[ABCDE]=3[ACD]$. Then there are two possible values for the radius of $\gamma$. The sum of these two values is $\sqrt{n}$ for some positive integer $n$. Compute $n$. [i]Proposed by Luke Robitaille[/i]

Let $n \ge 3$ be an integer. Prove that there exist positive integers $\ge 2$, $a_1,a_2,..,a_n$, such that $a_1 a_2 ... \widehat{a_i}... a_n \equiv 1$ (mod $a_i$), for $i = 1,..., n$. Here $\widehat{a_i}$ means the term $a_i$ is omitted.

Each of the 450 members of a parliament gives a slap in the face to exactly one of his colleagues. Prove that after that they can choose a committee consisting of 150 members, none of whom has been slapped in the face by any other member of the committee. (Folklore)

In triangle $ABC$, $AB = AC$. Point $D$ is the midpoint of side $BC$. Point $E$ lies outside the triangle $ABC$ such that $CE \perp AB$ and $BE = BD$. Let $M$ be the midpoint of segment $BE$. Point $F$ lies on the minor arc $\widehat{AD}$ of the circumcircle of triangle $ABD$ such that $MF \perp BE$. Prove that $ED \perp FD.$ [asy] defaultpen(fontsize(10)); size(6cm); pair A = (3,10), B = (0,0), C = (6,0), D = (3,0), E = intersectionpoints( Circle(B, 3), C--(C+100*dir(B--A)*dir(90)) )[1], M = midpoint(B--E), F = intersectionpoints(M--(M+50*dir(E--B)*dir(90)), circumcircle(A,B,D))[0]; dot(A^^B^^C^^D^^E^^M^^F); draw(B--C--A--B--E--D--F--M^^circumcircle(A,B,D)); pair point = extension(M,F,A,D); pair[] p={A,B,C,D,E,F,M}; string s = "A,B,C,D,E,F,M"; int size = p.length; real[] d; real[] mult; for(int i = 0; i<size; ++i) { d[i] = 0; mult[i] = 1;} d[4] = -50; string[] k= split(s,","); for(int i = 0;i<p.length;++i) { label("$"+k[i]+"$",p[i],mult[i]*dir(point--p[i])*dir(d[i])); }[/asy]

You have to organize a fair procedure to randomly select someone from $ n$ people so that every one of them would be chosen with the probability $ \frac{1}{n}$. You are allowed to choose two real numbers $ 0<p_1<1$ and $ 0<p_2<1$ and order two coins which satisfy the following requirement: the probability of tossing "heads" on the first coin $ p_1$ and the probability of tossing "heads" on the second coin is $ p_2$. Before starting the procedure, you are supposed to announce an upper bound on the total number of times that the two coins are going to be flipped altogether. Describe a procedure that achieves this goal under the given conditions.