Found problems: 85335
For which $n$ the plane may be paved by congruent figures bounded by $n$ arcs of circles?
In a group of $n > 20$ people, there are some (at least one, and possibly all) pairs of people that know each other. Knowing is symmetric; if Alice knows Blaine, then Blaine also knows Alice. For some values of $n$ and $k,$ this group has a peculiar property: If any $20$ people are removed from the group, the number of pairs of people that know each other is
at most $\frac{n-k}{n}$ times that of the original group of people.
(a) If $k = 41,$ for what positive integers $n$ could such a group exist?
(b) If $k = 39,$ for what positive integers $n$ could such a group exist?
Consider $27$ unit-cubes assembled into one $3 \times 3 \times 3$ cube. Let $A$ and $B$ be two opposite corners of this large cube. Remove the one unit-cube not visible from the exterior, along with all six unit-cubes in the center of each face. Compute the minimum distance an ant has to walk along the surface of the modified cube to get from $A$ to $B$.
[img]https://cdn.artofproblemsolving.com/attachments/0/5/d3aa802eae40cfe717088445daabd5e7194691.png[/img]
Andy and Harry are trying to make an O for the MOAA logo. Andy starts with a circular piece of leather with radius 3 feet and cuts out a circle with radius 2 feet from the middle. Harry starts with a square piece of leather with side length 3 feet and cuts out a square with side length 2 feet from the middle. In square feet, what is the positive difference in area between Andy and Harry's final product to the nearest integer?
[i]Proposed by Andy Xu[/i]
Let $n=2017$ and $x_1,\dots,x_n$ be boolean variables. An \emph{$7$-CNF clause} is an expression of the form $\phi_1(x_{i_1})+\dots+\phi_7(x_{i_7})$, where $\phi_1,\dots,\phi_7$ are each either the function $f(x)=x$ or $f(x)=1-x$, and $i_1,i_2,\dots,i_7\in\{1,2,\dots,n\}$. For example, $x_1+(1-x_1)+(1-x_3)+x_2+x_4+(1-x_3)+x_{12}$ is a $7$-CNF clause. What's the smallest number $k$ for which there exist $7$-CNF clauses $f_1,\dots,f_k$ such that \[f(x_1,\dots,x_n):=f_1(x_1,\dots,x_n)\cdots f_k(x_1,\dots,x_n)\] is $0$ for all values of $(x_1,\dots,x_n)\in\{0,1\}^n$?
Let $P$ and $P^{\prime }$ be two parallelograms with equal area, and let their sidelengths be $a,$ $b$ and $a^{\prime },$ $b^{\prime }.$ Assume that $a^{\prime }\leq a\leq b\leq b^{\prime },$ and moreover, it is possible to place the segment $b^{\prime }$ such that it completely lies in the interior of the parallelogram $P.$
Show that the parallelogram $P$ can be partitioned into four polygons such that these four polygons can be composed again to form the parallelogram $%
P^{\prime }.$
Choose an integer $n$ from $1$ to $10$ inclusive as your answer to this problem. Let $m$ be the number of distinct values in $\left\{1,2,\ldots,10\right\}$ chosen by all teams at the Math Bonanza for this problem which are greater than or equal to $n$. Your score on this problem will be $\frac{mn}{15}$. For example, if $5$ teams choose $1$, $2$ teams choose $2$, and $6$ teams choose $3$ with these being the only values chosen, and you choose $2$, you will receive $\frac{4}{15}$ points.
[i]2018 CCA Math Bonanza Lightning Round #5.3[/i]
Let $k$ be a given circle and $A$ is a fixed point outside $k$. $BC$ is a diameter of $k$. Find the locus of the orthocentre of $\triangle ABC$ when $BC$ varies.
[i]Proposed by T. Vitanov, E. Kolev[/i]
Find all functions $f:\mathbb{Z}_{>0}\rightarrow\mathbb{Z}_{>0}$ with the following properties:
1) For every natural number $n\geq 3$, $\gcd(f(n),n)\neq 1$.
2) For every natural number $n\geq 3$, there exists $i_n\in\mathbb{Z}_{>0}$, $1\leq i_n\leq n-1$, such that $f(n)=f(i_n)+f(n-i_n)$.
[i]Proposed by Pavel Ciurea[/i]
In the hexagon $ABCDEF$, all angles are equally large. The side lengths satisfy $AB = CD = EF = 3$ and $BC = DE = F A = 2$. The diagonals $AD$ and $CF$ intersect each other in the point $G$. The point $H$ lies on the side $CD$ so that $DH = 1$. Prove that triangle $EGH$ is equilateral.
A quadratic polynomial $p(x)$ has positive real coefficients with sum $1$. Show that given any positive real numbers with product $1$, the product of their values under $p$ is at least $1$.
Let $\omega_{1}$ be a circle with centre $O$. $P$ is a point on $\omega_{1}$. $\omega_{2}$ is a circle with centre $P$, with radius smaller than $\omega_{1}$. $\omega_{1}$ meets $\omega_{2}$ at points $T$ and $Q$. Let $TR$ be a diameter of $\omega_{2}$. Draw another two circles with $RQ$ as the radius, $R$ and $P$ as the centres. These two circles meet at point $M$, with $M$ and $Q$ lie on the same side of $PR$. A circle with centre $M$ and radius $MR$ intersects $\omega_{2}$ at $R$ and $N$. Prove that a circle with centre $T$ and radius $TN$ passes through $O$.
A series of lockers, numbered 1 through 100, are all initially closed. Student 1 goes through and opens every locker. Student 3 goes through and "flips" every 3rd locker ("flipping") a locker means changing its state: if the locker is open he closes it, and if the locker is closed he opens it). Thus, Student 3 will close the third locker, open the sixth, close the ninth. . . . Student 5 then goes through and "flips"every 5th locker. This process continues with all students with odd numbers $n<100$ going through and "flipping" every $n$th locker.
How many lockers are open after this process?
An equilateral triangle $ABC$ is given. On the line through $B$ parallel to $AC$ there is a point $D$, such that $D$ and $C$ are on the same side of the line $AB$. The perpendicular bisector of $CD$ intersects the line $AB$ in $E$. Prove that triangle $CDE$ is equilateral.
A confused cockroach is initially at vertex $A$ of a cube $ABCDEFGH$ with edges measuring $1$ meter, as shown in the figure. Every second, the cockroach moves $1$ meter, always choosing to go to one of the three adjacent vertices to its current position. For example, after $1$ second, the cockroach could stop at vertex $B$, $D$, or $E$.
(a) In how many ways can the cockroach stop at vertex $G$ after $3$ seconds?
(b) Is it possible for the cockroach to stop at vertex A after exactly $2023$ seconds?
(c) In how many ways can the cockroach stop at A after exactly $2024$ seconds?
Note: One way for the cockroach to stop at a vertex after a certain number of seconds differs from another way if, at some point, the cockroach is at different vertices in the trajectory. For example, there are $2$ ways for the cockroach to stop at $C$ after $2$ seconds: one of them passes through $A$, $B$, $C$, and the other through $A$, $D$, $C$.
[img]https://cdn.discordapp.com/attachments/954427908359876608/1299721377124847616/Screenshot_2024-10-16_173123.png?ex=671e3b5b&is=671ce9db&hm=76962ee2949d8324c2f7022ef63f8b7d3c6fe3aabf4ecf526f44249439f204ac&[/img]
[asy]
draw((0,0)--(0,1)--(2,1)--(2,0)--cycle^^(.5,1)--(.5,2)--(1.5,2)--(1.5,1)--(.5,2)^^(.5,1)--(1.5,2)^^(1,2)--(1,0));
//Credit to Zimbalono for the diagram[/asy]
The radius of the smallest circle containing the symmetric figure composed of the $3$ unit squares shown above is
$\textbf{(A) }\sqrt{2}\qquad\textbf{(B) }\sqrt{1.25}\qquad\textbf{(C) }1.25\qquad\textbf{(D) }\frac{5\sqrt{17}}{16}\qquad \textbf{(E) }\text{None of these}$
Let $ n \geq 3$ be a positive integer and let $ m \geq 2^{n\minus{}1}\plus{}1$. Prove that for each family of nonzero distinct subsets $ (A_j)_{j \in \overline{1, m}}$ of $ \{1, 2, ..., n\}$ there exist $ i$, $ j$, $ k$ such that $ A_i \cup A_j \equal{} A_k$.
Consider $n$ weights, $n \ge 2$, of masses $m_1, m_2, ..., m_n$, where $m_k$ are positive integers such that $1 \le m_ k \le k$ for all $k \in \{1,2,...,n\} $: Prove that we can place the weights on the two pans of a balance such that the pans stay in equilibrium if and only if the number $m_1 + m_2 + ...+ m_n$ is even.
Estonian Olympiad
We are given a circle $c(O,R)$ and two points $A,B$ so that $R<AB<2R$.The circle $c_1 (A,r)$ ($0<r<R$) crosses the circle $c$ at C,D ($C$ belongs to the short arc $AB$).From $B$ we consider the tangent lines $BE,BF$ to the circle $c_1$ ,in such way that $E$ lays out of the circle $c$.If $M\equiv EC\cap DF$ show that the quadrilateral $BCFM$ is cyclic.
$3n-1$ points are given in the plane, no three are collinear. Prove that one can select $2n$ of them whose convex hull is not a triangle.
In triangle $ABC,$ the medians to the sides $\overline{AB}$ and $\overline{AC}$ are perpendicular. Prove that $\cot B+\cot C\ge \frac23.$
There are \(n+1\) squares in a row, labelled from 0 to \(n\). Tony starts with \(k\) stones on square 0. On each move, he may choose a stone and advance the stone up to \(m\) squares where \(m\) is the number of stones on the same square (including itself) or behind it.
Tony's goal is to get all stones to square \(n\). Show that Tony cannot achieve his goal in fewer than \(\frac{n}{1} + \frac{n}{2} + \cdots + \frac{n}{k}\) moves.
[i]Proposed by Tony Wang[/i]
Two disjoint circles are inscribed in an angle with vertex $A$, whose measure is equal to $a$. The distance between their centers is $d$. A straight line tangent to both circles and not passing through $A$ intersects the sides of the angle at points $B$ and $C$. Find the radius of the circle circumscribed about triangle $ABC$.
Prove that equation $y^2=x^3+7$ doesn't have any solution on integers.
The cirumradius and the inradius of triangle $ABC$ are equal to $R$ and $r, O, I$ are the centers of respective circles. External bisector of angle $C$ intersect $AB$ in point $P$. Point $Q$ is the projection of $P$ to line $OI$. Find distance $OQ.$
(A.Zaslavsky, A.Akopjan)