Found problems: 85335
The point $M$ moves such that the sum of squares of the lengths from $M$ to faces of a cube, is fixed. Find the locus of $M.$
The cells of a square $2011 \times 2011$ array are labelled with the integers $1,2,\ldots, 2011^2$, in such a way that every label is used exactly once. We then identify the left-hand and right-hand edges, and then the top and bottom, in the normal way to form a torus (the surface of a doughnut).
Determine the largest positive integer $M$ such that, no matter which labelling we choose, there exist two neighbouring cells with the difference of their labels at least $M$.
(Cells with coordinates $(x,y)$ and $(x',y')$ are considered to be neighbours if $x=x'$ and $y-y'\equiv\pm1\pmod{2011}$, or if $y=y'$ and $x-x'\equiv\pm1\pmod{2011}$.)
[i](Romania) Dan Schwarz[/i]
Determine all $4$-tuples $(a,b, c, d)$ of positive real numbers satisfying $a + b +c + d = 1$ and
$\max (\frac{a^2}{b},\frac{b^2}{a}) \cdot \max (\frac{c^2}{d},\frac{d^2}{c}) = (\min (a + b, c + d))^4$
Determine all positive integers $M$ such that the sequence $a_0, a_1, a_2, \cdots$ defined by \[ a_0 = M + \frac{1}{2} \qquad \textrm{and} \qquad a_{k+1} = a_k\lfloor a_k \rfloor \quad \textrm{for} \, k = 0, 1, 2, \cdots \] contains at least one integer term.
For all integers $0 \leq k \leq 16$, let \[S_k = \sum_{j=0}^{k}(-1)^j {\binom{16}{j}}.\] Compute $\max(S_0,S_1, \ldots S_{16})$.
[i]2021 CCA Math Bonanza Tiebreaker Round #4[/i]
Let $k$ be a positive integer. The organising commitee of a tennis tournament is to schedule the matches for $2k$ players so that every two players play once, each day exactly one match is played, and each player arrives to the tournament site the day of his first match, and departs the day of his last match. For every day a player is present on the tournament, the committee has to pay $1$ coin to the hotel. The organisers want to design the schedule so as to minimise the total cost of all players' stays. Determine this minimum cost.
Let $ABC$ be an acute triangle. Let $D$ be a point on side $AB$ and $E$ be a point on side $AC$ such that lines $BC$ and $DE$ are parallel. Let $X$ be an interior point of $BCED$. Suppose rays $DX$ and $EX$ meet side $BC$ at points $P$ and $Q$, respectively, such that both $P$ and $Q$ lie between $B$ and $C$. Suppose that the circumcircles of triangles $BQX$ and $CPX$ intersect at a point $Y \neq X$. Prove that the points $A, X$, and $Y$ are collinear.
Let $A$ and $B$ be finite sets of real numbers and let $x$ be an element of $A+B$. Prove that \[|A\cap (x-B)|\leq \frac{|A-B|^2}{|A+B|}\] where $A+B=\{a+b: a\in A, b\in B\}$, $x-B=\{x-b: b\in B\}$ and $A-B=\{a-b: a\in A, b\in B\}$.
Prove that any triangle can be cut by at most into $3$ parts, from which an isosceles triangle is formed.
The triangle $ABC$ lies on the coordinate plane. The midpoint of $\overline{AB}$ has coordinates $(-16, -63)$, the midpoint of $\overline{AC}$ has coordinates $(13, 50)$, and the midpoint of $\overline{BC}$ has coordinates $(6, -85)$. What are the coordinates of point $A$?
What is the largest prime factor of $7999488$?
Prove that there exist infinitely many distinct positive integers, $x$ and $y$, such that $$x^3+y^2|x^2+y^3$$
Let $a_0$ be a fixed positive integer. We define an infinite sequence of positive integers $\{a_n\}_{n\ge 1}$ in an inductive way as follows: if we are given the terms $a_0,a_1,...a_{n-1}$ , then $a_n$ is the smallest positive integer such that $\sqrt[n]{a_0\cdot a_1\cdot ...\cdot a_n}$ is a positive integer. Show that the sequence $\{a_n\}_{n\ge 1}$ is eventually constant.
[b]Note:[/b] The sequence $\{a_n\}_{n\ge 1}$ is eventually constant if there exists a positive integer $k$ such that $a_n=c$, for every $n\ge k$.
What is the maximum possible value for the sum of the squares of the roots of $x^4+ax^3+bx^2+cx+d$ where $a$, $b$, $c$, and $d$ are $2$, $0$, $1$, and $7$ in some order?
A blue square of side length $10$ is laid on top of a coordinate grid with corners at $(0,0)$, $(0,10)$, $(10,0)$, and $(10,10)$. Red squares of side length $2$ are randomly placed on top of the grid, changing the color of a $2\times2$ square section red. Each red square when placed lies completely within the blue square, and each square's four corners take on integral coordinates. In addition, randomly placed red squares may overlap, keeping overlapped regions red. Compute the expected value of the number of red squares necessary to turn the entire blue square red, rounded to the nearest integer. Your score will be given by $\lfloor25\min\{(\tfrac{A}{C})^2,(\tfrac{C}{A})^2\}\rfloor$, where $A$ is your answer and $C$ is the actual answer.
If a polynomial $f(x)$ is divided by $(x-a)^{2} (x-b)$, where $a\ne b$, derive a formula for the remainder.
Circles $o_1, o_2$ with equal radii intersect at points $A, B$. Points $C, D, E, F$ lie in this order on one line, with $C, E$ lying on $o_1$ and $D, F$ on $o_2$. Perpendicular bisectors of $CD$ and $EF$ intersect $AB$ at $X, Y$ respectively. Prove that $AX=BY$.
For each positive integer $k$, find all positive integer $n$ such that there exists a permutation $a_1,\ldots,a_n$ of $1,2,\ldots,n$ satisfying $$a_1a_2\ldots a_i\equiv i^k \pmod n$$ for each $1\le i\le n$.
[i](Proposed by Tan Rui Xuen and Ivan Chan Guan Yu)[/i]
$$\int_0^\infty \frac{\sin(20x)\sin(21x)}{x^2}\,dx$$
[i]Proposed by Connor Gordon and Vlad Oleksenko[/i]
Four lines intersecting at six points form four triangles. Prove that the circles circumscribed around out these triangles have a common point.
A segment of length $1$ is divided into four segments. Then there exists a quadrilateral with the four segments as sides if and only if each segment is:
$\textbf{(A)}\ \text{equal to}\ \frac{1}{4} \\ \qquad\textbf{(B)}\ \text{equal to or greater than}\ \frac{1}{8}\ \text{and less than}\ \frac{1}{2} \\ \qquad\textbf{(C)}\ \text{greater than}\ \frac{1}{8}\ \text{and less than}\ \frac{1}{2} \\ \qquad\textbf{(D)}\ \text{greater than}\ \frac{1}{8}\ \text{and less than}\ \frac{1}{4} \\ \qquad\textbf{(E)}\ \text{less than}\ \frac{1}{2}$
Let $P$ be a point inside a triangle $ABC$ with $\angle C = 90^o$ such that $AP = AC$, and let $M$ be the midpoint of $AB$ and $CH$ be the altitude. Prove that $PM$ bisects $\angle BPH$ if and only if $\angle A = 60^o$.
Find all integers $n$ for which each cell of $n \times n$ table can be filled with one of the letters $I,M$ and $O$ in such a way that:
[LIST]
[*] in each row and each column, one third of the entries are $I$, one third are $M$ and one third are $O$; and [/*]
[*]in any diagonal, if the number of entries on the diagonal is a multiple of three, then one third of the entries are $I$, one third are $M$ and one third are $O$.[/*]
[/LIST]
[b]Note.[/b] The rows and columns of an $n \times n$ table are each labelled $1$ to $n$ in a natural order. Thus each cell corresponds to a pair of positive integer $(i,j)$ with $1 \le i,j \le n$. For $n>1$, the table has $4n-2$ diagonals of two types. A diagonal of first type consists all cells $(i,j)$ for which $i+j$ is a constant, and the diagonal of this second type consists all cells $(i,j)$ for which $i-j$ is constant.
Evaluate the following definite integral.
\[ 2^{2009}\frac {\int_0^1 x^{1004}(1 \minus{} x)^{1004}\ dx}{\int_0^1 x^{1004}(1 \minus{} x^{2010})^{1004}\ dx}\]
Let there be given a pyramid $SABCD$ whose base $ABCD$ is a parallelogram. Let $N$ be the midpoint of $BC$. A plane $\lambda$ intersects the lines $SC,SA,AB$ at points $P,Q,R$ respectively such that $\overline{CP}/\overline{CS}=\overline{SQ}/\overline{SA}=\overline{AR}/\overline{AB}$. A point $M$ on the line $SD$ is such that the line $MN$ is parallel to $\lambda$. Show that the locus of points $M$, when $\lambda$ takes all possible positions, is a segment of the length $\frac{\sqrt5}2SD$.