Found problems: 85335
Let $n$ be a positive integer. Two players, Alice and Bob, are playing the following game:
- Alice chooses $n$ real numbers; not necessarily distinct.
- Alice writes all pairwise sums on a sheet of paper and gives it to Bob. (There are $\frac{n(n-1)}{2}$ such sums; not necessarily distinct.)
- Bob wins if he finds correctly the initial $n$ numbers chosen by Alice with only one guess.
Can Bob be sure to win for the following cases?
a. $n=5$
b. $n=6$
c. $n=8$
Justify your answer(s).
[For example, when $n=4$, Alice may choose the numbers 1, 5, 7, 9, which have the same pairwise sums as the numbers 2, 4, 6, 10, and hence Bob cannot be sure to win.]
(a) Show that $n(n + 1)(n + 2)$ is divisible by $6$.
(b) Show that $1^{2015} + 2^{2015} + 3^{2015} + 4^{2015} + 5^{2015} + 6^{2015}$ is divisible by $7$.
Find the minimu value of $\frac{1}{\pi}\int_{-\frac{\pi}{2}}^{\frac{\pi}{2}} \{x\cos t+(1-x)\sin t\}^2dt.$
[i]2010 Ibaraki University entrance exam/Science[/i]
A crossword is a grid of black and white cells such that every white cell belongs to some $2\times 2$ square of white cells. A word in the crossword is a contiguous sequence of two or more white cells in the same row or column, delimited on each side by either a black cell or the boundary of the grid.
Show that the total number of words in an $n\times n$ crossword cannot exceed $(n+1)^2/2$.
[i]Proposed by Nikolai Beluhov, Bulgaria[/i]
We are given a cube with edges of length $n$ cm. At our disposal is a long piece of insulating tape of width $1$ cm. It is required to stick this tape to the cube. The tape may freely cross an edge of the cube on to a different face but it must always be parallel to an edge of the cube. It may not overhang the edge of a face or cross over a vertex. How many pieces of the tape are necessary in order to completely cover the cube? (You may assume that $n$ is an integer.)
(A Spivak)
Prove that if the real numbers $ a $ and $ b $ are not both equal to zero, then for every natural $ n $
$$ a^{2n} + a^{2n-1}b + a^{2n-2} b^2 + \ldots + ab^{2n-1} + b^{2n} > 0. $$
Find all functions $f$ from reals to reals which satisfy $f (f(x) + f(y)) = f(x^2) + 2x^2 f(y) + (f(y))^2$ for all real numbers $x$ and $y$.
$N$ different positive integers are arranged around a circle , in such a way that the sum of every $5$ consecutive numbers in the circle is a multiple of $13$. Let $A $ be the smallest possible sum of the $n$ numbers. Calculate the value of $A$ for
$\bullet$ $n = 99$,
$\bullet$ $n = 100$.
Let $H$ be the orthocenter of the triangle $ABC$ and let $D$, $E$, $F$ be the feet of heights by $A$, $B$, $C$. Let $\omega_D$, $\omega_E$, $\omega_F$ be the incircles of $FEH$, $DHF$, $HED$ and let $I_D$, $I_E$, $I_F$ be their centers. Show that $I_DD$, $I_EE$ and $I_FF$ compete.
Let a regular $ (2n \plus{}1)\minus{}$gon be inscribed in a circle of radius $ r.$ We consider all the triangles whose vertices are from those of the regular $ (2n \plus{} 1)\minus{}$gon.
[b](a)[/b] How many triangles among them contain the center of the circle in their interior?
[b](b)[/b] Find the sum of the areas of all those triangles that contain the center of the circle in their interior.
The eight points below are the vertices and the midpoints of the sides of a square. We would like to draw a number of circles through the points, in such a way that each pair of points lie on (at least) one of the circles.
Determine the smallest number of circles needed to do this.
[asy]
unitsize(1 cm);
dot((0,0));
dot((1,0));
dot((2,0));
dot((0,1));
dot((2,1));
dot((0,2));
dot((1,2));
dot((2,2));
[/asy]
The triangle $ABC$ is $| BC | = a$ and $| AC | = b$. On the ray starting from vertex $C$ and passing the midpoint of side $AB$ , choose any point $D$ other than vertex $C$. Let $K$ and $L$ be the projections of $D$ on the lines $AC$ and $BC$, respectively, $K$ and $L$. Find the ratio $| DK | : | DL |$.
The function $f(x, y)$ is defined for all real numbers $x, y$. It satisfies $f(x,0) = ax$ (where $a$ is a non-zero constant) and if $(c, d)$ and $(h, k)$ are distinct points such that $f(c, d) = f(h, k)$, then $f(x, y)$ is constant on the line through $(c, d)$ and $(h, k)$. Show that for any real $b$, the set of points such that $f(x, y) = b$ is a straight line and that all such lines are parallel. Show that $f(x, y) = ax + by$, for some constant $b$.
Find the smallest possible sum $a + b + c + d + e$ where $a, b, c, d,$ and $e$ are positive integers satisfying the conditions
$\star$ each of the pairs of integers $(a, b), (b, c), (c, d),$ and $(d, e)$ are [b]not[/b] relatively prime
$\star$ all other pairs of the five integers [b]are[/b] relatively prime.
Three circles with centres A, B, C touch each other pairwise externally, and touch circle c from inside. Prove that if the centre of c coincideswith the orthocentre of triangle ABC, then ABC is equilateral.
Two circles $O_1$ and $O_2$ intersect at points $A$ and $B$. Lines $\overline{AC}$ and $\overline{BD}$ are drawn such that $C$ is on $O_1$ and $D$ is on $O_2$ and $\overline{AC} \perp \overline{AB}$ and $\overline{BD} \perp \overline{AB}$. If minor arc $AB= 45$ degrees relative to $O_1$ and minor arc $AB= 60$ degrees relative to $O_2$ and the radius of $O_2 = 10$, the area of quadrilateral $CADB$ can be expressed in simplest form as $a + b\sqrt{k} + c\sqrt{\ell}$. Compute $a + b + c + k +\ell$.
Prove that the equation $ 2x^2 - 215y^2 = 1 $ has no integer solutions.
Show that for any $a,b,c$ positive reals,
\[ (a+b)(a+c) \geq 2 \sqrt{abc(a+b+c)} \]
Let $ABC$ be a triangle with midpoint $M$ of $BC$. A point $X$ is called [i]immaculate[/i] if the perpendicular line from $X$ to line $MX$ intersects lines $AB$ and $AC$ at two points that are equidistant from $M$. Suppose $U, V, W$ are three immaculate points on the circumcircle of triangle $ABC$. Prove that $M$ is the incentre of $\triangle UVW$.
[i]Proposed by Pranjal Srivastava and Rohan Goyal[/i]
A wooden block (mass $M$) is hung from a peg by a massless rope. A speeding bullet (with mass $m$ and initial speed $v_\text{0}$) collides with the block at time $t = \text{0}$ and embeds in it. Let $S$ be the system consisting of the block and bullet. Which quantities are conserved between $t = -\text{10 s}$ and $ t = \text{+10 s}$?
[asy]
// Code by riben
draw(circle((0,0),0.3),linewidth(2));
filldraw(circle((0,0),0.3),gray);
draw((0,-0.8)--(0,-15.5),linewidth(2));
draw((5,-15.5)--(-5,-15.5)--(-5,-20.5)--(5,-20.5)--cycle,linewidth(2));
filldraw((5,-15.5)--(-5,-15.5)--(-5,-20.5)--(5,-20.5)--cycle,gray);
draw((-15,-18)--(-16,-17)--(-18,-17)--(-18,-19)--(-16,-19)--cycle,linewidth(2));
filldraw((-15,-18)--(-16,-17)--(-18,-17)--(-18,-19)--(-16,-19)--cycle,gray);
[/asy]
(A) The total linear momentum of $S$.
(B) The horizontal component of the linear momentum of $S$.
(C) The mechanical energy of $S$.
(D) The angular momentum of $S$ as measured about a perpendicular axis through the peg.
(E) None of the above are conserved.
Determine the sets $S{}$ of positive integers satisfying the following two conditions:
[list=a]
[*]For any positive integers $a, b, c{}$, if $ab + bc + ca{}$ is in $S$, then so are $a + b + c{}$ and $abc$; and
[*]The set $S{}$ contains an integer $N \geqslant 160$ such that $N-2$ is not divisible by $4$.
[/list]
[i]Bogdan Blaga, United Kingdom[/i]
A particular country has seven distinct cities, conveniently named $C_1,C_2,\dots,C_7.$ Between each pair of cities, a direction is chosen, and a one-way road is constructed in that direction connecting the two cities. After the construction is complete, it is found that any city is reachable from any other city, that is, for distinct $1 \leq i, j \leq 7,$ there is a path of one-way roads leading from $C_i$ to $C_j.$ Compute the number of ways the roads could have been configured. Pictured on the following page are the possible configurations possible in a country with three cities, if every city is reachable from every other city.
[Insert Diagram]
[i]Proposed by Ezra Erives[/i]
Show that there is no function \(f:\mathbb{N}^* \rightarrow \mathbb{N}^*\) such that \(f^n(n)=n+1\) for all \(n\) (when \(f^n\) is the \(n\)th iteration of \(f\))
In an acute triangle the feet of altitudes drawn from vertices $A$ and $B$ are $D$ and $E$, respectively. Let $M$ be the midpoint of side $AB$. Line $CM$ intersects the circumcircle of $CDE$ again in point $P$ and the circumcircle of $CAB$ again in point $Q$. Prove that $|MP| = |MQ|$.
The number $665$ is represented as a sum of $18$ natural numbers nenule $a_1, a_2, ..., a_{18}$.
Determine the smallest possible value of the smallest common multiple of the numbers $a_1, a_2, ..., a_{18}$.