Found problems: 492
An $n$ by $n$ grid, where every square contains a number, is called an $n$-code if the numbers in every row and column form an arithmetic progression. If it is sufficient to know the numbers in certain squares of an $n$-code to obtain the numbers in the entire grid, call these squares a key.
[b]a.) [/b]Find the smallest $s \in \mathbb{N}$ such that any $s$ squares in an $n-$code $(n \geq 4)$ form a key.
[b]b.)[/b] Find the smallest $t \in \mathbb{N}$ such that any $t$ squares along the diagonals of an $n$-code $(n \geq 4)$ form a key.
Let $n\geq 3$ an integer. Determine whether there exist permutations $(a_1,a_2, \ldots, a_n)$ of the numbers $(1,2,\ldots, n)$ and $(b_1, b_2, \ldots, b_n)$ of the numbers $(n+1,n+2,\ldots, 2n)$ so that $(a_1b_1, a_2b_2, \ldots a_nb_n)$ is a strictly increasing arithmetic progression.
Prove that if the lengths of the sides of a triangle form an arithmetic progression, then the radius of the inscribed circle is one third of one of the heights of the triangle.
Find three rational numbers $\frac{a}{d}, \frac{b}{d}, \frac{c}{d}$ in their lowest terms such that they form an arithmetic progression and $\frac{b}{a} =\frac{a + 1}{d + 1}, \frac{c}{b} = \frac{b + 1}{d + 1}$.
An infinite sequence of positive real numbers $a_1,a_2,a_3,\dots$ is called [i]territorial[/i] if for all positive integers $i,j$ with $i<j$, we have $|a_i-a_j|\ge\tfrac1j$. Can we find a territorial sequence $a_1,a_2,a_3,\dots$ for which there exists a real number $c$ with $a_i<c$ for all $i$?
The internal angles of quadrilateral $ABCD$ form an arithmetic progression. Triangles $ABD$ and $DCB$ are similar with $\angle DBA=\angle DCB$ and $\angle ADB=\angle CBD$. Moreover, the angles in each of these two triangles also form an arithmetic progression. In degrees, what is the largest possible sum of the two largest angles of $ABCD$?
${\textbf{(A)}\ 210\qquad\textbf{(B)}\ 220\qquad\textbf{(C)}\ 230\qquad\textbf{(D}}\ 240\qquad\textbf{(E)}\ 250$
Suppose that every positve integer has been given one of the colors red, blue,arbitrarily. Prove that there exists an infinite sequence of positive integers $ a_{1} < a_{2} < a_{3} < \cdots < a_{n} < \cdots,$ such that inifinite sequence of positive integers $ a_{1},\frac {a_{1} \plus{} a_{2}}{2},a_{2},\frac {a_{2} \plus{} a_{3}}{2},a_{3},\frac {a_{3} \plus{} a_{4}}{2},\cdots$ has the same color.
Let $\langle a_n\rangle $ and $ \langle b_n\rangle$ be two arithmetic sequences of numbers, and let $m$ be an integer greater than $2.$ Define $P_k(x)=x^2+a_kx+b_k,\ k=1,2,\cdots, m.$ Prove that if the quadratic expressions $P_1(x), P_m(x)$ do not have any real roots, then all the remaining polynomials also don't have real roots.
Define $(a_n)$ a sequence, where $a_1= 12, a_2= 24$ and for $n\geq 3$, we have: $$a_n= a_{n-2}+14$$
a) Is $2023$ in the sequence?
b) Show that there are no perfect squares in the sequence.
Let $n$ be a natural number, $n \ge 5$, and $a_1, a_2, . . . , a_n$ real numbers such that all possible sums $a_i + a_j$, where $1 \le i < j \le n$, form $\frac{n(n-1)}{2}$ consecutive members of an arithmetic progression when taken in some order. Prove that $a_1 = a_2 = . . . = a_n$.
Two infinite arithmetic sequences with positive integers are given:$$a_1<a_2<a_3<\cdots ; b_1<b_2<b_3<\cdots$$
It is known that there are infinitely many pairs of positive integers $(i,j)$ for which $i\leq j\leq i+2021$ and $a_i$ divides $b_j$. Prove that for every positive integer $i$ there exists a positive integer $j$ such that $a_i$ divides $b_j$.
$a_n$ sequence is a arithmetic sequence with all terms be positive integers. (for $a_n$ non-constant sequence) Let $p_n$ is greatest prime divisor of $a_n$. Prove that
$$(\frac{a_n}{p_n})$$
sequence is infinity.
[hide]Note:
If we find a $M>0$ constant such that $x_n \leq M$ for all $n \in {\mathbb N}$'s, $(x_n)$ sequence is non-infinite, but we can't find $M$, $(x_n)$ sequence is infinity [/hide]
Prove that for any integer $n$, $n\geq 3$, there exist $n$ positive integers $a_1,a_2,\ldots,a_n$ in arithmetic progression, and $n$ positive integers in geometric progression $b_1,b_2,\ldots,b_n$ such that
\[ b_1 < a_1 < b_2 < a_2 <\cdots < b_n < a_n . \]
Give an example of two such progressions having at least five terms.
[i]Mihai Baluna[/i]
How many sets of two or more consecutive positive integers have a sum of 15?
$ \textbf{(A) } 1\qquad \textbf{(B) } 2\qquad \textbf{(C) } 3\qquad \textbf{(D) } 4\qquad \textbf{(E) } 5$
Given: (i) $a$, $b > 0$; (ii) $a$, $A_1$, $A_2$, $b$ is an arithmetic progression; (iii) $a$, $G_1$, $G_2$, $b$ is a geometric progression. Show that
\[A_1 A_2 \ge G_1 G_2.\]
2 players A and B play the following game with A going first: On each player's turn, he puts a number from 1 to 99 among 99 equally spaced points on a circle (numbers cannot be repeated), and the player who completes 3 consecutive numbers that forms an arithmetic sequence around the circle wins the game. Who has the winning strategy? Explain your reasoning.
$(a_n)$ is an arithmetic sequence, $(b_n)$ is a geometric sequence. If $b_1=a_1^2,b_2=a_2^2,b_3=a_3^2(a_1<a_2)$, and $\lim_{n\to\infty}(b_1+b_2+\cdots+b_n)=\sqrt2+1$, find $a_n$.
Fill in each blank unshaded cell with a positive integer less than 100, such that every consecutive group of unshaded cells within a row or column is an arithmetic sequence. You do not need to prove that your answer is the only one possible; you merely need to find an answer that satisfies the constraints above. (Note: In any other USAMTS problem, you need to provide a full proof. Only in this problem is an answer without justification acceptable.)
[asy]
size(9cm);
for (int x=0; x<=11; ++x)
draw((x, 0) -- (x, 5), linewidth(.5pt));
for (int y=0; y<=5; ++y)
draw((0, y) -- (11, y), linewidth(.5pt));
filldraw((0,4)--(0,3)--(2,3)--(2,4)--cycle, gray, gray);
filldraw((1,1)--(1,2)--(3,2)--(3,1)--cycle, gray, gray);
filldraw((4,1)--(4,4)--(5,4)--(5,1)--cycle, gray, gray);
filldraw((7,0)--(7,3)--(6,3)--(6,0)--cycle, gray, gray);
filldraw((7,4)--(7,5)--(6,5)--(6,4)--cycle, gray, gray);
filldraw((8,1)--(8,2)--(10,2)--(10,1)--cycle, gray, gray);
filldraw((9,4)--(9,3)--(11,3)--(11,4)--cycle, gray, gray);
draw((0,0)--(11,0)--(11,5)--(0,5)--cycle);
void foo(int x, int y, string n)
{
label(n, (x+0.5, y+0.5));
}
foo(1, 2, "10");
foo(4, 0, "31");
foo(5, 0, "26");
foo(10, 0, "59");
foo(0, 4, "3");
foo(7, 4, "59");
[/asy]
The function $f:\mathbb{N}\rightarrow \mathbb{N}$ is [b]peruvian[/b] if it satifies the following two properties:
$\triangleright f$ is strictly increasing.
$\triangleright$ The numbers $a_1,a_2,a_3,\dots$ where $a_1=f(1)$ and $a_{n+1}=f(a_n)$ for every $n\geq 1$, are in arithmetic progression.
Determine all peruvian functions $f:\mathbb{N}\rightarrow \mathbb{N}$ such that $f(1)=3$.
For each integer $ n > 1,$ let $ F(n)$ be the number of solutions of the equation $ \sin x \equal{} \sin nx$ on the interval $ [0,\pi].$ What is $ \sum_{n \equal{} 2}^{2007}F(n)?$
$ \textbf{(A)}\ 2,014,524 \qquad \textbf{(B)}\ 2,015,028 \qquad \textbf{(C)}\ 2,015,033 \qquad \textbf{(D)}\ 2,016,532 \qquad \textbf{(E)}\ 2,017,033$
Suppose an infinite non-constant arithmetic progression of integers contains $1$ in it. Prove that there are an infinite number of perfect cubes in this progression. (A [i]perfect cube[/i] is an integer of the form $k^3$, where $k$ is an integer. For example, $-8$, $0$ and $1$ are perfect cubes.)
Alice and Bob play a game on the infinite side of a checkered strip, in which the cells are numbered with consecutive integers from left to right (..., $-2$, $-1$, $0$, $1$, $2$, ...). Alice in her turn puts one cross in any free cell, and Bob in his turn puts zeros in any 2020 free cells. Alice will win if he manages to get such 4 cells marked with crosses, the corresponding cell numbers will form an arithmetic progression. Bob's goal in this game is to prevent Alice from winning. They take turns and Alice moves first. Will Alice be able to win no matter how Bob plays?
Show that any representation of 1 as the sum of distinct reciprocals of numbers drawn from the arithmetic progression $\{2,5,8,11,...\}$ such as given in the following example must have at least eight terms: \[1=\frac{1}{2}+\frac{1}{5}+\frac{1}{8}+\frac{1}{11}+\frac{1}{20}+\frac{1}{41}+\frac{1}{110}+\frac{1}{1640}\]
Given is the function $ f\equal{} \lfloor x^2 \rfloor \plus{} \{ x \}$ for all positive reals $ x$. ( $ \lfloor x \rfloor$ denotes the largest integer less than or equal $ x$ and $ \{ x \} \equal{} x \minus{} \lfloor x \rfloor$.)
Show that there exists an arithmetic sequence of different positive rational numbers, which all have the denominator $ 3$, if they are a reduced fraction, and don’t lie in the range of the function $ f$.
Let $n\ge3$ be a natural number. For a set $S$ of $n$ real numbers, $A(S)$ denotes the set of all strictly increasing arithmetic sequences of three terms in $S$. At most, how many elements can the set $A(S)$ have?