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

Let $x\neq y$. Two sequences $x,a_1,a_2,a_3,y$ and $b_1,x,b_2,b_3,y,b_4$ are arithmetic sequence. Then $\frac{b_4-b_3}{a_2-a_1}=$________.
Let $s_1, s_2, s_3$ be the respective sums of $n$, $2n$, $3n$ terms of the same arithmetic progression with $a$ as the first term and $d$ as the common difference. Let $R=s_3-s_2-s_1$. Then $R$ is dependent on: $ \textbf{(A)}\ a \text{ } \text{and} \text{ } d\qquad\textbf{(B)}\ d \text{ } \text{and} \text{ } n\qquad\textbf{(C)}\ a \text{ } \text{and} \text{ } n\qquad\textbf{(D)}\ a, d, \text{ } \text{and} \text{ } n\qquad$ $\textbf{(E)}\ \text{neither} \text{ } a \text{ } \text{nor} \text{ } d \text{ } \text{nor} \text{ } n $
Let m be a positive integer. Prove that there exist infinitely many prime numbers p such that m+p^3 is composite.
In a given arithmetic sequence the first term is $2$, the last term is $29$, and the sum of all the terms is $155$. The common difference is: $\text{(A)} \ 3 \qquad \text{(B)} \ 2 \qquad \text{(C)} \ \frac{27}{19} \qquad \text{(D)} \ \frac{13}9 \qquad \text{(E)} \ \frac{23}{38}$
For $2k$ real numbers $a_1, a_2, ..., a_k$, $b_1, b_2, ..., b_k$ define a sequence of numbers $X_n$ by \[ X_n = \sum_{i=1}^k [a_in + b_i] \quad (n=1,2,...). \] If the sequence $X_N$ forms an arithmetic progression, show that $\textstyle\sum_{i=1}^k a_i$ must be an integer. Here $[r]$ denotes the greatest integer less than or equal to $r$.
Let $A$ be any set of $20$ distinct integers chosen from the arithmetic progression $1, 4, 7,\ldots,100$. Prove that there must be two distinct integers in $A$ whose sum is $104$.
An infinite arithmetic progression whose terms are positive integers contains the square of an integer and the cube of an integer. Show that it contains the sixth power of an integer.
Show that there exist strictly increasing infinite arithmetic sequence of integers which has no numbers in common with the Fibonacci sequence.
Find all integers $n\ge 3$ for which the following statement is true: Any arithmetic progression $a_1,\ldots ,a_n$ with $n$ terms for which $a_1+2a_2+\ldots+na_n$ is rational contains at least one rational term.
Consider a $ 7\times 7$ numbers table $ a_{ij} \equal{} (i^2 \plus{} j)(i \plus{} j^2), 1\le i,j\le 7.$ When we add arbitrarily each term of an arithmetical progression consisting of $ 7$ integers to corresponding to term of certain row (or column) in turn, call it an operation. Determine whether such that each row of numbers table is an arithmetical progression, after a finite number of operations.
If $x\neq y$ and the sequences $x,a_1,a_2,y$ and $x,b_1,b_2,b_3,y$ each are in arithmetic progression, then $(a_2-a_1)/(b_2-b_1)$ equals $\textbf{(A) }\frac{2}{3}\qquad\textbf{(B) }\frac{3}{4}\qquad\textbf{(C) }1\qquad\textbf{(D) }\frac{4}{3}\qquad \textbf{(E) }\frac{3}{2}$
Determine all positive integers $n$, $n\ge2$, such that the following statement is true: If $(a_1,a_2,...,a_n)$ is a sequence of positive integers with $a_1+a_2+\cdots+a_n=2n-1$, then there is block of (at least two) consecutive terms in the sequence with their (arithmetic) mean being an integer.
Let $n$ be a positive integer and let $x_1\le x_2\le\cdots\le x_n$ be real numbers. Prove that \[ \left(\sum_{i,j=1}^{n}|x_i-x_j|\right)^2\le\frac{2(n^2-1)}{3}\sum_{i,j=1}^{n}(x_i-x_j)^2. \] Show that the equality holds if and only if $x_1, \ldots, x_n$ is an arithmetic sequence.
Natural numbers have been divided in groups as follow: $(1), (2, 4), (3, 5, 7), (6, 8, 10, 12), (9, 11, 13, 15, 17), \ldots$. Let $S_n$ be the sum of the elements of the $n$th group. Prove that $\frac{S_{2n+1}}{2n+1}-\frac{S_{2n}}{2n}$ is even.
If the discriminant of $ ax^2\plus{}2bx\plus{}c\equal{}0$ is zero, then another true statement about $ a$, $ b$, and $ c$ is that: $ \textbf{(A)}\ \text{they form an arithmetic progression} \\ \textbf{(B)}\ \text{they form a geometric progression} \\ \textbf{(C)}\ \text{they are unequal} \\ \textbf{(D)}\ \text{they are all negative numbers} \\ \textbf{(E)}\ \text{only b is negative and a and c are positive}$
All possible sequences of numbers $-1$ and $+1$ of length $100$ are considered. For each of them, the square of the sum of the terms is calculated. Find the arithmetic average of the resulting values.
Determine all polynomials $f$ with integer coefficients with the property that for any two distinct primes $p$ and $q$, $f(p)$ and $f(q)$ are relatively prime.