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

Given two conditions: A: $\sqrt{1+\sin\theta}=a$ B: $\sin\frac{\theta}{2}+\cos\frac{\theta}{2}=a$ Then, which one of the followings are true? $(\text{A})$A is sufficient and necessary condition of B. $(\text{B})$A is necessary but insufficient condition of B. $(\text{C})$A is sufficient but unnecessary condition of B. $(\text{D})$A is insufficient and unnecessary condition of B.
Find the values of $ x $ that satisfy the inequality $$ \sqrt{x} - \sqrt{x- a} > 2,$$ where $ a $ is a gicen poistive number.
Prove that every integer $n \ge 12$ is the sum of two composite numbers.
On the plane $n$ points are chosen so that exactly $m$ of them lie on one straight line and no three points not included in these $m$ points lie on one straight line. What is the number of all lines, each of which contains at least two of these points?
Prove that for each positive integer $m$, one can find $m$ consecutive positive integers like $n$ such that the following phrase doesn't be a perfect power: $$\left(1^3+2018^3\right)\left(2^3+2018^3\right)\cdots \left(n^3+2018^3\right)$$ [i]Proposed by Navid Safaei[/i]
Let $p$ be a positive integer, $p>1.$ Find the number of $m\times n$ matrices with entries in the set $\left\{ 1,2,\dots,p\right\} $ and such that the sum of elements on each row and each column is not divisible by $p.$
Does the bellow depicted figure fit into a square $5\times5$.
There is a box containing $100$ balls, each of which is either orange or black. The box is equally likely to contain any number of black balls between $0$ and $100$, inclusive. A random black ball rolls out of the box. The probability that the next ball to roll out of the box is also black can be written in the form $\tfrac{p}{q}$ where $p$ and $q$ are relatively prime positive integers. Find $p + q$.
Each member of the sequence $112002, 11210, 1121, 117, 46, 34,\ldots$ is obtained by adding five times the rightmost digit to the number formed by omitting that digit. Determine the billionth ($10^9$th) member of this sequence.
Triangle $ABC$ has points $A$ at $\left(0,0\right)$, $B$ at $\left(9,12\right)$, and $C$ at $\left(-6,8\right)$ in the coordinate plane. Find the length of the angle bisector of $\angle{BAC}$ from $A$ to where it intersects $BC$. [i]2017 CCA Math Bonanza Lightning Round #1.3[/i]
Let $n \geq 1$ be an integer. What is the maximum number of disjoint pairs of elements of the set $\{ 1,2,\ldots , n \}$ such that the sums of the different pairs are different integers not exceeding $n$?
Find the smallest positive integer $n$ or show no such $n$ exists, with the following property: there are infinitely many distinct $n$-tuples of positive rational numbers $(a_1, a_2, \ldots, a_n)$ such that both $$a_1+a_2+\dots +a_n \quad \text{and} \quad \frac{1}{a_1} + \frac{1}{a_2} + \dots + \frac{1}{a_n}$$ are integers.
A competition consists of $25$ sports, each awarding one gold medal to a winner. $25$ athletes participate, each in all $25$ sports. There are also $25$ experts, each of whom must predict the number of gold medals each athlete will win. In each prediction, the medal counts must be non-negative integers summing to $25$. An expert is called competent if they correctly guess the number of gold medals for at least one athlete. What is the maximum number \( k \) such that the experts can make their predictions so that at least \( k \) of them are guaranteed to be competent regardless of the outcome? \\
A convex solid is formed in four-dimensional Euclidean space with vertices at the $24$ possible permutations of $\{1, 2, 3, 4\}$ (so $(1, 2, 3, 4)$, $(1, 2, 4, 3)$, etc.). What is the product of the number of faces and edges of this solid?
Find all functions $f: \mathbb{N}_{0}\to \mathbb{N}_{0}$ such that for all $n\in \mathbb{N}_{0}$: \[f(m+f(n))=f(f(m))+f(n).\]
Prove that for all integers $n \geq 3$, there exist odd positive integers $x$, $y$ such that $7x^2 + y^2 = 2^n$.
Let circles $\Gamma_1$ and $\Gamma_2$ have radii $r_1$ and $r_2$, respectively. Assume that $r_1 < r_2$. Let $T$ be an intersection point of $\Gamma_1$ and $\Gamma_2$, and let $S$ be the intersection of the common external tangents of $\Gamma_1$ and $\Gamma_2$. If it is given that the tangents to $\Gamma_1$ and $ \Gamma_2$ at $T$ are perpendicular, determine the length of $ST$ in terms of $r_1$ and $r_2$.
Suppose $a_0,\ldots, a_{100}$ are positive reals. Consider the following polynomial for each $k$ in $\{0,1,\ldots, 100\}$: $$a_{100+k}x^{100}+100a_{99+k}x^{99}+a_{98+k}x^{98}+a_{97+k}x^{97}+\dots+a_{2+k}x^2+a_{1+k}x+a_k,$$where indices are taken modulo $101$, [i]i.e.[/i], $a_{100+i}=a_{i-1}$ for any $i$ in $\{1,2,\dots, 100\}$. Show that it is impossible that each of these $101$ polynomials has all its roots real. [i]Proposed by Prithwijit De[/i]
Suppose that a sequence $a_1,a_2,\ldots$ of positive real numbers satisfies \[a_{k+1}\geq\frac{ka_k}{a_k^2+(k-1)}\] for every positive integer $k$. Prove that $a_1+a_2+\ldots+a_n\geq n$ for every $n\geq2$.
Let $a_1,a_2,...,a_n$ be $n$ different positive integers where $n\ge 1$. Show that $$\sum_{i=1}^n a_i^3 \ge \left(\sum_{i=1}^n a_i\right)^2$$
$1+\dfrac{1}{2}+\dfrac{1}{4}+\dfrac{1}{8}$ is equal to $\textbf{(A)}\ \dfrac{15}{8} \qquad \textbf{(B)}\ 1\dfrac{3}{14} \qquad \textbf{(C)}\ \dfrac{11}{8} \qquad \textbf{(D)}\ 1\dfrac{3}{4} \qquad \textbf{(E)}\ \dfrac{7}{8}$
Prove that for any natural numbers min the inequality holds $$1^m + 2^m + \ldots + n^m \geq n\cdot \left( \frac{n+1}{2}\right)^m$$
On an infinite chessboard, a solitaire game is played as follows: at the start, we have $n^2$ pieces occupying a square of side $n.$ The only allowed move is to jump over an occupied square to an unoccupied one, and the piece which has been jumped over is removed. For which $n$ can the game end with only one piece remaining on the board?
Nine distinct positive integers are arranged in a circle such that the product of any two non-adjacent numbers in the circle is a multiple of $n$ and the product of any two adjacent numbers in the circle is not a multiple of $n$, where $n$ is a fixed positive integer. Find the smallest possible value for $n$.
Find all functions $f:\mathbb Z_{>0}\to \mathbb Z_{>0}$ such that $a+f(b)$ divides $a^2+bf(a)$ for all positive integers $a$ and $b$ with $a+b>2019$.