A cuboctahedron is a solid with 6 square faces and 8 equilateral triangle faces, with each edge adjacent to both a square and a triangle (see picture). Suppose the ratio of the volume of an octahedron to a cuboctahedron with the same side length is $r$. Find $100r^2$. [asy] // dragon96, replacing // [img]http://i.imgur.com/08FbQs.png[/img] size(140); defaultpen(linewidth(.7)); real alpha=10, x=-0.12, y=0.025, r=1/sqrt(3); path hex=rotate(alpha)*polygon(6); pair A = shift(x,y)*(r*dir(330+alpha)), B = shift(x,y)*(r*dir(90+alpha)), C = shift(x,y)*(r*dir(210+alpha)); pair X = (-A.x, -A.y), Y = (-B.x, -B.y), Z = (-C.x, -C.y); int i; pair[] H; for(i=0; i<6; i=i+1) { H[i] = dir(alpha+60*i);} fill(X--Y--Z--cycle, rgb(204,255,255)); fill(H[5]--Y--Z--H[0]--cycle^^H[2]--H[3]--X--cycle, rgb(203,153,255)); fill(H[1]--Z--X--H[2]--cycle^^H[4]--H[5]--Y--cycle, rgb(255,203,153)); fill(H[3]--X--Y--H[4]--cycle^^H[0]--H[1]--Z--cycle, rgb(153,203,255)); draw(hex^^X--Y--Z--cycle); draw(H[1]--B--H[2]^^H[3]--C--H[4]^^H[5]--A--H[0]^^A--B--C--cycle, linewidth(0.6)+linetype("5 5")); draw(H[0]--Z--H[1]^^H[2]--X--H[3]^^H[4]--Y--H[5]);[/asy]

All cells of an $n\times n$ table are painted in several colors so that there is no monochromatic $2\times2$ square. A sequence of different cells $a_1,a_2,\ldots,a_k$ is called a [i]colorful[/i] if any two consecutive cells are adjacent and are painted in different colors. What is the largest $k{}$ for which there is a colorful sequence of length $k{}$ regardless of the coloring of the cells of the table? [i]Proposed by N. Belukhov[/i]

Triangle $ABC$ is said to be perpendicular to triangle $DEF$ if the perpendiculars from $A$ to $EF$,from $B$ to $FD$ and from $C$ to $DE$ are concurrent.Prove that if $ABC$ is perpendicular to $DEF$,then $DEF$ is perpendicular to $ABC$

Let $n(\ge 2)$ be an integer. $2n^2$ contestants participate in a Chinese chess competition, where any two contestant play exactly once. There may be draws. It is known that (1)If A wins B and B wins C, then A wins C. (2)there are at most $\frac{n^3}{16}$ draws. Proof that it is possible to choose $n^2$ contestants and label them $P_{ij}(1\le i,j\le n)$, so that for any $i,j,i',j'\in \{1,2,...,n\}$, if $i<i'$, then $P_{ij}$ wins $P_{i'j'}$.

Given a concyclic quadrilateral $ABCD$ with circumcenter $O$. Let $E$ be the intersection of $AD$ and $BC$, while $F$ be the intersection of $AC$ and $BD$. A circle $w$ are tangent to $BD$ and $AC$ such that $F$ is the orthocenter of $\triangle QEP$ where $PQ$ is a diameter of $w$. Prove that $EO$ passes through the center of $w$.

Given a positive integer $n,$ let $s(n)$ denote the sum of the digits of $n.$ Compute the largest positive integer $n$ such that $n = s(n)^2 + 2s(n) - 2.$

For any number $x$, let $\lfloor x\rfloor$ denotes the greatest integer less than or equal to $x$. A sequence $a_1,a_2,\cdots$ is given, where \[a_n=\left\lfloor{\sqrt{2n}+\dfrac{1}{2}}\right\rfloor.\] How many values of $k$ are there such that $a_k=2010$?

We define the $\emph{weight}$ of a path to be the sum of the numbers written on each edge of the path. Find the minimum weight among all paths in the graph below that visit each vertex precisely once: [center][img]http://i.imgur.com/V99Eg9j.png[/img][/center]

There are two bowls on a table, one white and one black. In the white bowl there $2019$ balls. Players $A$ and $B$ play a game where they make every other move ($A$ begins). One move consists is $\bullet$ to move one or your balls from one bowl to the other, or $\bullet$ to remove a ball from the white bowl, with the condition that the resulting position (that is, the number of bullets in the two bowls) have not occurred before. The player who has no valid move to make loses. Can any of the players be sure to win? If so, which one?

The largest one of numbers $ p_1^{\alpha_1}, p_2^{\alpha_2}, \cdots, p_t^{\alpha_t}$ is called a $ \textbf{Good Number}$ of positive integer $ n$, if $ \displaystyle n\equal{} p_1^{\alpha_1} \cdot p_2^{\alpha_2} \cdots p_t^{\alpha_t}$, where $ p_1$, $ p_2$, $ \cdots$, $ p_t$ are pairwisely different primes and $ \alpha_1, \alpha_2, \cdots, \alpha_t$ are positive integers. Let $ n_1, n_2, \cdots, n_{10000}$ be $ 10000$ distinct positive integers such that the $ \textbf{Good Numbers}$ of $ n_1, n_2, \cdots, n_{10000}$ are all equal. Prove that there exist integers $ a_1, a_2, \cdots, a_{10000}$ such that any two of the following $ 10000$ arithmetical progressions $ \{ a_i, a_i \plus{} n_i, a_i \plus{} 2n_i, a_i \plus{} 3n_i, \cdots \}$($ i\equal{}1,2, \cdots 10000$) have no common terms.

is there a function $f:\mathbb{N}\rightarrow \mathbb{N}$ such that $i) \exists n\in \mathbb{N}:f(n)\neq n$ $ii)$ the number of divisors of $m$ is $f(n)$ if and only if the number of divisors of $f(m)$ is $n$

Given the triangle $ABC$, let $L$, $M$ and $N $be the midpoints of $BC$, $CA$ and $AB$ respectively. The lines $LM$ and $LN$ cut the tangent to the circumcircle at $A$ at $P$ and $Q$ respectively . Prove that $CP \parallel BQ$.

Triangle $ABC$ has circumcircle $\omega$ where $B'$ is the point diametrically opposite $B$ and $C'$ is the point diametrically opposite $C$. Given $B'C'$ passes through the midpoint of $AB$, if $AC' = 3$ and $BC = 7$, find $AB'^2$..

Points $ A’,B,C’ $ are arbitrarily taken on edges $ SA,SB, $ respectively, $ SC $ of a tetrahedron $ SABC. $ Plane forrmed by $ ABC $ intersects the plane $ \rho , $ formed by $ A’B’C’, $ in a line $ d. $ Prove that, meanwhile the plane $ \rho $ rotates around $ d, $ the lines $ AA’,BB’ $ and $ CC’ $ are, and remain concurrent. Find de locus of the respective intersections.

$9.3$ A natural number is called square-free, if it is not divisible by the square of any prime number. For a natural number $a$, we consider the number $f(a) = a^{a+1} + 1$. Prove that: a) if $a$ is even, then $f(a)$ is not square-free b) there exist infinitely many odd $a$ for which $f(a)$ is not square-free $9.4$ We will call a generalized $2n$-parallelogram a convex polygon with $2n$ sides, so that, traversed consecutively, the $k$th side is parallel and equal to the $(n+k)$th side for $k=1, 2, ... , n$. In a rectangular coordinate system, a generalized parallelogram is given with $50$ vertices, each with integer coordinates. Prove that its area is at least $300$.

Given a right triangular prism $A_1B_1C_1 - ABC$ with $\angle BAC = \frac{\pi}{2}$ and $AB = AC = AA_1$, let $G$, $E$ be the midpoints of $A_1B_1$, $CC_1$ respectively, and $D$, $F$ be variable points lying on segments $AC$, $AB$ (not including endpoints) respectively. If $GD \bot EF$, the range of the length of $DF$ is ${ \textbf{(A)}\ [\frac{1}{\sqrt{5}}, 1)\qquad\textbf{(B)}\ [\frac{1}{5}, 2)\qquad\textbf{(C)}\ [1, \sqrt{2})\qquad\textbf{(D)}} [\frac{1}{\sqrt{2}}, \sqrt{2})\qquad $

Lukas Nepomuceno draws 5 congruent circles equally spaced around a 6th, and colors all of them 1 of 3 colors. Assume that rotations and reflections of colorings are indistinguishable. How many distinct colorings are there? [i]2022 CCA Math Bonanza Lightning Round 4.4[/i]

A regular icosahedron is a regular solid of $20$ faces, each in the form of an equilateral triangle, with $12$ vertices, so that each vertex is in $5$ edges. Twelve indistinguishable candies are glued to the vertices of a regular icosahedron (one at each vertex), and four of these twelve candies are special. André and Lucas want to together create a strategy for the following game: • First, André is told which are the four special sweets and he must remove exactly four sweets that are not special from the icosahedron and leave the solid on a table, leaving afterwards without communicating with Lucas. • Later, Sponchi, who wants to prevent Lucas from discovering the special sweets, can pick up the icosahedron from the table and rotate it however he wants. • After Sponchi makes his move, he leaves the room, Lucas enters and he must determine the four special candies out of the eight that remain in the icosahedron. Determine if there is a strategy for which Lucas can always properly discover the four special sweets.

Show that the number $1989$ as well as each of its powers $1989^n$ ($n \in N$), can be expressed as a sum of two positive squares in at least two ways.

Let $x$ be a number such that $10000x+2=4$. What is the value of $5000x+1$? $\textbf{(A) }{-}1\qquad\textbf{(B) }0\qquad\textbf{(C) }1\qquad\textbf{(D) }2\qquad\textbf{(E) }3$

What percent of the numbers $1, 2, 3, ... 1000$ are divisible by exactly one of the numbers $4$ and $5?$

Let $x,y,z$ be positive real numbers satisfying the equations $$xyz=1\text{ and }\frac yz(y-x^2)+\frac zx(z-y^2)+\frac xy(x-z^2)=0$$ What is the minimum value of the ratio of the sum of the largest and smallest numbers among $x,y,z$ to the median of them.

Consider the equations $x^2+y^2=16$ and $xy=\tfrac{9}{2}.$ Find the sum, over all ordered pairs $(x,y)$ satisfying these equations, of $|x+y|.$

Evaluate \[\int_{0}^{1}\frac{x\ dx}{(x^{2}+x+1)^{\frac{3}{2}}}\]

Let $n \geq 2$ be a positive integer, and suppose buildings of height $1, 2, \ldots, n$ are built in a row on a street. Two distinct buildings are said to be $\emph{roof-friendly}$ if every building between the two is shorter than both buildings in the pair. For example, if the buildings are arranged $5, 3, 6, 2, 1, 4,$ there are $8$ roof-friendly pairs: $(5, 3), (5, 6), (3, 6), (6, 2), (6, 4), (2, 1),$ $(2, 4), (1, 4).$ Find, with proof, the minimum and maximum possible number of roof-friendly pairs of buildings, in terms of $n.$