Found problems: 85335
1995 Taiwan National Olympiad, 6
Let $a,b,c,d$ are integers such that $(a,b)=(c,d)=1$ and $ad-bc=k>0$. Prove that there are exactly $k$ pairs $(x_{1},x_{2})$ of rational numbers with $0\leq x_{1},x_{2}<1$ for which both $ax_{1}+bx_{2},cx_{1}+dx_{2}$ are integers.
1996 National High School Mathematics League, 4
Let $x\in\left(-\frac{1}{2},0\right)$, $\alpha_1=\cos(\sin x\pi),\alpha_2=\sin(\cos x\pi),\alpha_1=\cos (x+1)\pi$, then
$\text{(A)}\alpha_3<\alpha_2<\alpha_1\qquad\text{(B)}\alpha_1<\alpha_3<\alpha_2\qquad\text{(C)}\alpha_3<\alpha_1<\alpha_2\qquad\text{(D)}\alpha_2<\alpha_3<\alpha_1$
2023 China Northern MO, 6
A positive integer $m$ is called a [i]beautiful [/i] integer if that there exists a positive integer $n$ such that $m = n^2+ n + 1$. Prove that there are infinitely many [i]beautiful [/i] integers with square factors, and the square factors of different beautiful integers are relative prime.
2020 June Advanced Contest, 3
Let a [i]lattice tetrahedron[/i] denote a tetrahedron whose vertices have integer coordinates. Given a lattice tetrahedron, a [i]move[/i] consists of picking some vertex and moving it parallel to one of the three edges of the face opposite the vertex so that it lands on a different point with integer coordinates. Prove that any two lattice tetrahedra with the same volume can be transformed into each other by a series of moves
2013 Today's Calculation Of Integral, 884
Prove that :
\[\pi (e-1)<\int_0^{\pi} e^{|\cos 4x|}dx<2(e^{\frac{\pi}{2}}-1)\]
2022 Yasinsky Geometry Olympiad, 4
Let $BM$ be the median of triangle $ABC$. On the extension of $MB$ beyond $B$, the point $K$ is chosen so that $BK =\frac12 AC$. Prove that if $\angle AMB=60^o$, then $AK=BC$.
(Mykhailo Standenko)
2017 ABMC, Accuracy
[b]p1.[/b] Len's Spanish class has four tests in the first term. Len scores $72$, $81$, and $78$ on the first three tests. If Len wants to have an 80 average for the term, what is the minimum score he needs on the last test?
[b]p2.[/b] In $1824$, the Electoral College had $261$ members. Andrew Jackson won $99$ Electoral College votes and John Quincy Adams won $84$ votes. A plurality occurs when no candidate has more than $50\%$ of the votes. Should a plurality occur, the vote goes to the House of Representatives to break the tie. How many more votes would Jackson have needed so that a plurality would not have occurred?
[b]p3.[/b] $\frac12 + \frac16 + \frac{1}{12} + \frac{1}{20} + \frac{1}{30}= 1 - \frac{1}{n}$. Find $n$.
[b]p4.[/b] How many ways are there to sit Samuel, Esun, Johnny, and Prat in a row of $4$ chairs if Prat and Johnny refuse to sit on an end?
[b]p5.[/b] Find an ordered quadruple $(w, x, y, z)$ that satisfies the following: $$3^w + 3^x + 3^y = 3^z$$ where $w + x + y + z = 2017$.
[b]p6.[/b] In rectangle $ABCD$, $E$ is the midpoint of $CD$. If $AB = 6$ inches and $AE = 6$ inches, what is the length of $AC$?
[b]p7.[/b] Call an integer interesting if the integer is divisible by the sum of its digits. For example, $27$ is divisible by $2 + 7 = 9$, so $27$ is interesting. How many $2$-digit interesting integers are there?
[b]p8.[/b] Let $a\#b = \frac{a^3-b^3}{a-b}$ . If $a, b, c$ are the roots of the polynomial $x^3 + 2x^2 + 3x + 4$, what is the value of $a\#b + b\#c + c\#a$?
[b]p9.[/b] Akshay and Gowri are examining a strange chessboard. Suppose $3$ distinct rooks are placed into the following chessboard. Find the number of ways that one can place these rooks so that they don't attack each other. Note that two rooks are considered attacking each other if they are in the same row or the same column.
[img]https://cdn.artofproblemsolving.com/attachments/f/1/70f7d68c44a7a69eb13ce12291c0600d11027c.png[/img]
[b]p10.[/b] The Earth is a very large sphere. Richard and Allen have a large spherical model of Earth, and they would like to (for some strange reason) cut the sphere up with planar cuts. If each cut intersects the sphere, and Allen holds the sphere together so it does not fall apart after each cut, what is the maximum number of pieces the sphere can be cut into after $6$ cuts?
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
2016 IFYM, Sozopol, 6
We are given a chessboard 100 x 100, $k$ barriers (each with length 1), and one ball. We want to put the barriers between the cells of the board and put the ball in some cell, in such way that the ball can get to each possible cell on the board. The only way that the ball can move is by lifting the board so it can go only forward, backward, to the left or to the right. The ball passes all cells on its way until it reaches a barrier or the edge of the board where it stops. What’s the least number of barriers we need so we can achieve that?
Durer Math Competition CD 1st Round - geometry, 2011.D5
Is it true that in every convex polygon $3$ adjacent vertices can be selected such that their circumcirscribed circle can cover the entire polygon?
2024 Indonesia TST, N
A natural number $n$ is called "good" if there exists natural numbers $a$ and $b$ such that $a+b=n$ and $ab \mid n^2+n+1$. Show that there are infinitely many "good" numbers
2010 All-Russian Olympiad, 2
On an $n\times n$ chart, where $n \geq 4$, stand "$+$" signs in the cells of the main diagonal and "$-$" signs in all the other cells. You can change all the signs in one row or in one column, from $-$ to $+$ or from $+$ to $-$. Prove that you will always have $n$ or more $+$ signs after finitely many operations.
2014 Chile TST Ibero, 2
Let $\triangle ABC$ be a triangle and points $P, Q, R$ on the sides $AB, BC,$ and $CA$ respectively, such that:
\[
\frac{AP}{AB} = \frac{BQ}{BC} = \frac{CR}{CA} = \frac{1}{n}
\]
for $n \in \mathbb{N}$. The segments $AQ$ and $CP$ intersect at $D$, the segments $BR$ and $AQ$ intersect at $E$, and the segments $BR$ and $CP$ intersect at $F$. Compute the ratio:
\[
\frac{\text{Area}(\triangle ABC)}{\text{Area}(\triangle DEF)}.
\]
2018 Bundeswettbewerb Mathematik, 1
Anja and Bernd take turns in removing stones from a heap, initially consisting of $n$ stones ($n \ge 2$). Anja begins, removing at least one but not all the stones. Afterwards, in each turn the player has to remove at least one stone and at most as many stones as removed in the preceding move. The player removing the last stone wins.
Depending on the value of $n$, which player can ensure a win?
2024 Indonesia Regional, 3
Given a triangle $ABC$, points $X,Y,$ and $Z$ are the midpoints of $BC,CA,$ and $AB$ respectively. The perpendicular bisector of $AB$ intersects line $XY$ and line $AC$ at $Z_1$ and $Z_2$ respectively. The perpendicular bisector of $AC$ intersects line $XZ$ and line $AB$ at $Y_1$ and $Y_2$ respectively. Let $K$ be a point such that $KZ_1 = KZ_2$ and $KY_1 = KY_2$. Prove that $KB=KC$.
2024 Harvard-MIT Mathematics Tournament, 17
The numbers $1, 2, \ldots, 20$ are put into a hat. Claire draws two numbers from the hat uniformly at random, $a<b,$ and then puts them back into the hat. Then, William draws two numbers from the hat uniformly at random, $c<d.$
Let $N$ denote the number of integers $n$ that satisfy exactly one of $a \le n \le b$ and $c \le n \le d.$ Compute the probability that $N$ is even.
2023 Harvard-MIT Mathematics Tournament, 9
One hundred points labeled $1$ to $100$ are arranged in a $10\times 10$ grid such that adjacent points are one unit apart. The labels are increasing left to right, top to bottom (so the first row has labels $1$ to $10,$ the second row has labels $11$ to $20,$ and so on).
Convex polygon $\mathcal{P}$ has the property that every point with a label divisible by $7$ is either on the boundary or in the interior of $\mathcal{P}.$ Compute the smallest possible area of $\mathcal{P}.$
2015 Peru Cono Sur TST, P7
In the plan $6$ points were located such that the distance between two damages of them is greater than or equal to $1$. Prove that it is possible to choose two of those points such that their distance is greater than or equal to $2 \cos{18}$
Observation: It might help you to know that $\cos{18} = 0.95105\ldots$ and $\cos{24} = 0.91354\ldots$
2020 MBMT, 18
Let $w, x, y, z$ be integers from $0$ to $3$ inclusive. Find the number of ordered quadruples of $(w, x, y, z)$ such that $5x^2 + 5y^2 + 5z^2 - 6wx-6wy -6wz$ is divisible by $4$.
[i]Proposed by Timothy Qian[/i]
2016 Greece Team Selection Test, 2
Given is a triangle $\triangle{ABC}$,with $AB<AC<BC$,inscribed in circle $c(O,R)$.Let $D,E,Z$ be the midpoints of $BC,CA,AB$ respectively,and $K$ the foot of the altitude from $A$.At the exterior of $\triangle{ABC}$ and with the sides $AB,AC$ as diameters,we construct the semicircles $c_1,c_2$ respectively.Suppose that $P\equiv DZ\cap c_1 \ , \ S\equiv KZ\cap c_1$ and $R\equiv DE\cap c_2 \ , \ T\equiv KE\cap c_2$.Finally,let $M$ be the intersection of the lines $PS,RT$.
[b]i.[/b] Prove that the lines $PR,ST$ intersect at $A$.
[b]ii.[/b] Prove that the lines $PR\cap MD$ intersect on $c$.
[asy]import graph; size(8cm);
real labelscalefactor = 0.5; /* changes label-to-point distance */
pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); /* default pen style */
pen dotstyle = black; /* point style */
real xmin = -4.8592569519241255, xmax = 12.331775417316715, ymin = -3.1864435704043403, ymax = 6.540061585876658; /* image dimensions */
pen aqaqaq = rgb(0.6274509803921569,0.6274509803921569,0.6274509803921569); pen uququq = rgb(0.25098039215686274,0.25098039215686274,0.25098039215686274);
draw((0.6699432366054657,3.2576036755978928)--(0.,0.)--(5.,0.)--cycle, aqaqaq);
/* draw figures */
draw((0.6699432366054657,3.2576036755978928)--(0.,0.), uququq);
draw((0.,0.)--(5.,0.), uququq);
draw((5.,0.)--(0.6699432366054657,3.2576036755978928), uququq);
draw(shift((0.33497161830273287,1.6288018377989464))*xscale(1.662889476749906)*yscale(1.662889476749906)*arc((0,0),1,78.3788505217281,258.3788505217281));
draw(shift((2.834971618302733,1.6288018377989464))*xscale(2.7093067970187343)*yscale(2.7093067970187343)*arc((0,0),1,-36.95500560847834,143.0449943915217));
draw((0.6699432366054657,3.2576036755978928)--(0.6699432366054657,0.));
draw((-0.9938564482532047,2.628510486065423)--(2.5,0.));
draw((0.6699432366054657,0.)--(0.,3.2576036755978923));
draw((0.6699432366054657,0.)--(5.,3.257603675597893));
draw((2.5,0.)--(3.3807330143335355,4.282570444700163));
draw((-0.9938564482532047,2.628510486065423)--(2.5,4.8400585427926455));
draw((2.5,4.8400585427926455)--(5.,3.257603675597893));
draw((-0.9938564482532047,2.628510486065423)--(3.3807330143335355,4.282570444700163), linewidth(1.2) + linetype("2 2"));
draw((0.,3.2576036755978923)--(5.,3.257603675597893), linewidth(1.2) + linetype("2 2"));
draw(circle((2.5,1.18355242571055), 2.766007292905304), linewidth(0.4) + linetype("2 2"));
draw((2.5,4.8400585427926455)--(2.5,0.), linewidth(1.2) + linetype("2 2"));
/* dots and labels */
dot((0.6699432366054657,3.2576036755978928),linewidth(3.pt) + dotstyle);
label("$A$", (0.7472169504504719,2.65), NE * labelscalefactor);
dot((0.,0.),linewidth(3.pt) + dotstyle);
label("$B$", (-0.2,-0.4), NE * labelscalefactor);
dot((5.,0.),linewidth(3.pt) + dotstyle);
label("$C$", (5.028818057451246,-0.34281415594345044), NE * labelscalefactor);
dot((2.5,0.),linewidth(3.pt) + dotstyle);
label("$D$", (2.4275434226319077,-0.32665717063401356), NE * labelscalefactor);
dot((2.834971618302733,1.6288018377989464),linewidth(3.pt) + dotstyle);
label("$E$", (3.073822835009383,1.5637101105701008), NE * labelscalefactor);
dot((0.33497161830273287,1.6288018377989464),linewidth(3.pt) + dotstyle);
label("$Z$", (0.003995626216375389,1.402140257475732), NE * labelscalefactor);
dot((0.6699432366054657,0.),linewidth(3.pt) + dotstyle);
label("$K$", (0.6179610679749769,-0.3105001853245767), NE * labelscalefactor);
dot((-0.9938564482532047,2.628510486065423),linewidth(3.pt) + dotstyle);
label("$P$", (-1.0785223895158957,2.7916409940873033), NE * labelscalefactor);
dot((0.,3.2576036755978923),linewidth(3.pt) + dotstyle);
label("$S$", (-0.14141724156855653,3.454077391774215), NE * labelscalefactor);
dot((5.,3.257603675597893),linewidth(3.pt) + dotstyle);
label("$T$", (5.061132028070119,3.3571354799175936), NE * labelscalefactor);
dot((3.3807330143335355,4.282570444700163),linewidth(3.pt) + dotstyle);
label("$R$", (3.445433497126431,4.375025554412117), NE * labelscalefactor);
dot((2.5,4.8400585427926455),linewidth(3.pt) + dotstyle);
label("$M$", (2.5567993051074027,4.940520040242407), NE * labelscalefactor);
clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle);
/* end of picture */[/asy]
2005 Pan African, 2
Noah has to fit 8 species of animals into 4 cages of the Arc. He planes to put two species of animal in each cage. It turns out that, for each species of animal, there are at most 3 other species with which it cannot share a cage. Prove that there is a way to assign the animals to the cages so that each species shares a cage with a compatible species.
2014 Chile National Olympiad, 2
Consider an $ABCD$ parallelogram of area $1$. Let $E$ be the center of gravity of the triangle $ABC, F$ the center of gravity of the triangle $BCD, G$ the center of gravity of the triangle $CDA$ and $H$ the center of gravity of the triangle $DAB$. Calculate the area of quadrilateral $EFGH$.
2023 Belarusian National Olympiad, 8.2
The driver starts driving every morning at the same time from office to the house of his boss, picks up the boss and then drives back to the office. He always drives with the same speed on the same road. Because the time of arrival of the car to the boss's house is predetermined, the boss always leaves the house on time, and thus the driver does not spend any time waiting for his boss. Once the driver started driving from the office $42$ minutes later, than usual. The boss saw that the car didn't come and started walking in the direction of office. When he met the car on the road, the driver picked him up and started driving back to the office. The speed of the boss is 20 times lower than the speed of the car, and the time usually spent on the route from office to the house is at least an hour.
Determine did the car come earlier or later to the office and by how many minutes.
1989 Czech And Slovak Olympiad IIIA, 3
For given coprime numbers $p > q > 0$, find all pairs of real numbers $c,d$ such that for the sets
$$A = \left\{ \left[n\frac{p}{q}\right] , n \in N \right\} \ \ and \ \ B = \{[cn + d], n \in N\}$$
where $A \cap B = \emptyset$, $A \cup B = N$, where $N = \{1, 2, 3, ...\}$ is the set of all natural numbers.
2021 Macedonian Mathematical Olympiad, Problem 2
In the City of Islands there are $2021$ islands connected by bridges. For any given pair of islands $A$ and $B$, one can go from island $A$ to island $B$ using the bridges. Moreover, for any four islands $A_1, A_2, A_3$ and $A_4$: if there is a bridge from $A_i$ to $A_{i+1}$ for each $i \in \left \{ 1,2,3 \right \}$, then there is a bridge between $A_{j}$ and $A_{k}$ for some $j,k \in \left \{ 1,2,3,4 \right \}$ with $|j-k|=2$. Show that there is at least one island which is connected to any other island by a bridge.
2007 Junior Balkan Team Selection Tests - Romania, 3
Let $ABC$ be a right triangle with $A = 90^{\circ}$ and $D \in (AC)$. Denote by $E$ the reflection of $A$ in the line $BD$ and $F$ the intersection point of $CE$ with the perpendicular in $D$ to $BC$. Prove that $AF, DE$ and $BC$ are concurrent.