Found problems: 76
Let $a, b, c$ be three distinct positive integers. Define $S(a, b, c)$ as the set of all rational roots of $px^2 + qx + r = 0$ for every permutation $(p, q, r)$ of $(a, b, c)$. For example, $S(1, 2, 3) = \{ -1, -2, -1/2 \}$ because the equation $x^2+3x+2$ has roots $-1$ and $-2$, the equation $2x^2+3x+1=0$ has roots $-1$ and $-1/2$, and for all the other permutations of $(1, 2, 3)$, the quadratic equations formed don't have any rational roots.
Determine the maximum number of elements in $S(a, b, c)$.
Determine the greatest number, who is the product of some positive integers, and the sum of these numbers is $1976.$
Given a sequence of integers $A_1,A_2,\cdots A_{99}$ such that for every sub-sequence that contains $m$ consecutive elements, there exist not more than $max\{ \frac{m}{3} ,1\}$ odd integers. Let $S=\{ (i,j) \ | i<j \}$ such that $A_i$ is even and $A_j$ is odd. Find $max\{ |S|\}$.
Given an integer $N \geq 4$, determine the largest value the sum
$$\sum_{i=1}^{\left \lfloor{\frac{k}{2}}\right \rfloor+1}\left( \left \lfloor{\frac{n_i}{2}}\right \rfloor+1\right)$$
may achieve, where $k, n_1, \ldots, n_k$ run through the integers subject to $k \geq 3$, $n_1 \geq \ldots\geq n_k\geq 1$ and $n_1 + \ldots + n_k = N$.
We consider a point $P$ in a plane $p$ and a point $Q \not\in p$. Determine all the points $R$ from $p$ for which \[ \frac{QP+PR}{QR} \] is maximum.
An alphabet consists of $n$ letters. What is the maximal length of a word if we know that any two consecutive letters $a,b$ of the word are different and that the word cannot be reduced to a word of the kind $abab$ with $a\neq b$ by removing letters.
Let $n$ be a fixed positive integer. Find the maximum possible value of \[ \sum_{1 \le r < s \le 2n} (s-r-n)x_rx_s, \] where $-1 \le x_i \le 1$ for all $i = 1, \cdots , 2n$.
Given positive integer $n$, find the biggest real number $C$ which satisfy the condition that if the sum of the reciprocals of a set of integers (They can be the same.) that are greater than $1$ is less than $C$, then we can divide the set of numbers into no more than $n$ groups so that the sum of reciprocals of every group is less than $1$.
Let $A = (a_1, a_2, \ldots, a_{2001})$ be a sequence of positive integers. Let $m$ be the number of 3-element subsequences $(a_i,a_j,a_k)$ with $1 \leq i < j < k \leq 2001$, such that $a_j = a_i + 1$ and $a_k = a_j + 1$. Considering all such sequences $A$, find the greatest value of $m$.
What is the greatest number of balls of radius $1/2$ that can be placed within a rectangular box of size $10 \times 10 \times 1 \ ?$
The $n$ points $P_1,P_2, \ldots, P_n$ are placed inside or on the boundary of a disk of radius 1 in such a way that the minimum distance $D_n$ between any two of these points has its largest possible value $D_n.$ Calculate $D_n$ for $n = 2$ to 7. and justify your answer.
Let $n \geq 2$ be a fixed integer. Find the least constant $C$ such the inequality
\[\sum_{i<j} x_{i}x_{j} \left(x^{2}_{i}+x^{2}_{j} \right) \leq C
\left(\sum_{i}x_{i} \right)^4\]
holds for any $x_{1}, \ldots ,x_{n} \geq 0$ (the sum on the left consists of $\binom{n}{2}$ summands). For this constant $C$, characterize the instances of equality.
Given real numbers $x_1, x_2, \dots , x_n \ (n \geq 2)$, with $x_i \geq \frac 1n \ (i = 1, 2, \dots, n)$ and with $x_1^2+x_2^2+\cdots+x_n^2 = 1$ , find whether the product $P = x_1x_2x_3 \cdots x_n$ has a greatest and/or least value and if so, give these values.
Determine the greatest number, who is the product of some positive integers, and the sum of these numbers is $1976.$
The least number is $m$ and the greatest number is $M$ among $ a_1 ,a_2 ,\ldots,a_n$ satisfying $ a_1 \plus{}a_2 \plus{}...\plus{}a_n \equal{}0$. Prove that
\[ a_1^2 \plus{}\cdots \plus{}a_n^2 \le\minus{}nmM\]
$(NET 3)$ Let $x_1, x_2, x_3, x_4,$ and $x_5$ be positive integers satisfying
\[x_1 +x_2 +x_3 +x_4 +x_5 = 1000,\]
\[x_1 -x_2 +x_3 -x_4 +x_5 > 0,\]
\[x_1 +x_2 -x_3 +x_4 -x_5 > 0,\]
\[-x_1 +x_2 +x_3 -x_4 +x_5 > 0,\]
\[x_1 -x_2 +x_3 +x_4 -x_5 > 0,\]
\[-x_1 +x_2 -x_3 +x_4 +x_5 > 0\]
$(a)$ Find the maximum of $(x_1 + x_3)^{x_2+x_4}$
$(b)$ In how many different ways can we choose $x_1, . . . , x_5$ to obtain the desired maximum?
Find an upper bound for the ratio
$$\frac{x_1x_2+2x_2x_3+x_3x_4}{x_1^2+x_2^2+x_3^2+x_4^2}$$
over all quadruples of real numbers $(x_1,x_2,x_3,x_4)\neq (0,0,0,0)$.
[i]Note.[/i] The smaller the bound, the better the solution.
Let $n$ be a fixed positive integer. Find the maximum possible value of \[ \sum_{1 \le r < s \le 2n} (s-r-n)x_rx_s, \] where $-1 \le x_i \le 1$ for all $i = 1, \cdots , 2n$.
It is given positive integer $n$. Let $a_1, a_2,..., a_n$ be positive integers with sum $2S$, $S \in \mathbb{N}$. Positive integer $k$ is called separator if you can pick $k$ different indices $i_1, i_2,...,i_k$ from set $\{1,2,...,n\}$ such that $a_{i_1}+a_{i_2}+...+a_{i_k}=S$. Find, in terms of $n$, maximum number of separators
Let $ n \in \mathbb{Z}^\plus{}$ and let $ a, b \in \mathbb{R}.$ Determine the range of $ x_0$ for which
\[ \sum^n_{i\equal{}0} x_i \equal{} a \text{ and } \sum^n_{i\equal{}0} x^2_i \equal{} b,\]
where $ x_0, x_1, \ldots , x_n$ are real variables.
Given the integer $n > 1$ and the real number $a > 0$ determine the maximum of $\sum_{i=1}^{n-1} x_i x_{i+1}$ taken over all nonnegative numbers $x_i$ with sum $a.$
Let $ P(x)$ be the real polynomial function, $ P(x) \equal{} ax^3 \plus{} bx^2 \plus{} cx \plus{} d.$ Prove that if $ |P(x)| \leq 1$ for all $ x$ such that $ |x| \leq 1,$ then
\[ |a| \plus{} |b| \plus{} |c| \plus{} |d| \leq 7.\]
Let $a,b,c$ be positive real numbers such that $a+b+c=10$ and $ab+bc+ca=25$. Let $m=\min\{ab,bc,ca\}$. Find the largest possible value of $m$.
[b](a)[/b] Find the rearrangement $\{a_1, \dots , a_n\}$ of $\{1, 2, \dots, n\}$ that maximizes
\[a_1a_2 + a_2a_3 + \cdots + a_na_1 = Q.\]
[b](b)[/b] Find the rearrangement that minimizes $Q.$
Prove that $0\le yz+zx+xy-2xyz\le{7\over27}$, where $x,y$ and $z$ are non-negative real numbers satisfying $x+y+z=1$.