Found problems: 85335
Determine all odd primes $p$ and $q$ such that the equation $x^p + y^q = pq$ at least one solution $(x, y)$ where $x$ and $y$ are positive integers.
In a triangle $ABC$ with $AB=AC$, let $D$ be the midpoint of $[BC]$. A line passing through $D$ intersects $AB$ at $K$, $AC$ at $L$. A point $E$ on $[BC]$ different from $D$, and a point $P$ on $AE$ is taken such that $\angle KPL=90^\circ-\frac{1}{2}\angle KAL$ and $E$ lies between $A$ and $P$. The circumcircle of triangle $PDE$ intersects $PK$ at point $X$, $PL$ at point $Y$ for the second time. Lines $DX$ and $AB$ intersect at $M$, and lines $DY$ and $AC$ intersect at $N$. Prove that the points $P,M,A,N$ are concyclic.
For $A\subset\mathbb Z$ and $a,b\in\mathbb Z$. We define $aA+b: =\{ax+b|x\in A\}$. If $a\neq0$ then we calll $aA+b$ and $A$ to similar sets. In this question the Cantor set $C$ is the number of non-negative integers that in their base-3 representation there is no $1$ digit. You see \[C=(3C)\dot\cup(3C+2)\ \ \ \ \ \ (1)\] (i.e. $C$ is partitioned to sets $3C$ and $3C+2$). We give another example $C=(3C)\dot\cup(9C+6)\dot\cup(3C+2)$.
A representation of $C$ is a partition of $C$ to some similiar sets. i.e. \[C=\bigcup_{i=1}^{n}C_{i}\ \ \ \ \ \ (2)\] and $C_{i}=a_{i}C+b_{i}$ are similar to $C$.
We call a representation of $C$ a primitive representation iff union of some of $C_{i}$ is not a set similar and not equal to $C$.
Consider a primitive representation of Cantor set. Prove that
a) $a_{i}>1$.
b) $a_{i}$ are powers of 3.
c) $a_{i}>b_{i}$
d) (1) is the only primitive representation of $C$.
Determine all positive integers $n > 2$ , such that \[ \frac{1}{2} \varphi(n) \equiv 1 ( \bmod 6) \]
Let $I$ be the incenter of a triangle $ABC$ with the property $\angle ABC - \angle BAC=30^{\circ}$. Line $CI$ intersects the circumcircle of $ABC$ at $C_1$. It turned out that $C_1$ lies on a common tangent line of circumcircles of triangles $ABC$ and $BCI$.
Find the angles of triangle $ABC$.
Let $P$ be a regular $n$-gon $A_1A_2\ldots A_n$. Find all positive integers $n$ such that for each permutation $\sigma (1),\sigma (2),\ldots ,\sigma (n)$ there exists $1\le i,j,k\le n$ such that the triangles $A_{i}A_{j}A_{k}$ and $A_{\sigma (i)}A_{\sigma (j)}A_{\sigma (k)}$ are both acute, both right or both obtuse.
Evaluate $\int_0^{2\pi} |x^2-\pi ^ 2 -\sin ^ 2 x|\ dx$.
A town's population increased by $1,200$ people, and then this new population decreased by $11 \%$. The town now had $32$ less people than it did before the $1,200$ increase. What is the original population?
$ \textbf{(A)}\ 1,200 \qquad\textbf{(B)}\ 11,200 \qquad\textbf{(C)}\ 9,968 \qquad\textbf{(D)}\ 10,000 \qquad\textbf{(E)}\ \text{none of these} $
Calculate $\int \frac{x^{3}}{(x-1)^{3}(x-2)}\ dx$
Given three distinct real numbers $a$, $b$, and $c$, show that at least two of the three following equations
\[(x-a)(x-b)=x-c\]
\[(x-c)(x-b)=x-a\]
\[(x-c)(x-a)=x-b\]
have real solutions.
A cryptographic code is designed as follows. The first time a letter appears in a given message it is replaced by the letter that is $ 1$ place to its right in the alphabet (assuming that the letter $ A$ is one place to the right of the letter $ Z$). The second time this same letter appears in the given message, it is replaced by the letter that is $ 1\plus{}2$ places to the right, the third time it is replaced by the letter that is $ 1 \plus{} 2 \plus{} 3$ places to the right, and so on. For example, with this code the word "banana" becomes "cbodqg". What letter will replace the last letter $ \text{s}$ in the message "Lee's sis is a Mississippi miss, Chriss!"?
$ \textbf{(A)}\ \text{g}\qquad
\textbf{(B)}\ \text{h}\qquad
\textbf{(C)}\ \text{o}\qquad
\textbf{(D)}\ \text{s}\qquad
\textbf{(E)}\ \text{t}$
What is the maximum area of a triangle that can be inscribed in an ellipse with semi-axes $a$ and $b$?
$\text{(A) }ab\frac{3\sqrt{3}}{4}\qquad\text{(B) }ab\qquad\text{(C) }ab\sqrt{2}\qquad\text{(D) }\left(a+b\right)\frac{3\sqrt{3}}{4}\qquad\text{(E) }\left(a+b\right)\sqrt{2}$
Suppose hops, skips and jumps are specific units of length. If $b$ hops equals $c$ skips, $d$ jumps equals $e$ hops, and $f$jumps equals $g$ meters, then one meter equals how many skips?
$ \textbf{(A)}\ \frac{bdg}{cef}\qquad\textbf{(B)}\ \frac{cdf}{beg}\qquad\textbf{(C)}\ \frac{cdg}{bef}\qquad\textbf{(D)}\ \frac{cef}{bdg}\qquad\textbf{(E)}\ \frac{ceg}{bdf} $
Find the integral solutions of the equation $7(x+y)=3(x^2-xy+y^2)$
Let $n\geq 5$ an integer and consider a regular $n$-gon. Initially, Nacho is situated in one of the vertices of the $n$-gon, in which he puts a flag. He will start moving clockwise. First, he moves one position and puts another flag, then, two positions and puts another flag, etcetera, until he finally moves $n-1$ positions and puts a flag, in such a way that he puts $n$ flags in total. ¿For which values of $n$, Nacho will have put a flag in each of the $n$ vertices?
How many real triples $(x,y,z)$ are there such that $\dfrac{4x^2}{1+4x^2}=y$, $\dfrac{4y^2}{1+4y^2}=z$, $\dfrac{4z^2}{1+4z^2}=x$ ?
$
\textbf{(A)}\ 2
\qquad\textbf{(B)}\ 4
\qquad\textbf{(C)}\ 6
\qquad\textbf{(D)}\ \text{Infinitely many}
\qquad\textbf{(E)}\ \text{None of the preceding}
$
Let $E$ and $F$ be points on the side $AB$ of a rectangle $ABCD$ such that $AE = EF$. The line through $E$ perpendicular to $AB$ intersects the diagonal $AC$ at $G$, and the segments $FD$ and $BG$ intersect at $H$. Prove that the areas of the triangles $FBH$ and $GHD$ are equal.
Let $A$ be the set $\{2,7,11,13\}$. A polynomial $f$ with integer coefficients possesses the following property: for each integer $n$ there exists $p \in A$ such that $p|f(n)$. Prove that there exists $p \in A$ such that $p|f(n)$ for all integers $n$.
We are given a collection of $2^{2^k}$ coins, where $k$ is a non-negative integer. Exactly one coin is fake.
We have an unlimited number of service dogs. One dog is sick but we do not know which one.
A test consists of three steps: select some coins from the collection of all coins; choose a service dog; the dog smells all of the selected coins at once.
A healthy dog will bark if and only if the fake coin is amongst them. Whether the sick dog will bark or not is random. \\
Devise a strategy to find the fake coin, using at most $2^k+k+2$ tests, and prove that it works.
In a triangle $ ABC$ incircle touches the sides $ AB$, $ AC$ and $ BC$ at $ C_1$, $ B_1$ and $ A_1$ respectively. Prove that $ \sqrt {\frac {AB_1}{AB}} \plus{} \sqrt {\frac {BC_1}{BC}} \plus{} \sqrt {\frac {CA_1}{CA}}\leq\frac {3}{\sqrt {2}}$ is true.
Suppose $p''(x) = 4x^2 + 4x + 2$ where $$p(x) = a_0 + a_1(x - 1) + a_2(x -2)^2 + a_3(x- 3)^4 + a_4(x-4)^4.$$ We have $p'(-3) = -24$ and $p(x)$ has the unique property that the sum of the third powers of the roots of $p(x)$ is equal to the sum of the fourth powers of the roots of $p(x)$ . Find $a_0$.
Trapezoid $ABCD$ has $\overline{AB} \parallel \overline{CD}$, $BC = CD = 43$, and $\overline{AD} \perp \overline{BD}$. Let $O$ be the intersection of the diagonals $\overline{AC}$ and $\overline{BD}$, and let $P$ be the midpoint of $\overline{BD}$. GIven that $OP = 11$, the length $AD$ can be written in the form $m\sqrt{n}$, where $m$ and $n$ are positive integers and $n$ is not divisible by the square of any prime. What is $m + n$?
$\textbf{(A)}\: 65\qquad\textbf{(B)}\: 132\qquad\textbf{(C)}\: 157\qquad\textbf{(D)}\: 194\qquad\textbf{(E)}\: 215$
The function $f$ satisfies the functional equation \[f(x) +f(y) = f(x + y ) - xy - 1\] for every pair $x,~ y$ of real numbers. If $f( 1) = 1$, then the number of integers $n \neq 1$ for which $f ( n ) = n$ is
$\textbf{(A) }0\qquad\textbf{(B) }1\qquad\textbf{(C) }2\qquad\textbf{(D) }3\qquad\textbf{(E) }\text{infinite}$
It is given $4$ circles in a plane and every one of them touches the other three as shown:
[img]https://services.artofproblemsolving.com/download.php?id=YXR0YWNobWVudHMvZC82L2FkYWQ5NThhMWRiMjAwZjYxOWFhYmE1M2YzZDU5YWI2N2IyYzk2LnBuZw==&rn=a3J1Z292aS5wbmc=[/img]
Biggest circle has radius $2$, and every one of the medium has $1$. Find out the radius of fourth circle.
Find the largest number formed by the digits 1 to 9, without repetition, that is divisible by 18.