Found problems: 85335
Let $$f(x) = (...((x - 2)^2 - 2)^2 - 2)^2... - 2)^2$$
(here there are $n$ brackets $( )$). Find $f''(0)$
Suppose we have sequences $(a_n)_{n \ge 0}$ and $(b_n)_{n \ge 0}$ and the function $f(x)=\tfrac{1}{x}$ such that for all $n$ we have:
[list]
[*]$a_{n+1} = f(f(a_n+b_n)-f(f(a_n)+f(b_n))$
[*]$a_{n+2} = f(1-a_n) - f(1+a_n)$
[*]$b_{n+2} = f(1-b_n) - f(1+b_n)$
[/list]
Given that $a_0=\tfrac{1}{6}$ and $b_0=\tfrac{1}{7},$ then $b_5=\tfrac{m}{n},$ where $m$ and $n$ are relatively prime positive integers. Find the sum of the prime factors of $mn.$
[u]Round 1[/u]
[b]p1.[/b] The alphabet of the Aau-Bau language consists of two letters: A and B. Two words have the same meaning if one of them can be constructed from the other by replacing any AA with A, replacing any BB with B, or by replacing any ABA with BAB. For example, the word AABA means the same thing as ABA, and AABA also means the same thing as ABAB. In this language, is it possible to name all seven days of the week?
[b]p2.[/b] A museum has a $4\times 4$ grid of rooms. Every two rooms that share a wall are connected by a door. Each room contains some paintings. The total number of paintings along any path of $7$ rooms from the lower left to the upper right room is always the same. Furthermore, the total number of paintings along any path of $7$ rooms from the lower right to the upper left room is always the same. The guide states that the museum has exactly $500$ paintings. Show that the guide is mistaken.
[img]https://cdn.artofproblemsolving.com/attachments/7/6/0fd93a0deaa71a5bb1599d2488f8b4eac5d0eb.jpg[/img]
[b]p3.[/b] A playground has a swing-set with exactly three swings. When 3rd and 4th graders from Dr. Anna’s math class play during recess, she has a rule that if a $3^{rd}$ grader is in the middle swing there must be $4^{th}$ graders on that person’s left and right. And if there is a $4^{th}$ grader in the middle, there must be $3^{rd}$ graders on that person’s left and right. Dr. Anna calculates that there are $350$ different ways her students can arrange themselves on the three swings with no empty seats. How many students are in her class?
[img]https://cdn.artofproblemsolving.com/attachments/5/9/4c402d143646582376d09ebbe54816b8799311.jpg[/img]
[b]p4.[/b] The archipelago Artinagos has $19$ islands. Each island has toll bridges to at least $3$ other islands. An unsuspecting driver used a bad mapping app to plan a route from North Noether Island to South Noether Island, which involved crossing $12$ bridges. Show that there must be a route with fewer bridges.
[img]https://cdn.artofproblemsolving.com/attachments/e/3/4eea2c16b201ff2ac732788fe9b78025004853.jpg[/img]
[b]p5.[/b] Is it possible to place the numbers from $1$ to $121$ in an $11\times 11$ table so that numbers that differ by $1$ are in horizontally or vertically adjacent cells and all the perfect squares $(1, 4, 9, ... , 121)$ are in one column?
[u]Round 2[/u]
[b]p6.[/b] Hungry and Sneaky have opened a rectangular box of chocolates and are going to take turns eating them. The chocolates are arranged in a $2m \times 2n$ grid. Hungry can take any two chocolates that are side-by-side, but Sneaky can take only one at a time. If there are no more chocolates located side-by-side, all remaining chocolates go to Sneaky. Hungry goes first. Each player wants to eat as many chocolates as possible. What is the maximum number of chocolates Sneaky can get, no matter how Hungry picks his?
[img]https://cdn.artofproblemsolving.com/attachments/b/4/26d7156ca6248385cb46c6e8054773592b24a3.jpg[/img]
[b]p7.[/b] There is a thief hiding in the sultan’s palace. The palace contains $2019$ rooms connected by doors. One can walk from any room to any other room, possibly through other rooms, and there is only one way to do this. That is, one cannot walk in a loop in the palace. To catch the thief, a guard must be in the same room as the thief at the same time. Prove that $11$ guards can always find and catch the thief, no matter how the thief moves around during the search.
[img]https://cdn.artofproblemsolving.com/attachments/a/b/9728ac271e84c4954935553c4d58b3ff4b194d.jpg[/img]
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Let $\Phi$ and $\Psi$ denote the Euler totient and Dedekind‘s totient respectively. Determine all $n$ such that $\Phi(n)$ divides $n +\Psi (n)$.
Given $n\geq2$, let $\mathcal{A}$ be a family of subsets of the set $\{1,2,\dots,n\}$ such that, for any $A_1,A_2,A_3,A_4 \in \mathcal{A}$, it holds that $|A_1 \cup A_2 \cup A_3 \cup A_4| \leq n -2$.
Prove that $|\mathcal{A}| \leq 2^{n-2}.$
The diameter of a circle is divided into $ n$ equal parts. On each part a semicircle is construced. As $ n$ becomes very large, the sum of the lengths of the arcs of the semicircles approaches a length:
$ \textbf{(A)}$ equal to the semi-circumference of the original circle
$ \textbf{(B)}$ equal to the diameter of the original circle
$ \textbf{(C)}$ greater than the diameter but less than the semi-circumeference of the original circle
$ \textbf{(D)}$ that is infinite
$ \textbf{(E)}$ greater than the semi-circumference but finite
Find all functions $ f:\mathbb R \to \mathbb R$ such that $xf(y)+yf(x)=(x+y)f(x)f(y)$ for all reals $x$ and $y$.
In a circle of radius $1$, six arcs of radius $1$ are drawn, which cut the circle as in the figure. Determine the black area.
[img]https://cdn.artofproblemsolving.com/attachments/8/9/0323935be8406ea0c452b3c8417a8148c977e3.jpg[/img]
Let $P(x)=x^4+20x^3+29x^2-666x+2025.$ It is known that $P(x)>0$ for every real $x.$ There is a root $r$ for $P$ in the first quadrant of the complex plane that can be expressed as $r=\frac{1}{2}(a+bi+\sqrt{c+di}),$ where $a,b,c,d$ are integers. Find $a+b+c+d.$
The numbers $1, 2, \dots , n$ are written on a blackboard and then erased via the following process:[list]
[*] Before any numbers are erased, a pair of numbers is chosen uniformly at random and circled.
[*] Each minute for the next $n -1$ minutes, a pair of numbers still on the blackboard is chosen uniformly at random and the smaller one is erased.
[*] In minute $n$, the last number is erased.
[/list]
What is the probability that the smaller circled number is erased before the larger?
[i]Proposed by Ethan Tan[/i]
An arbitrary point is selected on each of twelve diagonals of the faces of a cube.The centroid of these twelve points is determined. Find the locus of all these centroids.
Let $ x \equal{} \sqrt[3]{\frac{4}{25}}\,$. There is a unique value of $ y$ such that $ 0 < y < x$ and $ x^x \equal{} y^y$. What is the value of $ y$? Express your answer in the form $ \sqrt[c]{\frac{a}{b}}\,$, where $ a$ and $ b$ are relatively prime positive integers and $ c$ is a prime number.
$ABCD$ is convex quadrilateral. Circumcircle of $ABC$ intersect $AD$ and $DC$ at points $P$ and $Q$. Circumcircle of $ADC$ intersect $AB$ and $BC$ at points $S$ and $R$. Prove that if $PQRS$ is parallelogram then $ABCD$ is parallelogram
Given a rectangular parallelepiped $ABCDA_1B_1C_1D_1$, which has $AD= DC = 3\sqrt2$ cm, and $DD_1 = 8$ cm. Through the diagonal $B_1D$ of the parallelepiped $m$ parallel to line $A_1C_1$ is drawn on the plane $\gamma$.
a) Draw a section of a parallelepiped with plane $\gamma$.
b) Justify what geometric figure is this section, and find its area.
(Alexander Shkolny)
Let $x$ and $y$ be real numbers satisfying the conditions $x + y = 4$ and $xy = 3$. Compute the value of $(x - y)^2$.
A. $0$ B. $1$ C. $4$ D. $9$ E.$ -1$
Two circles with radii $R$ and $r$ intersect at $C$ and $D$ and are tangent to a line $\ell$ at $A$ and $B$. Prove that the circumradius of triangle $ABC$ does not depend on the length of segment $AB$.
Determine all injective functions defined on the set of positive integers into itself satisfying the following condition: If $S$ is a finite set of positive integers such that $\sum\limits_{s\in S}\frac{1}{s}$ is an integer, then $\sum\limits_{s\in S}\frac{1}{f\left( s\right) }$ is also an integer.
Let $S = \{f(a, b) | a, b = 1,2,3, 4$ and $a \ne b\}$, and consider all nonzero polynomials $p(X,Y )$ with integer coefficients such that $p(a, b) = 0$ for every element $(a,b)$ in $S$.
(a) What is the minimal degree of such polynomial $p(X, Y )$ ?
(b) Determine all such polynomials $p(X, Y )$ with minimal degree.
$ M,N,P,Q,R,S $ are the midpoints of the sides $ AB,BC,CD,DE,EF,FA $ of a convex hexagon $ ABCDEF. $
[b]a)[/b] Show that with the segments $ MQ,NR,PS, $ it can be formed a triangle.
[b]b)[/b] Show that a triangle formed with the segments $ MQ,NR,PS $ is right if and only if ether $ MQ\perp NR $ or $ MQ\perp PS $ or $ PS\perp RN. $
[i]Vasile Pop[/i]
We say that a triple of integers $(x, y, z)$ is of [i]jenifer [/i] type if $x, y$, and $z$ are positive integers, with $y \ge 2$, and $$x^2 - 3y^2 = z^2 - 3.$$
a) Find a triple $(x, y, z)$ of the jenifer type with $x = 5$ and $x = 7$.
b) Show that for every $x \ge 5$ and odd there are at least two distinct triples $(x, y_1, z_1)$ and $(x, y_2, z_2)$ of jenifer type.
c) Find some triple $(x, y, z)$ of jenifer type with $x$ even.
Let $ABCD$ be a convex quadrilateral inscribed in a circle with $M$ and $N$ the midpoints of the diagonals $AC$ and $BD$ respectively. Suppose that $AC$ bisects $\angle BMD$. Prove that $BD$ bisects $\angle ANC$.
We have $2p-1$ integer numbers, where $p$ is a prime number. Prove that we can choose exactly $p$ numbers (from these $2p-1$ numbers) so that their sum is divisible by $p$.
Prove that the number $x = \sqrt{1 + \sqrt 2}$ is irrational.
Let $a$ and $b$ be two circles, intersecting in two distinct points $Y$ and $Z$. A circle $k$ touches the circles $a$ and $b$ externally in the points $A$ and $B$.
Show that the angular bisectors of the angles $\angle ZAY$ and $\angle YBZ$ intersect on the line $YZ$.
Let $M$ be the set of the real numbers except for finitely many elements. Prove that for every positive integer $n$ there exists a polynomial $f(x)$ with $\deg f = n$, such that all the coefficients and the $n$ real roots of $f$ are all in $M$.