Found problems: 85335
If $ (0.2)^x \equal{} 2$ and $ \log 2 \equal{} 0.3010$, then the value of $ x$ to the nearest tenth is:
$ \textbf{(A)}\ \minus{} 10.0 \qquad\textbf{(B)}\ \minus{} 0.5 \qquad\textbf{(C)}\ \minus{} 0.4 \qquad\textbf{(D)}\ \minus{} 0.2 \qquad\textbf{(E)}\ 10.0$
Let $\omega$ be the incircle of a fixed equilateral triangle $ABC$. Let $\ell$ be a variable line that is tangent to $\omega$ and meets the interior of segments $BC$ and $CA$ at points $P$ and $Q$, respectively. A point $R$ is chosen such that $PR = PA$ and $QR = QB$. Find all possible locations of the point $R$, over all choices of $\ell$.
[i]Proposed by Titu Andreescu and Waldemar Pompe[/i]
Each vertex of convex pentagon $ABCDE$ is to be assigned a color. There are $6$ colors to choose from, and the ends of each diagonal must have different colors. How many different colorings are possible?
$ \textbf{(A)}\ 2520\qquad\textbf{(B)}\ 2880\qquad\textbf{(C)}\ 3120\qquad\textbf{(D)}\ 3250\qquad\textbf{(E)}\ 3750 $
Find the shortest distance between the point $(6,12)$ and the parabola given by the equation $x=\frac{y^2}{2}$
There are 999 scientists. Every 2 scientists are both interested in exactly 1 topic and for each topic there are exactly 3 scientists that are interested in that topic. Prove that it is possible to choose 250 topics such that every scientist is interested in at most 1 theme.
[i]A. Magazinov[/i]
If $ n$ is any whole number, $ n^2(n^2 \minus{} 1)$ is always divisible by
$ \textbf{(A)}\ 12 \qquad\textbf{(B)}\ 24 \qquad\textbf{(C)}\ \text{any multiple of }12 \qquad\textbf{(D)}\ 12 \minus{} n \qquad\textbf{(E)}\ 12\text{ and }24$
In year $N$, the $300^\text{th}$ day of the year is a Tuesday. In year $N+1$, the $200^\text{th}$ day is also a Tuesday. On what day of the week did the $100^\text{th}$ of year $N-1$ occur?
$\text{(A)}\ \text{Thursday}\qquad\text{(B)}\ \text{Friday}\qquad\text{(C)}\ \text{Saturday}\qquad\text{(D)}\ \text{Sunday}\qquad\text{(E)}\ \text{Monday}$
Let $p$ be a prime satisfying $p^2\mid 2^{p-1}-1$, and let $n$ be a positive integer. Define
\[ f(x) = \frac{(x-1)^{p^n}-(x^{p^n}-1)}{p(x-1)}. \]
Find the largest positive integer $N$ such that there exist polynomials $g(x)$, $h(x)$ with integer coefficients and an integer $r$ satisfying $f(x) = (x-r)^N g(x) + p \cdot h(x)$.
[i]Proposed by Victor Wang[/i]
Dear Mathlinkers,
1. A, B the end points of an arch circle
2. (O) a circle tangent to AB intersecting the arch in question
3. T the point of contact of (O) and AB
4. C, D the points of intersection of (O) with the arch in the order A, D, C, B
5. E, F the points of intersection of AC and DT, BD and CT.
Prove : EF is parallel to AB.
Sincerely
Jean-Louis
When preparing for a competition with more than two participating teams two of them play against each other at most once. When looking at the game plan it turns out:
(1) If two teams play against each other, there are no more team playing against both of them.
(2) If two teams do not play against each other, then there is always exactly two other teams playing against them both.
Prove that all teams play the same number of games.
Let $n$ be an integer $> 1$. In a circular arrangement of $n$ lamps $L_0, \cdots, L_{n-1}$, each one of which can be either ON or OFF, we start with the situation that all lamps are ON, and then carry out a sequence of steps, $Step_0, Step_1, \cdots$. If $L_{j-1}$ ($j$ is taken mod n) is ON, then $Step_j$ changes the status of $L_j$ (it goes from ON to OFF or from OFF to ON) but does not change the status of any of the other lamps. If $L_{j-1}$ is OFF, then $Step_j$ does not change anything at all. Show that:
[i](a)[/i] There is a positive integer $M(n)$ such that after $M(n)$ steps all lamps are ON again.
[i](b)[/i] If $n$ has the form $2^k$, then all lamps are ON after $n^2 - 1$ steps.
[i](c) [/i]If $n$ has the form $2^k +1$, then all lamps are ON after $n^2 -n+1$ steps.
Does there exist a convex polyhedron in which each internal angle of each of its faces is either a right angle or an obtuse angle, and which has exactly $100$ edges? Justify your answer.
The figure below, composed of four regular pentagons with a side length of $1$, was glued in space as follows. First, it was folded along the broken sections, by combining the bold sections, and then formed in such a way that colored sections formed a square. Find the length of the segment $AB$ created in this way.
[img]https://cdn.artofproblemsolving.com/attachments/0/7/bddad6449f74cbc7ea2623957ef05b3b0d2f19.png[/img]
Suppose that $ ABCD$ is a convex quadrilateral. Let $ F \equal{} AB\cap CD$, $ E \equal{} AD\cap BC$ and $ T \equal{} AC\cap BD$. Suppose that $ A,B,T,E$ lie on a circle which intersects with $ EF$ at $ P$. Prove that if $ M$ is midpoint of $ AB$, then $ \angle APM \equal{} \angle BPT$.
Let $g(x)=x^5+x^4+x^3+x^2+x+1$. What is the remainder when the polynomial $g(x^{12})$ is divided by the polynomial $g(x)$?
$\textbf{(A) }6\qquad\textbf{(B) }5-x\qquad\textbf{(C) }4-x+x^2\qquad$
$\textbf{(D) }3-x+x^2-x^3\qquad \textbf{(E) }2-x+x^2-x^3+x^4$
Given three positive real numbers $ x$, $ y$, $ z$ such that $ x \plus{} y \plus{} z \equal{} 1$, prove that
$ \frac {xy}{\sqrt {xy \plus{} yz}} \plus{} \frac {yz}{\sqrt {yz \plus{} zx}} \plus{} \frac {zx}{\sqrt {zx \plus{} xy}} \le \frac {\sqrt {2}}{2}$.
Let $\{a_n\}$ be a sequence such that: $a_1 = \frac{1}{2}$, $a_{k+1}=-a_k+\frac{1}{2-a_k}$ for all $k = 1, 2,\ldots$. Prove that
\[ \left(\frac{n}{2(a_1+a_2+\cdots+a_n)}-1\right)^n \leq \left(\frac{a_1+a_2+\cdots+a_n}{n}\right)^n\left(\frac{1}{a_1}-1\right)\left(\frac{1}{a_2}-1\right)\cdots \left(\frac{1}{a_n}-1\right). \]
Consider the cube with the vertices at the points $(\pm 1, \pm 1, \pm 1)$. Let $V_1,...,V_{95}$ be arbitrary points within this cube. Denote $v_i = \overrightarrow{OV_i}$, where $O = (0,0,0)$ is the origin. Consider the $2^{95}$ vectors of the form $s_1v_1 + s_2v_2 +...+ s_{95}v_{95}$, where $s_i = \pm 1$.
(a) If $d = 48$, prove that among these vectors there is a vector $w = (a, b, c)$ such that $a^2 + b^2 + c^2 \le 48$.
(b) Find a smaller $d$ (the smaller, the better) with the same property.
Let $a_1,a_2,a_3,a_4$ be positive real numbers satisfying \[\sum_{i<j}a_ia_j=1.\]Prove that \[\sum_{\text{sym}}\frac{a_1a_2}{1+a_3a_4}\geq\frac{6}{7}.\][i]* * *[/i]
Let a quardilateral $ABCD$ with $AB=AD$ and $\widehat B=\widehat D=90$.
At $CD$ we take point $E$ and at $BC$ we take point $Z$ such that
$AE\bot DZ$. Prove that $AZ\bot BE$
On a semicircle with unit radius four consecutive chords $AB,BC, CD,DE$ with lengths $a, b, c, d$, respectively, are given. Prove that
\[a^2 + b^2 + c^2 + d^2 + abc + bcd < 4.\]
Find all functions $f : N \to N$ such that $f(m)+f(n)$ divides $m+n$ for all positive integers $m$ and $n$.
Different points $A$ and $D$ are on the same side of the line $BC$, with $|AB| = | BC|= |CD|$ and lines $AD$ and $BC$ are perpendicular. Let $E$ be the intersection point of lines $AD$ and $BC$. Prove that $||BE| - |CE|| < |AD| \sqrt3$
An ant walks along the lines of a grid made up of $55$ horizontal lines and $45$ vertical lines. You want to paint some sections of lines so that the ant can go from any intersection to any other intersection, walking exclusively along painted sections. If the distance between consecutive lines is $10$ cm, what is the least possible number of centimeters that should be painted? What is the higher value?
In a round-robin tournament with $n$ players in which there are no draws, the numbers of wins scored by the players are $s_1 , s_2 , \ldots, s_n$. Prove that a necessary and sufficient condition for the existence of three players $A,B,C$ such that $A$ beats $B$, $B$ beats $C$, and $C$ beats $A$ is
$$s_{1}^{2} +s_{2}^{2} + \ldots +s_{n}^{2} < \frac{(2n-1)(n-1)n}{6}.$$