Found problems: 85335
Let $ a > b > 1, b$ is an odd number, let $ n$ be a positive integer. If $ b^n|a^n\minus{}1,$ then $ a^b > \frac {3^n}{n}.$
Let $S$ be the set of all $n$-tuples of real numbers, with the property that among the numbers $x_1,\frac{x_1+x_2}2,\ldots,\frac{x_1+x_2+\ldots+x_n}n$ the least is equal to $0$, and the greatest is equal to $1$. Determine
$$\max_{(x_1,x_2,\ldots,x_n)\in S}\max_{1\le i,j\le n}(x_i-x_j)\qquad\text{and}\min_{(x_1,x_2,\ldots,x_n)\in S}\max_{1\le i,j\le n}(x_i-x_j).$$
The real numbers $a_0, a_1, ... , a_{n+1}$ satisfy $a_0 = a_{n+1} = 0$ and $|a_{k-1} - 2a_k + a_{k+1}| \le 1$ for $k = 1, 2, ... , n$. Show that $|a_k| \le \frac{ k(n + 1 - k)}{2}$ for all $k$.
Let $A_{12}$ denote the answer to problem $12$. There exists a unique triple of digits $(B,C,D)$ such that $10>A_{12}>B>C>D>0$ and \[\overline{A_{12}BCD}-\overline{DCBA_{12}}=\overline{BDA_{12}C},\] where $\overline{A_{12}BCD}$ denotes the four digit base $10$ integer. Compute $B+C+D$.
How many alphabetic sequences (that is, sequences containing only letters from $a\cdots z$) of length $2013$ have letters in alphabetic order?
Let $ABC$ be a triangle with incenter $I$ and let $D$ be an arbitrary point on the side $BC$. Let the line through $D$ perpendicular to $BI$ intersect $CI$ at $E$. Let the line through $D$ perpendicular to $CI$ intersect $BI$ at $F$. Prove that the reflection of $A$ across the line $EF$ lies on the line $BC$.
On a party with $99$ guests, hosts Ann and Bob play a game (the hosts are not regarded as guests). There are $99$ chairs arranged in a circle; initially, all guests hang around those chairs. The hosts take turns alternately. By a turn, a host orders any standing guest to sit on an unoccupied chair $c$. If some chair adjacent to $c$ is already occupied, the same host orders one guest on such chair to stand up (if both chairs adjacent to $c$ are occupied, the host chooses exactly one of them). All orders are carried out immediately. Ann makes the first move; her goal is to fulfill, after some move of hers, that at least $k$ chairs are occupied. Determine the largest $k$ for which Ann can reach the goal, regardless of Bob's play.
Find all functions $f:\mathbb{R}\to\mathbb{R}$ such that $$f\left(x^3+f(y)\right)=x^2f(x)+y,$$for all $x,y\in\mathbb{R}.$ (Here $\mathbb{R}$ denotes the set of all real numbers.)
$(\sqrt6 + \sqrt7)^{1000}$ in base ten has a tens digit of $a$ and a ones digit of $b$. Determine $10a + b$.
Four circles, no two of which are congruent, have centers at $A$, $B$, $C$, and $D$, and points $P$ and $Q$ lie on all four circles. The radius of circle $A$ is $\frac{5}{8}$ times the radius of circle $B$, and the radius of circle $C$ is $\frac{5}{8}$ times the radius of circle $D$. Furthermore, $AB = CD = 39$ and $PQ = 48$. Let $R$ be the midpoint of $\overline{PQ}$. What is $AR+BR+CR+DR$?
$ \textbf{(A)}\ 180 \qquad\textbf{(B)}\ 184 \qquad\textbf{(C)}\ 188 \qquad\textbf{(D)}\ 192\qquad\textbf{(E)}\ 196 $
The 24 unshaded squares in the 5 × 5 grid below can be tiled with twelve 1 × 2 tiles. One such tiling is shown. Find the number of ways the grid can be tiled.
[center][img]https://snag.gy/KMoPrF.jpg[/img][/center]
Given a set $S \subset R^+$, $S \ne \emptyset$ such that for all $a, b, c \in S$ (not necessarily distinct) then $a^3 + b^3 + c^3 - 3abc$ is rational number. Prove that for all $a, b \in S$ then $\frac{a - b}{a + b}$ is also rational.
An ant is on the Cartesian plane. In a single move, the ant selects a positive integer $k$, then either travels [list]
[*] $k$ units vertically (up or down) and $2k$ units horizontally (left or right); or
[*] $k$ units horizontally (left or right) and $2k$ units vertically (up or down).
[/list]
Thus, for any $k$, the ant can choose to go to one of eight possible points. \\ Prove that, for any integers $a$ and $b$, the ant can travel from $(0, 0)$ to $(a, b)$ using at most $3$ moves.
[i]Nyihaha[/i] and [i]Bruhaha[/i] are two neighbouring islands, both having $n$ inhabitants. On island [i]Nyihaha[/i] every inhabitant is either a Knight or a Knave. Knights always tell the truth and Knaves always lie. The inhabitants of island [i]Bruhaha[/i] are normal people, who can choose to tell the truth or lie. When a visitor arrives on any of the two islands, the following ritual is performed: every inhabitant points randomly to another inhabitant (indepently from each other with uniform distribution), and tells "He is a Knight" or "He is a Knave'". On sland [i]Nyihaha[/i], Knights have to tell the truth and Knaves have to lie. On island [i]Bruhaha[/i] every inhabitant tells the truth with probability $1/2$ independently from each other. Sinbad arrives on island [i]Bruhaha[/i], but he does not know whether he is on island [i]Nyihaha[/i] or island [i]Bruhaha[/i]. Let $p_n$ denote the probability that after observing the ritual he can rule out being on island [i]Nyihaha[/i]. Is it true that $p_n\to 1$ if $n\to\infty$?
[i]Proposed by Dávid Matolcsi, Berkeley[/i]
Let $\vartriangle ABC$ be an acute triangle. $R$ is a point on arc $BC$. Choose two points $P, Q$ on $AR$ such that $B,P,C,Q$ are concyclic. Let the second intersection of $BP$, $CP$, $BQ$, $CQ$ and the circumcircle of $\vartriangle ABC$ is $P_B$, $P_C$, $Q_B$, $Q_C$, respectively. Let the circumcenter of $\vartriangle P P_BP_C$ and $\vartriangle QQ_BQ_C$ are $O_P$ and $O_Q$, respectively. Prove that $A,O_P,O_Q,R$ are concylic.
[i]proposed by andychang[/i]
Let $P$ be a point on a circle $C_1$ and let $C_2$ be a circle with center $P$ that intersects $C_1$ at two points Q and R. The circle $C_3$, with center $Q$ and which passes through $R$, intersects $C_2$ at another point S, as in figure. Shows that $QS$ is tangent to $C_1$.
[img]https://cdn.artofproblemsolving.com/attachments/7/5/f48d414c68c33c4efaf4d6c8bebcf6f1fad4ba.png[/img]
[b]p1.[/b] Find all solutions $a, b, c, d, e, f$ if it is known that they represent distinct digits and satisfy the following:
$\begin{tabular}{ccccc}
& a & b & c & a \\
+ & & d & d & e \\
& & & d & e \\
\hline
d & f & f & d & d \\
\end{tabular}$
[b]p2.[/b] Snowhite wrote on a piece of paper a whole number greater than $1$ and multiplied it by itself. She obtained a number, all digits of which are $1$: $n^2 = 111...111$ Does she know how to multiply?
[b]p3.[/b] Two players play the following game on an $8\times 8$ chessboard. The first player can put a bishop on an arbitrary square. Then the second player can put another bishop on a free square that is not controlled by the first bishop. Then the first player can put a new bishop on a free square that is not controlled by the bishops on the board. Then the second player can do the same, etc. A player who cannot put a new bishop on the board loses the game. Who has a winning strategy?
[b]p4.[/b] Four girls Marry, Jill, Ann and Susan participated in the concert. They sang songs. Every song was performed by three girls. Mary sang $8$ songs, more then anybody. Susan sang $5$ songs less then all other girls. How many songs were performed at the concert?
[b]p5.[/b] Pinocchio has a $10\times 10$ table of numbers. He took the sums of the numbers in each row and each such sum was positive. Then he took the sum of the numbers in each columns and each such sum was negative. Can you trust Pinocchio's calculations?
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Find all positive integers $n$ such that for any positive integer $a$ relatively prime to $n$, $2n^2 \mid a^n - 1$.
Given an ordered list of $3N$ real numbers, we can trim it to form a list of $N$ numbers as follows: We divide the list into $N$ groups of $3$ consecutive numbers, and within each group, discard the highest and lowest numbers, keeping only the median. \\
Consider generating a random number $X$ by the following procedure: Start with a list of $3^{2021}$ numbers, drawn independently and unfiformly at random between $0$ and $1$. Then trim this list as defined above, leaving a list of $3^{2020}$ numbers. Then trim again repeatedly until just one number remains; let $X$ be this number. Let $\mu$ be the expected value of $\left|X-\frac{1}{2} \right|$. Show that
\[
\mu \ge \frac{1}{4}\left(\frac{2}{3} \right)^{2021}.
\]
Let a geometric progression with $n$ terms have first term one, common ratio $r$ and sum $s$, where $r$ and $s$ are not zero. The sum of the geometric progression formed by replacing each term of the original progression by its reciprocal is
$\textbf{(A) }\frac{1}{s}\qquad\textbf{(B) }\frac{1}{r^ns}\qquad\textbf{(C) }\frac{s}{r^{n-1}}\qquad\textbf{(D) }\frac{r^n}{s}\qquad \textbf{(E) }\frac{r^{n-1}}{s}$
Six people play the following game: They have a cube, initially white. One by one, the players mark an $ X$ on a white face of the cube, and roll it like a die. The winner is the first person to roll an $ X$ (for example, player 1 wins with probability $ \frac {1}{6}$, while if none of players 1-5 win, player 6 will place an $ X$ on the last square and win for sure). What is the probability that the sixth player wins?
Given $n$ lines on the plane, they divide the plane onto several
bounded or bounded polygonal regions. Define the rank of a region as
the number of vertices on its boundary (a vertex is a point which
belongs to at least two lines). Prove that the sum of squares of
ranks of all regions does not exceed $10n^2$.
(D. Fomin)
Is the number $$\sin \frac{\pi}{18} \sin \frac{3\pi}{18} \sin \frac{5\pi}{18} \sin \frac{7\pi}{18} \sin \frac{9\pi}{18}$$ rational?
Let $ S$ be a finite set of points in the plane such that no three of them are on a line. For each convex polygon $ P$ whose vertices are in $ S$, let $ a(P)$ be the number of vertices of $ P$, and let $ b(P)$ be the number of points of $ S$ which are outside $ P$. A line segment, a point, and the empty set are considered as convex polygons of $ 2$, $ 1$, and $ 0$ vertices respectively. Prove that for every real number $ x$ \[\sum_{P}{x^{a(P)}(1 \minus{} x)^{b(P)}} \equal{} 1,\] where the sum is taken over all convex polygons with vertices in $ S$.
[i]Alternative formulation[/i]:
Let $ M$ be a finite point set in the plane and no three points are collinear. A subset $ A$ of $ M$ will be called round if its elements is the set of vertices of a convex $ A \minus{}$gon $ V(A).$ For each round subset let $ r(A)$ be the number of points from $ M$ which are exterior from the convex $ A \minus{}$gon $ V(A).$ Subsets with $ 0,1$ and 2 elements are always round, its corresponding polygons are the empty set, a point or a segment, respectively (for which all other points that are not vertices of the polygon are exterior). For each round subset $ A$ of $ M$ construct the polynomial
\[ P_A(x) \equal{} x^{|A|}(1 \minus{} x)^{r(A)}.
\]
Show that the sum of polynomials for all round subsets is exactly the polynomial $ P(x) \equal{} 1.$
[i]Proposed by Federico Ardila, Colombia[/i]
Compute the sum of all twenty-one terms of the geometric series \[1+2+4+8+\cdots+1048576.\]
$\textbf{(A) }2097149\hspace{12em}\textbf{(B) }2097151\hspace{12em}\textbf{(C) }2097153$
$\textbf{(D) }2097157\hspace{12em}\textbf{(E) }2097161$