Found problems: 85335
Let $p_1$ and $p_2$ be positive real numbers. Prove that there exist functions $f_i\colon \mathbb R \rightarrow \mathbb R$ such that the smallest positive period of $f_i$ is $p_i\, (i=1, 2)$, and $f_1-f_2$ is also periodic. [J. Riman]
Call a set of $n$ lines [i]good[/i] if no $3$ lines are concurrent. These $n$ lines divide the Euclidean plane into regions (possible unbounded). A [i]coloring[/i] is an assignment of two colors to each region, one from the set $\{A_1, A_2\}$ and the other from $\{B_1, B_2, B_3\}$, such that no two adjacent regions (adjacent meaning sharing an edge) have the same $A_i$ color or the same $B_i$ color, and there is a region colored $A_i, B_j$ for any combination of $A_i, B_j$.
A number $n$ is [i]colourable[/i] if there is a coloring for any set of $n$ good lines. Find all colourable $n$.
Altitudes $BE$ and $CF$ of an acute-angled triangle $ABC$ meet at point $H$. The perpendicular from $H$ to $EF$ meets the line $\ell$ passing through $A$ and parallel to $BC$ at point $P$. The bisectors of two angles between $\ell$ and $HP$ meet $BC$ at points $S$ and $T$. Prove that the circumcircles of triangles $ABC$ and $PST$ are tangent.
Let $ABC$ be a triangle in which $AB=AC$. A point $I$ lies inside the triangle such that $\angle ABI=\angle CBI$ and $\angle BAI=\angle CAI$. Prove that \[\angle BIA=90^o+\dfrac{\angle C}{2}\]
Georgina calls a $992$-element subset $A$ of the set $S = \{1, 2, 3, \ldots , 1984\}$ a [b]halfthink set[/b] if
[list]
[*] the sum of the elements in $A$ is equal to half of the sum of the elements in $S$, and
[*] exactly one pair of elements in $A$ differs by $1$.
[/list]
She notices that for some values of $n$, with $n$ a positive integer between $1$ and $1983$, inclusive, there are no halfthink sets containing both $n$ and $n+1$. Find the last three digits of the product of all possible values of $n$.
[i]Proposed by Andrew Wu and Jason Wang[/i]
(Note: wording changed from original to specify what $n$ can be.)
For each number $x$ we denote by $S(x)$ the sum of digits from its decimal representation. Find all positive integers $m$ for each of which there exists a positive integer $n$, such that $$S(n^2-2n+10)=m$$
[i]Chernov S.[/i]
Let $n$ be a positive integer . If $\sigma$ is a permutation of the first $n$ positive integers , let $S(\sigma)$ be the set of all distinct sums of the form $\sum_{i=k}^{l} \sigma(i)$ where $1 \leq k \leq l \leq n$ .
[b](a)[/b] Exhibit a permutation $\sigma$ of the first $n$ positive integers such that $|S(\sigma)|\geq \left \lfloor{\frac{(n+1)^2}{4}}\right \rfloor $.
[b](b)[/b] Show that $|S(\sigma)|>\frac{n\sqrt{n}}{4\sqrt{2}}$ for all permutations $\sigma$ of the first $n$ positive integers .
Consider sequences $a$ of the form $a = (a_1, a_2, ... , a_{20})$ such that each term $a_i$ is either $0$ or $1$. For each such sequence $a$, we can produce a sequence $b = (b_1, b_2, ..., b_{20})$, where $$b_i\begin{cases} a_i + a_{i+1} & i = 1 \\ a_{i-1} + a_i + a_{i+1} & 1 < i < 20\\ a_{i-1} + a_i &i = 20 \end{cases}$$
In two bowls there are in total ${N}$ balls, numbered from ${1}$ to ${N}$. One ball is moved from one of the bowls into the other. The average of the numbers in the bowls is increased in both of the bowls by the same amount, ${x}$. Determine the largest possible value of ${x}$.
Four disks with disjoint interiors are mutually tangent. Three of them are equal in size and the fourth one is smaller. Find the ratio of the radius of the smaller disk to one of the larger disks.
If $a$, $b$, $c$ are rational, show that
\[
\frac{1}{(b-c)^2}+\frac{1}{(c-a)^2}+\frac{1}{(a-b)^2}
\]
is the square of a rational.
Let $p > 5$ be a prime number. Show that there exists a prime number $q < p$ and a positive integer $n$ such that $p$ divides $n^2-q$.
[i]Proposed by Andrew Gu.[/i]
Let $m,n,a_1,a_2,\dots,a_n$ be positive integers and $r$ be a real number. Prove that the equation
\[\lfloor a_1x\rfloor+\lfloor a_2x\rfloor+\cdots+\lfloor a_nx\rfloor=sx+r\]
has exactly $ms$ solutions in $x$, where $s=a_1+a_2+\cdots+a_n+\frac1m$.
[i]Linus Tang[/i]
The plan of the castle in Baranow Sandomierski can be presented as the graph with $16$ vertices on the picture.
A night guard plans a closed round along the edges of this graph.
(a) How many rounds passing through each vertex exactly once are there? The directions are irrelevant.
(b) How many non-selfintersecting rounds (taking directions into account) containing each edge of the graph exactly once are there?
[img]https://cdn.artofproblemsolving.com/attachments/1/f/27ca05fc689fd8d873130db9d8cc52acf49bb4.png[/img]
The degrees of polynomials $P$ and $Q$ with real coefficients do not exceed $n$. These polynomials satisfy the identity
\[ P(x) x^{n + 1} + Q(x) (x+1)^{n + 1} = 1. \]
Determine all possible values of $Q \left( - \frac{1}{2} \right)$.
Let $M$ and $N$ are midpoint of edges $AB$ and $CD$ of the tetrahedron $ABCD$, $AN=DM$ and $CM=BN$. Prove that $AC=BD$.
S. Berlov
Let $f, g : \mathbb R \to \mathbb R$ be two functions such that $g\circ f : \mathbb R \to \mathbb R$ is an injective function. Prove that $f$ is also injective.
Joe and Penny play a game. Initially there are $5000$ stones in a pile, and the two players remove stones from the pile by making a sequence of moves. On the $k$-th move, any number of stones between $1$ and $k$ inclusive may be removed. Joe makes the odd-numbered moves and Penny makes the even-numbered moves. The player who removes the very last stone is the winner. Who wins if both players play perfectly?
Given that the height of a greater sage grouse flying through the air is defined by the function $64x-x^2$ for $0<x<64$, what is the first time at which the bird reaches a height of 903?
[i]2022 CCA Math Bonanza Lightning Round 2.3[/i]
Find the number of primes$ p$, such that $ x^{3} \minus{}5x^{2} \minus{}22x\plus{}56\equiv 0\, \, \left(mod\, p\right)$ has no three distinct integer roots in $ \left[0,\left. p\right)\right.$.
$\textbf{(A)}\ 1 \qquad\textbf{(B)}\ 2 \qquad\textbf{(C)}\ 3 \qquad\textbf{(D)}\ 4 \qquad\textbf{(E)}\ \text{None}$
Sum of all roots of the equation
$$cos^{100} x + a_1 cos^{99} x + a_2cos^{98} x +... + a_99 cos x+ a_{100} = 0$$, in interval $\left[\pi, \frac{3\pi}{2} \right]$, is equal to $21\pi$, and the sum of all roots of the equation
$$sin^{100} x + a_1 sin^{99} x + a_2sin ^{98} x +... + a_99sin x+ a_{100} = 0$$, in the same interval, is equal to $24\pi $. How many roots does the first equation have on the segment $\left[ \frac{\pi}{2}, \pi\right]$?
Jerry buys a bottle of 150 pills. Using a standard 12 hour clock, he sees that the clock reads exactly 12 when he takes the first pill. If he takes one pill every five hours, what hour will the clock read when he takes the last pill in
the bottle?
Find all real-valued functions $f$ on the reals such that $f(-x) = -f(x)$, $f(x+1) = f(x) + 1$ for all $x$, and $f\left(\dfrac{1}{x}\right) = \dfrac{f(x)}{x^2}$ for $x \not = 0$.
An accurate 12-hour analog clock has an hour hand, a minute hand, and a second hand that are aligned at 12:00 o’clock and make one revolution in 12 hours, 1 hour, and 1 minute, respectively. It is well known, and not difficult to prove, that there is no time when the three hands are equally spaced around the clock, with each separating angle $ \frac{2 \cdot \pi}{3}.$ Let $ f(t), g(t), h(t)$ be the respective absolute deviations of the separating angles from \frac{2 \cdot \pi}{3} at $ t$ hours after 12:00 o’clock. What is the minimum value of $ max\{f(t), g(t), h(t)\}?$
A banker learned that among similarly looking golden coins, exactly one is counterfeit and has less weight.
The banker asked an expert to determine the coin by means of a balance, and demanded each coin should participate in no more than two weightings in order to not wear out the coin, thereby losing market value. What is the largest number of coins the banker could have had, given that the expert successfully completed his task?