This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND
OR
NO

Found problems: 85335

You are given a standard kilogram mass and a tuning fork that is calibrated in Hz. You are also provided with a complete collection of laboratory equipment, but none of it is calibrated in SI units. You do not know the values of any fundamental constants. Which of the following quantities could you measure in SI units? (A) The acceleration due to gravity. (B) The speed of light in a vacuum. (C) The density of room temperature water. (D) The spring constant of a given spring. (E) The air pressure in the room.
[b]a)[/b] Show that if four distinct complex numbers have the same absolute value and their sum vanishes, then they represent a rectangle. [b]b)[/b] Let $ x,y,z,t $ be four real numbers, and $ k $ be an integer. Prove the following implication: $$ \sum_{j\in\{ x,y,z,t\}} \sin j = 0 = \sum_{j\in\{ x,y,z,t\}} \cos j\implies \sum_{j\in\{ x,y,z,t\}} \sin (1+2n)j. $$
a) Find at least two functions $f: \mathbb{R}^+ \rightarrow \mathbb{R}^+$ such that $$\displaystyle{2f(x^2)\geq xf(x) + x,}$$ for all $x \in \mathbb{R}^+.$ b) Let $f: \mathbb{R}^+ \rightarrow \mathbb{R}^+$ be a function such that $$\displaystyle{2f(x^2)\geq xf(x) + x,}$$ for all $x \in \mathbb{R}^+.$ Show that $ f(x^3)\geq x^2,$ for all $x \in \mathbb{R}^+.$ Can we find the best constant $a\in \Bbb{R}$ such that $f(x)\geq x^a,$ for all $x \in \mathbb{R}^+?$
Given a point $O$ inside triangle $ABC$ . Prove that $$S_A * \overrightarrow{OA} + S_B * \overrightarrow{OB} + S_C * \overrightarrow{OC} = \overrightarrow{0}$$ where $S_A, S_B, S_C$ denote areas of triangles $BOC, COA, AOB$ respectively.
[b]p1.[/b] Thirty players participate in a chess tournament. Every player plays one game with every other player. What maximal number of players can get exactly $5$ points? (any game adds $1$ point to the winner’s score, $0$ points to a loser’s score, in the case of a draw each player obtains $1/2$ point.) [b]p2.[/b] A father and his son returned from a fishing trip. To make their catches equal the father gave to his son some of his fish. If, instead, the son had given his father the same number of fish, then father would have had twice as many fish as his son. What percent more is the father's catch more than his son's? [b]p3.[/b] What is the maximal number of pieces of two shapes, [img]https://cdn.artofproblemsolving.com/attachments/a/5/6c567cf6a04b0aa9e998dbae3803b6eeb24a35.png[/img] and [img]https://cdn.artofproblemsolving.com/attachments/8/a/7a7754d0f2517c93c5bb931fb7b5ae8f5e3217.png[/img], that can be used to tile a $7\times 7$ square? [b]p4.[/b] Six shooters participate in a shooting competition. Every participant has $5$ shots. Each shot adds from 1 to $10$ points to shooter’s score. Every person can score totally for all five shots from $5$ to $50$ points. Each participant gets $7$ points for at least one of his shots. The scores of all participants are different. We enumerate the shooters $1$ to $6$ according to their scores, the person with maximal score obtains number $1$, the next one obtains number $2$, the person with minimal score obtains number $6$. What score does obtain the participant number 3? The total number of all obtained points is $264$. [b]p5.[/b] There are $2014$ stones in a pile. Two players play the following game. First, player $A$ takes some number of stones (from $1$ to $30$) from the pile, then player B takes $1$ or $2$ stones, then player $A$ takes $2$ or $3$ stones, then player $B$ takes $3$ or $4$ stones, then player A takes $4$ or $5$ stones, etc. The player who gets the last stone is the winner. If no player gets the last stone (there is at least one stone in the pile but the next move is not allowed) then the game results in a draw. Who wins the game using the right strategy? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
In the game of Nim, players are given several piles of stones. On each turn, a player picks a nonempty pile and removes any positive integer number of stones from that pile. The player who removes the last stone wins, while the first player who cannot move loses. Alice, Bob, and Chebyshev play a 3-player version of Nim where each player wants to win but avoids losing at all costs (there is always a player who neither wins nor loses). Initially, the piles have sizes $43$, $99$, $x$, $y$, where $x$ and $y$ are positive integers. Assuming that the first player loses when all players play optimally, compute the maximum possible value of $xy$. [i]Proposed by Sammy Luo[/i]
Let $ABCD$ be a convex quadrilateral such that $\angle ABC = \angle ADC = 135^{\circ}$ and \[AC^2\cdot BD^2 = 2\cdot AB\cdot BC\cdot CD\cdot DA.\] Prove that the diagonals of the quadrilateral $ABCD$ are perpendicular.
Three nonzero real numbers are given. If they are written in any order as coefficients of a quadratic trinomial, then each of these trinomials has a real root. Does it follow that each of these trinomials has a positive root?
[b]p1.[/b] The numerator of the fraction was increased by 20%. By what percentage should its denominator be reduced so that the resulting fraction doubles? [b]p2.[/b] From point $O$ on the plane there are four rays $OA$, $OB$, $OC$ and $OD$ (not necessarily in that order). It is known that $\angle AOB =40^o$, $\angle BOC = 70^o$, $\angle COD = 80^o$. What values can the angle between rays $OA$ and $OD$ take? (The angle between the rays is from $0^o$ to $180^o$.) [b]p3.[/b] Three equal circles have a common interior point. Prove that there is a circle of the same radius containing the centers of these three circles. [b]p4.[/b] Two non-leap years are consecutive. The first one has more Mondays than Wednesdays. Which of the seven days of the week will occur most often in the second year? [b]p5.[/b] The difference between two four-digit numbers is $7$. How much can the sums of their digits differ? [b]p6.[/b] The numbers $1, 2, 3, 4, 5, 6, 7, 8, 9$ are written on the board. In one move you can increase any of the numbers by $3$ or $5$. What is the minimum number of moves you need to make for all the numbers to become equal? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c2416727_soros_olympiad_in_mathematics]here.[/url]
Some students of a group were friends of some others. One day all students of the group take part in a picnic. During the picnic some friends had a quarrel with each other, but some other students became friends. After the picnic, the number of friends for each student changed by $1$. Prove that the number of students in the group was even.
Consider the function $ h$, defined for all positive real numbers, such that: $$10x -6h(x) = 4h \left(\frac{2020}{x}\right) $$ for all $x > 0$. Find $h(x)$ and the value of $h(4)$.
The game Boddle uses eight cards numbered $6, 11, 12, 14, 24, 47, 54$, and $n$, where $0 \le n \le 56$. An integer D is announced, and players try to obtain two cards, which are not necessarily distinct, such that one of their differences (positive or negative) is congruent to $D$ modulo $57$. For example, if $D = 27$, then the pair $24$ and $54$ would work because $24 - 54 \equiv 27$ mod $57$. Compute $n$ such that this task is always possible for all $D$.
Ten pirates find a chest filled with golden and silver coins. There are twice as many silver coins in the chest as there are golden. They divide the golden coins in such a way that the difference of the numbers of coins given to any two of the pirates is not divisible by $10.$ Prove that they cannot divide the silver coins in the same way.
Let $ABCD$ be a convex quadrilateral. Points $X$ and $Y$ lie on the extensions beyond $D$ of the sides $CD$ and $AD$ respectively in such a way that $DX = AB$ and $DY = BC$. Similarly points $Z$ and $T$ lie on the extensions beyond $B$ of the sides $CB$ and $AB$ respectively in such a way that $BZ = AD$ and $BT = DC$. Let $M_1$ be the midpoint of $XY$, and $M_2$ be the midpoint of $ZT$. Prove that the lines $DM_1, BM_2$ and $AC$ concur.
$ a,b,c,d \in [0,1]$ and $ x,y,z,t \in [0, \frac{1}{2}]$ and $ a+b+c+d=x+y+z+t=1$.prove that: $ (i)$ $ ax+by+cz+dt$ $ \geq$ $ min( {\frac{a+b}{2} , \frac{b+c}{2} , \frac{c+d}{2} , \frac{d+a}{2} , \frac{a+c}{2} , \frac{b+d}{2} )}$ $ (ii)$ $ ax+by+cz+dt$ $ \geq$ $ 54abcd$
Let $ABC$ be an acute triangle with incenter $I$ and circumcircle $\Omega$. The line passing $I$ and perpendicular to $AI$ meets $AB, AC$ at $D, E$, respectively. $A$-excircle of $\triangle{ABC}$ meets $BC$ at $T$. $AT$ meets $\Omega$ at $P$. The line passing $P$ and parallel to $BC$ meets $\Omega$ at $Q$. The intersection of $QI$ and $AT$ is $K$. Prove that $Q,D,K,E$ are concyclic.
Find all integer solutions of the equation \[\frac {x^{7} \minus{} 1}{x \minus{} 1} \equal{} y^{5} \minus{} 1.\]
Solve the system of equations \[x^2 + y^2 + z^2 + t^2 = 50;\] \[x^2 - y^2 + z^2 - t^2 = -24;\] \[xy = zt;\] \[x - y + z - t = 0.\]
Let $ I$ be the incentre and $ O$ the circumcentre of a given acute triangle $ ABC$. The incircle is tangent to $ BC$ at $ D$. Assume that $ \angle B < \angle C$ and the segments $ AO$ and $ HD$ are parallel, where $H$ is the orthocentre of triangle $ABC$. Let the intersection of the line $ OD$ and $ AH$ be $ E$. If the midpoint of $ CI$ is $ F$, prove that $ E,F,I,O$ are concyclic.
A straight road consists of green and red segments in alternating colours, the first and last segment being green. Suppose that the lengths of all segments are more than a centimeter and less than a meter, and that the length of each subsequent segment is larger than the previous one. A grasshopper wants to jump forward along the road along these segments, stepping on each green segment at least once an without stepping on any red segment (or the border between neighboring segments). Prove that the grasshopper can do this in such a way that among the lengths of his jumps no more than $8$ different values occur. [i]Proposed by T. Korotchenko[/i]
Given a circle, point $A$ on it and point $M$ inside it. We consider the chords $BC$ passing through $M$. Prove that the circles passing through the midpoints of the sides of all the triangles $ABC$ are tangent to a fixed circle.
Let $a>1$ and $b>1$ be rational numbers. Denote by $\mathcal{F}_{a,b}$ the set of functions $f:[0,\infty)\rightarrow\mathbb{R}$ such that $$f(ax)=bf(x), \text{ for all }x\geq 0.$$ a) Prove that the set $\mathcal{F}_{a,b}$ contains both Riemann integrable functions on any interval and functions that are not Riemann integrable on any interval. b) If $f\in\mathcal{F}_{a,b}$ is Riemann integrable on $[0,\infty)$ and $\int_{\frac{1}{a}}^{a}f(x)dx=1$, calculate $$\int_a^{a^2} f(x)dx\text{ and }\int_0^1 f(x)dx.$$ [i]Vasile Pop[/i]
In an in finite sequence $a_1, a_2, a_3, \cdots$, the number $a_1$ equals $1$, and each $a_n, n > 1$, is obtained from $a_{n-1}$ as follows: [list]- if the greatest odd divisor of $n$ has residue $1$ modulo $4$, then $a_n = a_{n-1} + 1,$ - and if this residue equals $3$, then $a_n = a_{n-1} - 1.$[/list] Prove that in this sequence [b](a) [/b] the number $1$ occurs infi nitely many times; [b](b)[/b] each positive integer occurs infi nitely many times. (The initial terms of this sequence are $1, 2, 1, 2, 3, 2, 1, 2, 3, 4, 3, \cdots$ )
Let $f(n)=1 \times 3 \times 5 \times \cdots \times (2n-1)$. Compute the remainder when $f(1)+f(2)+f(3)+\cdots +f(2016)$ is divided by $100.$ [i]Proposed by James Lin[/i]
We say that a $2023$-tuple of nonnegative integers $(a_1,\hdots,a_{2023})$ is [i]sweet[/i] if the following conditions hold: [list] [*] $a_1+\hdots+a_{2023}=2023$ [*] $\frac{a_1}{2}+\frac{a_2}{2^2}+\hdots+\frac{a_{2023}}{2^{2023}}\le 1$ [/list] Determine the greatest positive integer $L$ so that \[a_1+2a_2+\hdots+2023a_{2023}\ge L\] holds for every sweet $2023$-tuple $(a_1,\hdots,a_{2023})$ [i]Ivan Novak[/i]