Found problems: 85335
Among the coordinates $(x,y)$ $(1\leq x,y\leq 101)$, choose some points such that there does not exist $4$ points which form a isoceles trapezium with its base parallel to either the $x$ or $y$ axis(including rectangles). Find the maximum number of coordinate points that can be chosen.
The bell number $b_n$ is the number of ways to partition the set $\{1,2,\ldots,n\}$. For example $b_3=5$. Find a recurrence for $b_n$ and show that $b_n=e^{-1}\sum_{k\geq 0} \frac{k^n}{k!}$. Using a combinatorial proof show that the number of ways to partition $\{1,2,\ldots,n\}$, such that now two consecutive numbers are in the same block, is $b_{n-1}$.
Let $P(x)$ be a non-constant polynomial with integer coefficients. Prove that there is no function $T$ from the set of integers into the set of integers such that the number of integers $x$ with $T^n(x)=x$ is equal to $P(n)$ for every $n\geq 1$, where $T^n$ denotes the $n$-fold application of $T$.
[i]Proposed by Jozsef Pelikan, Hungary[/i]
Let $\mathcal{B}$ be the set of rectangular boxes that have volume $23$ and surface area $54$. Suppose $r$ is the least possible radius of a sphere that can fit any element of $\mathcal{B}$ inside it. Then $r^{2}$ can be expressed as $\tfrac{p}{q}$, where $p$ and $q$ are relatively prime positive integers. Find $p+q$.
Let $P$ be a point in the plane of triangle $ABC$. Denote the reflections of $A,B,C$ over $P$ by $A',B'$ and $C'$, respectively. Let $A'',B'',C''$ be the reflection of $A',B',C'$ over $BC,CA$ and $AB$, respectively. Let the line $A''B''$ intersects $AC$ at $A_b$ and let $A''C''$ intersects $AB$ at $A_c$. Denote by $\omega_A$ the circle through the points $A,A_b,A_c$. The circles $\omega_B,\omega_C$ are defined similarly. Prove that $\omega_A ,\omega_B ,\omega_C$ are coaxial, i.e., they share a common radical axis.
[i]Proposed by Navneel Singhal, Delhi and K. V. Sudharshan, Chennai, India[/i]
Determine the absolute value of the sum \[ \lfloor 2013\sin{0^\circ} \rfloor + \lfloor 2013\sin{1^\circ} \rfloor + \cdots + \lfloor 2013\sin{359^\circ} \rfloor, \] where $\lfloor x \rfloor$ denotes the greatest integer less than or equal to $x$.
(You may use the fact that $\sin{n^\circ}$ is irrational for positive integers $n$ not divisible by $30$.)
[i]Ray Li[/i]
Let ${\triangle ABC}$ be a right triangle with $\angle A = 90^\circ$ and $BC = 38.$ There exist points $K$ and $L$ inside the triangle such \[AK = AL = BK = CL = KL = 14.\] The area of the quadrilateral $BKLC$ can be expressed as $n\sqrt3$ for some positive integer $n.$ Find $n.$
Given $101$ segments in a line, prove that there exists $11$ segments meeting in $1$ point or $11$ segments such that every two of them are disjoint.
Let $ABCD$ be a cyclic quadrilateral such that $AB \cdot BC=2 \cdot AD \cdot DC$. Prove that its diagonals $AC$ and $BD$ satisfy the inequality $8BD^2 \le 9AC^2$.
[color=#FF0000]
Moderator says: Do not double post [url]http://www.artofproblemsolving.com/Forum/viewtopic.php?f=46&t=590175[/url][/color]
Bernardo randomly picks $ 3$ distinct numbers from the set $ \{1,2,3,4,5,6,7,8,9\}$ and arranges them in descending order to form a $ 3$-digit number. Silvia randomly picks $ 3$ distinct numbers from the set $ \{1,2,3,4,5,6,7,8\}$ and also arranges them in descending order to form a $ 3$-digit number. What is the probability that Bernardo's number is larger than Silvia's number?
$ \textbf{(A)}\ \frac {47}{72}\qquad
\textbf{(B)}\ \frac {37}{56}\qquad
\textbf{(C)}\ \frac {2}{3}\qquad
\textbf{(D)}\ \frac {49}{72}\qquad
\textbf{(E)}\ \frac {39}{56}$
Four different points $A,B,C,D$ are given in space such that $AC\perp BD,AD\perp BC.$ Show there is a sphere containing midpoits of all 7 segments $AB,AC,AD,BC,BD,CD.$
A basketball team's players were successful on $50\%$ of their two-point shots and $40\%$ of their three-point shots, which resulted in $54$ points. They attempted $50\%$ more two-point shots than three-point shots. How many three-point shots did they attempt?
$ \textbf{(A) }10\qquad\textbf{(B) }15\qquad\textbf{(C) }20\qquad\textbf{(D) }25\qquad\textbf{(E) }30 $
The vertices of a convex polygon with $n\geqslant 4$ sides are coloured with black and white. A diagonal is called [i]multicoloured[/i] if its vertices have different colours. A colouring of the vertices is [i]good[/i] if the polygon can be partitioned into triangles by using only multicoloured diagonals which do not intersect in the interior of the polygon. Find the number of good colourings.
[i]Proposed by S. Berlov[/i]
Prove that one can partition the set of natural numbers into $100$ nonempty subsets such that among any three natural numbers $a$, $b$, $c$ satisfying $a+99b=c$, there are two that belong to the same subset.
Let $f\colon \mathbb{R}^n \rightarrow \mathbb{R}^m$ be a map such that the image of every compact set is compact, and the image of every connected set is connected. Prove that $f$ is continuous.
Cat and Claire are having a conversation about Cat’s favorite number. Cat says, “My favorite number is a two-digit perfect square!”
Claire asks, “If you picked a digit of your favorite number at random and revealed it to me without telling me which place it was in, is there any chance I’d know for certain what it is?”
Cat says, “Yes! Moreover, if I told you a number and identified it as the sum of the digits of my favorite number, or if I told you a number and identified it as the positive difference of the digits of my favorite number, you wouldn’t know my favorite number.”
Claire says, “Now I know your favorite number!” What is Cat’s favorite number?
Determine all triples of nonzero decimal digits $(x,y,z)$ for which the equality $\sqrt{ \underbrace{xxx...x}_{2n}- \underbrace{yy...y}_{n}}= \underbrace{zzz...z}_{n}$ holds for at least two different natural numbers $n$.
The pupil is training in the square equation solution. Having the recurrent equation solved, he stops, if it doesn't have two roots, or solves the next equation, with the free coefficient equal to the greatest root, the coefficient at $x$ equal to the least root, and the coefficient at $x^2$ equal to $1$. Prove that the process cannot be infinite. What maximal number of the equations he will have to solve?
Does there exist a positive integer $m$, such that if $S_n$ denotes the lcm of $1,2, \ldots, n$, then $S_{m+1}=4S_m$?
Let positive integers $K$ and $d$ be given. Prove that there exists a positive integer $n$ and a sequence of $K$ positive integers $b_1,b_2,..., b_K$ such that the number $n$ is a $d$-digit palindrome in all number bases $b_1,b_2,..., b_K$.
Given $a\in (0,1)$ and $C$ the set of increasing functions
$f:[0,1]\to [0,\infty )$ such that $\int\limits_{0}^{1}{f(x)}dx=1$ . Determine:
$(a)\underset{f\in C}{\mathop{\max }}\,\int\limits_{0}^{a}{f(x)dx}$
$(b)\underset{f\in C}{\mathop{\max }}\,\int\limits_{0}^{a}{{{f}^{2}}(x)dx}$
How many ways are there to partition $7$ students into the groups of $2$ or $3$?
$
\textbf{(A)}\ 70
\qquad\textbf{(B)}\ 105
\qquad\textbf{(C)}\ 210
\qquad\textbf{(D)}\ 280
\qquad\textbf{(E)}\ 630
$
Let $ ABC$ be an obtuse inscribed in a circle of radius $ 1$. Prove that $ \triangle ABC$ can be covered by an isosceles right-angled triangle with hypotenuse of length $ \sqrt {2} \plus{} 1$.
Let $\displaystyle M$ be a set composed of $\displaystyle n$ elements and let $\displaystyle \mathcal P (M)$ be its power set. Find all functions $\displaystyle f : \mathcal P (M) \to \{ 0,1,2,\ldots,n \}$ that have the properties
(a) $\displaystyle f(A) \neq 0$, for $\displaystyle A \neq \phi$;
(b) $\displaystyle f \left( A \cup B \right) = f \left( A \cap B \right) + f \left( A \Delta B \right)$, for all $\displaystyle A,B \in \mathcal P (M)$, where $\displaystyle A \Delta B = \left( A \cup B \right) \backslash \left( A \cap B \right)$.
You have 2 six-sided dice. One is a normal fair die, while the other has 2 ones, 2 threes, and 2 fives. You pick a die and roll it. Because of some secret magnetic attraction of the unfair die, you have a 75% chance of picking the unfair die and a 25% chance of picking the fair die. If you roll a three, what is the probability that you chose the fair die?