Found problems: 85335
Let $p$ be an odd prime number. For every integer $a,$ define the number $S_a = \sum^{p-1}_{j=1} \frac{a^j}{j}.$ Let $m,n \in \mathbb{Z},$ such that $S_3 + S_4 - 3S_2 = \frac{m}{n}.$ Prove that $p$ divides $m.$
[i]Proposed by Romeo Meštrović, Montenegro[/i]
On side $AC$ of triangle $ABC$ an arbitrary point is selected $D$. The tangent in $D$ to the circumcircle of triangle $BDC$ meets $AB$ in point $C_{1}$; point $A_{1}$ is defined similarly. Prove that $A_{1}C_{1}\parallel AC$.
Keiko tosses one penny and Ephraim tosses two pennies. The probability that Ephraim gets the same number of heads that Keiko gets is
$\text{(A)}\ \dfrac{1}{4} \qquad \text{(B)}\ \dfrac{3}{8} \qquad \text{(C)}\ \dfrac{1}{2} \qquad \text{(D)}\ \dfrac{2}{3} \qquad \text{(E)}\ \dfrac{3}{4}$
A circle with radius $r$ is tangent to sides $AB$, $AD$, and $CD$ of rectangle $ABCD$ and passes through the midpoint of diagonal $AC$.The area of the rectangle in terms of $r$, is
$\textbf{(A) }4r^2\qquad\textbf{(B) }6r^2\qquad\textbf{(C) }8r^2\qquad\textbf{(D) }12r^2\qquad \textbf{(E) }20r^2$
Find all positive integers $n$ with the following property: There are only a finite number of positive multiples of $n$ that have exactly $n$ positive divisors.
Al gets the disease algebritis and must take one green pill and one pink pill each day for two weeks. A green pill costs $ \$1$ more than a pink pill, and Al’s pills cost a total of $ \$546$ for the two weeks. How much does one green pill cost?
$ \textbf{(A)}\ \$7 \qquad
\textbf{(B)}\ \$14 \qquad
\textbf{(C)}\ \$19 \qquad
\textbf{(D)}\ \$20 \qquad
\textbf{(E)}\ \$39$
[b]Q12.[/b] Find all positive integers $P$ such that the sum and product of all its divisors are $2P$ and $P^2$, respectively.
Let $ n$ be a positive integer, and let $ x$ and $ y$ be a positive real number such that $ x^n \plus{} y^n \equal{} 1.$ Prove that
\[ \left(\sum^n_{k \equal{} 1} \frac {1 \plus{} x^{2k}}{1 \plus{} x^{4k}} \right) \cdot \left( \sum^n_{k \equal{} 1} \frac {1 \plus{} y^{2k}}{1 \plus{} y^{4k}} \right) < \frac {1}{(1 \minus{} x) \cdot (1 \minus{} y)}.
\]
[i]Author: Juhan Aru, Estonia[/i]
Find the number of ways $66$ identical coins can be separated into three nonempty piles so that there are fewer coins in the first pile than in the second pile and fewer coins in the second pile than in the third pile.
On the plane, given an angle $ xOy$. $ M$ be a mobile point on ray $ Ox$ and $ N$ a mobile point on ray $ Oy$. Let $ d$ be the external angle bisector of angle $ xOy$ and $ I$ be the intersection of $ d$ with the perpendicular bisector of $ MN$. Let $ P$, $ Q$ be two points lie on $ d$ such that $ IP \equal{} IQ \equal{} IM \equal{} IN$, and let $ K$ the intersection of $ MQ$ and $ NP$.
$ 1.$ Prove that $ K$ always lie on a fixed line.
$ 2.$ Let $ d_1$ line perpendicular to $ IM$ at $ M$ and $ d_2$ line perpendicular to $ IN$ at $ N$. Assume that there exist the intersections $ E$, $ F$ of $ d_1$, $ d_2$ from $ d$. Prove that $ EN$, $ FM$ and $ OK$ are concurrent.
Let $a$ and $b$ be positive integers satisfying $\frac{ab+1}{a+b}<\frac{3}{2}$. The maximum possible value of $\frac{a^3b^3+1}{a^3+b^3}$ is $\frac{p}{q}$, where $p$ and $q$ are relatively prime positive integers. Find $p+q$.
Let $n \geq 2$ be a positive integer. At the center of a circular garden is a guard tower. On the outskirt of the garden there are $n$ garden dwarfs regularly spaced. In the tower are attentive supervisors. Each supervisor controls a portion of the garden delimited by two dwarfs.
We say that the supervisor $A$ controls the supervisor $B$ if the region of $B$ is contained in that of $A$.
Among the supervisors there are two groups: the apprentices and the teachers. Each apprentice is controlled by exactly one teachers, and controls no one, while the teachers are not controlled by anyone.
The entire garden has the following maintenance costs:
- One apprentice costs 1 gold per year.
- One teacher costs 2 gold per year.
- A garden dwarf costs 2 gold per year.
Show that the garden dwarfs cost at least as much as the supervisors.
For the positive real numbers $ a,b,c$ prove the inequality
\[ \frac {c}{a \plus{} 2b} \plus{} \frac {a}{b \plus{} 2c} \plus{} \frac {b}{c \plus{} 2a}\ge1.
\]
Let $n\in \mathbb{N}^*$ and a matrix $A\in \mathcal{M}_n(\mathbb{C}),\ A=(a_{ij})_{1\le i, j\le n}$ such that:
\[a_{ij}+a_{jk}+a_{ki}=0,\ (\forall)i,j,k\in \{1,2,\ldots,n\}\]
Prove that $\text{rank}\ A\le 2$.
It is known that two circles have centers at $P$ and $Q$. Prove that the intersection points of the two internal common tangents of the two circles with their two external common tangents lie on the same circle.
Reduce $$\frac{2}{\sqrt{4-3\sqrt[4]{5} + 2\sqrt[4]{25}-\sqrt[4]{125}}}$$ to its lowest form.
Then generalize this result and show that it holds for any positive $n$.
A square in the [i]xy[/i]-plane has area [i]A[/i], and three of its vertices have [i]x[/i]-coordinates $2,0,$ and $18$ in some order. Find the sum of all possible values of [i]A[/i].
What is the sum of the positive solutions to $2x^2 -\lfloor x \rfloor = 5$, where $\lfloor x \rfloor$ is the largest integer less than or equal to $x$?
Let $n\geqslant 3$ be a positiv integer. Ana chooses the positive integers $a_1,a_2,\ldots,a_n$ and for any non-empty subset $A\subseteq\{1,2,\ldots,n\}$ she computes the sum \[s_A=\sum_{k
\in A}a_k.\]She orders these sums $s_1\leqslant s_2\leqslant\cdots\leqslant s_{2^n-1}.$ Prove that there exists a subset $B\subseteq\{1,2,\ldots,2^n-1\}$ with $2^{n-2}+1$ elements such that, regardless of the integers $a_1,a_2,\ldots,a_n$ chosen by Ana, these can be determined by only knowing the sums $s_i$ with $i\in B.$
Suppose $f:\mathbb{R}\to\mathbb{R}$ is a differentiable function for which the inequality $f'(x) \leq f'(x+\frac{1}{n})$ holds for every $x\in\mathbb{R}$ and every $n\in\mathbb{N}$.Prove that f is continiously differentiable
Are there integers $a$ and $b$ such that $a^5b+3$ and $ab^5+3$ are both perfect cubes of integers?
Each term of a sequence of positive integers is obtained from the previous term by adding to it its largest digit. What is the maximal number of successive odd terms in such a sequence?
Given $ n \geq 3$, $ n$ is a integer. Prove that:
\[ (2^n \minus{} 2) \cdot \sqrt{2i\minus{}1} \geq \left( \sum_{j\equal{}0}^{i\minus{}1}C_n^j \plus{} C_{n\minus{}1}^{i\minus{}1} \right) \cdot \sqrt{n}\]
where if $ n$ is even, then $ \displaystyle 1 \leq i \leq \frac{n}{2}$; if $ n$ is odd, then $ \displaystyle 1 \leq i \leq \frac{n\minus{}1}{2}$.
Initially, there are $3^{80}$ particles at the origin $(0,0)$. At each step the particles are moved to points above the $x$-axis as follows: if there are $n$ particles at any point $(x,y)$, then $\Bigl \lfloor \frac{n}{3} \Bigr\rfloor$ of them are moves to $(x+1,y+1)$, $\Bigl \lfloor \frac{n}{3} \Bigr\rfloor$ are moved to $(x,y+1)$ and the remaining to $(x-1,y+1)$, For example, after the first step, there are $3^{79}$ particles each at $(1,1),(0,1)$ and $(-1,1)$. After the second step, there are $3^{78}$ particles each at $(-2,2)$ and $(2,2)$, $2 \times 3^{78}$ particles each at $(-1,2)$ and $(1,2)$, and $3^{79}$ particles at $(0,2)$. After $80$ steps, the number of particles at $(79,80)$ is:
Let it \(C,D > 0\). We call a function \(f:\mathbb{R} \rightarrow \mathbb{R}\) [i]pretty[/i] if \(f\) is a \(C^2\)-class, \(|x^3f(x)| \leq C\) and \(|xf''(x)| \leq D\).
[list='i']
[*] Show that if \(f\) is pretty, then, given \(\epsilon \geq 0\), there is a \(x_0 \geq 0\) such that for every \(x\) with \(|x| \geq x_0\), we have \(|x^2f'(x)| < \sqrt{2CD}+\epsilon\).
[*] Show that if \(0 < E < \sqrt{2CD}\) then there is a pretty function \(f\) such that for every \(x_0 \geq 0\) there is a \(x > x_0\) such that \(|x^2f'(x)| > E\).
[/list]