Found problems: 85335
Find all integers $a,b,c,d$ such that
(i) $1 \leq a \leq b \leq c \leq d$;
(ii) $ab + cd = a +b +c +d + 3$.
In parallelogram $ABCD,$ let $O$ be the intersection of diagonals $\overline{AC}$ and $\overline{BD}.$ Angles $CAB$ and $DBC$ are each twice as large as angle $DBA,$ and angle $ACB$ is $r$ times as large as angle $AOB.$ Find the greatest integer that does not exceed $1000r.$
Prove that if $a, b, c$ are positive numbers and $ab + bc + ca > a+ b + c$, then $a + b + c > 3$.
(a) Prove that there exist infinitely many natural numbers $n$ such that the sum of the digits of $11n$ is twice the sum of the digits of $n$.
(b) Prove that there exist infinitely many natural numbers $n$ such that the sum of the digits of $4n + 3$ is equal to the sum of the digits of $n$.
(c) Prove that for any natural number $n$, it is possible to find $n$ consecutive numbers such that none of them is prime.
Prove that $$\frac{\sin^3 a}{\sin b} +\frac{\cos^3 a}{\cos b} \ge \frac{1}{\cos(a - b)}$$ for all $a$ and $b$ in the interval $(0, \pi/2)$ .
Let $ABCD$ be a cyclic quadrilateral. Let $E$ and $F$ be variable points on the sides $AB$ and $CD$, respectively, such that $AE:EB=CF:FD$. Let $P$ be the point on the segment $EF$ such that $PE:PF=AB:CD$. Prove that the ratio between the areas of triangles $APD$ and $BPC$ does not depend on the choice of $E$ and $F$.
Let us call a positive integer [i]pedestrian[/i] if all its decimal digits are equal to 0 or 1. Suppose that the product of some two pedestrian integers also is pedestrian. Is it necessary in this case that the sum of digits of the product equals the product of the sums of digits of the factors?
[i]Viktor Kleptsyn, Konstantin Knop[/i]
A regular polygon with $20$ vertices is given. Alice colors each vertex in one of two colors. Bob then draws a diagonal connecting two opposite vertices. Now Bob draws perpendicular segments to this diagonal, each segment having vertices of the same color as endpoints. He gets a fish from Alice for each such segment he draws. How many fish can Bob guarantee getting, no matter Alice's goodwill?
[b](a)[/b] Sketch the diagram of the function $f$ if
\[f(x)=4x(1-|x|) , \quad |x| \leq 1.\]
[b](b)[/b] Does there exist derivative of $f$ in the point $x=0 \ ?$
[b](c)[/b] Let $g$ be a function such that
\[g(x)=\left\{\begin{array}{cc}\frac{f(x)}{x} \quad : x \neq 0\\ \text{ } \\ 4 \ \ \ \ \quad : x=0\end{array}\right.\]
Is the function $g$ continuous in the point $x=0 \ ?$
[b](d)[/b] Sketch the diagram of $g.$
Let $ ABC$ be an acute angled triangle and let $ H$ be its ortho centre. Let $ h_{max}$ denote the largest altitude of the triangle $ ABC$. Prove that:
$AH \plus{} BH \plus{} CH\leq2h_{max}$
Let $S= \{ a_1, \ldots, a_n\}$ be a set of $n\geq 1$ positive real numbers. For each nonempty subset of $S$ the sum of its elements is written down. Show that all written numbers can be divided into $n$ classes such that in each class the ratio of the greatest number to the smallest number is not greater than $2$.
Find, with proof, a polynomial $f(x,y,z)$ in three variables, with integer coefficients, such that for all $a,b,c$ the sign of $f(a,b,c)$ (that is, positive, negative, or zero) is the same as the sign of $a+b\sqrt[3]{2}+c\sqrt[3]{4}$.
Let $\tau(n)$ denote the number of positive divisors of the positive integer $n$. Prove that there exist infinitely many positive integers $a$ such that the equation $ \tau(an)=n $ does not have a positive integer solution $n$.
Prove or disprove that $\forall a,b,c,d \in \mathbb{R}^+$ we have the following inequality:
\[3 \leq \frac{4a+b}{a+4b} + \frac{4b+c}{b+4c} + \frac{4c+a}{c+4a} < \frac{33}{4}\]
Given a non-zero real number $a$. Find all functions $f : R \to R$, such that $$f(f(x + y)) = f(x + y) + f(x)f(y) + axy$$ for all $x, y \in R$.
$16$ pieces of the shape $1\times 3$ are placed on a $7\times 7$ chessboard, each of which is exactly three fields. One field remains free. Find all possible positions of this field.
$(GBR 4)$ The segment $AB$ perpendicularly bisects $CD$ at $X$. Show that, subject to restrictions, there is a right circular cone whose axis passes through $X$ and on whose surface lie the points $A,B,C,D.$ What are the restrictions?
A point $P$ lies inside $\vartriangle ABC$ such that the values of areas of $\vartriangle PAB, \vartriangle PBC, \vartriangle PCA$ can form a triangle. Let $BC = a,CA = b,AB = c, PA = x,PB = y, PC = z$, prove that
$$\frac{(x + y)^2 + (y + z)^2 + (z + x)^2}{x + y + z} \le a + b + c$$
Let $ABCDEF$ be a regular hexagon of area $1$. Let $M$ be the midpoint of $DE$. Let $X$ be the intersection of $AC$ and $BM$, let $Y$ be the intersection of $BF$ and $AM$, and let $Z$ be the intersection of $AC$ and $BF$. If $[P]$ denotes the area of a polygon $P$ for any polygon $P$ in the plane, evaluate $[BXC] + [AYF] + [ABZ] - [MXZY]$.
Let $k$ and $m$ be integers with $1 < k < m$. For a positive integer $i$, let $L_i$ be the least common multiple of $1,2,\ldots,i$.
Prove that $k$ is a divisor of $L_i \cdot [\binom{m}{i} - \binom{m-k}{i}]$ for all $i \geq 1$. [Here, $\binom{n}{i} = \frac{n!}{i!(n-i)!}$ denotes a binomial coefficient. Note that $\binom{n}{i} = 0$ if $n < i$.]
[b]p1.[/b] Jose,, Luciano, and Placido enjoy playing cards after their performances, and you are invited to deal. They use just nine cards, numbered from $2$ through $10$, and each player is to receive three cards. You hope to hand out the cards so that the following three conditions hold:
A) When Jose and Luciano pick cards randomly from their piles, Luciano most often picks a card higher than Jose,
B) When Luciano and Placido pick cards randomly from their piles, Placido most often picks a card higher than Luciano,
C) When Placido and Jose pick cards randomly from their piles, Jose most often picks a card higher than Placido.
Explain why it is impossible to distribute the nine cards so as to satisfy these three conditions, or give an example of one such distribution.
[b]p2.[/b] Is it possible to fill a rectangular box with a finite number of solid cubes (two or more), each with a different edge length? Justify your answer.
[b]p3.[/b] Two parallel lines pass through the points $(0, 1)$ and $(-1, 0)$. Two other lines are drawn through $(1, 0)$ and $(0, 0)$, each perpendicular to the ¯rst two. The two sets of lines intersect in four points that are the vertices of a square. Find all possible equations for the first two lines.
[b]p4.[/b] Suppose $a_1, a_2, a_3,...$ is a sequence of integers that represent data to be transmitted across a communication channel. Engineers use the quantity
$$G(n) =(1 - \sqrt3)a_n -(3 - \sqrt3)a_{n+1} +(3 + \sqrt3)a_{n+2}-(1+ \sqrt3)a_{n+3}$$
to detect noise in the signal.
a. Show that if the numbers $a_1, a_2, a_3,...$ are in arithmetic progression, then $G(n) = 0$ for all $n = 1, 2, 3, ...$.
b. Show that if $G(n) = 0$ for all $n = 1, 2, 3, ...$, then $a_1, a_2, a_3,...$ is an arithmetic progression.
[b]p5.[/b] The Olive View Airline in the remote country of Kuklafrania has decided to use the following rule to establish its air routes: If $A$ and $B$ are two distinct cities, then there is to be an air route connecting $A$ with $B$ either if there is no city closer to $A$ than $B$ or if there is no city closer to $B$ than $A$. No further routes will be permitted. Distances between Kuklafranian cities are never equal. Prove that no city will be connected by air routes to more than ¯ve other cities.
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
What's the largest number of elements that a set of positive integers between $1$ and $100$ inclusive can have if it has the property that none of them is divisible by another?
Four positive integers $x,y,z$ and $t$ satisfy the relations
\[ xy - zt = x + y = z + t. \]
Is it possible that both $xy$ and $zt$ are perfect squares?
Let $n \geqslant 3$ be an integer, and let $x_1,x_2,\ldots,x_n$ be real numbers in the interval $[0,1]$. Let $s=x_1+x_2+\ldots+x_n$, and assume that $s \geqslant 3$. Prove that there exist integers $i$ and $j$ with $1 \leqslant i<j \leqslant n$ such that
\[2^{j-i}x_ix_j>2^{s-3}.\]
Determine the remainder when $$2^6\cdot3^{10}\cdot5^{12}-75^4\left(26^2-1\right)^2+3^{10}-50^6+5^{12}$$ is divided by $1001$.
[i]2016 CCA Math Bonanza Lightning #4.1[/i]