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.

The diagram below shows a rectangle and two triangles with areas $20$ and $4$. What is the area of the shaded triangle? [asy] size(3cm); draw((0,0)--(7,0)--(7,5)--(0,5)--(0,0)); draw((4,0)--(0,5)); draw((7,0)--(0,5)); draw((4,0)--(7,5)); filldraw((0,0)--(4,0)--(0,5)--cycle, lightgray); label("$4$",(5.5,0.5)); label("$20$",(4,4)); [/asy] $\textbf{(A) } 12\qquad\textbf{(B) } 14\qquad\textbf{(C) } 16\qquad\textbf{(D) } 18\qquad\textbf{(E) } 20$

A company has five directors. The regulations of the company require that any majority (three or more) of the directors should be able to open its strongroom, but any minority (two or less) should not be able to do so. The strongroom is equipped with ten locks, so that it can only be opened when keys to all ten locks are available. Find all positive integers $n$ such that it is possible to give each of the directors a set of keys to $n$ different locks, according to the requirements and regulations of the company.

Let $ \triangle{ABC}$ be a triangle with $ AB\not\equal{}AC$. The incircle with centre $ I$ touches $ BC$, $ CA$, $ AB$ at $ D$, $ E$, $ F$, respectively. Furthermore let $ M$ the midpoint of $ EF$ and $ AD$ intersect the incircle at $ P\not\equal{}D$. Show that $ PMID$ ist cyclic.

In $\triangle ABC, BC=a, CA=b, AB=c,$ and $\Gamma$ is its circumcircle. $(1)$ Determine a necessary and sufficient condition on $a,b$ and $c$ if there exists a unique point $P(P\neq B, P\neq C)$ on the arc $BC$ of $\Gamma$ not passing through point $A$ such that $PA=PB+PC$. $(2)$ Let $P$ be the unique point stated in $(1)$. If $AP$ bisects $BC$, prove that $\angle BAC<60^{\circ}$.

On each unit square of a $9 \times 9$ square, there is a bettle. Simultaneously, at the whistle, each bettle moves from its unit square to another one which has only a common vertex with the original one (thus in diagonal). Some bettles can go to the same unit square. Determine the minimum number of empty unit squares after the moves. Pierre.

Find all positive integers $ n $ with the following property: It is possible to fill a $ n \times n $ chessboard with one of arrows $ \uparrow, \downarrow, \leftarrow, \rightarrow $ such that 1. Start from any grid, if we follows the arrows, then we will eventually go back to the start point. 2. For every row, except the first and the last, the number of $ \uparrow $ and the number of $ \downarrow $ are the same. 3. For every column, except the first and the last, the number of $ \leftarrow $ and the number of $ \rightarrow $ are the same.

Determine whether there exists a positive integer $n$ such that the sum of the digits of $n^2$ is $2002$.

A round-robin tournament is one where each team plays every other team exactly once. Five teams take part in such a tournament getting: $3$ points for a win, $1$ point for a draw and $0$ points for a loss. At the end of the tournament the teams are ranked from first to last according to the number of points. (a) Is it possible that at the end of the tournament, each team has a different number of points, and each team except for the team ranked last has exactly two more points than the next-ranked team? (b) Is this possible if there are six teams in the tournament instead?