Found problems: 85335
If $y=a+\frac{b}{x}$, where $a$ and $b$ are constants, and if $y=1$ when $x=-1$, and $y=5$ when $x=-5$, then $a+b$ equals:
$ \textbf{(A)}\ -1 \qquad\textbf{(B)}\ 0\qquad\textbf{(C)}\ 1\qquad\textbf{(D)}\ 10\qquad\textbf{(E)}\ 11 $
Prove that the number $1\underbrace{\hbox{0...0}}_{\hbox{49}}5\underbrace{\hbox{0...0}}_{\hbox{99}}1$ is not the cube of any integer.
Goodnik writes 10 numbers on the board, then Nogoodnik writes 10 more numbers, all 20 of the numbers being positive and distinct. Can Goodnik choose his 10 numbers so that no matter what Nogoodnik writes, he can form 10 quadratic trinomials of the form $x^2 +px+q$, whose coeficients $p$ and $q$ run through all of the numbers written, such that the real roots of these trinomials comprise exactly 11 values?
[i]I. Rubanov[/i]
Find the largest number $n$ such that $(2004!)!$ is divisible by $((n!)!)!$.
If $x$ and $y$ are positive real numbers such that $(x + \sqrt{x^2 + 1})(y +\sqrt{y^2 + 1}) = 2018$:
The minimum possible value of $x + y$ is
A. $\frac{2017}{\sqrt{2018}}$ B. $\frac{2018}{\sqrt{2019}}$ C. $\frac{2017}{2\sqrt{2018}}$ D. $\frac{2019}{\sqrt{2018}}$ E. $\sqrt{3}$
Let $ABC$ be a triangle and let $O$ be its circumcentre. The internal and external bisectrices of the angle $BAC$ meet the line $BC$ at points $D$ and $E$, respectively. Let further $M$ and $L$ respectively denote the midpoints of the segments $BC$ and $DE$. The circles $ABC$ and $ALO$ meet again at point $N$. Show that the angles $BAN$ and $CAM$ are equal.
Let $a_1,a_2,\cdots,a_{2000}$ be distinct positive integers such that $1 \leq a_1 < a_2 < \cdots < a_{2000} < 4000$ such that the LCM (least common multiple) of any two of them is $\geq 4000$. Show that $a_1 \geq 1334$
Given a cube. On each edge of the cube, we write a number, either $1$ or $-1$. For each face of the cube, we multiply the four numbers on the edges of this face, and write the product on this face. Finally, we add all the eighteen numbers that we wrote down on the edges and face of the cube.
What is the smallest possible sum that we can get?
Find the remainder when $8^{2014}$ + $6^{2014}$ is divided by 100.
In how many ways can one select eight integers $a_1,a_2, ... ,a_8$, not necesarily distinct, such that $1 \le a_1 \le ... \le a_8 \le 8$?
Consider the sequence defined by \(a_1 = 2\), \(a_2 = 3\), and
\[
a_{2k+1} = 2 + 2a_k, \quad a_{2k+2} = 2 + a_k + a_{k+1},
\]
for all integers \(k \geq 1\). Determine all positive integers \(n\) such that
\[
\frac{a_n}{n}
\]
is an integer.
Proposed by Niranjan Balachandran, SS Krishnan, and Prithwijit De.
Let $ n$ be an integer, $ n \geq 3.$ Let $ a_1, a_2, \ldots, a_n$ be real numbers such that $ 2 \leq a_i \leq 3$ for $ i \equal{} 1, 2, \ldots, n.$ If $ s \equal{} a_1 \plus{} a_2 \plus{} \ldots \plus{} a_n,$ prove that
\[ \frac{a^2_1 \plus{} a^2_2 \minus{} a^2_3}{a_1 \plus{} a_2 \minus{} a_3} \plus{} \frac{a^2_2 \plus{} a^2_3 \minus{} a^2_4}{a_2 \plus{} a_3 \minus{} a_4} \plus{} \ldots \plus{} \frac{a^2_n \plus{} a^2_1 \minus{} a^2_2}{a_n \plus{} a_1 \minus{} a_2} \leq 2s \minus{} 2n.\]
Let $ABCD$ be a convex quadrilateral with $AB=BD=DC$ and $AB \perp BD \perp DC$. Let $M$ be the midpoint of segment $BC$. Show that $\angle BAM+\angle DCA=45^\circ$.
Let $\triangle ABC$ be a scalene triangle. Point $P$ lies on $\overline{BC}$ so that $\overline{AP}$ bisects $\angle BAC$. The line through $B$ perpendicular to $\overline{AP}$ intersects the line through $A$ parallel to $\overline{BC}$ at point $D$. Suppose $BP = 2$ and $PC = 3$. What is $AD$ ?
$\textbf{(A) }8\qquad\textbf{(B) }9\qquad\textbf{(C) }10\qquad\textbf{(D) }11\qquad\textbf{(E) }12$
Determine all positive integers $n$ for which $n(n + 9)$ is a perfect square.
Suppose that $A$ is a set of integers. Denote the number of elements in $A$ by $|A|$. Define $A+A = \{a_1+a_2: a_1, a_2 \in A\}$ and $A-A = \{a_1-a_2:a_1, a_2 \in A\}$. Prove or disprove: for any set $A$, we have the inequality $|A-A| \ge |A+A|$.
A rabbit initially stands at the position $0$, and repeatedly jumps on the real line. In each jump, the rabbit can jump to any position corresponds to an integer but it cannot stand still. Let $N(a)$ be the number of ways to jump with a total distance of $2019$ and stop at the position $a$. Determine all integers $a$ such that $N(a)$ is odd.
Buffalo Shuffle-o is a card game in which all the cards are distributed evenly among all players at the start of the game. When Annika and $3$ of her friends play Buffalo Shuffle-o, each player is dealt $15$ cards. Suppose $2$ more friends join the next game. How many cards will be dealt to each player?
$\textbf{(A) } 8\qquad\textbf{(B) } 9\qquad\textbf{(C) } 10\qquad\textbf{(D) } 11\qquad\textbf{(E) } 12$
ngl easily silliable
Let $d(n)$ denote the number of positive divisors of $n$. For positive integer $n$ we define $f(n)$ as $$f(n) = d\left(k_1\right) + d\left(k_2\right)+ \cdots + d\left(k_m\right),$$ where $1 = k_1 < k_2 < \cdots < k_m = n$ are all divisors of the number $n$. We call an integer $n > 1$ [i]almost perfect[/i] if $f(n) = n$. Find all almost perfect numbers.
[i]Paulius Ašvydis[/i]
Let $n$ be a positive integer. Define a chameleon to be any sequence of $3n$ letters, with exactly $n$ occurrences of each of the letters $a, b,$ and $c$. Define a swap to be the transposition of two adjacent letters in a chameleon. Prove that for any chameleon $X$ , there exists a chameleon $Y$ such that $X$ cannot be changed to $Y$ using fewer than $3n^2/2$ swaps.
Find all sequences of positive integers $a_1,a_2,\dots$ such that $$(n^2+1)a_n = n(a_{n^2}+1)$$ for all positive integers $n$.
In how many ways can the integers from $1$ to $2006$ be divided into three non-empty disjoint sets so that none of these sets contains a pair of consecutive integers?
Find the smallest real $\alpha$, such that for any convex polygon $P$ with area $1$, there exist a point $M$ in the plane, such that the area of convex hull of $P\cup Q$ is at most $\alpha$, where $Q$ denotes the image of $P$ under central symmetry with respect to $M$.
Cyclic pentagon $ ABCDE$ has a right angle $ \angle{ABC} \equal{} 90^{\circ}$ and side lengths $ AB \equal{} 15$ and $ BC \equal{} 20$. Supposing that $ AB \equal{} DE \equal{} EA$, find $ CD$.
[b]a)[/b] $ \lim_{n\to\infty } \sum_{j=1}^n\frac{n}{n^2+n+j} =1 $
[b]b)[/b] $ \lim_{n\to\infty } \left( n- \sum_{j=1}^n\frac{n^2}{n^2+n+j} \right) =3/2 $
[i]Cristinel Mortici[/i]