Found problems: 85335
Let $ABC$ be a triangle and $O$ be its circumcircle. Let $A', B', C'$ be the midpoints of minor arcs $AB$, $BC$ and $CA$ respectively. Let $I$ be the center of incircle of $ABC$. If $AB = 13$, $BC = 14$ and $AC = 15$, what is the area of the hexagon $AA'BB'CC'$?
Suppose $m \angle BAC = \alpha$ , $m \angle CBA = \beta$, and $m \angle ACB = \gamma$.
[b]p10.[/b] Let the incircle of $ABC$ be tangent to $AB, BC$, and $AC$ at $J, K, L$, respectively. Compute the angles of triangles $JKL$ and $A'B'C'$ in terms of $\alpha$, $\beta$, and $\gamma$, and conclude that these two triangles are similar.
[b]p11.[/b] Show that triangle $AA'C'$ is congruent to triangle $IA'C'$. Show that $AA'BB'CC'$ has twice the area of $A'B'C'$.
[b]p12.[/b] Let $r = JL/A'C'$ and the area of triangle $JKL$ be $S$. Using the previous parts, determine the area of hexagon $AA'BB'CC'$ in terms of $ r$ and $S$.
[b]p13.[/b] Given that the circumradius of triangle $ABC$ is $65/8$ and that $S = 1344/65$, compute $ r$ and the exact value of the area of hexagon $AA'BB'CC'$.
PS. You had better use hide for answers.
p1. A regular $6$-face dice is thrown three times. Calculate the probability that the number of dice points on all three throws is $ 12$?
p2. Given two positive real numbers $x$ and $y$ with $xy = 1$. Determine the minimum value of $\frac{1}{x^4}+\frac{1}{4y^4}.$
p3. Known a square network which is continuous and arranged in forming corners as in the following picture. Determine the value of the angle marked with the letter $x$.
[img]https://cdn.artofproblemsolving.com/attachments/6/3/aee36501b00c4aaeacd398f184574bd66ac899.png[/img]
p4. Find the smallest natural number $n$ such that the sum of the measures of the angles of the $n$-gon, with $n > 6$ is less than $n^2$ degrees.
p5. There are a few magic cards. By stating on which card a number is there, without looking at the card at all, someone can precisely guess the number. If the number is on Card $A$ and $B$, then the number in question is $1 + 2$ (sum of corner number top left) cards $A$ and $B$. If the numbers are in $A$, $B$, and $C$, the number what is meant is $1 + 2 + 4$ or equal to $7$ (which is obtained by adding the numbers in the upper left corner of each card $A$,$B$, and $C$).
[img]https://cdn.artofproblemsolving.com/attachments/e/5/9e80d4f3bba36a999c819c28c417792fbeff18.png[/img]
a. How can this be explained?
b. Suppose we are going to make cards containing numbers from $1$ to with $15$ based on the rules above. Try making the cards.
[hide=original wording for p5, as the wording isn't that clear]Ada suatu kartu ajaib. Dengan menyebutkan di kartu yang mana suatu bilan gan berada, tanpa melihat kartu sama sekali, seseorang dengan tepat bisa menebak bilangan yang dimaksud. Kalau bilangan tersebut ada pada Kartu A dan B, maka bilangan yang dimaksud adalah 1 + 2 (jumlah bilangan pojok kiri atas) kartu A dan B. Kalau bilangan tersebut ada di A, B, dan C, bilangan yang dimaksud adalah 1 + 2 + 4 atau sama dengan 7 (yang diperoleh dengan menambahkan bilangan-bilangan di pojok kiri atas masing-masing kartu A, B, dan C)
a. Bagaimana hal ini bisa dijelaskan?
b. Andai kita akan membuat kartu-kartu yang memuat bilangan dari 1 sampai dengan 15 berdasarkan aturan di atas. Coba buatkan kartu-kartunya[/hide]
Prove that if $n$ is a square-free positive integer, there are no coprime positive integers $x$ and $y$ such that $(x + y)^3$ divides $x^n+y^n$
Suppose $S = \{a_1, a_2,..., a_{15}\}$ is a set of $1 5$ distinct positive integers chosen from $2 , 3, ... , 2012$ such that every two of them are coprime. Prove that $S$ contains a prime number.
(Note: Two positive integers $m, n$ are coprime if their only common factor is 1)
The inequality $y-x<\sqrt{x^2}$ is satisfied if and only if
$\textbf{(A) }y<0\text{ or }y<2x\text{ (or both inequalities hold)}\qquad$
$\textbf{(B) }y>0\text{ or }y<2x\text{ (or both inequalities hold)}\qquad$
$\textbf{(C) }y^2<2xy\qquad\textbf{(D) }y<0\qquad\textbf{(E) }x>0\text{ and }y<2x$
For which natural number $n$ is it possible to draw $n$ line segments between vertices of a regular $2n$-gon so that every vertex is an endpoint for exactly one segment and these segments have pairwise different lengths?
Let $a,b,c$ be positive reals such that $a+b+c=3$. Prove the inequality
\[\frac{a^2}{a+b^2}+\frac{b^2}{b+c^2}+\frac{c^2}{c+a^2}\geq \frac{3}{2}.\]
A mathematical contest had $3$ problems, each of which was given a score between $0$ and $7$ ($0$ and $7$ included). It is known that, for any two contestants, there exists at most one problem in which they have obtained the same score (for example, there are no two contestants whose ordered scores are $7,1,2$ and $7,1,5$, but there might be two contestants whose ordered scores are $7,1,2$ and $7,2,1$). Find the maximum number of contestants.
In an $n \times n$ square array of $1\times1$ cells, at least one cell is colored pink. Show that you can always divide the square into rectangles along cell borders such that each rectangle contains exactly one pink cell.
Points $A$, $B$, $C$, $D$ are such that no three of them are collinear. Let $E=AB\cap CD$ and $F=BC\cap DA$. Let $k_1$, $k_2$ and $k_3$ denote the circles with diameter $\overline{AC}$, $\overline{BD}$ and $\overline{EF}$, respectively. Prove that either $k_1,k_2,k_3$ pass through one point, or no two of them intersect.
Mary and Pat play the following number game. Mary picks an initial integer greater than $2017$. She then multiplies this number by $2017$ and adds $2$ to the result. Pat will add $2019$ to this new number and it will again be Mary’s turn. Both players will continue to take alternating turns. Mary will always multiply the current number by $2017$ and add $2$ to the result when it is her turn. Pat will always add $2019$ to the current number when it is his turn. Pat wins if any of the numbers obtained by either player is divisible by $2018$. Mary wants to prevent Pat from winning the game.
Determine, with proof, the smallest initial integer Mary could choose in order to achieve this.
Let $X$ be a set with $|X| = n$ , and let $X_1 , X_2 ,... X_n$ be the $n$subsets eith $|X_j| \geq 2$, for $1 \leq j \leq n$. Suppose for each $2$ element subset $Y$ of $X$, there is a unique $j$ in the set $1,2,3....,n$ such that $Y \subset X_j$ . Prove that $X_j \cap X_k \not= \Phi$ for all $1 \leq j < k \leq n$
A [i]site[/i] is any point $(x, y)$ in the plane such that $x$ and $y$ are both positive integers less than or equal to 20.
Initially, each of the 400 sites is unoccupied. Amy and Ben take turns placing stones with Amy going first. On her turn, Amy places a new red stone on an unoccupied site such that the distance between any two sites occupied by red stones is not equal to $\sqrt{5}$. On his turn, Ben places a new blue stone on any unoccupied site. (A site occupied by a blue stone is allowed to be at any distance from any other occupied site.) They stop as soon as a player cannot place a stone.
Find the greatest $K$ such that Amy can ensure that she places at least $K$ red stones, no matter how Ben places his blue stones.
[i]Proposed by Gurgen Asatryan, Armenia[/i]
On the plane are chosen $n \ge 3$ points, not all on the same line. Drawing all lines passing through two of these points one obtains k different lines. Prove that $k \ge n$.
Let $n$ be a positive integer. A row of $n+ 1$ squares is written from left to right, numbered $0, 1, 2, \cdots, n$
Two frogs, named Alphonse and Beryl, begin a race starting at square 0. For each second that passes, Alphonse and Beryl make a jump to the right according to the following rules: if there are at least eight squares to the right of Alphonse, then Alphonse jumps eight squares to the right. Otherwise, Alphonse jumps one square to the right. If there are at least seven squares to the right of Beryl, then Beryl jumps seven squares to the right. Otherwise, Beryl jumps one square to the right. Let A(n) and B(n) respectively denote the number of seconds for Alphonse and Beryl to reach square n. For example, A(40) = 5 and B(40) = 10.
(a) Determine an integer n>200 for which $B(n) <A(n)$.
(b) Determine the largest integer n for which$ B(n) \le A(n)$.
Let $\mathbb{Q}_{>0}$ denote the set of all positive rational numbers. Determine all functions $f:\mathbb{Q}_{>0}\to \mathbb{Q}_{>0}$ satisfying $$f(x^2f(y)^2)=f(x)^2f(y)$$ for all $x,y\in\mathbb{Q}_{>0}$
A quadrilateral $ABCD$ is circumscribed around a circle $\omega$ centered at $I$. Lines $AC$ and $BD$ meet at point $P$, lines $AB$ and $CD$ meet at point $£$, lines $AD$ and $BC$ meet at point $F$. Point $K$ on the circumcircle of triangle $E1F$ is such that $\angle IKP = 90^o$. The ray $PK$ meets $\omega$ at point $Q$. Prove that the circumcircle of triangle $EQF$ touches $\omega$.
For a finite set $A$ of positive integers, a partition of $A$ into two disjoint nonempty subsets $A_1$ and $A_2$ is $\textit{good}$ if the least common multiple of the elements in $A_1$ is equal to the greatest common divisor of the elements in $A_2$. Determine the minimum value of $n$ such that there exists a set of $n$ positive integers with exactly $2015$ good partitions.
Let the series $$s(n,x)=\sum \limits_{k= 0}^n \frac{(1-x)(1-2x)(1-3x)\cdots(1-nx)}{n!}$$ Find a real set on which this series is convergent, and then compute its sum. Find also $$\lim \limits_{(n,x)\to (\infty ,0)} s(n,x)$$
Find the set of all $ a \in \mathbb{R}$ for which there is no infinite sequene $ (x_n)_{n \geq 0} \subset \mathbb{R}$ satisfying $ x_0 \equal{} a,$ and for $ n \equal{} 0,1, \ldots$ we have \[ x_{n\plus{}1} \equal{} \frac{x_n \plus{} \alpha}{\beta x_n \plus{} 1}\] where $ \alpha \beta > 0.$
For the positive integer $n$, define $f(n)=\min\limits_{m\in\Bbb Z}\left|\sqrt2-\frac mn\right|$. Let $\{n_i\}$ be a strictly increasing sequence of positive integers. $C$ is a constant such that $f(n_i)<\dfrac C{n_i^2}$ for all $i\in\{1,2,\ldots\}$. Show that there exists a real number $q>1$ such that $n_i\geqslant q^{i-1}$ for all $i\in\{1,2,\ldots \}$.
Let $P$ be a point in the interior of the acute-angled triangle $ABC$. Prove that if the reflections of $P$ with respect to the sides of the triangle lie on the circumcircle of the triangle, then $P$ is the orthocenter of $ABC$.
Prove that the number $\left\lfloor\left(5+\sqrt{35}\right)^{2n-1}\right\rfloor$ is divisible by $10^n$ for each $n\in\mathbb N$.
Let $ABC$ be a triangle with $AB<AC$. Let $D$ be the point where the bisector of angle $\angle BAC$ touches $BC$ and let $D'$ be the reflection of $D$ in the midpoint of $BC$. Let $X$ be the intersection of the bisector of angle $\angle BAC$ with the line parallel to $AB$ that passes through $D'$. Prove that the line $AC$ is tangent with the circumscribed circle of triangle $XCD'$
Let $ABC$ be an equilateral triangle of side length $1.$ For a real number $0<x<0.5,$ let $A_1$ and $A_2$ be the points on side $BC$ such that $A_1B=A_2C=x,$ and let $T_A=\triangle AA_1A_2.$ Construct triangles $T_B=\triangle BB_1B_2$ and $T_C=\triangle CC_1C_2$ similarly.
There exist positive rational numbers $b,c$ such that the region of points inside all three triangles $T_A,T_B,T_C$ is a hexagon with area $$\dfrac{8x^2-bx+c}{(2-x)(x+1)}\cdot \dfrac{\sqrt 3}{4}.$$ Find $(b,c).$