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

2007 Today's Calculation Of Integral, 233

Find the minimum value of the following definite integral. $ \int_0^{\pi} (a\sin x \plus{} b\sin 3x \minus{} 1)^2\ dx.$

1989 China Team Selection Test, 3

Find the greatest $n$ such that $(z+1)^n = z^n + 1$ has all its non-zero roots in the unitary circumference, e.g. $(\alpha+1)^n = \alpha^n + 1, \alpha \neq 0$ implies $|\alpha| = 1.$

2020 Jozsef Wildt International Math Competition, W52

If $f\in C^{(3)}([0,1])$ such that $f(0)=f(1)=f'(0)=0$ and $|f'''(x)|\le1,(\forall)x\in[0,1]$, show that: a) $$|f(x)|\le\frac{x(1-x)}{\sqrt3}\cdot\left(\int^x_0\frac{f(t)}{t(1-t)}dt\right)^{1/2},(\forall)x\in[0,1]$$ b) $$|f'(x)|\le\frac{1-2x}{\sqrt3}\cdot\left(\int^x_0\frac{|f(t)|}{t(1-t)}dt\right)^{1/2},(\forall)x\in\left[0,\frac12\right]$$ c) $$\int^1_0(1-x)^2\cdot\frac{|f(x)|}xdx\ge9\int^1_0\left(\frac{f(x)}x\right)^2dx$$ [i]Proposed by Florin Stănescu and Şerban Cioculescu[/i]

1990 Turkey Team Selection Test, 2

For real numbers $x_i$, the statement \[ x_1 + x_2 + x_3 = 0 \Rightarrow x_1x_2 + x_2x_3 + x_3x_1 \leq 0\] is always true. (Prove!) For which $n\geq 4$ integers, the statement \[x_1 + x_2 + \dots + x_n = 0 \Rightarrow x_1x_2 + x_2x_3 + \dots + x_{n-1}x_n + x_nx_1 \leq 0\] is always true. Justify your answer.

2018 Miklós Schweitzer, 9

Let $f:\mathbb{C} \to \mathbb{C}$ be an entire function, and suppose that the sequence $f^{(n)}$ of derivatives converges pointwise. Prove that $f^{(n)}(z)\to Ce^z$ pointwise for a suitable complex number $C$.

2007 ITAMO, 6

a) For each $n \ge 2$, find the maximum constant $c_{n}$ such that $\frac 1{a_{1}+1}+\frac 1{a_{2}+1}+\ldots+\frac 1{a_{n}+1}\ge c_{n}$ for all positive reals $a_{1},a_{2},\ldots,a_{n}$ such that $a_{1}a_{2}\cdots a_{n}= 1$. b) For each $n \ge 2$, find the maximum constant $d_{n}$ such that $\frac 1{2a_{1}+1}+\frac 1{2a_{2}+1}+\ldots+\frac 1{2a_{n}+1}\ge d_{n}$ for all positive reals $a_{1},a_{2},\ldots,a_{n}$ such that $a_{1}a_{2}\cdots a_{n}= 1$.

2014 Taiwan TST Round 2, 1

Let $a_i > 0$ for $i=1,2,\dots,n$ and suppose $a_1 + a_2 + \dots + a_n = 1$. Prove that for any positive integer $k$, \[ \left( a_1^k + \frac{1}{a_1^k} \right) \left( a_2^k + \frac{1}{a_2^k} \right) \dots \left( a_n^k + \frac{1}{a_n^k} \right) \ge \left( n^k + \frac{1}{n^k} \right)^n. \]

1979 Chisinau City MO, 180

It is known that for $0\le x \le 1$ the square trinomial $f (x)$ satisfies the condition $|f(x) | \le 1$. Show that $| f '(0) | \le 8.$

2003 Greece National Olympiad, 1

If $a, b, c, d$ are positive numbers satisfying $a^3 + b^3 +3ab = c + d = 1,$ prove that \[\left(a+\frac{1}{a}\right)^3+\left(b+\frac{1}{b}\right)^3+\left(c+\frac{1}{c}\right)^3+\left(d+\frac{1}{d}\right)^3\geq 40.\]

Today's calculation of integrals, 860

For a function $f(x)\ (x\geq 1)$ satisfying $f(x)=(\log_e x)^2-\int_1^e \frac{f(t)}{t}dt$, answer the questions as below. (a) Find $f(x)$ and the $y$-coordinate of the inflection point of the curve $y=f(x)$. (b) Find the area of the figure bounded by the tangent line of $y=f(x)$ at the point $(e,\ f(e))$, the curve $y=f(x)$ and the line $x=1$.

2009 AIME Problems, 8

Let $ S \equal{} \{2^0,2^1,2^2,\ldots,2^{10}\}$. Consider all possible positive differences of pairs of elements of $ S$. Let $ N$ be the sum of all of these differences. Find the remainder when $ N$ is divided by $ 1000$.

2008 Harvard-MIT Mathematics Tournament, 2

([b]3[/b]) Let $ \ell$ be the line through $ (0,0)$ and tangent to the curve $ y \equal{} x^3 \plus{} x \plus{} 16$. Find the slope of $ \ell$.

2007 Romania National Olympiad, 1

Let $\mathcal{F}$ be the set of functions $f: [0,1]\to\mathbb{R}$ that are differentiable, with continuous derivative, and $f(0)=0$, $f(1)=1$. Find the minimum of $\int_{0}^{1}\sqrt{1+x^{2}}\cdot \big(f'(x)\big)^{2}\ dx$ (where $f\in\mathcal{F}$) and find all functions $f\in\mathcal{F}$ for which this minimum is attained. [hide="Comment"] In the contest, this was the b) point of the problem. The a) point was simply ``Prove the Cauchy inequality in integral form''. [/hide]

1962 Miklós Schweitzer, 5

Let $ f$ be a finite real function of one variable. Let $ \overline{D}f$ and $ \underline{D}f$ be its upper and lower derivatives, respectively, that is, \[ \overline{D}f\equal{}\limsup_{{h,k\rightarrow 0}_{{h,k \geq 0}_{h\plus{}k>0}}} \frac{f(x\plus{}h)\minus{}f(x\minus{}k)}{h\plus{}k}\] , \[ \underline{D}f\equal{}\liminf_{{h,k\rightarrow 0}_{{h,k \geq 0}_{h\plus{}k>0}}} \frac{f(x\plus{}h)\minus{}f(x\minus{}k)}{h\plus{}k}.\] Show that $ \overline{D}f$ and $ \underline{D}f$ are Borel-measurable functions. [A. Csaszar]

1988 Flanders Math Olympiad, 4

Be $R$ a positive real number. If $R, 1, R+\frac12$ are triangle sides, call $\theta$ the angle between $R$ and $R+\frac12$ (in rad). Prove $2R\theta$ is between $1$ and $\pi$.

2014 Online Math Open Problems, 17

Let $AXYBZ$ be a convex pentagon inscribed in a circle with diameter $\overline{AB}$. The tangent to the circle at $Y$ intersects lines $BX$ and $BZ$ at $L$ and $K$, respectively. Suppose that $\overline{AY}$ bisects $\angle LAZ$ and $AY=YZ$. If the minimum possible value of \[ \frac{AK}{AX} + \left( \frac{AL}{AB} \right)^2 \] can be written as $\tfrac{m}{n} + \sqrt{k}$, where $m$, $n$ and $k$ are positive integers with $\gcd(m,n)=1$, compute $m+10n+100k$. [i]Proposed by Evan Chen[/i]

1991 Arnold's Trivium, 21

Find the derivative of the solution of the equation $\ddot{x} = \dot{x}^2 + x^3$ with initial condition $x(0) = 0$, $\dot{x}(0) = A$ with respect to $A$ for $A = 0$.

2024 District Olympiad, P2

Let $f:[0,1]\to(0,\infty)$ be a continous function on $[0,1]$ and let $A=\int_0^1 f(t)\mathrm{d}t.$[list=a] [*]Consider the function $F:[0,1]\to[0,A]$ defined by \[F(x)=\int_0^xf(t)\mathrm{d}t.\]Prove that $F(x)$ has an inverse function, which is differentiable. [*]Prove that there exists a unique function $g:[0,1]\to[0,1]$ for which\[\int_0^xf(t)\mathrm{d}t=\int_{g(x)}^1f(t)\mathrm{d}t\]is satisfied for every $x\in [0,1].$ [*]Prove that there exists $c\in[0,1]$ for which\[\lim_{x\to c}\frac{g(x)-c}{x-c}=-1,\]whre $g$ is the function uniquely determined at b. [/list]

2009 Stanford Mathematics Tournament, 7

An isosceles trapezoid has legs and shorter base of length $1$. Find the maximum possible value of its area

1991 USAMO, 2

For any nonempty set $\,S\,$ of numbers, let $\,\sigma(S)\,$ and $\,\pi(S)\,$ denote the sum and product, respectively, of the elements of $\,S\,$. Prove that \[ \sum \frac{\sigma(S)}{\pi(S)} = (n^2 + 2n) - \left(1 + \frac{1}{2} + \frac{1}{3} + \cdots + \frac{1}{n} \right) (n+1), \] where ``$\Sigma$'' denotes a sum involving all nonempty subsets $S$ of $\{1,2,3, \ldots,n\}$.

2010 Today's Calculation Of Integral, 547

Find the minimum value of $ \int_0^1 |e^{ \minus{} x} \minus{} a|dx\ ( \minus{} \infty < a < \infty)$.

2005 MOP Homework, 4

Consider an infinite array of integers. Assume that each integer is equal to the sum of the integers immediately above and immediately to the left. Assume that there exists a row $R_0$ such that all the number in the row are positive. Denote by $R_1$ the row below row $R_0$, by $R_2$ the row below row $R_1$, and so on. Show that for each positive integer $n$, row $R_n$ cannot contain more than $n$ zeros.

1997 Niels Henrik Abels Math Contest (Norwegian Math Olympiad) Round 2, 10

The minimal value of $ f(x) \equal{} \sqrt{a^2 \plus{} x^2} \plus{} \sqrt{(x\minus{}b)^2 \plus{} c^2}$ is A. $ a\plus{}b\plus{}c$ B. $ \sqrt{a^2 \plus{} (b \plus{} c)^2}$ C. $ \sqrt{b^2 \plus{} (a\plus{}c)^2}$ D. $ \sqrt{(a\plus{}b)^2 \plus{} c^2}$ E. None of these

2013 USAMTS Problems, 5

Niki and Kyle play a triangle game. Niki first draws $\triangle ABC$ with area $1$, and Kyle picks a point $X$ inside $\triangle ABC$. Niki then draws segments $\overline{DG}$, $\overline{EH}$, and $\overline{FI}$, all through $X$, such that $D$ and $E$ are on $\overline{BC}$, $F$ and $G$ are on $\overline{AC}$, and $H$ and $I$ are on $\overline{AB}$. The ten points must all be distinct. Finally, let $S$ be the sum of the areas of triangles $DEX$, $FGX$, and $HIX$. Kyle earns $S$ points, and Niki earns $1-S$ points. If both players play optimally to maximize the amount of points they get, who will win and by how much?

1969 Miklós Schweitzer, 7

Prove that if a sequence of Mikusinski operators of the form $ \mu e^{\minus{}\lambda s}$ ( $ \lambda$ and $ \mu$ nonnegative real numbers, $ s$ the differentiation operator) is convergent in the sense of Mikusinski, then its limit is also of this form. [i]E. Geaztelyi[/i]