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

2018 Bundeswettbewerb Mathematik, 2

Consider all functions $f:\mathbb{R} \to \mathbb{R}$ satisfying $f(1-f(x))=x$ for all $x \in \mathbb{R}$. a) By giving a concrete example, show that such a function exists. b) For each such function define the sum \[S_f=f(-2017)+f(-2016)+\dots+f(-1)+f(0)+f(1)+\dots+f(2017)+f(2018).\] Determine all possible values of $S_f$.

2016 Costa Rica - Final Round, F2

Tags: algebra , Sum , radical
Sea $f: R^+ \to R$ defined as $$f (x) = \frac{1}{\sqrt[3]{x^2 + 6x + 9} + \sqrt[3]{x^2 + 4x + 3} + \sqrt[3]{x^2 + 2x + 1}}$$ Calculate $$f (1) + f (2) + f (3) + ... + f (2016).$$

2007 Bosnia and Herzegovina Junior BMO TST, 1

Write the number $1000$ as the sum of at least two consecutive positive integers. How many (different) ways are there to write it?

2018 CHMMC (Fall), 3

Tags: algebra , Sum , CHMMC
Compute $$\sum^{\infty}_{n=1} \left( \frac{1}{n^2 + 3n} - \frac{1}{n^2 + 3n + 2}\right)$$

1993 Abels Math Contest (Norwegian MO), 4

Each of the $8$ vertices of a given cube is given a value $1$ or $-1$. Each of the $6$ faces is given the value of product of its four vertices. Let $A$ be the sum of all the $14$ values. Which are the possible values of $A$?

1985 All Soviet Union Mathematical Olympiad, 396

Is there any numbber $n$, such that the sum of its digits in the decimal notation is $1000$, and the sum of its square digits in the decimal notation is $1000000$?

2011 BAMO, 2

Five circles in a row are each labeled with a positive integer. As shown in the diagram, each circle is connected to its adjacent neighbor(s). The integers must be chosen such that the sum of the digits of the neighbor(s) of a given circle is equal to the number labeling that point. In the example, the second number $23 = (1+8)+(5+9)$, but the other four numbers do not have the needed value. [img]https://services.artofproblemsolving.com/download.php?id=YXR0YWNobWVudHMvMi9lL2M2MzVkMmMyYTRlZjliNWEzYWNkOTM2OGVmY2NkOGZmOWVkN2VmLnBuZw==&rn=MjAxMSBCQU1PIDIucG5n[/img] What is the smallest possible sum of the five numbers? How many possible arrangements of the five numbers have this sum? Justify your answers.

1957 Moscow Mathematical Olympiad, 363

Eight consecutive numbers are chosen from the Fibonacci sequence $1, 2, 3, 5, 8, 13, 21,...$. Prove that the sequence does not contain the sum of chosen numbers.

2009 Singapore Junior Math Olympiad, 5

Let $a, b$ be positive real numbers satisfying $a + b = 1$. Show that if $x_1,x_2,...,x_5$ are positive real numbers such that $x_1x_2...x_5 = 1$, then $(ax_1+b)(ax_2+b)...(ax_5+b)>1$

2020 LIMIT Category 2, 14

Tags: Sum , number theory , limit
Let $f: N \to N$ satisfy $n=\sum_{d|n} f(d), \forall n \in N$. Then sum of all possible values of $f(100)$ is?

2004 Thailand Mathematical Olympiad, 5

Tags: algebra , Sum , equation , radical
Let $n$ be a given positive integer. Find the solution set of the equation $\sum_{k=1}^{2n} \sqrt{x^2 -2kx + k^2} =| 2nx - n - 2n^2|$

1997 Singapore Team Selection Test, 2

For any positive integer n, evaluate $$\sum_{i=0}^{\lfloor \frac{n+1}{2} \rfloor} {n-i+1 \choose i}$$ , where $\lfloor n \rfloor$ is the greatest integer less than or equal to $n$ .

1981 Tournament Of Towns, (013) 3

Prove that every real positive number may be represented as a sum of nine numbers whose decimal representation consists of the digits $0$ and $7$. (E Turkevich)

2013 Danube Mathematical Competition, 2

Consider $64$ distinct natural numbers, at most equal to $2012$. Show that it is possible to choose four of them, denoted as $a,b,c,d$ such that $ a+b-c-d$ to be a multiple of $2013$

2002 Swedish Mathematical Competition, 1

$268$ numbers are written around a circle. The $17$th number is $3$, the $83$rd is $4$ and the $144$th is $9$. The sum of every $20$ consecutive numbers is $72$. Find the $210$th number.

2011 IMAR Test, 4

Given an integer number $n \ge 3$, show that the number of lists of jointly coprime positive integer numbers that sum to $n$ is divisible by $3$. (For instance, if $n = 4$, there are six such lists: $(3, 1), (1, 3), (2, 1, 1), (1, 2, 1), (1, 1, 2)$ and $(1, 1, 1, 1)$.)

2015 NIMO Summer Contest, 2

Tags: Sum , NIMO , summer contest
On a 30 question test, Question 1 is worth one point, Question 2 is worth two points, and so on up to Question 30. David takes the test and afterward finds out he answered nine of the questions incorrectly. However, he was not told which nine were incorrect. What is the highest possible score he could have attained? [i] Proposed by David Altizio [/i]

2012 IFYM, Sozopol, 6

Calculate the sum $1+\frac{\binom{2}{1}}{8}+\frac{\binom{4}{2}}{8^2}+\frac{\binom{6}{3}}{8^3}+...+\frac{\binom{2n}{n}}{8^n}+...$

2016 Argentina National Olympiad, 2

Tags: Sum , algebra , Compare
For an integer $m\ge 3$, let $S(m)=1+\frac{1}{3}+…+\frac{1}{m}$ (the fraction $\frac12$ does not participate in addition and does participate in fractions $\frac{1}{k}$ for integers from $3$ until $m$). Let $n\ge 3$ and $ k\ge 3$ . Compare the numbers $S(nk)$ and $S(n)+S(k)$ .

1986 All Soviet Union Mathematical Olympiad, 419

Two equal squares, one with red sides, another with blue ones, give an octagon in intersection. Prove that the sum of red octagon sides lengths is equal to the sum of blue octagon sides lengths.

2009 Danube Mathematical Competition, 5

Let $\sigma, \tau$ be two permutations of the quantity $\{1, 2,. . . , n\}$. Prove that there is a function $f: \{1, 2,. . . , n\} \to \{-1, 1\}$ such that for any $1 \le i \le j \le n$, we have $\left|\sum_{k=i}^{j} f(\sigma (k)) \right| \le 2$ and $\left|\sum_{k=i}^{j} f(\tau (k))\right| \le 2$

2008 Dutch IMO TST, 3

Let $m, n$ be positive integers. Consider a sequence of positive integers $a_1, a_2, ... , a_n$ that satisfies $m = a_1 \ge a_2\ge ... \ge a_n \ge 1$. Then define, for $1\le  i\le  m$, $b_i =$ # $\{ j \in \{1, 2, ... , n\}: a_j \ge i\}$, so $b_i$ is the number of terms $a_j $ of the given sequence for which $a_j  \ge i$. Similarly, we define, for $1\le   j \le  n$, $c_j=$ # $\{ i \in \{1, 2, ... , m\}: b_i \ge j\}$ , thus $c_j$ is the number of terms bi in the given sequence for which $b_i \ge j$. E.g.: If $a$ is the sequence $5, 3, 3, 2, 1, 1$ then $b$ is the sequence $6, 4, 3, 1, 1$. (a) Prove that $a_j = c_j $ for $1  \le j  \le n$. (b) Prove that for $1\le  k \le m$: $\sum_{i=1}^{k} b_i = k \cdot b_k + \sum_{j=b_{k+1}}^{n} a_j$.

1991 Tournament Of Towns, (296) 3

The numbers $x_1,x_2,x_3, ..., x_n$ satisfy the two conditions $$\sum^n_{i=1}x_i=0 \,\, , \,\,\,\,\sum^n_{i=1}x_i^2=1$$ Prove that there are two numbers among them whose product is no greater than $- 1/n$. (Stolov, Kharkov)

1998 Abels Math Contest (Norwegian MO), 3

Let $n$ be a positive integer. (a) Prove that $1^5 +3^5 +5^5 +...+(2n-1)^5$ is divisible by $n$. (b) Prove that $1^3 +3^3 +5^3 +...+(2n-1)^3$ is divisible by $n^2$.

1987 All Soviet Union Mathematical Olympiad, 449

Find a set of five different relatively prime natural numbers such, that the sum of an arbitrary subset is a composite number.