Found problems: 594
Calculate the sum: $1+ 2q + 3q^2 +...+nq^{n-1}$
Let $A$ and $B$ be two non-empty subsets of $X = \{1, 2, . . . , 8 \}$ with $A \cup B = X$ and $A \cap B = \emptyset$. Let $P_A$ be the product of all elements of $A$ and let $P_B$ be the product of all elements of $B$. Find the minimum possible value of sum $P_A +P_B$.
PS. It is a variation of [url=https://artofproblemsolving.com/community/c6h2267998p17621980]JBMO Shortlist 2019 A3 [/url]
Let $n_1,n_2,n_3,...,n_{2000}$ be $2000$ positive integers satisfying $n_1<n_2<n_3<...<n_{2000}$. Prove that
$$\frac{n_1}{[n_1,n_2]}+\frac{n_1}{[n_2,n_3]}+\frac{n_1}{[n_3,n_4]}+...+\frac{n_1}{[n_{1999},n_{2000}]} \le 1 - \frac{1}{2^{1999}}$$
where $[a, b]$ denotes the least common multiple of $a$ and $b$.
Let $q(n)$ denote the sum of the digits of a natural number $n$. Determine $q(q(q(2000^{2000})))$.
Let $N_0$ denote the set of nonnegative integers and $Z$ the set of all integers. Let a function $f : N_0 \times Z \to Z$ satisfy the conditions
(i) $f(0, 0) = 1$, $f(0, 1) = 1$
(ii) for all $k, k \ne 0, k \ne 1$, $f(0, k) = 0$ and
(iii) for all $n \ge 1$ and $k, f(n, k) = f(n -1, k) + f(n- 1, k - 2n)$. Find the value of
$$\sum_{k=0}^{2009 \choose 2} f(2008, k)$$
Show that there is a subset of $A$ from $\{1,2, 3,... , 2014\}$ such that :
(i) $|A| = 12$
(ii) for each coloring number in $A$ with red or white , we can always find some numbers colored in $A$ whose sum is $2015$.
* On a plane two points $A$ and $B$ are on the same side of a line. Find point $M$ on the line such that $MA +MB$ is equal to a given length.
The number $S$ is the result of the following sum: $1 + 10 + 19 + 28 + 37 +...+ 10^{2013}$
If one writes down the number $S$, how often does the digit `$5$' occur in the result?
Let $S = x + y +z$ where $x, y, z$ are three nonzero real numbers satisfying the following system of inequalities:
$$xyz > 1$$
$$x + y + z >\frac{1}{x}+\frac{1}{y}+\frac{1}{z}$$
Prove that $S$ can take on any real values when $x, y, z$ vary
Let $M$ denote the set of $m\times n$ matrices with entries in the set $\{0,1,2,3,4\}$ such that in each row and each column the sum of elements is divisible by $5$. Find the cardinality of set $M$.
The numbers $d_1, d_2,..., d_6$ are distinct digits of the decimal number system other than $6$.
Prove that $d_1+d_2+...+d_6= 36$ if and only if $(d_1-6) (d_2-6) ... (d_6 -6) = -36$.
Consider the sequence $x_n = 2^n-n$, $n = 0,1 ,2 ,...$.
Find all integers $m \ge 0$ such that $s_m = x_0 + x_1 + x_2 + ... + x_m$ is a power of $2$.
For an integer $n \ge 1$ we consider sequences of $2n$ numbers, each equal to $0, -1$ or $1$. The [i]sum product value[/i] of such a sequence is calculated by first multiplying each pair of numbers from the sequence, and then adding all the results together.
For example, if we take $n = 2$ and the sequence $0,1, 1, -1$, then we find the products $0\cdot 1, 0\cdot 1, 0\cdot -1, 1\cdot 1, 1\cdot -1, 1\cdot -1$. Adding these six results gives the sum product value of this sequence: $0+0+0+1+(-1)+(-1) = -1$. The sum product value of this sequence is therefore smaller than the sum product value of the sequence $0, 0, 0, 0$, which equals $0$.
Determine for each integer $n \ge 1$ the smallest sum product value that such a sequence of $2n$ numbers could have.
[i]Attention: you are required to prove that a smaller sum product value is impossible.[/i]
$n$ real numbers are written in increasing order in a line. The same numbers are written in the second line below in unknown order. The third line contains the sums of the pairs of numbers above from two previous lines. It comes out, that the third line is arranged in increasing order. Prove that the second line coincides with the first one.
Can the set $\{1,2,...,33\}$ be partitioned into $11$ three-element sets, in each of which one element equals the sum of the other two?
For a natural number $n \ge 2$, consider all representations of $n$ as a sum of its distinct divisors, $n = t_1 + t_2 + ... + t_k, t_i| n$. Two such representations differing only in order of the summands are considered the same (for example, $20 = 10+5+4+1$ and $20 = 5+1+10+4$). Let $a(n)$ be the number of different representations of $n$ in this form. Prove or disprove: There exists M such that $a(n) \le M$ for all $n \ge 2$.
Consider a triple $(a, b, c)$ of pairwise distinct positive integers satisfying $a + b + c = 2013$. A step consists of replacing the triple $(x, y, z)$ by the triple $(y + z - x,z + x - y,x + y - z)$. Prove that, starting from the given triple $(a, b,c)$, after $10$ steps we obtain a triple containing at least one negative number.
If $x_1,x_2,...,x_{2001}$ are real numbers with $0 \le x_n \le 1$ for $n = 1,2,...,2001$, find the maximum value of
$$\left(\frac{1}{2001}\sum_{n=1}^{2001}x_n^2\right)-\left(\frac{1}{2001}\sum_{n=1}^{2001}x_n\right)^2$$
Where is this maximum attained?
Let $a, b, c$ be positive real numbers. Prove that
$$\frac{a^3}{a^2 + bc}+\frac{b^3}{b^2 + ca}+\frac{c^3}{c^2 + ab} \ge \frac{(a^2 + b^2 + c^2)(ab + bc + ca)}{a^3 + b^3 + c^3 + 3abc}$$
Let $B_n$ be the set of all sequences of length $n$, consisting of zeros and ones. For every two sequences $a,b \in B_n$ (not necessarily different) we define strings $\varepsilon_0\varepsilon_1\varepsilon_2 \dots \varepsilon_n$ and $\delta_0\delta_1\delta_2 \dots \delta_n$ such that $\varepsilon_0=\delta_0=0$ and $$
\varepsilon_{i+1}=(\delta_i-a_{i+1})(\delta_i-b_{i+1}), \quad \delta_{i+1}=\delta_i+(-1)^{\delta_i}\varepsilon_{i+1} \quad (0 \leq i \leq n-1).
$$. Let $w(a,b)=\varepsilon_0+\varepsilon_1+\varepsilon_2+\dots +\varepsilon_n$ . Find $f(n)=\sum\limits_{a,b \in {B_n}} {w(a,b)} $.
.
Each of the numbers $1$ up to and including $2014$ has to be coloured; half of them have to be coloured red the other half blue. Then you consider the number $k$ of positive integers that are expressible as the sum of a red and a blue number. Determine the maximum value of $k$ that can be obtained.
Is it possible to arrange integers in the cells of the infinite chechered sheet so that every integer appears at least in one cell, and the sum of any $10$ numbers in a row vertically or horizontal, would be divisible by $101$?
a) Prove that if the sum of the non-zero digits $a_1, a_2, ... , a_n$ is a multiple of $27$, then it is possible to permute these digits in order to obtain an $n$-digit number that is a multiple of $27$.
b) Prove that if the non-zero digits $a_1, a_2, ... , a_n$ have the property that every ndigit number obtained by permuting these digits is a multiple of $27$, then the sum of these digits is a multiple of $27$
Integers $x_0,x_1,...,x_{n-1}, x_n = x_0, x_{n+1} = x_1$ satisfy the inequality $(-1)^{x_k} x_{k-1}x_{k+1} >0$ for $k = 1,2,...,n$. Prove that the difference $\sum_{k=0}^{n-1}x_k -\sum_{k=0}^{n-1}|x_k|$ is divisible by $4$.
The sequence $ \{a_n \} $ is defined as follows: $ a_0 = 1 $ and $ {a_n} = \sum \limits_ {k = 1} ^ {[\sqrt n]} {{a_ {n - {k ^ 2 }}}} $ for $ n \ge 1. $
Prove that among $ a_1, a_2, \ldots, a_ {10 ^ 6} $ there are at least $500$ even numbers.
(Here, $ [x] $ is the largest integer not exceeding $ x $.)