Found problems: 260
Find all triples $(x, y, z)$ such that $x, y, z, x - y, y - z, x - z$ are all prime positive integers.
Find all functions $f : \mathbb{R} \to \mathbb{R} $ which verify the relation
\[(x-2)f(y)+f(y+2f(x))= f(x+yf(x)), \qquad \forall x,y \in \mathbb R.\]
What is the maximum value of $n$ for which there is a set of distinct positive integers $k_1,k_2,\ldots,k_n$ for which \[k_1^2+k_2^2+\ldots+k_n^2=2002?\]
$\textbf{(A) }14\qquad\textbf{(B) }15\qquad\textbf{(C) }16\qquad\textbf{(D) }17\qquad\textbf{(E) }18$
A right circular cone has base radius $ r$ and height $ h$. The cone lies on its side on a flat table. As the cone rolls on the surface of the table without slipping, the point where the cone's base meets the table traces a circular arc centered at the point where the vertex touches the table. The cone first returns to its original position on the table after making $ 17$ complete rotations. The value of $ h/r$ can be written in the form $ 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$.
Consider points $ P$ which are inside the square with side length $ a$ such that the distance from $ P$ to the center of the square equals to the least distance from $ P$ to each side of the square.Find the area of the figure formed by the whole points $ P$.
You have some white one-by-one tiles and some black and white two-bye-one tiles as shown below. There are four different color patterns that can be generated when using these tiles to cover a three-by-one rectangoe by laying these tiles side by side (WWW, BWW, WBW, WWB). How many different color patterns can be generated when using these tiles to cover a ten-by-one rectangle?
[asy]
import graph; size(5cm);
real labelscalefactor = 0.5;
pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps);
draw((12,0)--(12,1)--(11,1)--(11,0)--cycle);
fill((13.49,0)--(13.49,1)--(12.49,1)--(12.49,0)--cycle, black);
draw((13.49,0)--(13.49,1)--(14.49,1)--(14.49,0)--cycle);
draw((15,0)--(15,1)--(16,1)--(16,0)--cycle);
fill((17,0)--(17,1)--(16,1)--(16,0)--cycle, black);
[/asy]
Let $n\ge 3$ be an integer and let $A_{1}, A_{2},\dots, A_{n}$ be $n$ distinct subsets of $S=\{1, 2,\dots, n\}$. Show that there exists $x\in S$ such that the n subsets $A_{i}-\{x\}, i=1,2,\dots n$ are also disjoint.
what i have is [hide="this"]we may assume that the union of the $A_{i}$s is $S$. [/hide]
Let $ABC$ be a triangle with sides of length $a$, $b$ and $c$. Let the bisector of the angle $C$ cut $AB$ in $D$. Prove that the length of $CD$ is \[ \frac{2ab\cos \frac{C}{2}}{a+b}. \]
Show that, for any fixed integer $\,n \geq 1,\,$ the sequence \[2, \; 2^{2}, \; 2^{2^{2}}, \; 2^{2^{2^{2}}}, \cdots \pmod{n}\] is eventually constant.
A $ 6\times 6$ square is dissected in to 9 rectangles by lines parallel to its sides such that all these rectangles have integer sides. Prove that there are always [b]two[/b] congruent rectangles.
Let $n$ be a positive integer, and $x$ be a positive real number. Prove that $$\sum_{k=1}^{n} \left( x \left[\frac{k}{x}\right] - (x+1)\left[\frac{k}{x+1}\right]\right) \leq n,$$ where $[x]$ denotes the largest integer not exceeding $x$.
Maggie Waggie organizes a pile of 127 calculus tests in alphabetical order, with Joccy Woccy's test being 64th in the pile. While Maggie isn't looking, Joccy walks over and randomly scrambles the entire pile of tests. When Maggie returns, she is oblivious to the fact that Joccy has tampered with the list. She uses a binary search algorithm to find Joccy's test, where she looks at the test in the middle of the pile. If the test is not Joccy's, she binary searches the top half of the list if the test appears after Joccy's name when arranged alphabetically, or the bottom half of the list otherwise. The probability that Maggie finds Joccy's test can be expressed as $\frac{p}{q}$. Compute $p+q$.
[i]2022 CCA Math Bonanza Team Round #5[/i]
A multi-digit number is written on the blackboard. Susan puts in a number of plus signs between some pairs of adjacent digits. The addition is performed and the process is repeated with the sum. Prove that regardless of what number was initially on the blackboard, Susan can always obtain a single-digit number in at most ten steps.
Let $a$ and $b$ be positive integers, $b<a$, such that $a^3+b^3+ab$ is divisible by $ab(a-b)$. Prove that $ab$ is a perfect cube.
Given a set of n elements, find the largest number of subsets such that no subset is contained in any other
Given 365 cards, in which distinct numbers are written. We may ask for any three cards, the order of numbers written in them. Is it always possible to find out the order of all 365 cards by 2000 such questions?
Which statement is not true for at least one prime $p$?
$ \textbf{(A)}\ \text{If } x^2+x+3 \equiv 0 \pmod p \text{ has a solution, then } \\ \qquad x^2+x+25 \equiv 0 \pmod p \text{ has a solution.}
\\ \\ \textbf{(B)}\ \text{If } x^2+x+3 \equiv 0 \pmod p \text{ does not have a solution, then} \\ \qquad x^2+x+25 \equiv 0 \pmod p \text{ has no solution}
\\ \\ \qquad\textbf{(C)}\ \text{If } x^2+x+25 \equiv 0 \pmod p \text{ has a solution, then} \\ \qquad x^2+x+3 \equiv 0 \pmod p \text{ has a solution}.
\\ \\ \qquad\textbf{(D)}\ \text{If } x^2+x+25 \equiv 0 \pmod p \text{ does not have a solution, then} \\ \qquad x^2+x+3 \equiv 0 \pmod p \text{ has no solution. }
\\ \\ \qquad\textbf{(E)}\ \text{None}
$
Show that the center of gravity of a convex region in the plane halves at least three chords of the region. [Gy. Hajos]
Define a search algorithm called $\texttt{powSearch}$. Throughout, assume $A$ is a 1-indexed sorted array of distinct integers. To search for an integer $b$ in this array, we search the indices $2^0,2^1,\ldots$ until we either reach the end of the array or $A[2^k] > b$. If at any point we get $A[2^k] = b$ we stop and return $2^k$. Once we have $A[2^k] > b > A[2^{k-1}]$, we throw away the first $2^{k-1}$ elements of $A$, and recursively search in the same fashion. For example, for an integer which is at position $3$ we will search the locations $1, 2, 4, 3$.
Define $g(x)$ to be a function which returns how many (not necessarily distinct) indices we look at when calling $\texttt{powSearch}$ with an integer $b$ at position $x$ in $A$. For example, $g(3) = 4$. If $A$ has length $64$, find
\[g(1) + g(2) + \ldots + g(64).\]
Suppose that $ m$ and $ n$ are odd integers such that $ m^2\minus{}n^2\plus{}1$ divides $ n^2\minus{}1$. Prove that $ m^2\minus{}n^2\plus{}1$ is a perfect square.
If $a, b, c$ are positive integers such that \[0 < a^{2}+b^{2}-abc \le c,\] show that $a^{2}+b^{2}-abc$ is a perfect square.
Find all integers $ k$ such that for infinitely many integers $ n \ge 3$ the polynomial
\[ P(x) =x^{n+ 1}+ kx^n - 870x^2 + 1945x + 1995\]
can be reduced into two polynomials with integer coefficients.
If $ \displaystyle \sum_{n \equal{} 0}^{\infty} \cos^{2n} \theta \equal{} 5$, what is the value of $ \cos{2\theta}$?
$ \textbf{(A)}\ \frac15 \qquad \textbf{(B)}\ \frac25 \qquad \textbf{(C)}\ \frac {\sqrt5}{5}\qquad \textbf{(D)}\ \frac35 \qquad \textbf{(E)}\ \frac45$
Show that there are infinitely many pairs of prime numbers $(p,q)$ such that $p\mid 2^{q-1}-1$ and $q\mid 2^{p-1}-1$.
Suppose that every positve integer has been given one of the colors red, blue,arbitrarily. Prove that there exists an infinite sequence of positive integers $ a_{1} < a_{2} < a_{3} < \cdots < a_{n} < \cdots,$ such that inifinite sequence of positive integers $ a_{1},\frac {a_{1} \plus{} a_{2}}{2},a_{2},\frac {a_{2} \plus{} a_{3}}{2},a_{3},\frac {a_{3} \plus{} a_{4}}{2},\cdots$ has the same color.