Found problems: 85335
Find all non-zero real numbers $a, b, c$ such that the following polynomial has four (not necessarily distinct) positive real roots.
$$P(x) = ax^4 - 8ax^3 + bx^2 - 32cx + 16c$$
Let's consider the graph of a square trinomial having roots $1$ and $4$. Let's draw two tangents to it from point $O$ (the origin of coordinates), touching it at points $A$ and $B$. What values can the cosine of angle $\angle AOB$ take?
Betal marks $2021$ points on the plane such that no three are collinear, and draws all possible segments joining these. He then chooses any $1011$ of these segments, and marks their midpoints. Finally, he chooses a segment whose midpoint is not marked yet, and challenges Vikram to construct its midpoint using [b]only[/b] a straightedge. Can Vikram always complete this challenge?
[i]Note.[/i] A straightedge is an infinitely long ruler without markings, which can only be used to draw the line joining any two given distinct points.
[i]Proposed by Prithwijit De and Sutanay Bhattacharya[/i]
Find the value(s) of $ x$ such that $ 8xy\minus{}12y\plus{}2x\minus{}3\equal{}0$ is true for all values of $ y$.
$ \textbf{(A)}\ \frac{2}{3} \qquad
\textbf{(B)}\ \frac{3}{2}\text{ or }\minus{}\frac{1}{4} \qquad
\textbf{(C)}\ \minus{}\frac{2}{3}\text{ or }\minus{}\frac{1}{4} \qquad
\textbf{(D)}\ \frac{3}{2} \qquad
\textbf{(E)}\ \minus{}\frac{3}{2}\text{ or }\minus{}\frac{1}{4}$
Two circles have radius 5 and 26. The smaller circle passes through center of the larger one. What is the difference between the lengths of the longest and shortest chords of the larger circle that are tangent to the smaller circle?
[i]Ray Li.[/i]
Let $n$ be a positive integer. On a blackboard, Bobo writes a list of $n$ non-negative integers. He then performs a sequence of moves, each of which is as follows:
-for each $i = 1, . . . , n$, he computes the number $a_i$ of integers currently on the board that are at most $i$,
-he erases all integers on the board,
-he writes on the board the numbers $a_1, a_2,\ldots , a_n$.
For instance, if $n = 5$ and the numbers initially on the board are $0, 7, 2, 6, 2$, after the first move the numbers on the board will be $1, 3, 3, 3, 3$, after the second they will be $1, 1, 5, 5, 5$, and so on.
(a) Show that, whatever $n$ and whatever the initial configuration, the numbers on the board will eventually not change any more.
(b) As a function of $n$, determine the minimum integer $k$ such that, whatever the initial configuration, moves from the $k$-th onwards will not change the numbers written on the board.
A 0-1 sequence of length $2^k$ is given. Alice can pick a member from the sequence, and reveal it (its place and its value) to Bob. Find the largest number $s$ for which Bob can always pick $s$ members of the sequence, and guess all their values correctly.
Alice and Bob can discuss a strategy before the game with the aim of maximizing the number of correct guesses of Bob. The only information Bob has is the length of the sequence and the member of the sequence picked by Alice.
An airport contains 25 terminals which are two on two connected by tunnels. There is exactly 50 main tunnels which can be traversed in the two directions, the others are with single direction. A group of four terminals is called [i]good[/i] if of each terminal of the four we can arrive to the 3 others by using only the tunnels connecting them. Find the maximum number of good groups.
Find all positive integers $m$ such that there exists integers $x$ and $y$ that satisfies $$m \mid x^2+11y^2+2022.$$
Let $D$ be a point on the circumcircle of some triangle $ABC$. Let $E, F$ be points on $AC$, $AB$, respectively, such that $A,D,E,F$ are concyclic. Let $M$ be the midpoint of $BC$. Show that if $DM$, $BE$, $CF$ are concurrent, then either $BE \cap CF$ is on the circle $ADEF$, or $EF$ is parallel to $BC$.
[i]proposed by USJL[/i]
Let $n \ne 0$ be a natural number and integers $x_1, x_2, ...., x_n, y_1, y_2, ...., y_n$ with the properties:
a) $x_1 + x_2 + .... + x_n = y_1 + y_2 + .... + y_n = 0,$
b) $x_1 ^ 2 + y_1 ^ 2 = x_2 ^ 2 + y_2 ^ 2 = .... = x_n ^ 2 + y_n ^ 2$.
Show that $n$ is even.
There are integers $a$, $b$, and $c$, each greater than 1, such that $$\sqrt[a]{N \sqrt[b]{N \sqrt[c]{N}}} = \sqrt[36]{N^{25}}$$ for all $N > 1$. What is $b$?
$\textbf{(A)}\ 2\qquad\textbf{(B)}\ 3\qquad\textbf{(C)}\ 4\qquad\textbf{(D)}\ 5\qquad\textbf{(E)}\ 6$
Simon is playing chess. He wins with probability 1/4, loses with probability 1/4, and draws with probability 1/2. What is the probability that, after Simon has played 5 games, he has won strictly more games than he has lost?
[i]2016 CCA Math Bonanza Individual #7[/i]
For a table $n \times 9$ ($n$ rows and $9$ columns), determine the maximum of $n$ that we can write one number in the set $\left\{ {1,2,...,9} \right\}$ in each cell such that these conditions are satisfied:
1. Each row contains enough $9$ numbers of the set $\left\{ {1,2,...,9} \right\}$.
2. Any two rows are distinct.
3. For any two rows, we can find at least one column such that the two intersecting cells between it and the two rows contain the same number.
Let $\triangle ABC$ be a triangle with $AB = 10.$ Let $D$ be a point on the opposite side of line $AC$ as $B$ so that $\triangle ACD$ is directly similar to $\triangle ABC$ (i.e. $\angle ACD = \angle ABC,$ etc). Let $M$ be the midpoint of $AD.$ Given that $A$ is the centroid of triangle $\triangle BCM,$ compute $BC^2.$
.
A circle with center $I$ and radius $r$ is inscribed in a triangle $ABC$ with a right angle at $C$. Rays $AI$ and $CI$ meet the opposite sides at $D$ and $E$ respectively. Prove that $\frac{1}{AE}+\frac{1}{BD}=\frac{1}{r}$
Given a triangle $ABC$ satisfying $AC+BC=3\cdot AB$. The incircle of triangle $ABC$ has center $I$ and touches the sides $BC$ and $CA$ at the points $D$ and $E$, respectively. Let $K$ and $L$ be the reflections of the points $D$ and $E$ with respect to $I$. Prove that the points $A$, $B$, $K$, $L$ lie on one circle.
[i]Proposed by Dimitris Kontogiannis, Greece[/i]
Given positive numbers $a_1, a_2, ..., a_m, b_1, b_2, ..., b_n$. Is known that $$a_1+a_2+...+a_m=b_1+b_2+...+b_n.$$ Prove that you can fill an empty table with $m$ rows and $n$ columns with no more than $(m+n-1)$ positive number in such a way, that for all $i,j$ the sum of the numbers in the $i$-th row will equal to $a_i$, and the sum of the numbers in the $j$-th column -- to $b_j$.
Let $n\ge3$ be an integer. A regular $n$-gon $P$ is given. We randomly select three distinct vertices of $P$. The probability that these three vertices form an isosceles triangle is $1/m$, where $m$ is an integer. How many such integers $n\le 2024$ are there?
\[\rm a. ~674\qquad \mathrm b. ~675\qquad \mathrm c. ~682 \qquad\mathrm d. ~684\qquad\mathrm e. ~685\]
Let $ABC$ be a triangle. $F$ and $L$ are two points on the side $[AC]$ such that $AF=LC< AC/2$.
Find the mesure of the angle $\angle FBL$ knowing that $AB^{2}+BC^{2}=AL^{2}+LC^{2}$.
For what positive integer $k$ is $\binom{100}{k} \binom{200}{k}$ maximal?
We consider the sequences strictely increasing $(a_0,a_1,...)$ of naturals which have the following property :
For every natural $n$, there is exactly one representation of $n$ as $a_i+2a_j+4a_k$, where $i,j,k$ can be equal.
Prove that there is exactly a such sequence and find $a_{2002}$
$A, B, C$ can walk at $5$ km/hr. They have a car that can accomodate any two of them whch travels at $50$ km/hr. Can they reach a point $62$ km away in less than $3$ hrs?
Maisy and Jeff are playing a game with a deck of cards with $4$ $0$’s, $4$ $1$’s, $4$ $2$’s, all the way up to $4$ $9$’s. You cannot tell apart cards of the same number. After shuffling the deck, Maisy and Jeff each take $4$ cards, make the largest $4$-digit integer they can, and then compare. The person with the larger $4$-digit integer wins. Jeff goes first and draws the cards $2,0,2,1$ from the deck. Find the number of hands Maisy can draw to beat that, if the order in which she draws the cards matters.
[i]Proposed by Richard Chen[/i]
In base ten, the number $100! = 100 \cdot 99 \cdot 98 \cdot 97... 2 \cdot 1$ has $158$ digits, and the last $24$ digits are all zeros. Find the number of zeros there are at the end of this same number when it is written in base $24$.