Found problems: 85335
Prove that, for every pair $ n$, $r$ of positive integers, there can be found a polynomial $ f(x)$ of degree $ n$ with integer coefficients, so that every polynomial $ g(x)$ of degree at most $ n$, for which the coefficients of the polynomial $ f(x)\minus{}g(x)$ are integers with absolute value not greater than $ r$, is irreducible over the field of rational numbers.
Find the number of all unordered pairs $\{A,B \}$ of subsets of an $8$-element set, such that $A\cap B \neq \emptyset$ and $\left |A \right | \neq \left |B \right |$.
Find all natural numbers $n$ for which there exists set $S$ consisting of $n$ points in the plane, satisfying the condition:
For each point $A \in S$ there exist at least three points say $X, Y, Z$ from $S$ such that the segments $AX, AY$ and$ AZ$ have length $1$ (it means that $AX = AY = AZ = 1$).
Let $f(x)$ be a polynomial with rational coefficients, and let $\alpha$ be a real number. If
\[\alpha^3-2019\alpha=(f(\alpha))^3-2019f(\alpha)=2021,\]
prove that $(f^n(\alpha))^3-2019f^n(\alpha)=2021$ for any positive integer $n$.
(Here, we define $f^n(x)=\underbrace{f(f(f\cdots f}_{n\text{ times}}(x)\cdots ))$.)
$ a_{i} \in \left\{0,1,2,3,4\right\}$ for every $ 0\le i\le 9$. If $ 6\sum _{i \equal{} 0}^{9}a_{i} 5^{i} \equiv 1\, \, \left(mod\, 5^{10} \right)$, $ a_{9} \equal{} ?$
$\textbf{(A)}\ 0 \qquad\textbf{(B)}\ 1 \qquad\textbf{(C)}\ 2 \qquad\textbf{(D)}\ 3 \qquad\textbf{(E)}\ 4$
A polynomial $f(x)$ with integer coefficients is said to be [i]tri-divisible[/i] if $3$ divides $f(k)$ for any integer $k$. Determine necessary and sufficient conditions for a polynomial to be tri-divisible.
Let $ABC$ be a triangle with circumcenter $O$. Let $P$ be the intersection of straight lines $BO$ and $AC$ and $\omega$ be the circumcircle of triangle $AOP$. Suppose that $BO = AP$ and that the measure of the arc $OP$ in $\omega$, that does not contain $A$, is $40^o$. Determine the measure of the angle $\angle OBC$.
[img]https://3.bp.blogspot.com/-h3UVt-yrJ6A/XqBItXzT70I/AAAAAAAAL2Q/7LVv0gmQWbo1_3rn906fTn6wosY1-nIfwCK4BGAYYCw/s1600/2007%2Bomb%2Bl2.png[/img]
Let $N = 2^{\left(2^2\right)}$ and $x$ be a real number such that $N^{\left(N^N\right)} = 2^{(2^x)}$. Find $x$.
For any positive integer $n$, let $f(n)$ be the maximum number of groups formed by a total of $n$ people such that the following holds: every group consists of an even number of members, and every two groups share an odd number of members. Compute $\textstyle\sum_{n=1}^{2022}f(n)\text{ mod }1000$.
How many three-digit positive integers $N$ satisfy the following properties?
- The number $N$ is divisible by $7$.
- The number formed by reversing the digits of $N$ is divisible by $5$.
$\textbf{(A) }13\qquad\textbf{(B) }14\qquad\textbf{(C) }15\qquad\textbf{(D) }16\qquad\textbf{(E) }17$
Determine all pairs $(a,b)$ of positive integers for which there exist positive integers $g$ and $N$ such that
$$\gcd (a^n+b,b^n+a)=g$$
holds for all integers $n\geqslant N.$ (Note that $\gcd(x, y)$ denotes the greatest common divisor of integers $x$ and $y.$)
[i]Proposed by Valentio Iverson, Indonesia[/i]
Let us consider a function $f:\mathbb{N}\to\mathbb{N}$ for which $f(1)=1$, $f(2n)=f(n)$ and $f(2n+1)=f(2n)+1$. Find the number of values at which the maximum value of $f(n)$ is attained for integer $n$ satisfying $0<n<2014$.
What is the area of the smallest triangle with all side lengths rational and all vertices lattice points?
In $\triangle{ABC}$, $\angle{C} = 90^{\circ}$ and $AB = 12$. Squares $ABXY$ and $ACWZ$ are constructed outside of the triangle. The points $X, Y, Z$, and $W$ lie on a circle. What is the perimeter of the triangle?
$ \textbf{(A)}\ 12+9\sqrt{3}\qquad\textbf{(B)}\ 18+6\sqrt{3}\qquad\textbf{(C)}\ 12+12\sqrt{2}\qquad\textbf{(D)}\ 30\qquad\textbf{(E)}\ 32 $
Show that there is a natural number $n$ such that $n!$ when written in decimal notation ends exactly in 1993 zeros.
Let $n$ be a positive integer greater than $2$. Solve in nonnegative real numbers the following system of equations \[x_{k}+x_{k+1}=x_{k+2}^{2}\quad , \quad k=1,2,\cdots,n\] where $x_{n+1}=x_{1}$ and $x_{n+2}=x_{2}$.
How many four-digit multiples of $8$ are greater than $2008$?
Consider the complex numbers $a_1, a_2,\cdots , a_n$, $n \geq 2$. Which have the following properties:
[list]
[*] $|a_i|=1$ $\forall$ $i=1,2,\cdots , n$
[*] $\sum \limits_{k=1}^n arg(a_k)\leq \pi$
[/list]
Show that the inequality$$\left(n^2\cot \left(\frac{\pi}{2n}\right)\right)^{-1}\left |\sum \limits_{k=0}^n(-1)^k\left[3n^2-(8k+5)n+4k(k+1)\sigma_k\right]\right |\geq \sqrt{\left(1+\frac{1}{n}\right)^2\cot^2 \left(\frac{\pi}{2n}\right)}+16\left |\sum \limits_{k=0}^n(-1)^k\sigma_k\right |$$where $\sigma_0=1$, $\sigma_k=\sum \limits_{1\leq i_1\leq i_2\leq \cdots \leq i_k\leq n}a_{i_1}a_{i_2}\cdots a_{i_k}$, $\forall$ $k=1,2,\cdots , n$
We call a matrix $\textsl{binary matrix}$ if all its entries equal to $0$ or $1$. A binary matrix is $\textsl{Good}$ if it simultaneously satisfies the following two conditions:
(1) All the entries above the main diagonal (from left to right), not including the main diagonal, are equal.
(2) All the entries below the main diagonal (from left to right), not including the main diagonal, are equal.
Given positive integer $m$, prove that there exists a positive integer $M$, such that for any positive integer $n>M$ and a given $n \times n$ binary matrix $A_n$, we can select integers $1 \leq i_1 <i_2< \cdots < i_{n-m} \leq n$ and delete the $i_i$-th, $i_2$-th,$\cdots$, $i_{n-m}$-th rows and $i_i$-th, $i_2$-th,$\cdots$, $i_{n-m}$-th columns of $A_n$, then the resulting binary matrix $B_m$ is $\textsl{Good}$.
Let $T$ be the set of all triples $(a,b,c)$ of positive integers for which there exist triangles with side lengths $a,b,c.$ Express \[\sum_{(a,b,c)\in T}\frac{2^a}{3^b5^c}\] as a rational number in lowest terms.
Prove that for any $ n\in \mathbb N$ the number $ 1\plus{}\dfrac{1}{3}\plus{}\dfrac{1}{5}\plus{}\ldots\plus{}\dfrac{1}{2n\plus{}1}$ is not an integer.
On a circle there are $n$ points such that every point has a distinct number. Determine the number of ways of choosing $k$ points such that for any point there are at least 3 points between this point and the nearest point. (clockwise) ($n,k\geq 2$)
Let $ABCD$ be a tetrahedron. Let $a$ be the length of $AB$ and let $S$ be the area of the projection of the tetrahedron onto a plane perpendicular to $AB$. Determine the volume of the tetrahedron in terms of $a$ and $S$.
A hunter and an invisible rabbit play a game on an infinite square grid. First the hunter fixes a colouring of the cells with finitely many colours. The rabbit then secretly chooses a cell to start in. Every minute, the rabbit reports the colour of its current cell to the hunter, and then secretly moves to an adjacent cell that it has not visited before (two cells are adjacent if they share an edge). The hunter wins if after some finite time either:[list][*]the rabbit cannot move; or
[*]the hunter can determine the cell in which the rabbit started.[/list]Decide whether there exists a winning strategy for the hunter.
[i]Proposed by Aron Thomas[/i]
Consider the points $O = (0,0), A = (- 2,0)$ and $B = (0,2)$ in the coordinate plane. Let $E$ and $F$ be the midpoints of $OA$ and $OB$ respectively. We rotate the triangle $OEF$ with a center in $O$ clockwise until we obtain the triangle $OE'F'$ and, for each rotated position, let $P = (x, y)$ be the intersection of the lines $AE'$ and $BF'$. Find the maximum possible value of the $y$-coordinate of $P$.