Found problems: 85335
There are 50 slips of paper numbered from 1 to 50. It is desired to pick 3 slips such that for any of the three numbers, divided by the greatest common divisor of the other two, the square root of the result is a rational number.
How many unordered triples of slips satisfy this condition?
Two circles with centers $A$ and $B$ intersect at points $X$ and $Y$. The minor arc $\angle{XY}=120$ degrees with respect to circle $A$, and $\angle{XY}=60$ degrees with respect to circle $B$. If $XY=2$, find the area shared by the two circles.
Prove that for every integer $S\ge100$ there exists an integer $P$ for which the following story could hold true:
The mathematician asks the shop owner: ``How much are the table, the cabinet and the bookshelf?'' The shop owner replies: ``Each item costs a positive integer amount of Euros. The table is more expensive than the cabinet, and the cabinet is more expensive than the bookshelf. The sum of the three prices is $S$ and their product is $P$.''
The mathematician thinks and complains: ``This is not enough information to determine the three prices!''
(Proposed by Gerhard Woeginger, Austria)
Let $m,n \geqslant 2$ be integers, let $X$ be a set with $n$ elements, and let $X_1,X_2,\ldots,X_m$ be pairwise distinct non-empty, not necessary disjoint subset of $X$. A function $f \colon X \to \{1,2,\ldots,n+1\}$ is called [i]nice[/i] if there exists an index $k$ such that \[\sum_{x \in X_k} f(x)>\sum_{x \in X_i} f(x) \quad \text{for all } i \ne k.\] Prove that the number of nice functions is at least $n^n$.
Let $\{a_n\}^{\infty}_0$ and $\{b_n\}^{\infty}_0$ be two sequences determined by the recursion formulas
\[a_{n+1} = a_n + b_n,\]
\[ b_{n+1} = 3a_n + b_n, n= 0, 1, 2, \cdots,\]
and the initial values $a_0 = b_0 = 1$. Prove that there exists a uniquely determined constant $c$ such that $n|ca_n-b_n| < 2$ for all nonnegative integers $n$.
Each square of the chessboard was painted in one of eight colors in such a way that the number of squares colored by all the colors are equal. Is it always possible to put $8$ rooks not threatening each other on multi-colored cells?
Consider a function $ f:\mathbb{R}\longrightarrow\mathbb{R} $ that admits bounded primitives. Prove that the function $ g:\mathbb{R}\longrightarrow\mathbb{R} $ defined as
$$ f(x)=\left\{ \begin{matrix} x, & \quad x\le 0 \\ f(1/x)\cdot\ln x ,& \quad x>0 \end{matrix}\right. $$
admits primitives.
[i]Florian Dumitrel[/i]
Six altitudes are constructed from the three vertices of the base of a tetrahedron to the opposite sides of the three lateral faces. Prove that all three straight lines joining two base points of the altitudes in each lateral face are parallel to a certain plane.
(IF Sharygin, Moscow)
Let $\Lambda= \{1, 2, \ldots, 2v-1,2v\}$ and $P=\{\alpha_1, \alpha_2, \ldots, \alpha_{2v-1}, \alpha_{2v}\}$ be a permutation of the elements of $\Lambda$.
(a) Prove that
$$\sum_{i=1}^v \alpha_{2i-1}\alpha_{2i} \leq \sum_{i=1}^v (2i-1)2i.$$
(b) Determine the largest positive integer $m$ such that we can partition the $m\times m$ square into $7$ rectangles for which every pair of them has no common interior points and their lengths and widths form the following sequence:
$$1,2,3,4,5,6,7,8,9,10,11,12,13,14.$$
Let $m, n \ge 2$ be distinct positive integers. In an infinite grid of unit squares, each square is filled with exactly one real number so that
[list]
[*]In each $m \times m$ square, the sum of the numbers in the $m^2$ cells is equal.
[*]In each $n \times n$ square, the sum of the numbers in the $n^2$ cells is equal.
[*]There exist two cells in the grid that do not contain the same number.
[/list]
Let $S$ be the set of numbers that appear in at least one square on the grid. Find, in terms of $m$ and $n$, the least possible value of $|S|$.
[i]Kiran Reddy[/i]
Find the sum of all integer values of $n$ such that the equation $\frac{x}{(yz)^2} + \frac{y}{(zx)^2} + \frac{z}{(xy)^2} = n$ has a solution in positive integers.
An ant, which is on an edge of a cube of side $8$, must travel on the surface and return to the starting point. It's path must contain interior points of the six faces of the cube and should visit only once each face of the cube. Find the length of the path that the ant can carry out and justify why it is the shortest path.
Let $S$ be an infinite set of positive integers, such that there exist four pairwise distinct $a,b,c,d \in S$ with $\gcd(a,b) \neq \gcd(c,d)$. Prove that there exist three pairwise distinct $x,y,z \in S$ such that $\gcd(x,y)=\gcd(y,z) \neq \gcd(z,x)$.
Let the set consisting of the squares of the positive integers be called $u$; thus $u$ is the set $1, 4, 9, 16 . . .$. If a certain operation on one or more members of the set always yields a member of the set, we say that the set is closed under that operation. Then $u$ is closed under:
${{ \textbf{(A)}\ \text{Addition}\qquad\textbf{(B)}\ \text{Multiplication} \qquad\textbf{(C)}\ \text{Division} \qquad\textbf{(D)}\ \text{Extraction of a positive integral root} }\qquad\textbf{(E)} \text{None of these} } $
Find the smallest odd integer $ k$ such that: for every $ 3\minus{}$degree polynomials $ f$ with integer coefficients, if there exist $ k$ integer $ n$ such that $ |f(n)|$ is a prime number, then $ f$ is irreducible in $ \mathbb{Z}[n]$.
Let $a,b,c>0$ and $abc=1$ . Prove that $$ \sqrt{2(1+a^2)(1+b^2)(1+c^2)}\ge 1+a+b+c.$$
Let $m,n$ be naturals satisfying $n \geq m \geq 2$ and let $S$ be a set consisting of $n$ naturals. Prove that $S$ has at least $2^{n-m+1}$ distinct subsets, each whose sum is divisible by $m$. (The zero set counts as a subset).
Given a polynomial with integer coefficients, which has at least one integer root. The greatest common divisor of all its integer roots equals $1$. Prove that if the leading coefficient of the polynomial equals $1$ then the greatest common divisor of the other coefficients also equals $1$.
The cells of a $8 \times 8$ table are colored either black or white so that each row has a different number of black squares, and each column has a different number of black squares. What is the maximum number of pairs of adjacent cells of different colors?
Two circles of different radii are cut out of cardboard. Each circle is subdivided into $200$ equal sectors. On each circle $100$ sectors are painted white and the other $100$ are painted black. The smaller circle is then placed on top of the larger circle, so that their centers coincide. Show that one can rotate the small circle so that the sectors on the two circles line up and at least $100$ sectors on the small circle lie over sectors of the same color on the big circle.
Let $T$ be a set of natural numbers, each of which is greater than 1. A subset $S$ of $T$ is called “good”, if for each $t\in T$ there exists $s\in S$, for which $gcd(t,s)>1$. Prove that the number of "good" subsets of $T$ is odd.
The side lengths of a triangle area $t$ form an arithmetic progression with difference $d$. Find the sides and angles of the triangle. Specifically, solve this problem for $d=1$ and $t=6$.
Every day, Kaori flips a fair coin. She practices her violin if and only if the coin comes up heads. The probability that she practices at least five days this week can be written in simplest form as $\frac{m}{n}$. Compute $m + n$
A dog owns $4$ different color shoes and $4$ identical green socks. He can fit every shoe and sock on each of his four distinguishable paws. In how many different orders can he put on the shoes and socks, provided that on each paw he must put on the sock before the shoe?
[i]2015 CCA Math Bonanza Individual Round #11[/i]
Let $ABC$ be a right-angle triangle with $\angle B=90^{\circ}$. Let $D$ be a point on $AC$ such that the inradii of the triangles $ABD$ and $CBD$ are equal. If this common value is $r^{\prime}$ and if $r$ is the inradius of triangle $ABC$, prove that
\[ \cfrac{1}{r'}=\cfrac{1}{r}+\cfrac{1}{BD}. \]