Found problems: 85335
Let $\{a_{n}\}_{n \ge 1}$ be a sequence of positive integers such that \[0 < a_{n+1}-a_{n}\le 2001 \;\; \text{for all}\;\; n \in \mathbb{N}.\] Show that there are infinitely many pairs $(p, q)$ of positive integers such that $p>q$ and $a_{q}\; \vert \; a_{p}$.
Let $\Lambda= \{1, 2, \ldots, 2v-1,2v\}$ and $P=\{\alpha_1, \alpha_2, \ldots, \alpha_{2v-1}, \alpha_{2v}\}$ be a permutation of the elements of $\Lambda$.
(a) Prove that
$$\sum_{i=1}^v \alpha_{2i-1}\alpha_{2i} \leq \sum_{i=1}^v (2i-1)2i.$$
(b) Determine the largest positive integer $m$ such that we can partition the $m\times m$ square into $7$ rectangles for which every pair of them has no common interior points and their lengths and widths form the following sequence:
$$1,2,3,4,5,6,7,8,9,10,11,12,13,14.$$
Sydney the squirrel is at $(0, 0)$ and is trying to get to $(2021, 2022)$. She can move only by reflecting her position over any line that can be formed by connecting two lattice points, provided that the reflection puts her on another lattice point. Is it possible for Sydney to reach $(2021, 2022)$?
Given $5$ points in the plane, no three of them being collinear. Show that among these $5$ points, we can always find $4$ points forming a convex quadrilateral.
Let $ n \ge 1$ and $ k \ge 3$ be integers. A circle is divided into $ n$ sectors $ a_1,a_2,\dots,a_n$. We will color the $ n$ sectors with $ k$ different colors such that $ a_i$ and $ a_{i \plus{} 1}$ have different color for each $ i \equal{} 1,2,\dots,n$ where $ a_{n \plus{} 1}\equal{}a_1$. Find the number of ways to do such coloring.
For how many three-element sets of positive integers $\{a,b,c\}$ is it true that $a \times b \times c = 2310$?
$\textbf{(A)}\ 32 \qquad
\textbf{(B)}\ 36 \qquad
\textbf{(C)}\ 40 \qquad
\textbf{(D)}\ 43 \qquad
\textbf{(E)}\ 45$
Determine the maximal length $L$ of a sequence $a_1,\dots,a_L$ of positive integers satisfying both the following properties:
[list=disc]
[*]every term in the sequence is less than or equal to $2^{2023}$, and
[*]there does not exist a consecutive subsequence $a_i,a_{i+1},\dots,a_j$ (where $1\le i\le j\le L$) with a choice of signs $s_i,s_{i+1},\dots,s_j\in\{1,-1\}$ for which \[s_ia_i+s_{i+1}a_{i+1}+\dots+s_ja_j=0.\]
[/list]
For every natural number $ t$, $ f(t)$ is the probability that if a fair coin is tossed $ t$ times, the number of times we get heads is 2008 more than the number of tails. What is the value of $ t$ for which $ f(t)$ attains its maximum? (if there is more than one, describe all of them)
Consider a rectangle $A_1A_2A_3A_4$ and a circle $\mathcal{C}_i$ centered at $A_i$ with radius $r_i$ for $i=1,2,3,4$. Suppose that $r_1+r_3=r_2+r_4<d$, where $d$ is the diagonal of the rectangle. The two pairs of common outer tangents of $\mathcal{C}_1$ and $\mathcal{C}_3$, and of $\mathcal{C}_2$ and $\mathcal{C}_4$ form a quadrangle. Prove that this quadrangle has an inscribed circle.
if a,b∈R+,$a^{\log b}=2$,$a^{\log a}b^{\log b}=5$,find out $(ab)^{\log ab}$
Let ABC be a scalene triangle. Consider points D, E, F on segments AB, BC, CA, respectively, such that $\overline{AF}$=$\overline{DF}$ and $\overline{BE}$=$\overline{DE}$.
Show that the circumcenter of ABC lies on the circumcircle of CEF.
$P(x)=ax^2+bx+c$ has exactly $1$ different real root where $a,b,c$ are real numbers. If $P(P(P(x)))$ has exactly $3$ different real roots, what is the minimum possible value of $abc$?
$
\textbf{(A)}\ -3
\qquad\textbf{(B)}\ -2
\qquad\textbf{(C)}\ 2\sqrt 3
\qquad\textbf{(D)}\ 3\sqrt 3
\qquad\textbf{(E)}\ \text{None of above}
$
A calculator has a squaring key $\boxed{x^2}$ which replaces the current number displayed with its square. For example, if the display is $\boxed{000003}$ and the $\boxed{x^2}$ key is depressed, then the display becomes $\boxed{000009}$. If the display reads $\boxed{000002}$, how many times must you depress the $\boxed{x^2}$ key to produce a displayed number greater than $500$?
$\text{(A)}\ 4 \qquad \text{(B)}\ 5 \qquad \text{(C)}\ 8 \qquad \text{(D)}\ 9 \qquad \text{(E)}\ 250$
In tetrahedron $ABCD$, vertex $D$ is connected with $D_0$, the centrod if $\triangle ABC$. Line parallel to $DD_0$ are drawn through $A,B$ and $C$. These lines intersect the planes $BCD, CAD$ and $ABD$ in points $A_2, B_1,$ and $C_1$, respectively. Prove that the volume of $ABCD$ is one third the volume of $A_1B_1C_1D_0$. Is the result if point $D_o$ is selected anywhere within $\triangle ABC$?
Find the surface generated by the solutions of \[ \frac {dx}{yz} = \frac {dy}{zx} = \frac{dz}{xy}, \] which intersects the circle $y^2+ z^2 = 1, x = 0.$
Can a square be divided into $10$ pairwise non-congruent triangles with the same area?
A bag of popping corn contains $\frac{2}{3}$ white kernels and $\frac{1}{3}$ yellow kernels. Only $\frac{1}{2}$ of the white kernels will pop, whereas $\frac{2}{3}$ of the yellow ones will pop. A kernel is selected at random from the bag, and pops when placed in the popper. What is the probability that the kernel selected was white?
$ \textbf{(A)}\ \frac{1}{2} \qquad\textbf{(B)}\ \frac{5}{9} \qquad\textbf{(C)}\ \frac{4}{7} \qquad\textbf{(D)}\ \frac{3}{5} \qquad\textbf{(E)}\ \frac{2}{3} $
Find the number of ordered triples of positive integers $(a, b, c)$ such that $abc$ divides $(ab + 1)(bc + 1)(ca + 1)$.
Let $ABC$ be a triangle with $AB = 16$, $AC = 10$, $BC = 18$. Let $D$ be a point on $AB$ such that $4AD = AB$ and let E be the foot of the angle bisector from $B$ onto $AC$. Let $P$ be the intersection of $CD$ and $BE$. Find the area of the quadrilateral $ADPE$.
Denote $f(x) = x^4 + 2x^3 - 2x^2 - 4x+4$. Prove that there are infinitely many primes $p$ that satisfies the following.
For all positive integers $m$, $f(m)$ is not a multiple of $p$.
[b]4.[/b] We see, in Figures 1 and 2, examples of lock screens from a cellphone that only works with a password that is not typed but drawn with straight line segments. Those segments form a polygonal line with vertices in a lattice. When drawing the pattern that corresponds to a password, the finger can't lose contact with the screen. Every polygonal line corresponds to a sequence of digits and this sequence is, in fact, the password. The tracing of the polygonal obeys the following rules:
[i]i.[/i] The tracing starts at some of the detached points which correspond to the digits from $1$ to $9$ (Figure 3).
[i]ii.[/i] Each segment of the pattern must have as one of its extremes (on which we end the tracing of the segment) a point that has not been used yet.
[i]iii.[/i] If a segment connects two points and contains a third one (its middle point), then the corresponding digit to this third point is included in the password. That does not happen if this point/digit has already been used.
[i]iv.[/i] Every password has at least four digits.
Thus, every polygonal line is associated to a sequence of four or more digits, which appear in the password in the same order that they are visited. In Figure 1, for instance, the password is 218369, if the first point visited was $2$. Notice how the segment connecting the points associated with $3$ and $9$ includes the points associated to digit $6$. If the first visited point were the $9$, then the password would be $963812$. If the first visited point were the $6$, then the password would be $693812$. In this case, the $6$ would be skipped, because it can't be repeated. On the other side, the polygonal line of Figure 2 is associated to a unique password.
Determine the smallest $n (n \geq 4)$ such that, given any subset of $n$ digits from $1$ to $9$, it's possible to elaborate a password that involves exactly those digits in some order.
The number $12$ is written on the whiteboard. Each minute, the number on the board is either multiplied or divided by one of the numbers $2$ or $3$ (a division is possible only if the result is an integer) . Prove that the number that will be written on the board in exactly one hour will not be equal to $54$.
What is the value of this expression in decimal form?
\[\dfrac{44}{11}+\dfrac{110}{44}+\dfrac{44}{1100}\]
$\textbf{(A) }6.4\qquad\textbf{(B) }6.504\qquad\textbf{(C) }6.54\qquad\textbf{(D) }6.9\qquad\textbf{(E) }6.94$
$z$ is a complex number that $\left|2z+\frac{1}{z}\right|=1$, then the range value of $\arg(z)$ is________.
A positive integer is [i]totally square[/i] is the sum of its digits (written in base $10$) is a square number. For example, $13$ is totally square because $1 + 3 = 2^2$, but $16$ is not totally square.
Show that there are infinitely many positive integers that are not the sum of two totally square integers.