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

2012 India Regional Mathematical Olympiad, 2

Let $P(x)=x^n+a_{n-1}x^{n-1}+\cdots+a_0$ be a polynomial of degree $n\geq 3.$ Knowing that $a_{n-1}=-\binom{n}{1}$ and $a_{n-2}=\binom{n}{2},$ and that all the roots of $P$ are real, find the remaining coefficients. Note that $\binom{n}{r}=\frac{n!}{(n-r)!r!}.$

2005 MOP Homework, 4

Let $p$ be an odd prime. Prove that \[\sum^{p-1}_{k=1} k^{2p-1} \equiv \frac{p(p+1)}{2}\pmod{p^2}.\]

1954 AMC 12/AHSME, 10

The sum of the numerical coefficients in the expansion of the binomial $ (a\plus{}b)^8$ is: $ \textbf{(A)}\ 32 \qquad \textbf{(B)}\ 16 \qquad \textbf{(C)}\ 64 \qquad \textbf{(D)}\ 48 \qquad \textbf{(E)}\ 7$

2000 National High School Mathematics League, 8

Define $a_n$: the coefficient of then item $x$ in $(3-\sqrt{x})^n$, where $n$ is a positive integer. Then $\lim_{n\to\infty}\left(\frac{3^2}{a_2}+\frac{3^3}{a_3}+\cdots+\frac{3^n}{a_n}\right)=$________.

2011 USA Team Selection Test, 5

Let $c_n$ be a sequence which is defined recursively as follows: $c_0 = 1$, $c_{2n+1} = c_n$ for $n \geq 0$, and $c_{2n} = c_n + c_{n-2^e}$ for $n > 0$ where $e$ is the maximal nonnegative integer such that $2^e$ divides $n$. Prove that \[\sum_{i=0}^{2^n-1} c_i = \frac{1}{n+2} {2n+2 \choose n+1}.\]

2014 All-Russian Olympiad, 3

In a country, mathematicians chose an $\alpha> 2$ and issued coins in denominations of 1 ruble, as well as $\alpha ^k$ rubles for each positive integer k. $\alpha$ was chosen so that the value of each coins, except the smallest, was irrational. Is it possible that any natural number of rubles can be formed with at most 6 of each denomination of coins?

2014 Brazil Team Selection Test, 2

Prove that in any set of $2000$ distinct real numbers there exist two pairs $a>b$ and $c>d$ with $a \neq c$ or $b \neq d $, such that \[ \left| \frac{a-b}{c-d} - 1 \right|< \frac{1}{100000}. \]

2002 National High School Mathematics League, 8

Consider the expanded form of $\left(x+\frac{1}{2\sqrt[4]{x}}\right)^n$, put all items in number (from high power to low power). If the coefficients of the first three items are arithmetic sequence, then the number of items with an integral power is________.

2014 Bundeswettbewerb Mathematik, 2

For all positive integers $m$ and $k$ with $m\ge k$, define $a_{m,k}=\binom{m}{k-1}-3^{m-k}$. Determine all sequences of real numbers $\{x_1, x_2, x_3, \ldots\}$, such that each positive integer $n$ satisfies the equation \[a_{n,1}x_1+ a_{n,2}x_2+ \cdots + a_{n,n}x_n = 0\]

2014 ELMO Shortlist, 3

Let $t$ and $n$ be fixed integers each at least $2$. Find the largest positive integer $m$ for which there exists a polynomial $P$, of degree $n$ and with rational coefficients, such that the following property holds: exactly one of \[ \frac{P(k)}{t^k} \text{ and } \frac{P(k)}{t^{k+1}} \] is an integer for each $k = 0,1, ..., m$. [i]Proposed by Michael Kural[/i]

2014 ELMO Shortlist, 3

Let $t$ and $n$ be fixed integers each at least $2$. Find the largest positive integer $m$ for which there exists a polynomial $P$, of degree $n$ and with rational coefficients, such that the following property holds: exactly one of \[ \frac{P(k)}{t^k} \text{ and } \frac{P(k)}{t^{k+1}} \] is an integer for each $k = 0,1, ..., m$. [i]Proposed by Michael Kural[/i]

1972 Canada National Olympiad, 7

a) Prove that the values of $x$ for which $x=(x^2+1)/198$ lie between $1/198$ and $197.99494949\cdots$. b) Use the result of problem a) to prove that $\sqrt{2}<1.41\overline{421356}$. c) Is it true that $\sqrt{2}<1.41421356$?

2009 Math Prize For Girls Problems, 10

When the integer $ {\left(\sqrt{3} \plus{} 5\right)}^{103} \minus{} {\left(\sqrt{3} \minus{} 5\right)}^{103}$ is divided by 9, what is the remainder?

2005 MOP Homework, 5

Show that for nonnegative integers $m$ and $n$, $\frac{\dbinom{m}{0}}{n+1}-\frac{\dbinom{m}{1}}{n+2}+...+(-1)^m\frac{\dbinom{m}{m}}{n+m+1}$ $=\frac{\dbinom{n}{0}}{m+1}-\frac{\dbinom{n}{1}}{m+2}+...+(-1)^n\frac{\dbinom{n}{n}}{m+n+1}$.

2020 AIME Problems, 12

Let $n$ be the least positive integer for which $149^n - 2^n$ is divisible by $3^3 \cdot 5^5 \cdot 7^7$. Find the number of positive divisors of $n$.

1990 Dutch Mathematical Olympiad, 3

A polynomial $ f(x)\equal{}ax^4\plus{}bx^3\plus{}cx^2\plus{}dx$ with $ a,b,c,d>0$ is such that $ f(x)$ is an integer for $ x \in \{ \minus{}2,\minus{}1,0,1,2 \}$ and $ f(1)\equal{}1$ and $ f(5)\equal{}70$. $ (a)$ Show that $ a\equal{}\frac{1}{24}, b\equal{}\frac{1}{4},c\equal{}\frac{11}{24},d\equal{}\frac{1}{4}$. $ (b)$ Prove that $ f(x)$ is an integer for all $ x \in \mathbb{Z}$.

1983 AIME Problems, 13

For $\{1, 2, 3, \dots, n\}$ and each of its nonempty subsets a unique [b]alternating sum[/b] is defined as follows: Arrange the numbers in the subset in decreasing order and then, beginning with the largest, alternately add and subtract successive numbers. (For example, the alternating sum for $\{1, 2, 4, 6, 9\}$ is $9 - 6 + 4 - 2 + 1 = 6$ and for $\{5\}$ it is simply 5.) Find the sum of all such alternating sums for $n = 7$.

2014 All-Russian Olympiad, 3

In a country, mathematicians chose an $\alpha> 2$ and issued coins in denominations of 1 ruble, as well as $\alpha ^k$ rubles for each positive integer k. $\alpha$ was chosen so that the value of each coins, except the smallest, was irrational. Is it possible that any natural number of rubles can be formed with at most 6 of each denomination of coins?

2011 AMC 8, 22

What is the tens digit of $7^{2011}$? $ \textbf{(A)}0\qquad\textbf{(B)}1\qquad\textbf{(C)}3\qquad\textbf{(D)}4\qquad\textbf{(E)}7 $

1985 IMO Longlists, 54

Set $S_n = \sum_{p=1}^n (p^5+p^7)$. Determine the greatest common divisor of $S_n$ and $S_{3n}.$

1993 All-Russian Olympiad, 4

If $ \{a_k\}$ is a sequence of real numbers, call the sequence $ \{a'_k\}$ defined by $ a_k' \equal{} \frac {a_k \plus{} a_{k \plus{} 1}}2$ the [i]average sequence[/i] of $ \{a_k\}$. Consider the sequences $ \{a_k\}$; $ \{a_k'\}$ - [i]average sequence[/i] of $ \{a_k\}$; $ \{a_k''\}$ - average sequence of $ \{a_k'\}$ and so on. If all these sequences consist only of integers, then $ \{a_k\}$ is called [i]Good[/i]. Prove that if $ \{x_k\}$ is a [i]good[/i] sequence, then $ \{x_k^2\}$ is also [i]good[/i].

2002 USAMTS Problems, 4

Let $f(n)$ be the number of ones that occur in the decimal representations of all the numbers from 1 to $n$. For example, this gives $f(8)=1$, $f(9)=1$, $f(10)=2$, $f(11)=4$, and $f(12)=5$. Determine the value of $f(10^{100})$.

2014 India IMO Training Camp, 1

Prove that in any set of $2000$ distinct real numbers there exist two pairs $a>b$ and $c>d$ with $a \neq c$ or $b \neq d $, such that \[ \left| \frac{a-b}{c-d} - 1 \right|< \frac{1}{100000}. \]

2015 Switzerland Team Selection Test, 2

Let $a$, $b$, $c$ be real numbers greater than or equal to $1$. Prove that \[ \min \left(\frac{10a^2-5a+1}{b^2-5b+10},\frac{10b^2-5b+1}{c^2-5c+10},\frac{10c^2-5c+1}{a^2-5a+10}\right )\leq abc. \]

2014 Harvard-MIT Mathematics Tournament, 28

Let $f(n)$ and $g(n)$ be polynomials of degree $2014$ such that $f(n)+(-1)^ng(n)=2^n$ for $n=1,2,\ldots,4030$. Find the coefficient of $x^{2014}$ in $g(x)$.