This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND
OR
NO

Found problems: 85335

How many $7$-digit positive integers are there such that the number remains same when its digits are reversed and is multiple of $11$? $ \textbf{(A)}\ 900 \qquad\textbf{(B)}\ 854 \qquad\textbf{(C)}\ 818 \qquad\textbf{(D)}\ 726 \qquad\textbf{(E)}\ \text{None} $
For his birthday, Bert gets a box that holds 125 jellybeans when filled to capacity. A few weeks later, Carrie gets a larger box full of jellybeans. Her box is twice as high, twice as wide and twice as long as Bert's. Approximately, how many jellybeans did Carrie get? $ \text{(A)}\ 250\qquad\text{(B)}\ 500\qquad\text{(C)}\ 625\qquad\text{(D)}\ 750\qquad\text{(E)}\ 1000 $
Ten balls numbered $1$ to $10$ are in a jar. Jack reaches into the jar and randomly removes one of the balls. Then Jill reaches into the jar and randomly removes a different ball. The probability that the sum of the two numbers on the balls removed is even is $\text{(A)}\ \frac{4}{9} \qquad \text{(B)}\ \frac{9}{19} \qquad \text{(C)}\ \frac{1}{2} \qquad \text{(D)}\ \frac{10}{19} \qquad \text{(E)}\ \frac{5}{9}$
Consider an acute non-isosceles triangle. In a single step it is allowed to cut any one of the available triangles into two triangles along its median. Is it possible that after a finite number of cuttings all triangles will be isosceles? [i]Proposed by E. Bakaev[/i]
Solve the equation $$(12x-1)(6x-1)(4x-1)(3x -1) = 5.$$
Complex number $z=\cos\theta+\text{i}\sin\theta(0\leq\theta\leq\pi)$. Points that three complex numbers $z,(1+\text{i})z,2\overline{z}$ refer to on complex plane are $P,Q,R$. When $P,Q,R$ are not collinear, $PQSR$ is a parallelogram. The longest distance between $S$ and the original point is________.
Find all functions $f:\mathbb{N}\rightarrow \mathbb{N}$ such that for all $m,n\in\mathbb{N}$, \[(2^m+1)f(n)f(2^mn)=2^mf(n)^2+f(2^mn)^2+(2^m-1)^2n. \]
Alice and Bob are playing game on an $n \times n$ grid. Alice goes first, and they take turns drawing a black point from the coordinate set \[\{(i, j) \mid i, j \in \mathbb{N}, 1 \leq i, j \leq n\}\] There is a constraint that the distance between any two black points cannot be an integer. The player who cannot draw a black point loses. Find all integers $n$ such that Alice has a winning strategy. [i]Proposed by chengbilly[/i]
Consider the quadratic equation \(x^2 + a_0 x + b_0\) for some real numbers \((a_0, b_0)\). Repeat the following procedure as many times as possible: Let \(c_i = \min \{r_i, s_i\}\), with \(r_i, s_i\) being the roots of the equation \(x^2 + a_i x + b_i\). The new equation is written as \(x^2 + b_i x + c_i\). That is, for the next iteration of the procedure, \(a_{i+1} = b_i\) and \(b_{i+1} = c_i\). We say that \((a_0, b_0)\) is an $\textit{interesting}$ pair if, after a finite number of steps, the equation we obtain after one step is the same, so that \((a_i, b_i) = (a_{i+1}, b_{i+1})\). Find all $\textit{interesting}$ pairs.
For a natural number $n$, with $v_2(n)$ we denote the largest integer $k\geq0$ such that $2^k|n$. Let us assume that the function $f\colon\mathbb{N}\to\mathbb{N}$ meets the conditions: $(i)$ $f(x)\leq3x$ for all natural numbers $x\in\mathbb{N}$. $(ii)$ $v_2(f(x)+f(y))=v_2(x+y)$ for all natural numbers $x,y\in\mathbb{N}$. Prove that for every natural number $a$ there exists exactly one natural number $x$ such that $f(x)=3a$.
Point $P$ is selected at random from the interior of the pentagon with vertices $A = (0, 2), B = (4, 0), C = (2\pi + 1, 0), D = (2\pi + 1, 4),$ and $E = (0, 4)$. What is the probability that $\angle ABP$ is obtuse? Express your answer as a common fraction.
We define $ f: \mathbb{N} \rightarrow \mathbb{N}$, $ f(n) \equal{} \sum_{k \equal{} 1}^{n}(k,n)$. a) Show that if $ \gcd(m,n)\equal{}1$ then we have $ f(mn)\equal{}f(m)\cdot f(n)$; b) Show that $ \sum_{d|n}f(d) \equal{} nd(n)$.
Let $M$, $N$ and $P$ be midpoints of sides $BC, AC$ and $AB$, respectively, and let $O$ be circumcenter of acute-angled triangle $ABC$. Circumcircles of triangles $BOC$ and $MNP$ intersect at two different points $X$ and $Y$ inside of triangle $ABC$. Prove that \[\angle BAX=\angle CAY.\]
Convex quadrilateral $ ABCD$ is inscribed in a circle, $ \angle{A}\equal{}60^o$, $ BC\equal{}CD\equal{}1$, rays $ AB$ and $ DC$ intersect at point $ E$, rays $ BC$ and $ AD$ intersect each other at point $ F$. It is given that the perimeters of triangle $ BCE$ and triangle $ CDF$ are both integers. Find the perimeter of quadrilateral $ ABCD$.
Alfred and Bonnie play a game in which they take turns tossing a fair coin. The winner of a game is the first person to obtain a head. Alfred and Bonnie play this game several times with the stipulation that the loser of a game goes first in the next game. Suppose that Alfred goes first in the first game, and that the probability that he wins the sixth game is $m/n$, where $m$ and $n$ are relatively prime positive integers. What are the last three digits of $m + n$?
There are $23$ balls on a table, all of which are either red or blue, such that the probability that there are $n$ red balls and $23-n$ blue balls on the table ($1 \le n \le 22$) is proportional to $n$. (e.g. the probability that there are $2$ red balls and $21$ blue balls is twice the probability that there are $1$ red ball and $22$ blue balls.) Given that the probability that the red balls and blue balls can be arranged in a line such that there is a blue ball on each end, no two red balls are next to each other, and an equal number of blue balls can be placed between each pair of adjacent red balls is $\frac{a}{b}$, where $a$ and $b$ are relatively prime positive integers, find $a+b$. Note: There can be any nonzero number of consecutive blue balls at the ends of the line. [i]Proposed by Ada Tsui[/i]
We are given the finite sets $ X$, $ A_1$, $ A_2$, $ \dots$, $ A_{n \minus{} 1}$ and the functions $ f_i: \ X\rightarrow A_i$. A vector $ (x_1,x_2,\dots,x_n)\in X^n$ is called [i]nice[/i], if $ f_i(x_i) \equal{} f_i(x_{i \plus{} 1})$, for each $ i \equal{} 1,2,\dots,n \minus{} 1$. Prove that the number of nice vectors is at least \[ \frac {|X|^n}{\prod\limits_{i \equal{} 1}^{n \minus{} 1} |A_i|}. \]
Let $ABC$ be a triangle, $I$ its incenter and $I_a$ its $A$-excenter. Let $\omega$ be its circuncircle and $D$ be the intersection of $AI$ and $\omega$. Let some line $r$ through $D$ cut $BC$ in $E$ and $\omega$ in $F$. The lines $IE$ and $I_aE$ intersect $I_aF$ and $IF$ in $P$ and $Q$, respectively. Furthermore, the circles $PII_a$ and $QII_a$ intersect $I_aE$ and $IE$ in $R$ and $S$, respectively. Prove that there is a circle passing through $F,E,R$ and $S$.
What is the smallest positive integer value of $x$ for which $x \equiv 4$ (mod $9$) and $x \equiv 7$ (mod $8$)?
Let $I$ be incentre of scalene $\triangle ABC$ and let $L$ be midpoint of arc $BAC$. Let $M$ be midpoint of $BC$ and let the line through $M$ parallel to $AI$ intersect $LI$ at point $P$. Let $Q$ lie on $BC$ such that $PQ\perp LI$. Let $S$ be midpoint of $AM$ and $T$ be midpoint of $LI$. Prove that $IS\perp BC$ if and only if $AQ\perp ST$. [i]~Mahavir Gandhi[/i]
For nonnegative integer $n$, the following are true: [list] [*]$f(0)=0$ [*]$f(1)=1$ [*]$f(n)=f(n-\tfrac{m(m-1)}2)-f(\tfrac{m(m+1)}2-n)$ for integer $m$ satisfying $m\geq 2$ and $\tfrac{m(m-1)}2<n\leq\tfrac{m(m+1)}2$.[/list] Find the smallest integer $n$ such that $f(n)=4$.
Let $a$, $b$, and $c$ be real angles such that \newline \[3\sin a + 4\sin b + 5\sin c = 0\] \[3\cos a + 4\cos b + 5\cos c = 0.\] \newline The maximum value of the expression $\frac{\sin b \sin c}{\sin^2 a}$ can be expressed as $\frac{p}{q}$ for relatively prime $p,q$. Compute $p+q$.
Given triangle $ABC$. Consider lines $l$ with the next property: the reflections of $l$ in the sidelines of the triangle concur. Prove that all these lines have a common point.
Two perpendicular chords are drawn through a given interior point $P$ of a circle with radius $R.$ Determine, with proof, the maximum and the minimum of the sum of the lengths of these two chords if the distance from $P$ to the center of the circle is $kR.$
Show that $n^n + (n + 1)^{n + 1}$ is composite for infinitely many positive integers $n$.