Found problems: 85335
Find the least positive integer $n$ satisfying the following statement: for eash pair of positive integers $a$ and $b$ such that $36$ divides $a+b$ and $n$ divides $ab$ it follows that $36$ divides both $a$ and $b$.
Find the number of ordered pairs $(a, b)$ of positive integers that are solutions of the following equation: \[a^2 + b^2 = ab(a+b).\]
The figure shows a rectangle, its circumscribed circle and four semicircles, which have the rectangle’s sides as diameters. Prove that the combined area of the four dark gray crescentshaped regions is equal to the area of the light gray rectangle.
[img]https://1.bp.blogspot.com/-gojv6KfBC9I/XzT9ZMKrIeI/AAAAAAAAMVU/NB-vUldjULI7jvqiFWmBC_Sd8QFtwrc7wCLcBGAsYHQ/s0/2013%2BMohr%2Bp3.png[/img]
Let $ABCDE$ be a convex pentagon such that
\begin{align*}
&AB+BC+CD+DE+EA=65 \text{ and} \\
&AC+CE+EB+BD+DA=72.
\end{align*}
Compute the perimeter of the convex pentagon whose vertices are the midpoints of the sides of $ABCDE.$
We are given an equilateral triangle ABC with the length of its side equal to $1$. There are $n-1$ points on each side of the triangle $ABC$ that equally divide the side into $n$ segments. We draw all possible lines that pass through any two of all those $3(n-1)$ points such that they are parallel to one of three sides of triangle $ABC$. All such lines divide triangle $ABC$ into some lesser triangles whose vertices are called [i]nodes[/i]. We assign a real number for each [i]node[/i] such that the following conditions are satisfied:
(I) real numbers $a,b,c$ are assigned to $A,B,C$ respectively;
(II) for any rhombus that is consisted of two lesser triangles that share a common side, the sum of the numbers of vertices on its one diagonal is equal to that of vertices on the other diagonal.
1) Find the minimum distance between the [i]node[/i] with the maximal number to the [i]node[/i] with the minimal number;
2) Denote by $S$ the sum of the numbers of all [i]nodes[/i], find $S$.
Jose is $4$ years younger than Zack. Zack is $3$ years older than Inez. Inez is $15$ years old. How old is Jose?
$\text{(A)}\ 8 \qquad \text{(B)}\ 11 \qquad \text{(C)}\ 14 \qquad \text{(D)}\ 16 \qquad \text{(E)}\ 22$
Suppose $f(x, y)$ is a function that takes in two integers and outputs a real number, such that it satisfies
$$f(x, y) = \frac{f(x, y + 1) + f(x, y - 1)}{2}$$
$$f(x, y) = \frac{f(x + 1, y) + f(x - 1, y)}{2}$$
What is the minimum number of pairs $(x, y)$ we need to evaluate to be able to uniquely determine $f$?
A circle passing through the midpoint $M$ of the side $BC$ and the vertex $A$ of the triangle $ABC$ intersects the segments $AB$ and $AC$ for the second time in the points $P$ and $Q$, respectively. Prove that if $\angle BAC=60^{\circ}$, then $AP+AQ+PQ<AB+AC+\frac{1}{2} BC$.
An athlete's target heart rate, in beats per minute, is $80\%$ of the theoretical maximum heart rate. The maximum heart rate is found by subtracting the athlete's age, in years, from $220$. To the nearest whole number, what is the target heart rate of an athlete who is $26$ years old?
$\textbf{(A)}\ 134\qquad
\textbf{(B)}\ 155 \qquad
\textbf{(C)}\ 176\qquad
\textbf{(D)}\ 194\qquad
\textbf{(E)}\ 243$
Let $A$ be a finite set of positive integers, and for each positive integer $n$ we define
\[S_n = \{x_1 + x_2 + \cdots + x_n \;\vert\; x_i \in A \text{ for } i = 1, 2, \dots, n\}\]
That is, $S_n$ is the set of all positive integers which can be expressed as sum of exactly $n$ elements of $A$, not necessarily different. Prove that there exist positive integers $N$ and $k$ such that
$$\left\vert S_{n + 1} \right\vert = \left\vert S_n \right\vert + k \text{ for all } n\geq N.$$
[i]Proposed by Ariel García[/i]
Let $ABCD$ be a convex quadrilateral such that $\vartriangle ABC$ is an equilateral triangle. Let $P$ be a point inside the quadrilateral such that $\vartriangle APD$ is an equilateral triangle and $\angle PCD = 30^o$. Suppose $CP = 6$ and $CD = 8$. The area of the triangle formed by $P$, the midpoint of $\overline{BC}$, and the midpoint of $\overline{AB}$ can be expressed in simplest radical form as $\frac{a+b\sqrt{c}}{d}$ , where $a$, $b$, $c$, and $d$ are positive integers with $gcd(a, b, d) = 1$ and with $c$ not divisible by the square of any prime. Compute $a + b + c + d$.
Given that $20N^2$ is a divisor of $11!,$ what is the greatest possible integer value of $N?$
$p$ is a prime number that is greater than $2$. Let $\{ a_{n}\}$ be a sequence such that $ na_{n+1}= (n+1) a_{n}-\left( \frac{p}{2}\right)^{4}$.
Show that if $a_{1}=5$, the $16 \mid a_{81}$.
On each of the 2006 cards a natural number is written. Cards are placed arbitrarily in a row. 2 players take in turns a card from any end of the row until all the cards are taken. After that each player calculates sum of the numbers written of his cards. If the sum of the first player is not less then the sum of the second one then the first player wins. Show that there's a winning strategy for the first player.
Note that $k\ge 1$ for an odd natural number $$k! ! = k \cdot (k - 2) \cdot ... \cdot 1.$$
Prove that $2^n$ divides $(2^n -1)!! -1$ for all $n \ge 3$.
Determine all triplets off positive integers $ (a,b,c)$ for which $ \mid2^a\minus{}b^c\mid\equal{}1$
Let there exist a configuration of [i]exactly[/i] 1 black king, $n$ black chess pieces (each of which can be a pawn, knight, bishop, rook, or queen), and a white [i]anti-king[/i] on a standard 8x8 board in which the white [i]anti-king[/i] is not under attack, but will be if it is moved. Compute the minimal value of $n$.
*An [i]anti-king[/i] can move to any square is [b]not[/b] 1 square vertically, horizontally, or diagonally. It can also capture undefended pieces.
[i]2022 CCA Math Bonanza Team Round #4[/i]
The positive integers \( a \) and \( b \) are coprime and such that there exist positive integers \( m_2 \) and \( m_5 \) for which \( am_2 + b \) is a perfect square of a positive integer, and \( am_5 + b \) is a perfect fifth power of a positive integer. Does there always exist a positive integer \( n \) for which \( an + b \) is a perfect \( k \)-th power of a positive integer, if:
a) \( k = 7 \);
b) \( k = 10 \)?
The Hawking Space Agency operates $n-1$ space flights between the $n$ habitable planets of the Local Galaxy Cluster. Each flight has a fixed price which is the same in both directions, and we know that using these flights, we can travel from any habitable planet to any habitable planet.
In the headquarters of the Agency, there is a clearly visible board on a wall, with a portrait, containing all the pairs of different habitable planets with the total price of the cheapest possible sequence of flights connecting them. Suppose that these prices are precisely $1,2, ... , \binom{n}{2}$ monetary units in some order. prove that $n$ or $n-2$ is a square number.
The vertices of two regular octagons are numbered from $1$ to $8$, in some order, which may vary between both octagons (each octagon must have all numbers from $1$ to $8$). After this, one octagon is placed on top of the other so that every vertex from one octagon touches a vertex from the other. Then, the numbers of the vertices which are in contact are multiplied (i.e., if vertex $A$ has a number $x$ and is on top of vertex $A'$ that has a number $y$, then $x$ and $y$ are multiplied), and the $8$ products are then added.
Prove that, for any order in which the vertices may have been numbered, it is always possible to place one octagon on top of the other so that the final sum is at least $162$.
Note: the octagons can be rotated.
The orthocenter of an acute triangle $ABC$ is $H$. Let $K$ and $P$ be the midpoints of lines $BC$ and $AH$, respectively. The angle bisector drawn from the vertex $A$ of the triangle $ABC$ intersects with line $KP$ at $D$. Prove that $HD\perp AD$.
Prove that the equation \[ x^n + 1 = y^{n+1}, \] where $n$ is a positive integer not smaller then 2, has no positive integer solutions in $x$ and $y$ for which $x$ and $n+1$ are relatively prime.
Numbers 1 and −1 are written in the cells of a board 2000×2000. It is known that the sum of all the numbers in the board is positive. Show that one can select 1000 rows and 1000 columns such that the sum of numbers written in their intersection cells is at least 1000.
[i]D. Karpov[/i]
A complete graph of $n$ vertices is a set of $n$ vertices and those vertices are connected in pairs by edges. Suppose the graph has $n$ vertices $A_1, A_2, ..., A_n$, the cycle is a set of edges of the form $A_{i_1}A_{i_2}, A_{i_2}A_{i_3},..., A_{i_m}A_{i_1}$ with $i_1, i_2, ..., i_m \in {1, 2, ..., n}$ double one different.
We call $m$ the length of this cycle. Find the smallest positive integer$ n$ such that for every way of coloring all edges of a complete graph of $n$ vertices, each edge filled with one of three different colors, there is always a cycle of even length with the same color.
PS. The same problem with another wording [url=https://artofproblemsolving.com/community/c6h151391p852296]here [/url].
Find all differentiable functions $f:\mathbb{R}\to\mathbb{R}$ such that
\[f'(x)=\frac{f(x+n)-f(x)}n\]
for all real numbers $x$ and all positive integers $n.$