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$ and $k$ be integers, $1\le k\le n$. Find an integer $b$ and a set $A$ of $n$ integers satisfying the following conditions: (i) No product of $k-1$ distinct elements of $A$ is divisible by $b$. (ii) Every product of $k$ distinct elements of $A$ is divisible by $b$. (iii) For all distinct $a,a'$ in $A$, $a$ does not divide $a'$.
Consider the cyclic quadrilateral with side lengths $1$, $4$, $8$, $7$ in that order. What is its circumdiameter? Let the answer be of the form $a\sqrt b+c$, for $b$ squarefree. Find $a+b+c$.
Let \( X \) be a finite set of real numbers, \( d \) be a real number, and \(\lambda_1, \lambda_2, \cdots, \lambda_{2025}\) be 2025 non-zero real numbers. Define \[A = \left\{ (x_1, x_2, \cdots, x_{2025}) : x_1, x_2, \cdots, x_{2025} \in X \text{ and } \sum_{i=1}^{2025} \lambda_i x_i = d \right\},\] \[B = \left\{ (x_1, x_2, \cdots, x_{2024}) : x_1, x_2, \cdots, x_{2024} \in X \text{ and } \sum_{i=1}^{2024} (-1)^i x_i = 0 \right\},\] \[C = \left\{ (x_1, x_2, \cdots, x_{2026}) : x_1, x_2, \cdots, x_{2026} \in X \text{ and } \sum_{i=1}^{2026} (-1)^i x_i = 0 \right\}.\] Show that \( |A|^2 \leq |B| \cdot |C| \).
Let $ABC$ be a triangle and $P$ a point in its interior. Circle $\Gamma_A$ is considered such that it is tangent to rays $(PB$ and $(PC$. Define similarly $\Gamma_B$ and $\Gamma_C$. Let $\ell_A\neq PA$ be the other common internal tangent of $\Gamma_B$ and $\Gamma_C$. Prove that $\ell_A$, $\ell_B$ and $\ell_C$ meet at a point. [i]Proposed by Andrei Vila[/i]
You are given a positive integer $n > 1$. What is the largest possible number of integers that can be chosen from the set $\{1, 2, 3, \ldots, 2^n\}$ so that for any two different chosen integers $a, b$, the value $a^k + b^k$ is not divisible by $2^n$ for any positive integer $k$? [i]Proposed by Oleksii Masalitin[/i]
It is known that odd prime numbers $x, y z$ satisfy $$x|(y^5+1),y|(z^5+1),z|(x^5+1).$$ Find the minimum value of the product $xyz$.
Let $ABC$ be a non isosceles triangle with circumcircle $(O)$ and incircle $(I)$. Denote $(O_1)$ as the circle internal tangent to $(O)$ at $A_1$ and also tangent to segments $AB,AC$ at $A_b,A_c$ respectively. Define the circles $(O_2), (O_3)$ and the points $B_1, C_1, B_c , B_a, C_a, C_b$ similarly. 1. Prove that $AA_1, BB_1, CC_1$ are concurrent at the point $M$ and $3$ points $I,M,O$ are collinear. 2. Prove that the circle $(I)$ is inscribed in the hexagon with $6$ vertices $A_b,A_c , B_c , B_a, C_a, C_b$.
Let N be a positive integer greater than 2. We number the vertices of a regular 2n-gon clockwise with the numbers 1, 2, . . . ,N,−N,−N + 1, . . . ,−2,−1. Then we proceed to mark the vertices in the following way. In the first step we mark the vertex 1. If ni is the vertex marked in the i-th step, in the i+1-th step we mark the vertex that is |ni| vertices away from vertex ni, counting clockwise if ni is positive and counter-clockwise if ni is negative. This procedure is repeated till we reach a vertex that has already been marked. Let $f(N)$ be the number of non-marked vertices. (a) If $f(N) = 0$, prove that 2N + 1 is a prime number. (b) Compute $f(1997)$.
In how many ways we can paint a $N \times N$ chessboard using 4 colours such that squares with a common side are painted with distinct colors and every $2 \times 2$ square (formed with 4 squares in consecutive lines and columns) is painted with the four colors?
The vertex C of the triangle ABC is allowed to vary along a line parallel to AB. Find the locus of the orthocenter.
There are 900 3-digit-numbers $100,101,\cdots,999$. Print them on 900 cards. Some numbers are still numbers when we turn upside down, for example $198$ is $861$ when we turn upside down. However, some numbers are not, for example $531$. So, some numbers cam be used twice. If we want to express all 3-digit-numbers, we can print________cards fewer.
Forty teams play a tournament in which every team plays every other team exactly once. No ties occur, and each team has a $50 \%$ chance of winning any game it plays. The probability that no two teams win the same number of games is $m/n,$ where $m$ and $n$ are relatively prime positive integers. Find $\log_2 n.$
In the square $ABCD$ of side length $2$ the point $M$ is the midpoint of $BC$ and $P$ a point on $DC$. Determine the smallest value of $AP+PM$. [img]https://1.bp.blogspot.com/-WD8WXIE6DK4/XzcC9GYsa6I/AAAAAAAAMXg/vl2OrbAdChEYrRpemYmj6DiOrdOSqj_IgCLcBGAsYHQ/s178/2001%2BMohr%2Bp3.png[/img]
Prove that there exists a positive integer $x<5^{2022}$ such that \[\{\varphi\sqrt[3]{x}\}<\varphi^{-2022}.\]
Given a regular tetrahedron $ABCD$ with center $O$, find $\sin \angle AOB$.
Find the base of the number system less than $100$, in which $2101$ is a perfect square.
Given $f:\mathbb{R}\to \mathbb{R}$ an arbitrary function and $g:\mathbb{R}\to \mathbb{R}$ a function of the second degree, with the property: for any real numbers m and n equation $f\left( x \right)=mx+n$ has solutions if and only if the equation $g\left( x \right)=mx+n$ has solutions Show that the functions $f$ and $g$ are equal.
In a convex quadrilateral $ABCD$ whose diagonals intersect at point $E$, the equalities$$\dfrac{|AB|}{|CD|}=\dfrac{|BC|}{|AD|}=\sqrt{\dfrac{|BE|}{|ED|}}$$hold. Prove that $ABCD$ is either a paralellogram or a cyclic quadrilateral
Let $ABC$ be an acute-angled triangle. Construct points $A', B', C'$ on its sides $BC, CA, AB$ such that: - $A'B' \parallel AB$, - $C'C$ is the bisector of angle $A'C'B'$, - $A'C' + B'C'= AB$.
At an international event there are $100$ countries participating, each with its own flag. There are $10$ distinct flagpoles at the stadium, labelled 1,#2,...,#10 in a row. In how many ways can all the $100$ flags be hoisted on these $10$ flagpoles, such that for each $i$ from $1$ to $10$, the flagpole #i has at least $i$ flags? (Note that the vertical order of the flagpoles on each flag is important)
The mean of a set of $k$ consecutive integers is $k$. If the smallest integer is $23$, what is the largest integer?
Let $n>1$ be an integer and $S_n$ the set of all permutations $\pi : \{1,2,\cdots,n \} \to \{1,2,\cdots,n \}$ where $\pi$ is bijective function. For every permutation $\pi \in S_n$ we define: \[ F(\pi)= \sum_{k=1}^n |k-\pi(k)| \ \ \text{and} \ \ M_{n}=\frac{1}{n!}\sum_{\pi \in S_n} F(\pi) \] where $M_n$ is taken with all permutations $\pi \in S_n$. Calculate the sum $M_n$.
Let $ABC$ be an acute-angled triangle. The external bisector of $\angle BAC$ meets the line $BC$ at point $N$. Let $M$ be the midpoint of $BC$. $P$ and $Q$ are two points on line $AN$ such that, $\angle PMN=\angle MQN=90^{\circ}$. If $PN=5$ and $BC=3$, then the length $QA$ can be expressed as $\frac{a}{b}$ where $a$ and $b$ are co-prime positive integers. What is the value of $(a+b)$?
Let $t = (a, b, c)$, and let us define $f^1 (t) = (a + b, b + c, c + a)$ and $f^k (t) = f^{k-1}(f^1(t))$ for all $k > 1$. Furthermore, a permutation of $t$ has the same elements, just in a different order (e.g., $(b, c, a)$). If $f^{2013}(s)$ is a permutation of $s$ for some $s = (k, m, n)$, where $k, m$, and $n$ are integers such that $|k|, |m|, |n|\le 10$, how many possible values of $s$ are there?