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

Let $n$ be a positive integer. Find the smallest positive integer $k$ with the property that for any colouring nof the squares of a $2n$ by $k$ chessboard with $n$ colours, there are $2$ columns and $2$ rows such that the $4$ squares in their intersections have the same colour.
Find all integers $x$ and $y$ satisfying the following equation $x^2 - 2xy + 5y^2 + 2x - 6y - 3 = 0$.
A trapezoid has side lengths $3, 5, 7,$ and $11$. The sum of all the possible areas of the trapezoid can be written in the form of $r_1 \sqrt{n_1} + r_2 \sqrt{n_2} + r_3$, where $r_1, r_2,$ and $r_3$ are rational numbers and $n_1$ and $n_2$ are positive integers not divisible by the square of a prime. What is the greatest integer less than or equal to \[r_1 + r_2 + r_3 + n_1 + n_2?\] $ \textbf{(A)}\ 57\qquad\textbf{(B)}\ 59\qquad\textbf{(C)}\ 61\qquad\textbf{(D)}\ 63\qquad\textbf{(E)}\ 65 $
The two intersections of the circles $k_i$ and $k_{i + 1}$ are $P_i$ and $Q_i$ ($1 \le i \le 5, k_6 = k_1$). On the circle $k_1$ lies an arbitrary point $A$. Then the points $B, C, D, E, F, G, H, I, J, K$ lie on the circles $k_2, k_3, k_4, k_5, k_1, k_2, k_3, k_4, k_5, k_1$ respectively, such that $AP_1B, BP_2C, CP_3D, DP_4E, EP_5F, F Q_1G, GQ_2H, HQ_3I, IQ_4J, JQ_5K$ are straight line triplets. Prove that that $K = A$. [img]https://1.bp.blogspot.com/-g6rF1hcPE08/X9j1SEJT7-I/AAAAAAAAMzc/2rWIiWTHZ34zfWVeGujkCxRW1hSCw5oOwCLcBGAsYHQ/s16000/2016%2BDurer%2BC..4.png[/img] [i]Circles can have different radii, and They can be located in different ways from the figure. We assume that during editing none neither of the two points mentioned above coincide.[/i]
$ a>0,\quad\lim_{n\to\infty }\sum_{i=1}^n \frac{1}{n+a^i} $
Let $q = \frac{3p-5}{2}$ where $p$ is an odd prime, and let\[ S_q = \frac{1}{2\cdot 3 \cdot 4} + \frac{1}{5\cdot 6 \cdot 7} + \cdots + \frac{1}{q(q+1)(q+2)} \]Prove that if $\frac{1}{p}-2S_q = \frac{m}{n}$ for integers $m$ and $n$, then $m - n$ is divisible by $p$.
Solve the system of equations: $ \begin{matrix} |x+y| + |1-x| = 6 \\ |x+y+1| + |1-y| = 4. \end{matrix} $
Let U be the set formed as the union of three open intervals, $U = (-100, -10) \cup (1/101, 1/11) \cup (101/100, 11/10)$. Show that $\int_{U} \frac{(x^2-x)^2}{(x^3-3x+1)^2} dx$ is rational.
Let $p_n$ be the $n^{\mbox{th}}$ prime counting from the smallest prime $2$ in increasing order. For example, $p_1=2, p_2=3, p_3 =5, \cdots$ (a) For a given $n \ge 10$, let $r$ be the smallest integer satisfying \[2\le r \le n-2, \quad n-r+1 < p_r\] and define $N_s=(sp_1p_2\cdots p_{r-1})-1$ for $s=1,2,\ldots, p_r$. Prove that there exists $j, 1\le j \le p_r$, such that none of $p_1,p_2,\cdots, p_n$ divides $N_j$. (b) Using the result of (a), find all positive integers $m$ for which \[p_{m+1}^2 < p_1p_2\cdots p_m\]
In every row of a grid $100 \times n$ is written a permutation of the numbers $1,2 \ldots, 100$. In one move you can choose a row and swap two non-adjacent numbers with difference $1$. Find the largest possible $n$, such that at any moment, no matter the operations made, no two rows may have the same permutations.
Prove that for every positive integer $n$ there exists an $n$-digit number divisible by $5^n$ all of whose digits are odd.
Find constants $A > B$ such that $\frac{f\left( \frac{1}{1+2x}\right) }{f(x)}$ is independent of $x$, where $f(x) = \frac{1 + Ax}{1 + Bx}$ for all real $x \ne - \frac{1}{B}$. Put $a_0 = 1$, $a_{n+1} = \frac{1}{1 + 2a_n}$. Find an expression for an by considering $f(a_0), f(a_1), ...$.
Prove that the group morphisms $f: (\mathbb{C},+)\to(\mathbb{C},+)$ for which there exists a positive $\lambda$ such that $|f(z)| \leq \lambda |z|$ for all $z\in\mathbb{C}$, have the form \[ f(z) = \alpha z + \beta \overline{z} \] for some complex $\alpha$, $\beta$. [i]Cristinel Mortici[/i]
A division of a group of people into various groups is called $k$-regular if the number of groups is less or equal to $k$ and two people that know each other are in different groups. Let $A$, $B$, and $C$ groups of people such that there are is no person in $A$ and no person in $B$ that know each other. Suppose that the group $A \cup C$ has an $a$-regular division and the group $B \cup C$ has a $b$-regular division. For each $a$ and $b$, determine the least possible value of $k$ for which it is guaranteed that the group $A \cup B \cup C$ has a $k$-regular division.
A subset of $ n\times n$ table is called even if it contains even elements of each row and each column. Find the minimum $ k$ such that each subset of this table with $ k$ elements contains an even subset
Alex, Bob, Charlie, Daniel, and Ethan are five classmates. Some pairs of them are friends. How many possible ways are there for them to be friends such that everyone has at least one friend, and such that there is exactly one loop of friends among the five classmates? Note: friendship is two-way, so if person x is friends with person y then person y is friends with person $x$.
Let $S$ be a set of real numbers which is closed under multiplication (that is $a,b\in S\implies ab\in S$). Let $T,U\subset S$ such that $T\cap U=\emptyset, T\cup U=S$. Given that for any three elements $a,b,c$ in $T$, not necessarily distinct, we have $abc\in T$ and also if $a,b,c\in U$, not necessarily distinct then $abc\in U$. Show at least one of $T$ and $U$ is closed under multiplication.
show that the polynomial $x^4+3x^3+6x^2+9x+12$ cannot be written as the product of 2 polynomials of degree 2 with integer coefficients.
Prove that in a triangle one of the sides is twice as large as the other if and only if a median and an angle bisector of this triangle are perpendicular
We call a sequence of length $n$ of zeros and ones a "string of length $n$" and the elements of the same sequence "bits". Let $m,n$ be two positive integers so that $m<2^n$. Arik holds $m$ strings of length $n$. Giora wants to find a new string of length $n$ different from all those Arik holds. For this Giora may ask Arik questions of the form: "What is the value of bit number $i$ in string number $j$?" where $1\leq i\leq n$ and $1\leq j\leq m$. What is the smallest number of questions needed for Giora to complete his task when: [b]a)[/b] $m=n$? [b]b)[/b] $m=n+1$?
Find the greatest positive integer $m$ with the following property: For every permutation $a_1, a_2, \cdots, a_n,\cdots$ of the set of positive integers, there exists positive integers $i_1<i_2<\cdots <i_m$ such that $a_{i_1}, a_{i_2}, \cdots, a_{i_m}$ is an arithmetic progression with an odd common difference.
Find all pairs of integers $x, y$ such that $y^5 + 2xy = x^2 + 2y^4.$ .
For $n=2^m$ (m is a positive integer) consider the set $M(n) = \{ 1,2,...,n\}$ of natural numbers. Prove that there exists an order $a_1, a_2, ..., a_n$ of the elements of M(n), so that for all $1\leq i < j < k \leq n$ holds: $a_j - a_i \neq a_k - a_j$.
The $n$-element set of real numbers is given, where $n \geq 6$. Prove that there exist at least $n-1$ two-element subsets of this set, in which the arithmetic mean of elements is not less than the arithmetic mean of elements in the whole set.
A square of side $2a$, lying always in the first quadrant of the $xy$-plane, moves so that two consecutive vertices are always on the $x$- and $y$-axes respectively. Prove that a point within or on the boundary of the square will in general describe a portion of a conic. For what points of the square does this locus degenerate?