Found problems: 85335
In a room, we have 2019 aligned switches, connected to 2019 light bulbs, all initially switched on. Then, 2019 people enter the room one by one, performing the operation: The first, uses all the switches; the second, every second switch; the third, every third switch, and so on. How many lightbulbs remain switched on, after all the people entered ?
Find all non-decreasing functions from real numbers to itself such that for all real numbers $x,y$ $f(f(x^2)+y+f(y))=x^2+2f(y)$ holds.
What is the value of $2-(-2)^{-2}$?
$ \textbf{(A) } -2
\qquad\textbf{(B) } \dfrac{1}{16}
\qquad\textbf{(C) } \dfrac{7}{4}
\qquad\textbf{(D) } \dfrac{9}{4}
\qquad\textbf{(E) } 6
$
There are pieces in the shape of an equilateral triangle with sides $1, 2, 3, 4, 5$ and $6$ ($50$ pieces of each size). You want to build an equilateral triangle of side $7$ using some of these pieces, without gaps or overlaps. What is the least number of pieces needed?
The sum of the largest number and the smallest number of a triple of positive integers $(x,y,z)$ is called to be the power of the triple. What is the sum of powers of all triples $(x,y,z)$ where $x,y,z \leq 9$?
$
\textbf{(A)}\ 9000
\qquad\textbf{(B)}\ 8460
\qquad\textbf{(C)}\ 7290
\qquad\textbf{(D)}\ 6150
\qquad\textbf{(E)}\ 6000
$
Let $p$ be a prime number.
Prove that it is possible to choose a permutation $a_1, a_2,...,a_p$ of $1,2,...,p$ such that the numbers $a_1, a_1a_2, a_1a_2a_3,..., a_1a_2a_3...a_p$ all have different remainder upon division by $p$.
Which natural numbers can be expressed as the difference of squares of two integers?
A $5 \times 100$ table is divided into $500$ unit square cells, where $n$ of them are coloured black and the rest are coloured white. Two unit square cells are called [i]adjacent[/i] if they share a common side. Each of the unit square cells has at most two adjacent black unit square cells. Find the largest possible value of $n$.
\[\int_0^1 \frac{1-x}{x^{5/2}+x^{3/2}+x^{1/2}}\mathrm dx\]
[i]Proposed by Connor Gordon[/i]
Let $S$ be a given sphere with center $O$ and radius $r$. Let $P$ be any point outside then sphere $S$, and let $S'$ be the sphere with center $P$ and radius $PO$. Denote by $F$ the area of the surface of the part of $S'$ that lies inside $S$. Prove that $F$ is independent of the particular point $P$ chosen.
Let $ABC$ be a triangle and let $D$ be the foot of the altitude from $A$. Let points $E$ and $F$ on a line through $D$ such that $AE$ is perpendicular to $BE$, $AF$ is perpendicular to $CF$, where $E$ and $F$ are points other than the point $D$. Let $M$ and $N$ be the midpoints of $BC$ and $EF$, respectively. Prove that $AN$ is perpendicular to $NM$.
Can we draw $\triangle ABC$ and points $X,Y$, such that $AX=BY=AB$, $ BX = CY = BC$,
$CX = AY = CA$?
The diagonals of a rectangle $ABCD$ meet at point $E$. A circle centered at $E$ lies inside the rectangle. Let $CF$, $DG$, $AH$ be the tangents to this circle from $C$, $D$, $A$; let $CF$ meet $DG$ at point $I$, $EI$ meet $AD$ at point $J$, and $AH$ meet $CF$ at point $L$. Prove that $LJ$ is perpendicular to $AD$.
For any real value of $ x$ the maximum value of $ 8x \minus{} 3x^2$ is:
$ \textbf{(A)}\ 0 \qquad
\textbf{(B)}\ \frac83 \qquad
\textbf{(C)}\ 4 \qquad
\textbf{(D)}\ 5 \qquad
\textbf{(E)}\ \frac{16}{3}$
The base of a convex pyramid has an odd number of edges. The lateral edges of the pyramid are all equal, and the angles between neighbouring faces are all equal. Show that the base must be a regular polygon.
Define the function $f:(0,1)\to (0,1)$ by \[\displaystyle f(x) = \left\{ \begin{array}{lr} x+\frac 12 & \text{if}\ \ x < \frac 12\\ x^2 & \text{if}\ \ x \ge \frac 12 \end{array} \right.\] Let $a$ and $b$ be two real numbers such that $0 < a < b < 1$. We define the sequences $a_n$ and $b_n$ by $a_0 = a, b_0 = b$, and $a_n = f( a_{n -1})$, $b_n = f (b_{n -1} )$ for $n > 0$. Show that there exists a positive integer $n$ such that \[(a_n - a_{n-1})(b_n-b_{n-1})<0.\]
[i]Proposed by Denmark[/i]
Benedek wrote the following $300 $ statements on a piece of paper.
$2 | 1!$
$3 | 1! \,\,\, 3 | 2!$
$4 | 1! \,\,\, 4 | 2! \,\,\, 4 | 3!$
$5 | 1! \,\,\, 5 | 2! \,\,\, 5 | 3! \,\,\, 5 | 4!$
$...$
$24 | 1! \,\,\, 24 | 2! \,\,\, 24 | 3! \,\,\, 24 | 4! \,\,\, · · · \,\,\, 24 | 23!$
$25 | 1! \,\,\, 25 | 2! \,\,\, 25 | 3! \,\,\, 25 | 4! \,\,\, · · · \,\,\, 25 | 23! \,\,\, 25 | 24!$
How many true statements did Benedek write down?
The symbol | denotes divisibility, e.g. $6 | 4!$ means that $6$ is a divisor of number $4!$.
Six bags of marbles contain $ 18$, $ 19$, $ 21$, $ 23$, $ 25$, and $ 34$ marbles, respectively. One bag contains chipped marbles only. The other $ 5$ bags contain no chipped marbles. Jane takes three of the bags and George takes two of the others. Only the bag of chipped marbles remains. If Jane gets twice as many marbles as George, how many chipped marbles are there?
$ \textbf{(A)}\ 18 \qquad \textbf{(B)}\ 19 \qquad \textbf{(C)}\ 21 \qquad \textbf{(D)}\ 23 \qquad \textbf{(E)}\ 25$
Find all the functions $f: \mathbb{R} \to\mathbb{R}$ such that
\[f(x-f(y))=f(f(y))+xf(y)+f(x)-1\]
for all $x,y \in \mathbb{R} $.
A subset $U \subset R$ is open if for any $x \in U$, there exist real numbers $a, b$ such that $x \in (a, b) \subset U$. Suppose $S \subset R$ has the property that any open set intersecting $(0, 1)$ also intersects $S$. Let $T$ be a countable collection of open sets containing $S$. Prove that the intersection of all of the sets of $T$ is not a countable subset of $R$.
(A set $\Gamma$ is countable if there exists a bijective function $f : \Gamma \to Z$.)
Find the minimum positive value of $ 1*2*3*4*...*2020*2021*2022$ where you can replace $*$ as $+$ or $-$
Let $a_1, a_2,\dots$ be an infinite sequence of positive real numbers such that for each positive integer $n$ we have \[\frac{a_1+a_2+\cdots+a_n}n\geq\sqrt{\frac{a_1^2+a_2^2+\cdots+a_{n+1}^2}{n+1}}.\]
Prove that the sequence $a_1,a_2,\dots$ is constant.
[i]Proposed by Alex Zhai[/i]
Find all triples $(p, x, y)$ consisting of a prime number $p$ and two positive integers $x$ and $y$ such that $x^{p -1} + y$ and $x + y^ {p -1}$ are both powers of $p$.
[i]Proposed by Belgium[/i]
Let $ ABCD$ be a parallelogram with $ \angle BAD \equal{} 60$ and denote by $ E$ the intersection of its diagonals. The circumcircle of triangle $ ACD$ meets the line $ BA$ at $ K \ne A$, the line $ BD$ at $ P \ne D$ and the line $ BC$ at $ L\ne C$. The line $ EP$ intersects the circumcircle of triangle $ CEL$ at points $ E$ and $ M$. Prove that triangles $ KLM$ and $ CAP$ are congruent.
There are $2005$ young people sitting around a large circular table. Of these, at most $668$ are boys. We say that a girl $G$ has a strong position, if, counting from $G$ in either direction, the number of girls is always strictly larger than the number of boys ($G$ is herself included in the count). Prove that there is always a girl in a strong position.