Found problems: 85335
2003 Federal Math Competition of S&M, Problem 2
Let ABCD be a square inscribed in a circle k and P be an arbitrary point of that circle. Prove that at least one of the numbers PA, PB, PC and PD is not rational.
2021 Indonesia TST, A
Given a polynomial $p(x) =Ax^3+x^2-A$ with $A \neq 0$. Show that for every different real number $a,b,c$, at least one of $ap(b)$, $bp(a)$, and $cp(a)$ not equal to 1.
2005 Thailand Mathematical Olympiad, 4
Triangle $\vartriangle ABC$ is inscribed in the circle with diameter $BC$. If $AB = 3$, $AC = 4$, and $O$ is the incenter of $\vartriangle ABC$, then find $BO \cdot OC$.
2012 BMT Spring, 2
Evaluate $\prod_{k=1}^{254}\log_{k+1}(k + 2)^{u_k}$, where $u_k = \begin{cases}- k & \text{if} \,\, k \,\, \text{is odd}\\
\frac{1}{k-1} & \text{if} \,\, k \,\, \text{is even} \end{cases}$
2001 Abels Math Contest (Norwegian MO), 1b
Suppose that $x$ and $y$ are positive real numbers such that $x^3, y^3$ and $x + y$ are all rational numbers. Show that the numbers $xy, x^2+y^2, x$ and $y$ are also rational
2021 Mexico National Olympiad, 1
The real positive numbers $a_1, a_2,a_3$ are three consecutive terms of an arithmetic progression, and similarly, $b_1, b_2, b_3$ are distinct real positive numbers and consecutive terms of an arithmetic progression. Is it possible to use three segments of lengths $a_1, a_2, a_3$ as bases, and other three segments of lengths $b_1, b_2, b_3$ as altitudes, to construct three rectangles of equal area ?
2023 Azerbaijan Senior NMO, 4
To open the magic chest, one needs to say a magic code of length $n$ consisting of digits $0, 1, 2, 3, 4, 5, 6, 7, 8, 9.$ Each time Griphook tells the chest a code it thinks up, the chest's talkative guardian responds by saying the number of digits in that code that match the magic code. (For example, if the magic code is $0423$ and Griphook says $3442,$ the chest's talkative guard will say $1$). Prove that there exists a number $k$ such that for any natural number $n \geq k,$ Griphook can find the magic code by checking at most $4n-2023$ times, regardless of what the magic code of the box is.
2010 Paraguay Mathematical Olympiad, 2
A series of figures is shown in the picture below, each one of them created by following a secret rule. If the leftmost figure is considered the first figure, how many squares will the 21st figure have?
[img]http://www.artofproblemsolving.com/Forum/download/file.php?id=49934[/img]
Note: only the little squares are to be counted (i.e., the $2 \times 2$ squares, $3 \times 3$ squares, $\dots$ should not be counted)
Extra (not part of the original problem): How many squares will the 21st figure have, if we consider all $1 \times 1$ squares, all $2 \times 2$ squares, all $3 \times 3$ squares, and so on?.
1994 AMC 8, 24
A $2$ by $2$ square is divided into four $1$ by $1$ squares. Each of the small squares is to be painted either green or red. In how many different ways can the painting be accomplished so that no green square shares its top or right side with any red square? There may be as few as zero or as many as four small green squares.
$\text{(A)}\ 4 \qquad \text{(B)}\ 6 \qquad \text{(C)}\ 7 \qquad \text{(D)}\ 8 \qquad \text{(E)}\ 16$
1993 AMC 12/AHSME, 24
A box contains $3$ shiny pennies and $4$ dull pennies. One by one, pennies are drawn at random from the box and not replaced. If the probability is $\frac{a}{b}$ that it will take more than four draws until the third shiny penny appears and $\frac{a}{b}$ is in lowest terms, then $a+b=$
$ \textbf{(A)}\ 11 \qquad\textbf{(B)}\ 20 \qquad\textbf{(C)}\ 35 \qquad\textbf{(D)}\ 58 \qquad\textbf{(E)}\ 66 $
2007 Estonia Team Selection Test, 3
Let $n$ be a natural number, $n > 2$. Prove that if $\frac{b^n-1}{b-1}$ is a prime power for some positive integer $b$ then $n$ is prime.
2010 Germany Team Selection Test, 1
A sequence $\left(a_n\right)$ with $a_1 = 1$ satisfies the following recursion: In the decimal expansion of $a_n$ (without trailing zeros) let $k$ be the smallest digest then $a_{n+1} = a_n + 2^k.$ How many digits does $a_{9 \cdot 10^{2010}}$ have in the decimal expansion?
2016 IFYM, Sozopol, 8
For a quadratic trinomial $f(x)$ and the different numbers $a$ and $b$ it is known that $f(a)=b$ and $f(b)=a$. We call such $a$ and $b$ [i]conjugate[/i] for $f(x)$. Prove that $f(x)$ has no other [i]conjugate[/i] numbers.
2010 Switzerland - Final Round, 10
Let $ n\geqslant 3$ and $ P$ a convex $ n$-gon. Show that $ P$ can be, by $ n \minus{} 3$ non-intersecting diagonals, partitioned in triangles such that the circumcircle of each triangle contains the whole area of $ P$. Under which conditions is there exactly one such triangulation?
LMT Team Rounds 2010-20, A29
Find the smallest possible value of $n$ such that $n+2$ people can stand inside or on the border of a regular $n$-gon with side length $6$ feet where each pair of people are at least $6$ feet apart.
[i]Proposed by Jeff Lin[/i]
2021 Math Prize for Girls Problems, 20
Let $G$ be the set of points $(x, y)$ such that $x$ and $y$ are positive integers less than or equal to 6. A [i]magic grid[/i] is an assignment of an integer to each point in $G$ such that, for every square with horizontal and vertical sides and all four vertices in $G$, the sum of the integers assigned to the four vertices is the same as the corresponding sum for any other such square. A magic grid is formed so that the product of all 36 integers is the smallest possible value greater than 1. What is this product?
2014 Stanford Mathematics Tournament, 1
A square $ABCD$ with side length $1$ is inscribed in a circle. A smaller square lies in the circle with two vertices lying on segment $AB$ and the other two vertices lying on minor arc $AB$. Compute the area of the smaller square.
2005 Croatia National Olympiad, 2
Let $U$ be the incenter of a triangle $ABC$ and $O_{1}, O_{2}, O_{3}$ be the circumcenters of the triangles $BCU, CAU, ABU$ , respectively. Prove that the circumcircles of the triangles $ABC$ and $O_{1}O_{2}O_{3}$ have the same center.
2005 Cono Sur Olympiad, 2
Let $ABC$ be an acute-angled triangle and let $AN$, $BM$ and $CP$ the altitudes with respect to the sides $BC$, $CA$ and $AB$, respectively. Let $R$, $S$ be the pojections of $N$ on the sides $AB$, $CA$, respectively, and let $Q$, $W$ be the projections of $N$ on the altitudes $BM$ and $CP$, respectively.
(a) Show that $R$, $Q$, $W$, $S$ are collinear.
(b) Show that $MP=RS-QW$.
2015 Ukraine Team Selection Test, 11
Let $\Omega$ and $O$ be the circumcircle and the circumcentre of an acute-angled triangle $ABC$ with $AB > BC$. The angle bisector of $\angle ABC$ intersects $\Omega$ at $M \ne B$. Let $\Gamma$ be the circle with diameter $BM$. The angle bisectors of $\angle AOB$ and $\angle BOC$ intersect $\Gamma$ at points $P$ and $Q,$ respectively. The point $R$ is chosen on the line $P Q$ so that $BR = MR$. Prove that $BR\parallel AC$.
(Here we always assume that an angle bisector is a ray.)
[i]Proposed by Sergey Berlov, Russia[/i]
1988 National High School Mathematics League, 4
Given three planes $\alpha,\beta,\gamma$. Intersection angle between any two planes are all $\theta$.$\alpha\cap\beta=a,\beta\cap\gamma=b,\gamma\cap\alpha=c$.
Given two conditions:
A: $\theta>\frac{\pi}{3}$
B: $a,b,c$ share one point.
$(\text{A})$A is sufficient but unnecessary condition of B.
$(\text{B})$A is necessary but insufficient condition of B.
$(\text{C})$A is sufficient and necessary condition of B.
$(\text{D})$None above
2005 China Team Selection Test, 2
Determine whether $\sqrt{1001^2+1}+\sqrt{1002^2+1}+ \cdots + \sqrt{2000^2+1}$ be a rational number or not?
1985 IMO Longlists, 1
Each of the numbers in the set $N = \{1, 2, 3, \cdots, n - 1\}$, where $n \geq 3$, is colored with one of two colors, say red or black, so that:
[i](i)[/i] $i$ and $n - i$ always receive the same color, and
[i](ii)[/i] for some $j \in N$, relatively prime to $n$, $i$ and $|j - i|$ receive the same color for all $i \in N, i \neq j.$
Prove that all numbers in $N$ must receive the same color.
2003 Hungary-Israel Binational, 2
Let $M$ be a point inside a triangle $ABC$ . The lines $AM , BM , CM$ intersect $BC, CA, AB$ at $A_{1}, B_{1}, C_{1}$, respectively. Assume that
$S_{MAC_{1}}+S_{MBA_{1}}+S_{MCB_{1}}= S_{MA_{1}C}+S_{MB_{1}A}+S_{MC_{1}B}$ . Prove that one of the lines $AA_{1}, BB_{1}, CC_{1}$ is a median of the triangle $ABC.$
2011 Iran MO (3rd Round), 6
We call two circles in the space fighting if they are intersected or they are clipsed.
Find a good necessary and sufficient condition for four distinct points $A,B,A',B'$ such that each circle passing through $A,B$ and each circle passing through $A',B'$ are fighting circles.
[i]proposed by Ali Khezeli[/i]