Found problems: 580
2014 IMAC Arhimede, 4
Let $n$ be a natural number and let $P (t) = 1 + t + t^2 + ... + t^{2n}$.
If $x \in R$ such that $P (x)$ and $P (x^2)$ are rational numbers, prove that $x$ is rational number.
2009 QEDMO 6th, 4
Let $a$ and $b$ be two real numbers and let $n$ be a nonnegative integer. Then prove that
$$\sum_{k=0}^{n} {n \choose k} (a + k)^k (b - k)^{n-k} = \sum_{k=0}^{n} \frac{n!}{t!} (a + b)^t $$
2017 Argentina National Olympiad, 2
In a row there are $51$ written positive integers. Their sum is $100$ . An integer is [i]representable [/i] if it can be expressed as the sum of several consecutive numbers in a row of $51$ integers. Show that for every $k$ , with $1\le k \le 100$ , one of the numbers $k$ and $100-k$ is representable.
2000 BAMO, 1
Prove that any integer greater than or equal to $7$ can be written as a sum of two relatively prime integers, both greater than 1. (Two integers are relatively prime if they share no common positive divisor other than $1$. For example, $22$ and 15 are relatively prime, and thus $37 = 22+15$ represents the number 37 in the desired way.)
1999 Tournament Of Towns, 3
Several positive integers $a_0 , a_1 , a_2 , ... , a_n$ are written on a board. On a second board, we write the amount $b_0$ of numbers written on the first board, the amount $b_1$ of numbers on the first board exceeding $1$, the amount $b_2$ of numbers greater than $2$, and so on as long as the $b$s are still positive. Then we stop, so that we do not write any zeros. On a third board we write the numbers $c_0 , c_1 , c_2 , ...$. using the same rules as before, but applied to the numbers $b_0 , b_1 , b_2 , ...$ of the second board. Prove that the same numbers are written on the first and the third boards.
(H. Lebesgue - A Kanel)
2002 Singapore MO Open, 2
Let $a_1,a_2,...,a_n$ and $b_1,b_2,...,b_n$ be real numbers between $1001$ and $2002$ inclusive. Suppose $ \sum_{i=1}^n a_i^2= \sum_{i=1}^n b_i^2$. Prove that $$\sum_{i=1}^n\frac{a_i^3}{b_i} \le \frac{17}{10} \sum_{i=1}^n a_i^2$$
Determine when equality holds.
2001 Switzerland Team Selection Test, 10
Prove that every $1000$-element subset $M$ of the set $\{0,1,...,2001\}$ contains either a power of two or two distinct numbers whose sum is a power of two.
2011 Indonesia TST, 1
For all positive integer $n$, define $f_n(x)$ such that $f_n(x) = \sum_{k=1}^n{|x - k|}$.
Determine all solution from the inequality $f_n(x) < 41$ for all positive $2$-digit integers $n$ (in decimal notation).
2014 Junior Balkan Team Selection Tests - Romania, 3
Let $n \ge 5$ be an integer. Prove that $n$ is prime if and only if for any representation of $n$ as a sum of four positive integers $n = a + b + c + d$, it is true that $ab \ne cd$.
2013 India PRMO, 2
Let $S_n=\sum_{k=0}^{n}\frac{1}{\sqrt{k+1}+\sqrt{k}}$. What is the value of $\sum_{n=1}^{99}\frac{1}{S_n+S_{n-1}}$ ?
2013 May Olympiad, 1
Find the number of ways to write the number $2013$ as the sum of two integers greater than or equal to zero so that when adding there is no carry over.
Clarification: In the sum $2008+5=2013$ there is carry over from the units to the tens
2004 Estonia Team Selection Test, 4
Denote $f(m) =\sum_{k=1}^m (-1)^k cos \frac{k\pi}{2 m + 1}$
For which positive integers $m$ is $f(m)$ rational?
1954 Moscow Mathematical Olympiad, 276
a) Let $1, 2, 3, 5, 6, 7, 10, .., N$ be all the divisors of $N = 2\cdot 3 \cdot 5 \cdot 7 \cdot 11 \cdot 13 \cdot 17 \cdot 19 \cdot 23 \cdot 29 \cdot 31$ (the product of primes $2$ to $31$) written in increasing order. Below this series of divisors, write the following series of $1$’s or $-1$’s: write $1$ below any number that factors into an even number of prime factors and below a $1$, write $-1$ below the remaining numbers. Prove that the sum of the series of $1$’s and $-1$’s is equal to $0$.
b) Let $1, 2, 3, 5, 6, 7, 10, .., N$ be all the divisors of $N = 2\cdot 3 \cdot 5 \cdot 7 \cdot 11 \cdot 13 \cdot 17 \cdot 19 \cdot 23 \cdot 29 \cdot 31 \cdot 37$ (the product of primes $2$ to $37$) written in increasing order. Below this series of divisors, write the following series of $1$’s or $-1$’s: write $1$ below any number that factors into an even number of prime factors and below a $1$, write $-1$ below the remaining numbers. Prove that the sum of the series of $1$’s and $-1$’s is equal to $0$.
2008 Indonesia TST, 2
Let $\{a_n\}_{n \in N}$ be a sequence of real numbers with $a_1 = 2$ and $a_n =\frac{n^2 + 1}{\sqrt{n^3 - 2n^2 + n}}$ for all positive integers $n \ge 2$.
Let $s_n = a_1 + a_2 + ...+ a_n$ for all positive integers $n$. Prove that $$\frac{1}{s_1s_2}+\frac{1}{s_2s_3}+ ...+\frac{1}{s_ns_{n+1}}<\frac15$$
for all positive integers $n$.
1956 Moscow Mathematical Olympiad, 336
$64$ non-negative numbers whose sum equals $1956$ are arranged in a square table, eight numbers in each row and each column. The sum of the numbers on the two longest diagonals is equal to $112$. The numbers situated symmetrically with respect to any of the longest diagonals are equal.
(a) Prove that the sum of numbers in any column is less than $1035$.
(b) Prove that the sum of numbers in any row is less than $518$.
2006 BAMO, 2
Since $24 = 3+5+7+9$, the number $24$ can be written as the sum of at least two consecutive odd positive integers.
(a) Can $2005$ be written as the sum of at least two consecutive odd positive integers? If yes, give an example of how it can be done. If no, provide a proof why not.
(b) Can $2006$ be written as the sum of at least two consecutive odd positive integers? If yes, give an example of how it can be done. If no, provide a proof why not.
2009 Puerto Rico Team Selection Test, 2
In each box of a $ 1 \times 2009$ grid, we place either a $ 0$ or a $ 1$, such that the sum of any $ 90$ consecutive boxes is $ 65$. Determine all possible values of the sum of the $ 2009$ boxes in the grid.
2015 Argentina National Olympiad, 1
Express the sum of $99$ terms$$\frac{1\cdot 4}{2\cdot 5}+\frac{2\cdot 7}{5\cdot 8}+\ldots +\frac{k(3k+1 )}{(3k-1)(3k+2)}+\ldots +\frac{99\cdot 298}{296\cdot 299}$$ as an irreducible fraction.
2006 MOP Homework, 5
Let $n$ be a nonnegative integer, and let $p$ be a prime number that is congruent to $7$ modulo $8$. Prove that
$$\sum_{k=1}^{p} \left\{ \frac{k^{2n}}{p} - \frac{1}{2} \right\} = \frac{p-1}{2}$$
2019 Argentina National Olympiad, 2
Let $n\geq1$ be an integer. We have two sequences, each of $n$ positive real numbers $a_1,a_2,\ldots ,a_n$ and $b_1,b_2,\ldots ,b_n$ such that $a_1+a_2+\ldots +a_n=1$ and $ b_1+b_2+\ldots +b_n=1$. Find the smallest possible value that the sum can take $$\frac{a_1^2}{a_1+b_1}+\frac{a_2^2}{a_2+b_2}+\ldots +\frac{a_n^2}{a_n +b_n}.$$
2015 Kyiv Math Festival, P3
Is it true that every positive integer greater than $50$ is a sum of $4$ positive integers such that each two of them have a common divisor greater than $1$?
2015 Czech-Polish-Slovak Junior Match, 2
Decide if the vertices of a regular $30$-gon can be numbered by numbers $1, 2,.., 30$ in such a way that the sum of the numbers of every two neighboring to be a square of a certain natural number.
2021 Saudi Arabia Training Tests, 39
Determine if there exists pairwise distinct positive integers $a_1$, $a_2$,$ ...$, $a_{101}$, $b_1$, $b_2$,$ ...$, $b_{101}$ satisfying the following property: for each non-empty subset $S$ of $\{1, 2, ..., 101\}$ the sum $\sum_{i \in S} a_i$ divides $100! + \sum_{i \in S} b_i$.
2016 JBMO Shortlist, 1
Let $S_n$ be the sum of reciprocal values of non-zero digits of all positive integers up to (and including) $n$. For instance, $S_{13} = \frac{1}{1}+ \frac{1}{2}+ \frac{1}{3}+ \frac{1}{4}+ \frac{1}{5}+ \frac{1}{6}+ \frac{1}{7}+ \frac{1}{8}+ \frac{1}{9}+ \frac{1}{1}+ \frac{1}{1}+ \frac{1}{1}+ \frac{1}{1}+ \frac{1}{2}+ \frac{1}{1}+ \frac{1}{3}$ .
Find the least positive integer $k$ making the number $k!\cdot S_{2016}$ an integer.
2000 Bundeswettbewerb Mathematik, 2
A $5$-tuple $(1,1,1,1,2)$ has the property that the sum of any three of them is divisible by the sum of the remaining two. Is there a $5$-tuple with this property whose all terms are distinct?