Found problems: 85335
Find all $ f: Q^ \plus{} \to\ Z$ functions that satisfy $ f \left(\frac {1}{x} \right) \equal{} f(x)$ and $ (x \plus{} 1)f(x \minus{} 1) \equal{} xf(x)$ for all rational numbers that are bigger than 1.
Let be a sequence of $ 51 $ natural numbers whose sum is $ 100. $ Show that for any natural number $ 1\le k<100 $ there are some consecutive numbers from this sequence whose sum is $ k $ or $ 100-k. $
Let $ n$ be an integer, $ n\geq 2$, and the integers $ a_1,a_2,\ldots,a_n$, such that $ 0 < a_k\leq k$, for all $ k \equal{} 1,2,\ldots,n$. Knowing that the number $ a_1 \plus{} a_2 \plus{} \cdots \plus{} a_n$ is even, prove that there exists a choosing of the signs $ \plus{}$, respectively $ \minus{}$, such that
\[ a_1 \pm a_2 \pm \cdots \pm a_n\equal{} 0.
\]
Suppose we have $2013$ piles of coins, with the $i$th pile containing exactly $i$ coins. We wish to remove the coins in a series of steps. In each step, we are allowed to take away coins from as many piles as we wish, but we have to take the same number of coins from each pile. We cannot take away more coins than a pile actually has. What is the minimum number of steps we have to take?
The two circles $\Gamma_1$ and $\Gamma_2$ intersect at $P$ and $Q$. The common tangent that's on the same side as $P$, intersects the circles at $A$ and $B$,respectively. Let $C$ be the second intersection with $\Gamma_2$ of the tangent to $\Gamma_1$ at $P$, and let $D$ be the second intersection with $\Gamma_1$ of the tangent to $\Gamma_2$ at $Q$. Let $E$ be the intersection of $AP$ and $BC$, and let $F$ be the intersection of $BP$ and $AD$. Let $M$ be the image of $P$ under point reflection with respect to the midpoint of $AB$. Prove that $AMBEQF$ is a cyclic hexagon.
Let $k$ be a positive integer and $r_n$ be the remainder when ${2 n} \choose {n}$ is divided by $k$.
Find all $k$ for which the sequence $(r_n)_{n=1}^{\infty}$ is eventually periodic.
Let $BF$ and $CN$ be the altitudes of the acute triangle $ABC$. Bisectors the angles $ACN$ and $ABF$ intersect at the point $T$. Find the radius of the circle circumscribed around the triangle $FTN$, if it is known that $BC = a$.
(Grigory Filippovsky)
Let $f: \mathbb N \to \mathbb N$ be a function such that $f(1)=1$ and
\[f(n)=n - f(f(n-1)), \quad \forall n \geq 2.\]
Prove that $f(n+f(n))=n $ for each positive integer $n.$
Given is a triangle $\triangle{ABC}$,with $AB<AC<BC$,inscribed in circle $c(O,R)$.Let $D,E,Z$ be the midpoints of $BC,CA,AB$ respectively,and $K$ the foot of the altitude from $A$.At the exterior of $\triangle{ABC}$ and with the sides $AB,AC$ as diameters,we construct the semicircles $c_1,c_2$ respectively.Suppose that $P\equiv DZ\cap c_1 \ , \ S\equiv KZ\cap c_1$ and $R\equiv DE\cap c_2 \ , \ T\equiv KE\cap c_2$.Finally,let $M$ be the intersection of the lines $PS,RT$.
[b]i.[/b] Prove that the lines $PR,ST$ intersect at $A$.
[b]ii.[/b] Prove that the lines $PR\cap MD$ intersect on $c$.
[asy]import graph; size(8cm);
real labelscalefactor = 0.5; /* changes label-to-point distance */
pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); /* default pen style */
pen dotstyle = black; /* point style */
real xmin = -4.8592569519241255, xmax = 12.331775417316715, ymin = -3.1864435704043403, ymax = 6.540061585876658; /* image dimensions */
pen aqaqaq = rgb(0.6274509803921569,0.6274509803921569,0.6274509803921569); pen uququq = rgb(0.25098039215686274,0.25098039215686274,0.25098039215686274);
draw((0.6699432366054657,3.2576036755978928)--(0.,0.)--(5.,0.)--cycle, aqaqaq);
/* draw figures */
draw((0.6699432366054657,3.2576036755978928)--(0.,0.), uququq);
draw((0.,0.)--(5.,0.), uququq);
draw((5.,0.)--(0.6699432366054657,3.2576036755978928), uququq);
draw(shift((0.33497161830273287,1.6288018377989464))*xscale(1.662889476749906)*yscale(1.662889476749906)*arc((0,0),1,78.3788505217281,258.3788505217281));
draw(shift((2.834971618302733,1.6288018377989464))*xscale(2.7093067970187343)*yscale(2.7093067970187343)*arc((0,0),1,-36.95500560847834,143.0449943915217));
draw((0.6699432366054657,3.2576036755978928)--(0.6699432366054657,0.));
draw((-0.9938564482532047,2.628510486065423)--(2.5,0.));
draw((0.6699432366054657,0.)--(0.,3.2576036755978923));
draw((0.6699432366054657,0.)--(5.,3.257603675597893));
draw((2.5,0.)--(3.3807330143335355,4.282570444700163));
draw((-0.9938564482532047,2.628510486065423)--(2.5,4.8400585427926455));
draw((2.5,4.8400585427926455)--(5.,3.257603675597893));
draw((-0.9938564482532047,2.628510486065423)--(3.3807330143335355,4.282570444700163), linewidth(1.2) + linetype("2 2"));
draw((0.,3.2576036755978923)--(5.,3.257603675597893), linewidth(1.2) + linetype("2 2"));
draw(circle((2.5,1.18355242571055), 2.766007292905304), linewidth(0.4) + linetype("2 2"));
draw((2.5,4.8400585427926455)--(2.5,0.), linewidth(1.2) + linetype("2 2"));
/* dots and labels */
dot((0.6699432366054657,3.2576036755978928),linewidth(3.pt) + dotstyle);
label("$A$", (0.7472169504504719,2.65), NE * labelscalefactor);
dot((0.,0.),linewidth(3.pt) + dotstyle);
label("$B$", (-0.2,-0.4), NE * labelscalefactor);
dot((5.,0.),linewidth(3.pt) + dotstyle);
label("$C$", (5.028818057451246,-0.34281415594345044), NE * labelscalefactor);
dot((2.5,0.),linewidth(3.pt) + dotstyle);
label("$D$", (2.4275434226319077,-0.32665717063401356), NE * labelscalefactor);
dot((2.834971618302733,1.6288018377989464),linewidth(3.pt) + dotstyle);
label("$E$", (3.073822835009383,1.5637101105701008), NE * labelscalefactor);
dot((0.33497161830273287,1.6288018377989464),linewidth(3.pt) + dotstyle);
label("$Z$", (0.003995626216375389,1.402140257475732), NE * labelscalefactor);
dot((0.6699432366054657,0.),linewidth(3.pt) + dotstyle);
label("$K$", (0.6179610679749769,-0.3105001853245767), NE * labelscalefactor);
dot((-0.9938564482532047,2.628510486065423),linewidth(3.pt) + dotstyle);
label("$P$", (-1.0785223895158957,2.7916409940873033), NE * labelscalefactor);
dot((0.,3.2576036755978923),linewidth(3.pt) + dotstyle);
label("$S$", (-0.14141724156855653,3.454077391774215), NE * labelscalefactor);
dot((5.,3.257603675597893),linewidth(3.pt) + dotstyle);
label("$T$", (5.061132028070119,3.3571354799175936), NE * labelscalefactor);
dot((3.3807330143335355,4.282570444700163),linewidth(3.pt) + dotstyle);
label("$R$", (3.445433497126431,4.375025554412117), NE * labelscalefactor);
dot((2.5,4.8400585427926455),linewidth(3.pt) + dotstyle);
label("$M$", (2.5567993051074027,4.940520040242407), NE * labelscalefactor);
clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle);
/* end of picture */[/asy]
Let $[a,b]$ be a given interval of real numbers not containing integers. Prove that there exists $N>0$ such that $[Na,Nb]$ does not contain integer numbers and the length of the interval $[Na,Nb]$ exceedes $\dfrac 16$.
A rectangular box has a total surface area of $94$ square inches. The sum of the lengths of all its edges is $48$ inches. What is the sum of the lengths in inches of all of its interior diagonals?
${ \textbf{(A)}\ 8\sqrt{3}\qquad\textbf{(B)}\ 10\sqrt{2}\qquad\textbf{(C)}\ 16\sqrt{3}\qquad\textbf{(D)}}\ 20\sqrt{2}\qquad\textbf{(E)}\ 40\sqrt{2} $
Equal line segments are marked in triangle $ABC$. Find its angles.
[img]https://cdn.artofproblemsolving.com/attachments/0/2/bcb756bba15ba57013f1b6c4cbe9cc74171543.png[/img]
A [i]mirrored polynomial[/i] is a polynomial $f$ of degree $100$ with real coefficients such that the $x^{50}$ coefficient of $f$ is $1$, and $f(x) = x^{100} f(1/x)$ holds for all real nonzero $x$. Find the smallest real constant $C$ such that any mirrored polynomial $f$ satisfying $f(1) \ge C$ has a complex root $z$ obeying $|z| = 1$.
The tangents at points $B$ and $C$ on a given circle meet at point $A$. Let $Q$ be a point on segment $AC$ and let $BQ$ meet the circle again at $P$. The line through $Q $ parallel to $AB$ intersects $BC$ at $J$. Prove that $PJ$ is parallel to $AC$ if and only if $BC^2 = AC\cdot QC$.
[b][u]BdMO National 2015 Secondary Problem 1.[/u][/b]
A crime is committed during the hartal.There are four witnesses.The witnesses are logicians and make the following statement:
Witness [b]One[/b] said exactly one of the four witnesses is a liar.
Witness [b]Two[/b] said exactly two of the four witnesses is a liar.
Witness [b]Three[/b] said exactly three of the four witnesses is a liar.
Witness [b]Four[/b] said exactly four of the four witnesses is a liar.
Assume that each of the statements is either true or false.How many of the winesses are liars?
Let us call a sequence $(b_1, b_2, \ldots)$ of positive integers fast-growing if $b_{n+1} \geq b_n + 2$ for all $n \geq 1$. Also, for a sequence $a = (a(1), a(2), \ldots)$ of real numbers and a sequence $b = (b_1, b_2, \ldots)$ of positive integers, let us denote
\[
S(a, b) = \sum_{n=1}^{\infty} \left| a(b_n) + a(b_n + 1) + \cdots + a(b_{n+1} - 1) \right|.
\]
a) Do there exist two fast-growing sequences $b = (b_1, b_2, \ldots)$, $c = (c_1, c_2, \ldots)$ such that for every sequence $a = (a(1), a(2), \ldots)$, if all the series
\[
\sum_{n=1}^{\infty} a(n), \quad S(a, b) \quad \text{and} \quad S(a, c)
\]
are convergent, then the series $\sum_{n=1}^{\infty} |a(n)|$ is also convergent?
b) Do there exist three fast-growing sequences $b = (b_1, b_2, \ldots)$, $c = (c_1, c_2, \ldots)$, $d = (d_1, d_2, \ldots)$ such that for every sequence $a = (a(1), a(2), \ldots)$, if all the series
\[
S(a, b), \quad S(a, c) \quad \text{and} \quad S(a, d)
\]
are convergent, then the series $\sum_{n=1}^{\infty} |a(n)|$ is also convergent?
Each row of a $24 \times 8$ table contains some permutation of the numbers $1, 2, \cdots , 8.$ In each column the numbers are multiplied. What is the minimum possible sum of all the products?
[i](C. Wu)[/i]
Csongi taught Benedek how to fold a duck in 8 steps from a $24$ cm $\times 24$ cm piece of paper. The paper is meant to be folded along the dashed line in the direction of the arrow. Once Benedek folded the duck, he undid all the steps, finding crease lines on the square sheet of paper. On one side of the paper, he drew in blue the folds which opened towards Benedek, and in red the folds which opened toward the table. How many cm is the difference between the total length of the blue lines and the red lines?
[img]https://cdn.artofproblemsolving.com/attachments/0/1/358a3b2c3b959a85406b94e34c182fd1c2e28d.png[/img]
An ancient Inca legend tells that a monster lives among the mountains that when wakes up, eats everyone who read this issue. After such a task, the monster returns to the mountains and sleeps for a number of years equal to the sum of its digits of the year in which you last woke up. The monster woke up for the first time in the year $234$.
a) Would the monster have woken up between the years $2005$ and $2015$?
b) Will we be safe in the next $10$ years?
Albert and Barbara play the following game. On a table there are $1999$ sticks, and each player in turn removes some of them: at least one stick, but at most half of the currently remaining sticks. The player who leaves just one stick on the table loses the game. Barbara moves first. Decide which player has a winning strategy and describe that strategy.
Consider the string of length $6$ composed of three characters $a, b, c$. For each string, if two $a$s are next to each other, or two $b$s are next to each other, then replace $aa$ by $b$, and replace $bb$ by $a$. Also, if $a$ and $b$ are next to each other, or two $c$s are next to each other, remove all two of them (i.e. delete $ab, ba, cc$). Determine the number of strings that can be reduced to $c$, the string of length $1$, by the reducing processes mentioned above.
Define the two sequences $a_0, a_1, a_2, \cdots$ and $b_0, b_1, b_2, \cdots$ by $a_0 = 3$ and $b_0 = 1$ with the recurrence relations $a_{n+1} = 3a_n + b_n$ and $b_{n+1} = 3b_n - a_n$ for all nonnegative integers $n.$ Let $r$ and $s$ be the remainders when $a_{32}$ and $b_{32}$ are divided by $31,$ respectively. Compute $100r + s.$
Five students named Fred, Gail, Henry, Iggy, and Joan are seated around a circular table in that order. To decide who goes first in a game, they play “countdown”. Henry starts by saying ‘34’, with Iggy saying ‘33’. If they continue to count down in their circular order, who will eventually say ‘1’?
$\textbf{(A)}\ \text{Fred} \qquad \textbf{(B)}\ \text{Gail} \qquad \textbf{(C)}\ \text{Henry} \qquad \textbf{(D)}\ \text{Iggy} \qquad \textbf{(E)}\ \text{Joan}$
The sequence $(x_n)$ is defined as follows:
$$x_1=2,\, x_{n+1}=\sqrt{x_n+8}-\sqrt{x_n+3}$$
for all $n\geq 1$.
a. Prove that $(x_n)$ has a finite limit and find that limit.
b. For every $n\geq 1$, prove that
$$n\leq x_1+x_2+\dots +x_n\leq n+1.$$
Find all finite and non-empty sets $A$ of functions $f: \mathbb{R} \mapsto \mathbb{R}$ such that for all $f_1, f_2 \in A$, there exists $g \in A$ such that for all $x, y \in \mathbb{R}$
$$f_1 \left(f_2 (y)-x\right)+2x=g(x+y)$$