Found problems: 85335
The number \(n\) can be written in base \(14\) as \(\underline{a}\) \(\underline{b}\) \(\underline{c}\), can be written in base \(15\) as \(\underline{a}\) \(\underline{c}\) \(\underline{b}\), and can be written in base \(6\) as \(\underline{a}\) \(\underline{c}\) \(\underline{a}\) \(\underline{c}\), where \(a > 0\). Find the base-\(10\) representation of \(n\).
Find the smallest positive integer $n$ such that $n^4 + (n+1)^4$ is composite.
Given is a non-isosceles triangle $ABC$ with $\angle ABC=60^{\circ}$, and in its interior, a point $T$ is selected such that $\angle ATC= \angle BTC=\angle BTA=120^{\circ}$. Let $M$ the intersection point of the medians in $ABC$. Let $TM$ intersect $(ATC)$ at $K$. Find $TM/MK$.
Let $x_{n} = \sin^2(n^\circ)$. What is the mean of $x_{1}, x_{2}, x_{3}, \cdots, x_{90}$?
$
\textbf{(A) }\frac{11}{45} \qquad
\textbf{(B) }\frac{22}{45} \qquad
\textbf{(C) }\frac{89}{180} \qquad
\textbf{(D) }\frac{1}{2} \qquad
\textbf{(E) }\frac{91}{180} \qquad
$
Iskandar arranged $n \in N$ integer numbers in a circle, the sum of which is $2n-1$. Crescentia now selects one of these numbers and name the given numbers in clockwise direction with $a_1,a_2,...., a_n$. Show that she can choose the starting number such that for all $k \in \{1, 2,..., n\}$ the inequality $a_1 + a_2 +...+ a_k \le 2k -1$ holds.
Kevin and Yang are playing a game. Yang has $2017 + \tbinom{2017}{2}$ cards with their front sides face down on the table. The cards are constructed as follows: [list] [*] For each $1 \le n \le 2017$, there is a blue card with $n$ written on the back, and a fraction $\tfrac{a_n}{b_n}$ written on the front, where $\gcd(a_n, b_n) = 1$ and $a_n, b_n > 0$. [*] For each $1 \le i < j \le 2017$, there is a red card with $(i, j)$ written on the back, and a fraction $\tfrac{a_i+a_j}{b_i+b_j}$ written on the front. [/list] It is given no two cards have equal fractions. In a turn Kevin can pick any two cards and Yang tells Kevin which card has the larger fraction on the front. Show that, in fewer than $10000$ turns, Kevin can determine which red card has the largest fraction out of all of the red cards.
There are $n\geq 3$ cities in a country and between any two cities $A$ and $B$, there is either a one way road from $A$ to $B$, or a one way road from $B$ to $A$ (but never both). Assume the roads are built such that it is possible to get from any city to any other city through these roads, and define $d(A,B)$ to be the minimum number of roads you must go through to go from city $A$ to $B$. Consider all possible ways to build the roads. Find the minimum possible average value of $d(A,B)$ over all possible ordered pairs of distinct cities in the country.
Points $K,A,L,C,I,T,E$ are such that triangles $CAT$ and $ELK$ are equilateral, share a center $I,$ and points $E,L,K$ lie on sides $CA, AT, TC$ respectively. If the area of triangle $CAT$ is double the area of triangle $ELK$ and $CI = 2,$ compute the minimum possible value of $CK.$
Let $a$ be a positive integer. Determine all $a$ such that the equation
$$ \biggl( 1+\frac{1}{x} \biggr) \cdot \biggl( 1+\frac{1}{x+1} \biggr) \cdots \biggl( 1+\frac{1}{x+a} \biggr)=a-x$$
has at least one integer solution for $x$.
For every such $a$ state the respective solutions.
(Richard Henner)
Let $k,n\ge 1$ be relatively prime integers. All positive integers not greater than $k+n$ are written in some order on the blackboard. We can swap two numbers that differ by $k$ or $n$ as many times as we want. Prove that it is possible to obtain the order $1,2,\dots,k+n-1, k+n$.
Find the largest prime number less than $2008$ that is a divisor of some integer in the infinite sequence \[\left\lfloor\dfrac{2008}1\right\rfloor,\,\,\,\,\,\,\,\,\,\left\lfloor\dfrac{2008^2}2\right\rfloor,\,\,\,\,\,\,\,\,\,\left\lfloor\dfrac{2008^3}3\right\rfloor,\,\,\,\,\,\,\,\,\,\left\lfloor\dfrac{2008^4}4\right\rfloor,\,\,\,\,\,\,\,\,\,\ldots.\]
Find the largest integer $A$ such that, for any permutation of the natural numbers not exceeding $100$, the sum of some ten successive numbers is at least $A$.
Find any polynomial with integer coefficients, the smallest value of which on the entire line is equal to :
a) $-\sqrt2$
b) $\sqrt2$
Let $ABC$ be a regular triangle. The line passing through the midpoint of $AB$ and parallel to $AC$ meets the minor arc $AB$ of the circumcircle at point $K$. Prove that the ratio $AK:BK$ is equal to the ratio of the side and the diagonal of a regular pentagon.
In acute $\vartriangle ABC$, let points $D$, $E,$ and $F$ be the feet of the altitudes of the triangle from $A$, $B$,and $C$, respectively. The area of $\vartriangle AEF$ is $1$, the area of $\vartriangle CDE$ is $2$, and the area of $\vartriangle BF D$ is $2 -\sqrt3$. What is the area of $\vartriangle DEF$?
The figure $F$ is the intersection of $N$ circles (they may have different radii). Find the maximal number of curvilinear “sides” which $F$ can have. Curvilinear sides of $F$ are the arcs (of the given circumferences) that constitute the boundary of $F$. (Their ends are the “vertices” of $F$ - the points of intersection of given circumferences that lie on the boundary of $F$.)
(N Brodsky)
$x,y,z\in\left(0,\frac{\pi}{2}\right)$ are given. Prove that:
\[ \frac{x\cos x+y\cos y+z\cos z}{x+y+z}\le \frac{\cos x+\cos y+\cos z}{3} \]
Given positive real $a,b,c$ satisfying \[\frac{1}{\sqrt{a+1}}+\frac{3}{\sqrt{b+3}}+\frac{3}{\sqrt{c+3}}=\frac72\]
Prove that $abc\leq 3$.\\
I was asked to propose a inequality for the condition of $abc<3$ inequality since <3 looks like a heart shape, then I construct a equality and with the help of wolfram, I gave the birth of this bad-looking inequality, I’m glad to see any method besides calculus.
Find all finite sets $S$ of points in the plane with the following property: for any three distinct points $A,B,$ and $C$ in $S,$ there is a fourth point $D$ in $S$ such that $A,B,C,$ and $D$ are the vertices of a parallelogram (in some order).
A bank has one million clients, one of whom is Inspector Gadget. Each client has a unique PIN number consisting of six digits. Dr. Claw has a list of all the clients. He is able to break into the account of any client, choose any $n$ digits of the PIN number and copy them. The n digits he copies from different clients need not be in the same $n$ positions. He can break into the account of each client, but only once. What is the smallest value of $n$ which allows Dr.Claw to determine the complete PIN number of Inspector Gadget?
The inscribed circle $\omega$ of triangle $ABC$ with center $I$ touches the sides $AB, BC, CA$ at points $C_1, A_1, B_1$. The circle circumsrcibed around $\vartriangle AB_1C_1$ intersects the circumscribed circle of $ABC$ for second time at the point $K$. Let $M$ be the midpoint $BC$, $L$ be the midpoint of $B_1C_1$. The circle circumsrcibed around $\vartriangle KA_1M$ cuts intersects $\omega$ for second time at the point $T$. Prove that the circumscribed circles of triangles $KLT$ and $LIM$ are tangent.
Let $a_1,a_2,a_3,\ldots$ be an infinite sequence of positive integers such that $a_{n+2m}$ divides $a_{n}+a_{n+m}$ for all positive integers $n$ and $m.$ Prove that this sequence is eventually periodic, i.e. there exist positive integers $N$ and $d$ such that $a_n=a_{n+d}$ for all $n>N.$
Let $\ell = 1$, $M = 23$, $N = 45$, and $u = 67$. Compute the number of ordered pairs of nonnegative integers $(X, Y)$ with $X \leq M - \ell$ and $Y \leq N + u$ such that the sum
\[ \sum_{k=\ell}^{u} \binom{X + k}{M}\cdot\binom{Y - k}{N} \]
is divisible by $89$ (for integers $a$ and $b$, define the binomial coefficient $\tbinom{a}{b}$ to be the number of $b$-element subsets of any given $a$-element set, which is $0$ when $a < 0$, $b < 0$, or $b > a$).
A music streaming service proposes songs classified in $10$ musical genres, so that each song belong to one and only one gender. The songs are played one after the other: the first $17$ are chosen by the user, but starting from the eighteenth the service automatically determines which song to play. Elisabetta has noticed that, if one makes the classification of which genres they appear several times during the last $17$ songs played, the new song always belongs to the genre at the top of the ranking or, in case of same merit, at one of the first genres.
Prove that, however, the first $17$ tracks are chosen, from a certain point onwards the songs proposed are
all of the same kind.
When Eva counts, she skips all numbers containing a digit divisible by 3. For example, the first ten numbers she counts are 1, 2, 4, 5, 7, 8, 11, 12, 14, 15. What is the $100^{\text{th}}$ number she counts?
[i]Proposed by Eugene Chen[/i]