Found problems: 85335
Let $S$ be the set of positive integers. For any $a$ and $b$ in the set we have $GCD(a, b)>1$. For any $a$, $b$ and $c$ in the set we have $GCD(a, b, c)=1$. Is it possible that $S$ has $2012$ elements?
[i]Proposed by Ognjen Stipetić.[/i]
[i]George the grasshopper[/i] lives of the real line, starting at $0$ . He is given the following sequence of numbers: $2, 3, 4, 8, 9, ... ,$ which are all the numbers of the form $2^k$ or $3^l$, $k, l \in \mathbb{N}$, arranged in increasing order. Starting from $2$, for each number $x$ in the sequence in order, he (currently at $a$) must choose to jump to either $a+x$ or $a-x$. Show that [i]George the grasshopper[/i] can jump in a way that he reaches every integer on the real line.
Natural numbers have been divided in groups as follow: $(1), (2, 4), (3, 5, 7), (6, 8, 10, 12), (9, 11, 13, 15, 17), \ldots$. Let $S_n$ be the sum of the elements of the $n$th group. Prove that $\frac{S_{2n+1}}{2n+1}-\frac{S_{2n}}{2n}$ is even.
In rectangle $ABCD$, $AB = 3$ and $BC = 4$. If the feet of the perpendiculars from $B$ and $D$ to $AC$ are $X$ and $Y$ , the length of $X Y$ can be expressed in the form m/n , where m and n are relatively prime positive integers. Find $m +n$.
Let $g(k)$ be the number of partitions of a $k$-element set $M$, i.e., the number of families $\{ A_1,A_2,\ldots ,A_s\}$ of nonempty subsets of $M$ such that $A_i\cap A_j=\emptyset$ for $i\not= j$ and $\bigcup_{i=1}^n A_i=M$. Prove that, for every $n$,
\[n^n\le g(2n)\le (2n)^{2n}\]
Julius has a set of five positive integers whose mean is 100. If Julius removes the median of the set of five numbers, the mean of the set increases by 5, and the median of the set decreases by 5. Find the maximum possible value of the largest of the five numbers Julius has.
How many positive integers less than or equal to $1000$ are divisible by $2$ and $3$ but not by $5$?
[i]2015 CCA Math Bonanza Individual Round #6[/i]
There are $20$ points marked on a circle. Two players take turns drawing chords with ends at marked points that do not intersect the already drawn chords. The one who cannot make the next move loses. Who can secure their win?
Let $f \colon [0,1] \to \mathbb{R} $ be a differentiable function such that its derivative is an integrable function on $[0,1]$, and $f(1)=0$. Prove that \[ \int_0^1 (xf'(x))^2 dx \geq 12 \cdot \left( \int_0^1 xf(x) dx\right)^2 \]
a) Determine the largest real number $A$ with the following property: For all non-negative real numbers $x,y,z$, one has
\[\frac{1+yz}{1+x^2}+\frac{1+zx}{1+y^2}+\frac{1+xy}{1+z^2} \ge A.\]
b) For this real number $A$, find all triples $(x,y,z)$ of non-negative real numbers for which equality holds in the above inequality.
Let $ S \equal{} \{1,2,3,\cdots ,280\}$. Find the smallest integer $ n$ such that each $ n$-element subset of $ S$ contains five numbers which are pairwise relatively prime.
Let $ABC$ be an acute triangle with circumcircle $\omega$. The altitudes $AD$, $BE$ and $CF$ of the triangle $ABC$ intersect at point $H$. A point $K$ is chosen on the line $EF$ such that $KH\parallel BC$. Prove that the reflection of $H$ in $KD$ lies on $\omega$.
Two people, $A$ and $B$, play the following game with a deck of 32 cards. With $A$ starting, and thereafter the players alternating, each player takes either 1 card or a prime number of cards. Eventually all of the cards are chosen, and the person who has none to pick up is the loser. Who will win the game if they both follow optimal strategy?
Jane's mother bakes cookies for Jane to share with her $6$ friends. When the cookies are evenly divided among the $7$ children (Jane and her $6$ friends), there is one cookie left over. Given that each child receives at least $1$ cookie, and Jane's mother baked less than $100$ cookies, how many different numbers of cookies could Jane's mother have baked? For example, she could have baked $15$ cookies, because each child receives $2$ cookies, with $1$ left over.
$\textbf{(A) }9\qquad\textbf{(B) }11\qquad\textbf{(C) }14\qquad\textbf{(D) }15\qquad\textbf{(E) }17$
If $x,y,z$ satisfy the system of equations
\[xy+yz+zx=23\]
\[\frac{y}{x+y}+\frac{z}{y+z}+\frac{x}{z+x}=-1\]
\[\frac{z^2x}{x+y}+\frac{x^2y}{y+z}+\frac{y^2z}{z+x}=202\]
Find the value of $x^2+y^2+z^2$.
[i]Proposed by Harry Kim[/i]
Let $f(n)$ be the sum of the digits of $n$. Find $\displaystyle{\sum_{n=1}^{99}f(n)}$.
For each pair $(a,b)$ of positive integers, determine all non-negative integers $n$ such that \[b+\left\lfloor{\frac{n}{a}}\right\rfloor=\left\lceil{\frac{n+b}{a}}\right\rceil.\]
Let $ABC$ be an acute-angled triangle of area 1. Show that the triangle whose vertices are the feet of the perpendiculars from the centroid $G$ to
$AB$, $BC$, $CA$ has area between $\frac 4{27}$ and $\frac 14$.
In quadrilateral $ABCD$, $AC = BD$ and $\measuredangle B = 60^\circ$. Denote by $M$ and $N$ the midpoints of $\overline{AB}$ and $\overline{CD}$, respectively. If $MN = 12$ and the area of quadrilateral $ABCD$ is 420, then compute $AC$.
[i]Proposed by Aaron Lin[/i]
Let $n$ be a positive integer and $A=\{ 1,2,\ldots ,n\}$. A subset of $A$ is said to be connected if it consists of one element or several consecutive elements. Determine the maximum $k$ for which there exist $k$ distinct subsets of $A$ such that the intersection of any two of them is connected.
Select a number $X$ from the set of all $3$-digit natural numbers uniformly at random. Let $A \in [0,1]$ be the probability that $X$ is divisible by $11$, given that it is palindromic. Let $B \in [0,1]$ be the probability that X is palindromic, given that it is divisible by $11$. Compute $B-A$.
Recall that a $3$-digit number is a palindrome if it reads the same left to right as right to left. For instance, $484$ is a palindrome, but $603$ is not a palindrome.
On a table there is a pile with $ T$ tokens which incrementally shall be converted into piles with three tokens each. Each step is constituted of selecting one pile removing one of its tokens. And then the remaining pile is separated into two piles. Is there a sequence of steps that can accomplish this process?
a.) $ T \equal{} 1000$ (Cono Sur)
b.) $ T \equal{} 2001$ (BWM)
$77$ stones weighing $1,2,\dots, 77$ grams are divided into $k$ groups such that total weights of each group are different from each other and each group contains less stones than groups with smaller total weights. For how many $k\in \{9,10,11,12\}$, is such a division possible?
$
\textbf{(A)}\ 4
\qquad\textbf{(B)}\ 3
\qquad\textbf{(C)}\ 2
\qquad\textbf{(D)}\ 1
\qquad\textbf{(E)}\ \text{None of above}
$
There are sixteen buildings all on the same side of a street. How many ways can we choose a nonempty subset of the buildings such that there is an odd number of buildings between each pair of buildings in the subset?
[i]Proposed by Yiming Zheng
Consider an isosceles triangle $KL_1L_2$ with $|KL_1|=|KL_2|$ and let $KA, L_1B_1,L_2B_2$ be its angle bisectors. Prove that $\cos \angle B_1AB_2 < \frac35$