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: 492

Lines in the xy-plane are drawn through the point $(3,4)$ and the trisection points of the line segment joining the points $(-4,5)$ and $(5,-1).$ One of these lines has the equation $\textbf{(A) }3x-2y-1=0\qquad\textbf{(B) }4x-5y+8=0\qquad\textbf{(C) }5x+2y-23=0\qquad$ $\textbf{(D) }x+7y-31=0\qquad \textbf{(E) }x-4y+13=0$
Prove that there do not exist eleven primes, all less than $20000$, which form an arithmetic progression.
An increasing arithmetic sequence with infinitely many terms is determined as follows. A single die is thrown and the number that appears is taken as the first term. The die is thrown again and the second number that appears is taken as the common difference between each pair of consecutive terms. Determine with proof how many of the 36 possible sequences formed in this way contain at least one perfect square.
Consider the set $E$ of all natural numbers $n$ such that whenn divided by $11, 12, 13$, respectively, the remainders, int that order, are distinct prime numbers in an arithmetic progression. If $N$ is the largest number in $E$, find the sum of digits of $N$.
Let be an infinite sequence $ \left( c_n \right)_{n\ge 1} $ of positive real numbers, with $ c_1=1, $ and satisfying $$ c_{n+1}-\frac{1}{c_{n+1}} =c_n+\frac{1}{c_n} , $$ for all natural numbers $ n. $ Prove that: [b]a)[/b] there exists a natural number $ k $ such that the sequence $ \left( c_n^k+\frac{1}{c_n^k} \right)_{n\ge 1} $ is an arithmetic one. [b]b)[/b] there exist two sequences $ \left( u_n \right)_{n\ge 1} ,\left( v_n \right)_{n\ge 1} $ of nonegative integers such that $ c_n=\sqrt{u_n} +\sqrt{v_n} , $ for any natural number $ n. $
For any positive integers $x,y,z$ and $w,$ prove that $x^2,y^2,z^2$ and $w^2$ cannot be four consecutive terms of arithmetic sequence.
Paul starts at $1$ and counts by threes: $1, 4, 7, 10, ... $. At the same time and at the same speed, Penny counts backwards from $2017$ by fi ves: $2017, 2012, 2007, 2002,...$ . Find the one number that both Paul and Penny count at the same time.
Does there exist an arithmetic progression with $2017$ terms such that each term is not a perfect power, but the product of all $2017$ terms is?
Alexis notices Joshua working with Dr. Lisi and decides to join in on the fun. Dr. Lisi challenges her to compute the sum of all $2008$ terms in the sequence. Alexis thinks about the problem and remembers a story one of her teahcers at school taught her about how a young Karl Gauss quickly computed the sum \[1+2+3+\cdots+98+99+100\] in elementary school. Using Gauss's method, Alexis correctly finds the sum of the $2008$ terms in Dr. Lisi's sequence. What is this sum?
Let $n\ge 2$ be a positive integer. Find whether there exist $n$ pairwise nonintersecting nonempty subsets of $\{1, 2, 3, \ldots \}$ such that each positive integer can be expressed in a unique way as a sum of at most $n$ integers, all from different subsets.
Prove that the sequence $5, 12, 19, 26, 33,\cdots $ contains no term of the form $2^n -1.$
Suppose that $ s_1,s_2,s_3, \ldots$ is a strictly increasing sequence of positive integers such that the sub-sequences \[s_{s_1},\, s_{s_2},\, s_{s_3},\, \ldots\qquad\text{and}\qquad s_{s_1+1},\, s_{s_2+1},\, s_{s_3+1},\, \ldots\] are both arithmetic progressions. Prove that the sequence $ s_1, s_2, s_3, \ldots$ is itself an arithmetic progression. [i]Proposed by Gabriel Carroll, USA[/i]
Consider a nonconstant arithmetic progression $a_1, a_2,\cdots, a_n,\cdots$. Suppose there exist relatively prime positive integers $p>1$ and $q>1$ such that $a_1^2, a_{p+1}^2$ and $a_{q+1}^2$ are also the terms of the same arithmetic progression. Prove that the terms of the arithmetic progression are all integers.
Prove that there exists a four-coloring of the set $M = \{1, 2, \cdots, 1987\}$ such that any arithmetic progression with $10$ terms in the set $M$ is not monochromatic. [b][i]Alternative formulation[/i][/b] Let $M = \{1, 2, \cdots, 1987\}$. Prove that there is a function $f : M \to \{1, 2, 3, 4\}$ that is not constant on every set of $10$ terms from $M$ that form an arithmetic progression. [i]Proposed by Romania[/i]
The function $f(x) = x^2+ax+b$ has two distinct zeros. If $f(x^2+2x-1)=0$ has four distinct zeros $x_1<x_2<x_3<x_4$ that form an arithmetic sequence, compute the range of $a-b$. [i](Source: China National High School Mathematics League 2021, Zhejiang Province, Problem 11)[/i]
Let $a_0, a_1, a_2, a_3, a_4$ be five positive numbers in the arithmetic progression with a difference $d$. Prove that $a^3_2 \leq \frac{1}{10}(a^3_0 + 4a^3_1 + 4a^3_3 + a^3_4).$
Let $A_{11}$ denote the answer to problem $11$. Determine the smallest prime $p$ such that the arithmetic sequence $p,p+A_{11},p+2A_{11},\cdots$ begins with the largest number of primes. There is just one triple of possible $(A_{10},A_{11},A_{12})$ of answers to these three problems. Your team will receive credit only for answers matching these. (So, for example, submitting a wrong answer for problem $11$ will not alter the correctness of your answer to problem $12$.)
An arithmetic sequence of five terms is considered $good$ if it contains 19 and 20. For example, $18.5,19.0,19.5,20.0,20.5$ is a $good$ sequence. For every $good$ sequence, the sum of its terms is totalled. What is the total sum of all $good$ sequences?
For all positive integers $n$, the function $\gamma: \mathbb{Z}^+ \to \mathbb{Z}_{\geq 0}$ is defined as, $\gamma(1) = 0$ and for all $n > 1$, if the prime factorization of $n$ is $n = p_1^{\alpha_1} p_2^{\alpha_2} \dots p_k^{\alpha_k},$ then $\gamma(n) = \alpha_1 + \alpha_2 + \dots + \alpha_k$. We have an arithmetic sequence $X = \{x_i\}_{i=1}^{\infty}$. If for a positive integer $a > 1$, the sequence $\{ \gamma(a^{x_i} -1) \}$ is also an arithmetic sequence, show that the sequence $X$ has to be constant.
The real positive numbers $a_1, a_2,a_3$ are three consecutive terms of an arithmetic progression, and similarly, $b_1, b_2, b_3$ are distinct real positive numbers and consecutive terms of an arithmetic progression. Is it possible to use three segments of lengths $a_1, a_2, a_3$ as bases, and other three segments of lengths $b_1, b_2, b_3$ as altitudes, to construct three rectangles of equal area ?
Denote $ S_n $ as being the sum of the squares of the first $ n\in\mathbb{N} $ terms of a given arithmetic sequence of natural numbers. [b]a)[/b] If $ p\ge 5 $ is a prime, then $ p\big| S_p. $ [b]b)[/b] $ S_5 $ is not a perfect square.
Does there exist an increasing arithmetic progression of (a) $11$ (b) $10000$ (c) infinitely many positive integers such that the sums of their digits in base $10$ also form an increasing arithmetic progression? (A Shapovalov)
For each integer $n>1$, let $p(n)$ denote the largest prime factor of $n$. Determine all triples $(x, y, z)$ of distinct positive integers satisfying [list] [*] $x, y, z$ are in arithmetic progression, [*] $p(xyz) \le 3$. [/list]
Let $p$ be a prime and $k$ be a positive integer. Set $S$ contains all positive integers $a$ satisfying $1\le a \le p-1$, and there exists positive integer $x$ such that $x^k\equiv a \pmod p$. Suppose that $3\le |S| \le p-2$. Prove that the elements of $S$, when arranged in increasing order, does not form an arithmetic progression.
Four circles in a plane have a common center. Their radii form a strictly increasing arithmetic progression. Prove that there is no square with each vertex lying on a different circle.