Found problems: 85335
Basil needs to solve an exercise on summing two fractions $\dfrac{a}{b}$ and $\dfrac{c}{d}$, where $a$, $b$, $c$, $d$ are some non-zero real numbers. But instead of summing he performed multiplication (correctly). It appears that Basil's answer coincides with the correct answer to given exercise. Find the value of $\dfrac{b}{a} + \dfrac{d}{c}$.
Let $S$ be a set of positive integers satisfying the following two conditions:
• For each positive integer $n$, at least one of $n, 2n, \dots, 100n$ is in $S$.
• If $a_1, a_2, b_1, b_2$ are positive integers such that $\gcd(a_1a_2, b_1b_2) = 1$ and $a_1b_1, a_2b_2 \in S,$ then
$a_2b_1, a_1b_2 \in S.$
Suppose that $S$ has natural density $r$. Compute the minimum possible value of $\lfloor 10^5r\rfloor$.
Note: $S$ has natural density $r$ if $\tfrac{1}{n}|S \cap {1, \dots, n}|$ approaches $r$ as $n$ approaches $\infty$.
Let $ n$ be the number of integer values of $ x$ such that $ P \equal{} x^4 \plus{} 6x^3 \plus{} 11x^2 \plus{} 3x \plus{} 31$ is the square of an integer. Then $ n$ is:
$ \textbf{(A)}\ 4 \qquad \textbf{(B)}\ 3 \qquad \textbf{(C)}\ 2 \qquad \textbf{(D)}\ 1 \qquad \textbf{(E)}\ 0$
Given a nonisosceles, nonright triangle ABC, let O denote the center of its circumscribed circle, and let $A_1$, $B_1$, and $C_1$ be the midpoints of sides BC, CA, and AB, respectively. Point $A_2$ is located on the ray $OA_1$ so that $OAA_1$ is similar to $OA_2A$. Points $B_2$ and $C_2$ on rays $OB_1$ and $OC_1$, respectively, are defined similarly. Prove that lines $AA_2$, $BB_2$, and $CC_2$ are concurrent, i.e. these three lines intersect at a point.
Let
$$a_k = 0.\overbrace{0 \ldots 0}^{k - 1 \: 0's} 1 \overbrace{0 \ldots 0}^{k - 1 \: 0's} 1$$
The value of $\sum_{k = 1}^\infty a_k$ can be expressed as a rational number $\frac{p}{q}$ in simplest form. Find $p + q$.
Thin and Fat eat a pizza of $2n$ pieces. Each piece contains a distinct amount of olives between $1$ and $2n$. Thin eats the first piece, and the two players alternately eat a piece neighbor of an eaten piece. However, neither Thin nor Fat like olives, so they will choose pieces that minimizes the total amount of olives they eat. For each arrangement $\sigma$ of the olives, let $s(\sigma)$ the minimal amount of olives that Thin can eat, considering that both play in the best way possible. Let $S(n)$ the maximum of $s(\sigma)$, considering all arrangements.
$a)$ Prove that $n^2-1+\lfloor \frac{n}{2} \rfloor \le S(n) \le n^2+\lfloor \frac{n}{2} \rfloor$
$b)$ Prove that $S(n)=n^2-1+\frac{n}{2}$ for each even n.
$ \int \frac{1+2x^3}{1+x^2-2x^3+x^6} dx $
[i]Ion Nedelcu[/i] and [i]Lucian Tutescu[/i]
Find all polynomials with real coefficients $P(x)$ such that $P(x^2+x+1)$ divides $P(x^3-1)$.
[b]p1.[/b] Prove that no matter what digits are placed in the four empty boxes, the eight-digit number $9999\Box\Box\Box\Box$ is not a perfect square.
[b]p2.[/b] Prove that the number $m/3+m^2/2+m^3/6$ is integral for all integral values of $m$.
[b]p3.[/b] An elevator in a $100$ store building has only two buttons: UP and DOWN. The UP button makes the elevator go $13$ floors up, and the DOWN button makes it go $8$ floors down. Is it possible to go from the $13$th floor to the $8$th floor?
[b]p4.[/b] Cut the triangle shown in the picture into three pieces and rearrange them into a rectangle. (Pieces can not overlap.)
[img]https://cdn.artofproblemsolving.com/attachments/4/b/ca707bf274ed54c1b22c4f65d3d0b0a5cfdc56.png[/img]
[b]p5.[/b] Two players Tom and Sid play the following game. There are two piles of rocks, $7$ rocks in the first pile and $9$ rocks in the second pile. Each of the players in his turn can take either any amount of rocks from one pile or the same amount of rocks from both piles. The winner is the player who takes the last rock. Who does win in this game if Tom starts the game?
[b]p6.[/b] In the next long multiplication example each letter encodes its own digit. Find these digits.
$\begin{tabular}{ccccc}
& & & a & b \\
* & & & c & d \\
\hline
& & c & e & f \\
+ & & a & b & \\
\hline
& c & f & d & f \\
\end{tabular}$
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Let $a$ and $b$ be positive real numbers smaller than $1$. Prove that the following two statements are equivalent:
(i) $a+b = 1$,
(ii) Whenever $x,y$ are positive real numbers such that $x < 1, y < 1, ax+by < 1$, the following inequlity holds:
$$\frac{1}{1-ax-by} \le \frac{a}{1-x} + \frac{b}{1-y}$$
Let $M$ be the midpoint of $AB$ in a right angled triangle $ABC$ with $\angle C = 90^\circ$. A circle passing through $C$ and $M$ meets segments $BC, AC$ at $P, Q$ respectively. Let $c_1, c_2$ be the circles with centers $P, Q$ and radii $BP, AQ$ respectively. Prove that $c_1, c_2$ and the circumcircle of $ABC$ are concurrent.
The cells of a $5\times5$ grid are each colored red, white, or blue. Sam starts at the bottom-left cell of the grid and walks to the top-right cell by taking steps one cell either up or to the right. Thus, he passes through $9$ cells on his path, including the start and end cells. Compute the number of colorings for which Sam is guaranteed to pass through a total of exactly $3$ red cells, exactly $3$ white cells, and exactly $3$ blue cells no matter which route he takes.
Find all poltnomials $ P(x)$ with real coefficients satisfying: For all $ a>1995$, the number of real roots of $ P(x)\equal{}a$ (incuding multiplicity of each root) is greater than 1995, and every roots are greater than 1995.
For all positive integers $ n$ prove the inequality:
$ \left( \frac{1\plus{}(n\plus{}1)^{n\plus{}1}}{n\plus{}2} \right)^{n\minus{}1}>\left( \frac{1\plus{}n^n}{n\plus{}1} \right)^n.$
There are several bears living on the $2025$ islands of the Arctic Ocean. Every bear sometimes swims from one island to another. It turned out that every bear made at least one swim in a year, but no two bears made equal swams. At the same time, exactly one swim was made between each two islands $A$ and $B$: either from $A$ to $B$ or from $B$ to $A$. Prove that there were no bears on some island at the beginning and at the end of the year.
[i]A. Kuznetsov[/i]
Given an infinite sheet of square ruled paper. Some of the squares contain a piece. A move consists of a piece jumping over a piece on a neighbouring square (which shares a side) onto an empty square and removing the piece jumped over. Initially, there are no pieces except in an $m x n$ rectangle ($m, n > 1$) which has a piece on each square. What is the smallest number of pieces that can be left after a series of moves?
Let $a,b,c,d$ be positive real numbers with $a+b+c+d=2$. Prove the following inequality:
$$\frac{(a+c)^{2}}{ad+bc}+\frac{(b+d)^{2}}{ac+bd}+4\geq 4\left ( \frac{a+b+1}{c+d+1}+\frac{c+d+1}{a+b+1} \right).$$
[i]Proposed by Mohammad Jafari[/i]
In the electoral college, each of $51$ places get some positive number of electoral votes for a nationwide total of $538$. Thus, $270$ electoral votes guarantees a win. Across all distributions of electoral votes to each place, let $M$ be the maximum number of sets of places that combine to have at least $270$ electoral votes. Find $M$.
Let $P_1$, $P_2$, $\dots$, $P_{2n}$ be $2n$ distinct points on the unit circle $x^2+y^2=1$, other than $(1,0)$. Each point is colored either red or blue, with exactly $n$ red points and $n$ blue points. Let $R_1$, $R_2$, $\dots$, $R_n$ be any ordering of the red points. Let $B_1$ be the nearest blue point to $R_1$ traveling counterclockwise around the circle starting from $R_1$. Then let $B_2$ be the nearest of the remaining blue points to $R_2$ travelling counterclockwise around the circle from $R_2$, and so on, until we have labeled all of the blue points $B_1, \dots, B_n$. Show that the number of counterclockwise arcs of the form $R_i \to B_i$ that contain the point $(1,0)$ is independent of the way we chose the ordering $R_1, \dots, R_n$ of the red points.
Determine all pairs of positive integers $(a,b)$ such that \[ \dfrac{a^2}{2ab^2-b^3+1} \] is a positive integer.
Let $D$ be the midpoint of the side $BC$ of a triangle $ABC$. Let $M$ be a point on the side $BC$ such that $\angle BAM = \angle DAC$. Further, let $L$ be the second intersection point of the circumcircle of the triangle $CAM$ with the side $AB$, and let $K$ be the second intersection point of the circumcircle of the triangle $BAM$ with the side $AC$. Prove that $KL \parallel BC$.
Find the largest real number $k$, such that for any positive real numbers $a,b$,
$$(a+b)(ab+1)(b+1)\geq kab^2$$
Given points $O$ and $A$ in the plane. Every point in the plane is colored with one of a finite number of colors. Given a point $X$ in the plane, the circle $C(X)$ has center $O$ and radius $OX+{\angle AOX\over OX}$, where $\angle AOX$ is measured in radians in the range $[0,2\pi)$. Prove that we can find a point $X$, not on $OA$, such that its color appears on the circumference of the circle $C(X)$.
Consider two quadrilaterals $ A_1B_1C_1D_1,A_2B_2C_2D_2 $ and the points $ M,N,P,Q,E_1,F_1,E_2,F_2 $ representing the middle of the segments $ A_1A_2,B_1B_2,C_1C_2,D_1D_2,B_1D_1,A_1C_1,B_2D_2,A_2,C_2, $ respectively. Show that $ MNPQ $ is a parallelogram if and only if $ E_1F_1E_2F_2 $ is a parallelogram.
[i]Cristinel Mortici[/i]
Let $ G$ be a solvable torsion group in which every Abelian subgroup is finitely generated. Prove that $ G$ is finite.
[i]J. Pelikan[/i]