Found problems: 85335
If positive integers $p,q,r$ are such that the quadratic equation $px^2-qx+r=0$ has two distinct real roots in the open interval $(0,1)$, find the minimum value of $p$.
Seven people of seven different ages are attending a meeting. The seven people leave the meeting one at a
time in random order. Given that the youngest person leaves the meeting sometime before the oldest
person leaves the meeting, the probability that the third, fourth, and fifth people to leave the meeting do so in order of their ages (youngest to oldest) is $\frac{m}{n}$ , where m and n are relatively prime positive integers. Find $m + n$.
(a) Build a function $f : \mathbb R \to \mathbb R_+$ with the property $\left( \mathcal P \right)$, i.e. all $x \in \mathbb Q$ are local, strict minimum points.
(b) Build a function $f : \mathbb Q \to \mathbb R_+$ such that every point is a local, strict minimum point and such that $f$ is unbounded on $I \cap \mathbb Q$, where $I$ is a non-degenerate interval.
(c) Let $f: \mathbb R \to \mathbb R_+$ be a function unbounded on every $I \cap \mathbb Q$, where $I$ is a non-degenerate interval. Prove that $f$ doesn't have the property $\left( \mathcal P \right)$.
Find all nonzero integers $a, b, c, d$ with $a>b>c>d$ that satisfy $ab+cd=34$ and $ac-bd=19.$
The remainder $R$ obtained by dividing $x^{100}$ by $x^2-3x+2$ is a polynomial of degree less than $2$. Then $R$ may be written as:
$\textbf{(A) }2^{100}-1\qquad
\textbf{(B) }2^{100}(x-1)-(x-2)\qquad
\textbf{(C) }2^{100}(x-3)\qquad$
$\textbf{(D) }x(2^{100}-1)+2(2^{99}-1)\qquad
\textbf{(E) }2^{100}(x+1)-(x+2)$
Let $f(x)=cx(x-1)$, where $c$ is a positive real number. We use $f^n(x)$ to denote the polynomial obtained by composing $f$ with itself $n$ times. For every positive integer $n$, all the roots of $f^n(x)$ are real. What is the smallest possible value of $c$?
Let $ M,M'$ be two conjugates point in triangle $ ABC$ (in the sense that $ \angle MAB\equal{}\angle M'AC,\dots$). Let $ P,Q,R,P',Q',R'$ be foots of perpendiculars from $ M$ and $ M'$ to $ BC,CA,AB$. Let $ E\equal{}QR\cap Q'R'$, $ F\equal{}RP\cap R'P'$ and $ G\equal{}PQ\cap P'Q'$. Prove that the lines $ AG, BF, CE$ are parallel.
Let $ABC$ be an acute-angled triangle and $D$ the midpoint of $BC$. Let $E$ be a point on segment $AD$ and $M$ its projection on $BC$. If $N$ and $P$ are the projections of $M$ on $AB$ and $AC$ then the interior angule bisectors of $\angle NMP$ and $\angle NEP$ are parallel.
Positive numbers $ a$, $ b$, $ c$ are such that $ \left(a \plus{} b\right)\left(b \plus{} c\right)\left(c \plus{} a\right) \equal{} 8$. Prove the inequality
\[ \frac {a \plus{} b \plus{} c}{3}\ge\sqrt [27]{\frac {a^3 \plus{} b^3 \plus{} c^3}{3}}
\]
Given a triangle $ABC$ such that $AB<AC$ . On sides $AB$ and $BC$, points $P$ and $Q$ are marked respectively such that the lines $AQ$ and $CP$ are perpendicular, and the circle inscribed in the triangle $ABC$ touches the length $PQ$. The line $CP$ intersects the circle circumscribed around the triangle $ABC$ at the points $C$ and $T$. If the lines $CA,PQ$ and $BT$ intersect at one point, prove that the angle $\angle CAB$ is right.
There are $15$ people attending math team: $12$ students and $3$ captains. One of the captains brings $33$ identical snacks. A nonnegative number of names (students and/or captains) are written on the NO SNACK LIST. At the end of math team, all students each get n snacks, and all captains get $n +1$ snacks, unless the person’s name is written on the board. After everyone’s snacks are distributed, there are none left. Find the number of possible integer values of $n$.
Alice and Bob play a game on a 6 by 6 grid. On his or her turn, a player chooses a rational number not yet appearing in the grid and writes it in an empty square of the grid. Alice goes first and then the players alternate. When all squares have numbers written in them, in each row, the square with the greatest number in that row is colored black. Alice wins if she can then draw a line from the top of the grid to the bottom of the grid that stays in black squares, and Bob wins if she can't. (If two squares share a vertex, Alice can draw a line from one to the other that stays in those two squares.) Find, with proof, a winning strategy for one of the players.
Let $S$ be the set of numbers of the form $n^5 - 5n^3 + 4n$, where $n$ is an integer that is not a multiple of $3$. What is the largest integer that is a divisor of every number in $S$?
Each of the small squares of a $50\times 50$ table is coloured in red or blue. Initially all squares are red. A [i]step[/i] means changing the colour of all squares on a row or on a column.
a) Prove that there exists no sequence of steps, such that at the end there are exactly $2011$ blue squares.
b) Describe a sequence of steps, such that at the end exactly $2010$ squares are blue.
[i]Adriana & Lucian Dragomir[/i]
We color some unit squares in a $ 99\times 99 $ square grid with one of $ 5 $ given distinct colors, such that each color appears the same number of times. On each row and on each column there are no differently colored unit squares. Find the maximum possible number of colored unit squares.
Functions $ f$ and $ g$ are quadratic, $ g(x) \equal{} \minus{} f(100 \minus{} x)$, and the graph of $ g$ contains the vertex of the graph of $ f$. The four $ x$-intercepts on the two graphs have $ x$-coordinates $ x_1$, $ x_2$, $ x_3$, and $ x_4$, in increasing order, and $ x_3 \minus{} x_2 \equal{} 150$. The value of $ x_4 \minus{} x_1$ is $ m \plus{} n\sqrt p$, where $ m$, $ n$, and $ p$ are positive integers, and $ p$ is not divisible by the square of any prime. What is $ m \plus{} n \plus{} p$?
$ \textbf{(A)}\ 602\qquad \textbf{(B)}\ 652\qquad \textbf{(C)}\ 702\qquad \textbf{(D)}\ 752\qquad \textbf{(E)}\ 802$
Compute the circumradius of cyclic hexagon $ABCDEF$, which has side lengths $AB=BC=2$, $CD=DE=9$, and $EF=FA=12$.
Let $P$ be an arbitrary point inside triangle $ABC$, denote by $A_{1}$ (different from $P$) the second intersection of line $AP$ with the circumcircle of triangle $PBC$ and define $B_{1},C_{1}$ similarly. Prove that $\left(1 \plus{} 2\cdot\frac {PA}{PA_{1}}\right)\left(1 \plus{} 2\cdot\frac {PB}{PB_{1}}\right)\left(1 \plus{} 2\cdot\frac {PC}{PC_{1}}\right)\geq 8$.
Let $a,b,c$ be positive real numbers such that $a+b+c = 3$. Find the minimum value of the expression \[A=\dfrac{2-a^3}a+\dfrac{2-b^3}b+\dfrac{2-c^3}c.\]
In triangle $ABC,$ points $M$ and $N$ are the midpoints of $AB$ and $AC,$ respectively, and points $P$ and $Q$ trisect $BC.$ Given that $A, M, P, N,$ and $Q$ lie on a circle and $BC=1,$ compute the area of triangle $ABC.$
Let $\Omega$ be the circumcircle of an acute triangle $ABC$. Points $D$, $E$, $F$ are the midpoints of the inferior arcs $BC$, $CA$, $AB$, respectively, on $\Omega$. Let $G$ be the antipode of $D$ in $\Omega$. Let $X$ be the intersection of lines $GE$ and $AB$, while $Y$ the intersection of lines $FG$ and $CA$. Let the circumcenters of triangles $BEX$ and $CFY$ be points $S$ and $T$, respectively. Prove that $D$, $S$, $T$ are collinear.
[i]Proposed by kyou46 and Li4.[/i]
Let \(\mathbb{R}\) denote the set of real numbers. A subset \(S\subseteq\mathbb{R}\) is called [i]dense[/i] if any non-empty open interval of \(\mathbb{R}\) contains at least one element in \(S\). For a function \(f:\mathbb{R}\to\mathbb{R}\), let \(\mathcal{O}_f(x)\) denote the set \(\left\{x,f(x),f(f(x)),\ldots\right\}\).
(a) Is there a function \(g:\mathbb{R}\to\mathbb{R}\), continuous everywhere in \(\mathbb{R}\) such that \(\mathcal{O}_g(x)\) is dense for all \(x\in\mathbb{R}\) for all \(x\in\mathbb{R}\)?
(b) Is there a function \(h:\mathbb{R}\to\mathbb{R}\), continuous at all but a single \(x_0\in\mathbb{R}\), such that \(\mathcal{O}_h(x)\) is dense for all \(x\in\mathbb{R}\)?
[i]Proposed by the ICMC Problem Committee[/i]
Let $S$ be an infinite set of integers containing zero, and such that the distances between successive number never exceed a given fixed number. Consider the following procedure: Given a set $X$ of integers we construct a new set consisting of all numbers $x \pm s,$ where $x$ belongs to $X$ and s belongs to $S.$ Starting from $S_0 = \{0\}$ we successively construct sets $S_1, S_2, S_3, \ldots$ using this procedure. Show that after a finite number of steps we do not obtain any new sets, i.e. $S_k = S_{k_0}$ for $k \geq k_0.$
Let $AEBC$ be a cyclic quadrilateral. Let $D$ be a point on the ray $AE$ which is outside the circumscribed circumference of $AEBC$. Suppose that $\angle CAB=\angle BAE$. Prove that $AB=BD$ if and only if $DE=AC$.
Let be a $ 3\times 3 $ complex matrix such that $ A^3=I $ and for which exist four real numbers $ a,b,c,d $ with $ a,c\neq 1 $ such that $ \det \left( A^2+aA+bI \right) =\det \left( A^2+cA+dI \right) =0. $ Show that $ a+b=c+d. $
[i]C. Merticaru[/i]