Found problems: 85335
Prove that for every positive real $a,b,c$ the inequality holds :
$\frac{a}{b}+\frac{b}{c}+\frac{c}{a}+1 \geq \frac{2\sqrt2}{3} (\sqrt{\frac{a+b}{c}}+\sqrt{\frac{b+c}{a}}+\sqrt{\frac{c+a}{b}})$
When does the equality hold?
Let $a, b,c$ be positive real numbers such that $ab + bc + ca = 1$. Prove that
$$a\sqrt{b^2 + c^2 + bc} + b\sqrt{c^2 + a^2 + ca} + c\sqrt{a^2 + b^2 + ab} \ge \sqrt3$$
How many positive integers $A$ are there such that if we append $3$ digits to the rightmost of decimal representation of $A$, we will get a number equal to $1+2+\cdots + A$?
$
\textbf{a)}\ 0
\qquad\textbf{b)}\ 1
\qquad\textbf{c)}\ 2
\qquad\textbf{d)}\ 2002
\qquad\textbf{e)}\ \text{None of above}
$
Prove the following inequalities:
(1) $ x\minus{}\sin x\leq \tan x\minus{}x\ \ \left(0\leq x<\frac{\pi}{2}\right)$
(2) $ \int_0^x \cos (\tan t\minus{}t)\ dt\leq \sin (\sin x)\plus{}\frac 12 \left(x\minus{}\frac{\sin 2x}{2}\right)\ \left(0\leq x\leq \frac{\pi}{3}\right)$
Sets \(X\subset \mathbb{Z}^{+}\) and \(Y\subset \mathbb{Z}^{+}\) are called [i]comradely[/i], if every positive integer \(n\) can be written as \(n=xy\) for some \(x\in X\) and \(y\in Y\). Let \(X(n)\) and \(Y(n)\) denote the number of elements of \(X\) and \(Y\), respectively, among the first \(n\) positive integers.
Let \(f\colon \mathbb{Z}^{+}\to \mathbb{R}^{+}\) be an arbitrary function that goes to infinity. Prove that one can find comradely sets \(X\) and \(Y\) such that \(\dfrac{X(n)}{n}\) and \(\dfrac{Y(n)}{n}\) goes to \(0\), and for all \(\varepsilon>0\) exists \(n \in \mathbb{Z}^+\) such that
\[\frac{\min\big\{X(n), Y(n)\big\}}{f(n)}<\varepsilon. \]
How many triples of positive integers $(a,b,c)$ are there such that $a!+b^3 = 18+c^3$?
$
\textbf{(A)}\ 4
\qquad\textbf{(B)}\ 3
\qquad\textbf{(C)}\ 2
\qquad\textbf{(D)}\ 1
\qquad\textbf{(E)}\ 0
$
p1. Let $A = \{(x, y)|3x + 5y\ge 15, x + y^2\le 25, x\ge 0, x, y$ integer numbers $\}$. Find all pairs of $(x, zx)\in A$ provided that $z$ is non-zero integer.
p2. A shop owner wants to be able to weigh various kinds of weight objects (in natural numbers) with only $4$ different weights.
(For example, if he has weights $ 1$, $2$, $5$ and $10$. He can weighing $ 1$ kg, $2$ kg, $3$ kg $(1 + 2)$, $44$ kg $(5 - 1)$, $5$ kg, $6$ kg, $7$ kg, $ 8$ kg, $9$ kg $(10 - 1)$, $10$ kg, $11$ kg, $12$ kg, $13$ kg $(10 + 1 + 2)$, $14$ kg $(10 + 5 -1)$, $15$ kg, $16$ kg, $17$ kg and $18$ kg). If he wants to be able to weigh all the weight from $ 1$ kg to $40$ kg, determine the four weights that he must have. Explain that your answer is correct.
p3. Given the following table.
[img]https://cdn.artofproblemsolving.com/attachments/d/8/4622407a72656efe77ccaf02cf353ef1bcfa28.png[/img]
Table $4\times 4$ is a combination of four smaller table sections of size $2\times 2$.
This table will be filled with four consecutive integers such that:
$\bullet$ The horizontal sum of the numbers in each row is $10$ .
$\bullet$ The vertical sum of the numbers in each column is $10$
$\bullet$ The sum of the four numbers in each part of $2\times 2$ which is delimited by the line thickness is also equal to $10$.
Determine how many arrangements are possible.
p4. A sequence of real numbers is defined as following:
$U_n=ar^{n-1}$, if $n = 4m -3$ or $n = 4m - 2$
$U_n=- ar^{n-1}$, if $n = 4m - 1$ or $n = 4m$, where $a > 0$, $r > 0$, and $m$ is a positive integer.
Prove that the sum of all the $ 1$st to $2009$th terms is $\frac{a(1+r-r^{2009}+r^{2010})}{1+r^2}$
5. Cube $ABCD.EFGH$ is cut into four parts by two planes. The first plane is parallel to side $ABCD$ and passes through the midpoint of edge $BF$. The sceond plane passes through the midpoints $AB$, $AD$, $GH$, and $FG$. Determine the ratio of the volumes of the smallest part to the largest part.
Let $ f(x)\equal{}5x^{13}\plus{}13x^5\plus{}9ax$. Find the least positive integer $ a$ such that $ 65$ divides $ f(x)$ for every integer $ x$.
It is well-known that a quadratic equation has no more than 2 roots. Is it possible for the equation $\lfloor x^2\rfloor+px+q=0$ with $p\neq 0$ to have more than 100 roots?
[i]Alexey Tolpygo[/i]
Alice needs to replace a light bulb located $10$ centimeters below the ceiling of her kitchen. The ceiling is $2.4$ meters above the floor. Alice is $1.5$ meters tall and can reach $46$ centimeters above her head. Standing on a stool, she can just reach the light bulb. What is the height of the stool, in centimeters?
$ \textbf{(A)}\ 32 \qquad\textbf{(B)}\ 34\qquad\textbf{(C)}\ 36\qquad\textbf{(D)}\ 38\qquad\textbf{(E)}\ 40 $
For all $y$, define cubic $f_y (x)$ such that $f_y (0) = y$, $f_y (1) = y +12$, $f_y (2) = 3y^2$, $f_y (3) = 2y +4$. For all $y$, $f_y(4)$ can be expressed in the form $ay^2 +by +c$ where $a,b,c$ are integers. Find $a +b +c$.
In triangle $ ABC$ the medians $ \overline{AD}$ and $ \overline{CE}$ have lengths 18 and 27, respectively, and $ AB \equal{} 24$. Extend $ \overline{CE}$ to intersect the circumcircle of $ ABC$ at $ F$. The area of triangle $ AFB$ is $ m\sqrt {n}$, where $ m$ and $ n$ are positive integers and $ n$ is not divisible by the square of any prime. Find $ m \plus{} n$.
Let $t\in R$. Prove that $\exists A:R \times R \to R$ such that A is a symmetric, biadditive, nonzero function and $A(tx,x)=0 \,\forall x\in R$ iff t is transcendental or (t is algebraic and t,-t are conjugates over $\mathbb{Q}$).
Let $a$, $b$, and $c$ be real numbers such that $0\le a,b,c\le 5$ and $2a + b + c = 10$. Over all possible values of $a$, $b$, and $c$, determine the maximum possible value of $a + 2b + 3c$.
[i]Proposed by Andrew Wen[/i]
The altitudes through the vertices $ A,B,C$ of an acute-angled triangle $ ABC$ meet the opposite sides at $ D,E, F,$ respectively. The line through $ D$ parallel to $ EF$ meets the lines $ AC$ and $ AB$ at $ Q$ and $ R,$ respectively. The line $ EF$ meets $ BC$ at $ P.$ Prove that the circumcircle of the triangle $ PQR$ passes through the midpoint of $ BC.$
Prove that there are no integers $x$ and $y$ for which
$$x^2 +3xy-2y^2 =122.$$
In Occidentalia there are $20$ different companies, each looking to hire $15$ new employees. A group of $300$ applicants interview each of the companies. Each company qualifies each applicant as suitable or not suitable to work in it, in such a way that each of them finds exactly $p$ suitable applicants, with $p > 15$. and each applicant is found suitable by at least one company. What is the smallest of $p $f or which it is always possible to assign $15$ applicants to each company, given that each company is assigned only applicants that it considers appropriate, and that each of the $300$ applicants is assigned to a company?
For positive real numbers $a, b, c$ such that $a+b+c=3$, show that:
\[\sqrt{a} + \sqrt{b} + \sqrt{c} \ge ab+bc+ca.\]
Find all integers $n > 1$ for which there is a set $B$ of $n$ points in the plane such that for any $A \in B$ there are three points $X,Y,Z \in B$ with $AX = AY = AZ = 1$.
Let $a_1 = 1$ and $a_{n+1} = a_n \cdot p_n$ for $n \geq 1$ where $p_n$ is the $n$th prime number, starting with $p_1 = 2$. Let $\tau(x)$ be equal to the number of divisors of $x$. Find the remainder when
$$\sum_{n=1}^{2020} \sum_{d \mid a_n} \tau (d)$$
is divided by 91 for positive integers $d$. Recall that $d|a_n$ denotes that $d$ divides $a_n$.
[i]Proposed by Minseok Eli Park (wolfpack)[/i]
Given an integer $n \ge 2$, determine the number of ordered $n$-tuples of integers $(a_1, a_2,...,a_n)$ such that
(a) $a_1 + a_2 + .. + a_n \ge n^2$ and
(b) $a_1^2 + a_2^2 + ... + a_n^2 \le n^3 + 1$
Prove that $a=2$ is the greatest real number for which the inequality:
$$
\frac{x_1}{x_n+x_2}+\frac{x_2}{x_1+x_3}+\dots+\frac{x_n}{x_{n-1}+x_1} \ge a
$$
holds true for any $n \ge 4$ and any positive real numbers $x_1, x_2,\dots,x_n$.
There is a board with $2020$ squares in the bottom row and $2019$ in the top row, located as shown shown in the figure.
[img]https://cdn.artofproblemsolving.com/attachments/f/3/516ad5485c399427638c3d1783593d79d83002.png[/img]
In the bottom row the integers numbers from $ 1$ to $2020$ are placed in some order. Then in each box in the top row records the multiplication of the two numbers below it. How can they place the numbers in the bottom row so that the sum of the numbers in the top row be the smallest possible?
Five points are selected within a unit circle at random. Estimate the minimum distance between any pair of points. An estimate $E$ earns $\frac{2}{1+|log_2(A)-log_2(E)|}$ points, where $A$ is the actual answer.
[i]2022 CCA Math Bonanza Lightning Round 5.4[/i]
Fix $2n$ distinct reals $x_1,y_1,...,x_n,y_n$ and dene the $n\times n$ matrix where its $(i, j)$-th element is $x_i + y_j$ for all $i, j = 1,..., n$. Show that if the products of the numbers in each column is always the same, then also the products of the numbers in each row is always the same.
( Alberto Alfarano)