Found problems: 85335
$ a,b,c>0 $ and $ abc=1 $. Prove that $\frac{1}{2}\ (\sqrt{a}\ +\sqrt{b}\ + \sqrt{c}\ ) +\frac{1}{1+a}\ + \frac{1}{1+b}\ + \frac{1}{1+c}\ge\ 3 $.
( The official problem is with $ abc = 1 $ but it can be proved without using it. )
Determine the maximal size of the set $S$ such that:
i) all elements of $S$ are natural numbers not exceeding $100$;
ii) for any two elements $a,b$ in $S$, there exists $c$ in $S$ such that $(a,c)=(b,c)=1$;
iii) for any two elements $a,b$ in $S$, there exists $d$ in $S$ such that $(a,d)>1,(b,d)>1$.
[i]Yao Jiangang[/i]
For all positive integers $n$, denote by $\sigma(n)$ the sum of the positive divisors of $n$ and $\nu_p(n)$ the largest power of $p$ which divides $n$. Compute the largest positive integer $k$ such that $5^k$ divides \[\sum_{d|N}\nu_3(d!)(-1)^{\sigma(d)},\] where $N=6^{1999}$.
[i]Proposed by David Altizio[/i]
The points of intersection of $ xy \equal{} 12$ and $ x^2 \plus{} y^2 \equal{} 25$ are joined in succession. The resulting figure is:
$ \textbf{(A)}\ \text{a straight line} \qquad\textbf{(B)}\ \text{an equilateral triangle} \qquad\textbf{(C)}\ \text{a parallelogram}$
$ \textbf{(D)}\ \text{a rectangle} \qquad\textbf{(E)}\ \text{a square}$
Determine the smallest positive integer n for
that there are positive integers $x_1, x_2,. . . , x_n$ so that each natural number from 1001 to 2021 inclusive can be written as sum of one or more different terms $x_i$ (i = 1, 2,..., n).
In a triangle ABC, D is midpoint of BC . If $\angle ADB = 45 ^{\circ}$ and $\angle ACD = 30^{\circ}$, determine $\angle BAD.$
Prove that for any integer $a$ there exist infinitely many positive integers $n$ such that $a^{2^n}+2^n$ is not a prime.
[b]proposed by S. Berlov[/b]
Let $CH$ be the altitude of a right-angled triangle $ABC$ ($\angle C = 90^{\circ}$) with $BC = 2AC$. Let $O_1$, $O_2$ and $O$ be the incenters of triangles $ACH$, $BCH$ and $ABC$ respectively, and $H_1$, $H_2$, $H_0$ be the projections of $O_1$, $O_2$, $O$ respectively to $AB$. Prove that $H_1H = HH_0 = H_0H_2$.
The quadrilateral $ABCD$ is inscribed in the circle $o$. Bisectors of angles $DAB$ and $ABC$ intersect at point $P$, and bisectors of angles $BCD$ and $CDA$ intersect in point $Q$. Point $M$ is the center of this arc $BC$ of the circle $o$ which does not contain points $D$ and $A$. Point $N$ is the center of the arc $DA$ of the circle $o$, which does not contain points $B$ and $C$. Prove that the points $P$ and $Q$ lie on the line perpendicular to $MN$.
[b]p1.[/b] In the correct identity $(x^2 - 1)(x + ...) = (x + 3)(x- 1)(x +...)$ two numbers were replaced with dots. What were these numbers?
[b]p2.[/b] A merchant is carrying money from point A to point B. There are robbers on the roads who rob travelers: on one road the robbers take $10\%$ of the amount currently available, on the other - $20\%$, etc. . How should the merchant travel to bring as much of the money as possible to B? What part of the original amount will he bring to B?
[img]https://cdn.artofproblemsolving.com/attachments/f/5/ab62ce8fce3d482bc52b89463c953f4271b45e.png[/img]
[b]p3.[/b] Find the angle between the hour and minute hands at $7$ hours $38$ minutes.
[b]p4.[/b] The lottery game is played as follows. A random number from $1$ to $1000$ is selected. If it is divisible by $2$, they pay a ruble, if it is divisible by $10$ - two rubles, by $12$ - four rubles, by $20$ - eight, if it is divisible by several of these numbers, then they pay the sum. How much can you win (at one time) in such a game? List all options.
[b]p5.[/b]The sum of the digits of a positive integer $x$ is equal to $n$. Prove that between $x$ and $10x$ you can find an integer whose sum of digits is $ n + 5$.
[b]p6.[/b] $9$ people took part in the campaign, which lasted $12$ days. There were $3$ people on duty every day. At the same time, the duty officers quarreled with each other and no two of them wanted to be on duty together ever again. Nevertheless, the participants of the campaign claim that for all $12$ days they were able to appoint three people on duty, taking into account this requirement. Could this be so?
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c2416727_soros_olympiad_in_mathematics]here.[/url]
Show that the sequence $\{a_{n}\}_{n \ge 1}$ defined by $a_{n}=\lfloor n\sqrt{2}\rfloor$ contains an infinite number of integer powers of $2$.
Find all functions $f: \mathbb{R} \to \mathbb{R}$, such that for all real $x,y$ the following equation holds:$$f(x-0.25)+f(y-0.25)=f(x+\lfloor y+0.25 \rfloor - 0.25)$$
Two positive integers $m$ and $n$ are called [i]similar [/i] if one of them can be obtained from the other one by swapping two digits (note that a $0$-digit cannot be swapped with the leading digit). Find the greatest integer $N$ such that N is divisible by $13$ and any number similar to $N$ is not divisible by $13$.
Let $\Gamma$ be a circle with centre $I$, and $A B C D$ a convex quadrilateral such that each of the segments $A B, B C, C D$ and $D A$ is tangent to $\Gamma$. Let $\Omega$ be the circumcircle of the triangle $A I C$. The extension of $B A$ beyond $A$ meets $\Omega$ at $X$, and the extension of $B C$ beyond $C$ meets $\Omega$ at $Z$. The extensions of $A D$ and $C D$ beyond $D$ meet $\Omega$ at $Y$ and $T$, respectively. Prove that \[A D+D T+T X+X A=C D+D Y+Y Z+Z C.\]
[i]Proposed by Dominik Burek, Poland and Tomasz Ciesla, Poland[/i]
$M$ is any point on the side $AB$ of the triangle $ABC$. $r,r_1,r_2$ are the radii of the circles inscribed in $ABC,AMC,BMC$. $q$ is the radius of the circle on the opposite side of $AB$ to $C$, touching the three sides of $AB$ and the extensions of $CA$ and $CB$. Similarly, $q_1$ and $q_2$. Prove that $r_1r_2q=rq_1q_2$.
Let $\Omega$ and $\Gamma$ two circumferences such that $\Omega$ is in interior of $\Gamma$. Let $P$ a point on $\Gamma$.
Define points $A$ and $B$ distinct of $P$ on $\Gamma$ such that $PA$ and $PB$ are tangentes to $\Omega$. Prove that when $P$
varies on $\Gamma$, the line $AB$ is tangent to a fixed circunference.
[help me] Let m and n denote the number of digits in $2^{2007}$ and $5^{2007}$ when expressed in base 10. What is the sum m + n?
Three gamblers play against each other for money. They each start by placing a pile of one-krone coins on the table, and from this point on the total number of coins on the table does not change. The ratio between the number of coins they start with is $6 : 5 : 4$. At the end of the game, the ratio of the number of coins they have is $7 : 6 : 5$ in some order. At the end of the game, one of the gamblers has three coins more than at the beginning. How many coins does this gambler have at the end?
Find the smallest possible area of a convex pentagon whose vertexes are lattice points in a plane.
Circles $ A$, $ B$ and $ C$ are externally tangent to each other and internally tangent to circle $ D$. Circles $ B$ and $ C$ are congruent. Circle $ A$ has radius $ 1$ and passes through the center of $ D$. What is the radius of circle $ B$?
[asy]
unitsize(15mm);
pair A=(-1,0),B=(2/3,8/9),C=(2/3,-8/9),D=(0,0);
draw(Circle(D,2));
draw(Circle(A,1));
draw(Circle(B,8/9));
draw(Circle(C,8/9));
label("\(A\)", A);
label("\(B\)", B);
label("\(C\)", C);
label("D", (-1.2,1.8));[/asy]
$ \textbf{(A)}\ \frac23 \qquad \textbf{(B)}\ \frac {\sqrt3}{2} \qquad \textbf{(C)}\ \frac78 \qquad \textbf{(D)}\ \frac89 \qquad \textbf{(E)}\ \frac {1 \plus{} \sqrt3}{3}$
In a one-player game, you have three cards. At the beginning, a nonnegative integer is written on each of the cards, and the sum of these three integers is $2006$. At each step, you can select two of the three chards, subtract $1$ from the integer written on each of these two cards - as long as the resulting integers are still nonnegative -, and add $1$ to the integer written on the third card. You play this game until you can’t perform a step anymore because two of the cards have $0$’s written on them. Assume that, at this moment, the third card has a $1$ written on it. Prove that I can tell you which card contains the $1$ without knowing how exactly you proceeded in your game, but only knowing the starting configuration (i. e., the numbers written on the cards at the beginning of the game) and the fact that at the end, you were left with two $0$’s and a $1$.
Let $a_0$ be an arbitrary positive integer. Consider the infinite sequence $(a_n)_{n\geq 1}$, defined inductively as follows: given $a_0, a_1, ..., a_{n-1}$ define the term $a_n$ as the smallest positive integer such that $a_0+a_1+...+a_n$ is divisible by $n$. Prove that there exist a positive integer a positive integer $M$ such that $a_{n+1}=a_n$ for all $n\geq M$.
How many ordered sequences of $36$ digits have the property that summing the digits to get a number and taking the last digit of the sum results in a digit which is not in our original sequence? (Digits range from $0$ to $9$.)
Let $n\ge m\ge 1$ be integers. Prove that
\[\sum_{k=m}^n \left (\frac 1{k^2}+\frac 1{k^3}\right) \ge m\cdot \left(\sum_{k=m}^n \frac 1{k^2}\right)^2.\]
[i]Raymond Feng and Luke Robitaille[/i]
a) A student takes a subway to an Olympiad, pays one ruble and gets his change. Prove that if he takes a tram (street car) on his way home, he will have enough coins to pay the fare without change.
b) A student is going to a club. (S)he takes a tram, pays one ruble and gets the change. Prove that on the way back by a tram (s)he will be able to pay the fare without any need to change.
Note: In $1957$, the price of a subway ticket was $50$ kopeks, that of a tram ticket $30$ kopeks, the denominations of the coins were $1, 2, 3, 5, 10, 15$, and $20$ kopeks. ($1$ rouble = $100$ kopeks.)