Found problems: 85335
As shown below, there is a $40\times30$ paper with a filled $10\times5$ rectangle inside of it. We want to cut out the filled rectangle from the paper using four straight cuts. Each straight cut is a straight line that divides the paper into two pieces, and we keep the piece containing the filled rectangle. The goal is to minimize the total length of the straight cuts. How to achieve this goal, and what is that minimized length? Show the correct cuts and write the final answer. There is no need to prove the answer.
[i]Proposed by Morteza Saghafian[/i]
A single section at a stadium can hold either $7$ adults or $11$ children. When $N$ sections are completely lled, an equal number of adults and children will be seated in them. What is the least possible value of $N$?
We wish to construct a matrix with $19$ rows and $86$ columns, with entries $x_{ij} \in \{0, 1, 2\} \ (1 \leq i \leq 19, 1 \leq j \leq 86)$, such that:
[i](i)[/i] in each column there are exactly $k$ terms equal to $0$;
[i](ii)[/i] for any distinct $j, k \in \{1, . . . , 86\}$ there is $i \in \{1, . . . , 19\}$ with $x_{ij} + x_{ik} = 3.$
For what values of $k$ is this possible?
A convex $n$-gon $P$, where $n > 3$, is dissected into equal triangles by diagonals non-intersecting inside it. Which values of $n$ are possible, if $P$ is circumscribed?
The incircle of the triangle $ABC$ touches its sides $AB,BC,CA$ at points $C_1,A_1,B_1$ respectively. If $r$ is the inradius of $\vartriangle ABC, P,P_1$ are the perimeters of $\vartriangle ABC, \vartriangle A_1B_1C_1$ respectively, prove that $P+P_1 \ge 9 \sqrt3 r$.
I. Voronovich
Let us call "fine" the $2n$-digit number if it is exact square itself and the two numbers represented by its first $n$ digits (first digit may not be zero) and last $n$ digits (first digit may be zero, but it may not be zero itself) are exact squares also.
a) Find all two- and four-digit fine numbers.
b) Is there any six-digit fine number?
c) Prove that there exists $20$-digit fine number.
d) Prove that there exist at least ten $100$-digit fine numbers.
e) Prove that there exists $30$-digit fine number.
Suppose $n$ is a natural number such that $4^n + 2^n + 1$ is a prime. Prove that $n = 3^k$ for some nonnegative integer $k$.
There are $28$ students who have to be separated into two groups such that the number of students in each group
is a multiple of $4$. The number of ways to split them into the groups can be written as
$$\sum_{k \ge 0} 2^k a_k = a_0 +2a_1 +4a_2 +...$$
where each $a_i$ is either $0$ or $1$. Find the value of
$$\sum_{k \ge 0} ka_k = 0+ a_1 +2a_2 +3a3_ +....$$
There is a pile of $1000$ matches. Two players each take turns and can take $1$ to $5$ matches. It is also allowed at most $10$ times during the whole game to take $6$ matches, for example $7$ exceptional moves can be done by the first player and $3$ moves by the second and then no more exceptional moves are allowed. Whoever takes the last match wins. Determine which player has a winning strategy.
Let $ABCD$ be a unit square. A semicircle with diameter $AB$ is drawn so that it lies outside of the square. If $E$ is the midpoint of arc $AB$ of the semicircle, what is the area of triangle $CDE$
Let $\mathcal{P}$ be the set of all polynomials with coefficients in $\{0, 1\}$. Suppose $a, b$ are non-zero integers such that for every $f \in \mathcal{P}$ with $f(a)\neq 0$, we have $f(a) \mid f(b)$. Prove that $a=b$.
[i]Proposed by Shashank Ingalagavi and Krutarth Shah[/i]
Let $S$ be the unit circle with center $O$ and let $P_1, P_2,\ldots, P_n$ be points of $S$ such that the sum of vectors $v_i=\stackrel{\longrightarrow}{OP_i}$ is the zero vector. Prove that the inequality $\sum_{i=1}^n XP_i \geq n$ holds for every point $X$.
For each positive integer \( n \), let \( f(n) \) be the number of ordered triples \( (a, b, c) \) such that \( a, b, c \in \{1, 2, \ldots, n\} \) and that the two roots (possibly equal) of the quadratic equation \( ax^2 + bx + c = 0 \) are both integers.
(a) Prove that for every positive real number \( C \), there exists a positive integer \( n_C \) such that for all integers \( n \geq n_C \), we have \( f(n) > C \cdot n \).
(b) Prove that for every positive real number \( C \), there exists a positive integer \( n_C \) such that for all integers \( n \geq n_C \), we have \( f(n) < C \cdot n^{\frac{2025}{2024}} \).
Given $\triangle ABC$ and a point $P$ on one of its sides, call line $\ell$ the splitting line of $\triangle ABC$ through $P$ if $\ell$ passes through $P$ and divides $\triangle ABC$ into two polygons of equal perimeter. Let $\triangle ABC$ be a triangle where $BC = 219$ and $AB$ and $AC$ are positive integers. Let $M$ and $N$ be the midpoints of $\overline{AB}$ and $\overline{AC}$, respectively, and suppose that the splitting lines of $\triangle ABC$ through $M$ and $N$ intersect at $30^{\circ}$. Find the perimeter of $\triangle ABC$.
Let $x$ and $n$ be integers such that $1\le x\le n$. We have $x+1$ separate boxes and $n-x$ identical balls. Define $f(n,x)$ as the number of ways that the $n-x$ balls can be distributed into the $x+1$ boxes. Let $p$ be a prime number. Find the integers $n$ greater than $1$ such that the prime number $p$ is a divisor of $f(n,x)$ for all $x\in\{1,2,\ldots ,n-1\}$.
Let $f(x)$ and $g(x)$ be non-constant polynomials with integer positive coefficients, $m$ and $n$ are given natural numbers. Prove that there exists infinitely many natural numbers $k$ for which the numbers
$$f(m^n)+g(0),f(m^n)+g(1),\ldots,f(m^n)+g(k)$$
are composite.
[i]I. Tonov[/i]
(a) Let $k,n\ge 1$.Find the number of sequences $\phi=S_0,S_1,\ldots,S_k$ of subsets of $[n]=\{1,2,3,\ldots,n\}$ if for all $1\le i\le k$ we have either (i)$S_{i-1}\subset S_i$ and $|S_i-S_{i-1}|$,or (ii)$S_i\subset S_{i-1}$ and $|S_{i-1}-S_i|=1$.
(b) Suppose that we add the additional condition that $S_k=\phi$.Show that now the number $f_k(n)$ of sequences is given by$f_k(n)=\frac{1}{2^n}\sum_{i=0}^n\binom ni (n-2i)^k$.
Note that $f_k(n)=0$ if $k$ is odd.
A set of $n$ lines are said to be in [i]standard form[/i] if no two are parallel and no three are concurrent. Does there exist a value of $k$ such that given any $n$ lines in [i]standard form[/i], it is possible to colour the regions bounded by the $n$ lines using $k$ colours in such a way that no two regions of the same colour share a common intersection point of the $n$ lines?
The points $A,B,C$ are in this order on line $D$, and $AB = 4BC$. Let $M$ be a variable point on the perpendicular to $D$ through $C$. Let $MT_1$ and $MT_2$ be tangents to the circle with center $A$ and radius $AB$. Determine the locus of the orthocenter of the triangle $MT_1T_2.$
Let $ABC$ be an acute triangle and $D$ be the foot of altitude from $A$ to $BC.$ Let $X$ and $Y$ be points on the segment $BC$ such that $\angle{BAX} = \angle{YAC}, BX = 2, XY = 6,$ and $YC = 3.$ Given that $AD = 12,$ compute $BD.$
A fenced, rectangular field measures 24 meters by 52 meters. An agricultural researcher has 1994 meters of fence that can be used for internal fencing to partition the field into congruent, square test plots. The entire field must be partitioned, and the sides of the squares must be parallel to the edges of the field. What is the largest number of square test plots into which the field can be partitioned using all or some of the 1994 meters of fence?
Square pyramid $ABCDE$ has base $ABCD,$ which measures $3$ cm on a side, and altitude $\overline{AE}$ perpendicular to the base$,$ which measures $6$ cm. Point $P$ lies on $\overline{BE},$ one third of the way from $B$ to $E;$ point $Q$ lies on $\overline{DE},$ one third of the way from $D$ to $E;$ and point $R$ lies on $\overline{CE},$ two thirds of the way from $C$ to $E.$ What is the area, in square centimeters, of $\triangle PQR?$
$\textbf{(A) } \frac{3\sqrt2}{2} \qquad\textbf{(B) } \frac{3\sqrt3}{2} \qquad\textbf{(C) } 2\sqrt2 \qquad\textbf{(D) } 2\sqrt3 \qquad\textbf{(E) } 3\sqrt2$
[b]p1.[/b] Thirty players participate in a chess tournament. Every player plays one game with every other player. What maximal number of players can get exactly $5$ points? (any game adds $1$ point to the winner’s score, $0$ points to a loser’s score, in the case of a draw each player obtains $1/2$ point.)
[b]p2.[/b] A father and his son returned from a fishing trip. To make their catches equal the father gave to his son some of his fish. If, instead, the son had given his father the same number of fish, then father would have had twice as many fish as his son. What percent more is the father's catch more than his son's?
[b]p3.[/b] What is the maximal number of pieces of two shapes, [img]https://cdn.artofproblemsolving.com/attachments/a/5/6c567cf6a04b0aa9e998dbae3803b6eeb24a35.png[/img] and [img]https://cdn.artofproblemsolving.com/attachments/8/a/7a7754d0f2517c93c5bb931fb7b5ae8f5e3217.png[/img], that can be used to tile a $7\times 7$ square?
[b]p4.[/b] Six shooters participate in a shooting competition. Every participant has $5$ shots. Each shot adds from 1 to $10$ points to shooter’s score. Every person can score totally for all five shots from $5$ to $50$ points. Each participant gets $7$ points for at least one of his shots. The scores of all participants are different. We enumerate the shooters $1$ to $6$ according to their scores, the person with maximal score obtains number $1$, the next one obtains number $2$, the person with minimal score obtains number $6$. What score does obtain the participant number 3? The total number of all obtained points is $264$.
[b]p5.[/b] There are $2014$ stones in a pile. Two players play the following game. First, player $A$ takes some number of stones (from $1$ to $30$) from the pile, then player B takes $1$ or $2$ stones, then player $A$ takes $2$ or $3$ stones, then player $B$ takes $3$ or $4$ stones, then player A takes $4$ or $5$ stones, etc. The player who gets the last stone is the winner. If no player gets the last stone (there is at least one stone in the pile but the next move is not allowed) then the game results in a draw. Who wins the game using the right strategy?
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Find the maximum value of $ x_{0}$ for which there exists a sequence $ x_{0},x_{1}\cdots ,x_{1995}$ of positive reals with $ x_{0} \equal{} x_{1995}$, such that
\[ x_{i \minus{} 1} \plus{} \frac {2}{x_{i \minus{} 1}} \equal{} 2x_{i} \plus{} \frac {1}{x_{i}},
\]
for all $ i \equal{} 1,\cdots ,1995$.
For a positive integer $n$, let $6^{(n)}$ be the natural number whose decimal representation consists of $n$ digits $6$. Let us define, for all natural numbers $m$, $k$ with $1 \leq k \leq m$
\[\left[\begin{array}{ccc}m\\ k\end{array}\right] =\frac{ 6^{(m)} 6^{(m-1)}\cdots 6^{(m-k+1)}}{6^{(1)} 6^{(2)}\cdots 6^{(k)}} .\]
Prove that for all $m, k$, $ \left[\begin{array}{ccc}m\\ k\end{array}\right] $ is a natural number whose decimal representation consists of exactly $k(m + k - 1) - 1$ digits.