Found problems: 85335
2009 Jozsef Wildt International Math Competition, W. 8
If $n,p,q \in \mathbb{N}, p<q $ then $${{(p+q)n}\choose{n}} \sum \limits_{k=0}^n (-1)^k {{n}\choose{k}} {{(p+q-1)n}\choose{pn-k}}= {{(p+q)n}\choose{pn}} \sum \limits_{k=0}^{\left [\frac{n}{2} \right ]} (-1)^k {{pn}\choose{k}} {{(q-p)n}\choose{n-2k}} $$
2018 India IMO Training Camp, 3
Find the smallest positive integer $n$ or show no such $n$ exists, with the following property: there are infinitely many distinct $n$-tuples of positive rational numbers $(a_1, a_2, \ldots, a_n)$ such that both
$$a_1+a_2+\dots +a_n \quad \text{and} \quad \frac{1}{a_1} + \frac{1}{a_2} + \dots + \frac{1}{a_n}$$
are integers.
2021 Purple Comet Problems, 1
The diagram shows two intersecting line segments that form some of the sides of two squares with side lengths $3$ and $6$. Two line segments join vertices of these squares. Find the area of the region enclosed by the squares and segments.
2015 Junior Regional Olympiad - FBH, 2
Seller reduced price of one shirt for $20\%$,and they raised it by $10\%$. Does he needs to reduce or raise the price and how many, so that price of shirt will be reduced by $10\%$ from the original price
2005 Tuymaada Olympiad, 8
Let $a,b,c$ be positive reals s.t. $a^2+b^2+c^2=1$. Prove the following inequality \[ \sum \frac{a}{a^3+bc} >3 . \]
[i]Proposed by A. Khrabrov[/i]
2010 Contests, 3
There are $ n$ websites $ 1,2,\ldots,n$ ($ n \geq 2$). If there is a link from website $ i$ to $ j$, we can use this link so we can move website $ i$ to $ j$.
For all $ i \in \left\{1,2,\ldots,n - 1 \right\}$, there is a link from website $ i$ to $ i+1$.
Prove that we can add less or equal than $ 3(n - 1)\log_{2}(\log_{2} n)$ links so that for all integers $ 1 \leq i < j \leq n$, starting with website $ i$, and using at most three links to website $ j$. (If we use a link, website's number should increase. For example, No.7 to 4 is impossible).
Sorry for my bad English.
2005 JBMO Shortlist, 5
Let $O$ be the center of the concentric circles $C_1,C_2$ of radii $3$ and $5$ respectively. Let $A\in C_1, B\in C_2$ and $C$ point so that triangle $ABC$ is equilateral. Find the maximum length of $ [OC] $.
2016 PUMaC Team, 9
Let $\vartriangle ABC$ be a right triangle with $AB = 4, BC = 5$, and hypotenuse $AC$. Let I be the incenter of $\vartriangle ABC$ and $E$ be the excenter of $\vartriangle ABC$ opposite $A$ (the center of the circle tangent to $BC$ and the extensions of segments $AB$ and $AC$). Suppose the circle with diameter $IE$ intersects line $AB$ beyond $B$ at $D$. If $BD =\sqrt{a}- b$, where a and b are positive integers. Find $a + b$.
2020 OMMock - Mexico National Olympiad Mock Exam, 4
Let $ABC$ be a triangle. Suppose that the perpendicular bisector of $BC$ meets the circle of diameter $AB$ at a point $D$ at the opposite side of $BC$ with respect to $A$, and meets the circle through $A, C, D$ again at $E$. Prove that $\angle ACE=\angle BCD$.
[i]Proposed by José Manuel Guerra and Victor DomÃnguez[/i]
2004 Postal Coaching, 14
Find the greatest common divisor of all number in the set $( a^{41} - a | a \in \mathbb{N} and \geq 2 )$ . What is your guess if 41 is replaced by a natural number $n$
2009 Sharygin Geometry Olympiad, 18
Given three parallel lines on the plane. Find the locus of incenters of triangles with vertices lying on these lines (a single vertex on each line).
2022 Kosovo National Mathematical Olympiad, 4
Find all positive integers $k,m$ and $n$ such that $k!+3^m=3^n$
2018 Rioplatense Mathematical Olympiad, Level 3, 6
A company has $n$ employees. It is known that each of the employees works at least one of the $7$ days of the week, with the exception of an employee who does not work any of the $7$ days. Furthermore, for any two of these $n$ employees, there are at least $3$ days of the week in which one of the two works that day and the other does not (it is not necessarily the same employee who works those days). Determine the highest possible value of $n$.
2016 Bangladesh Mathematical Olympiad, 5
Suppose there are $m$ Martians and $n$ Earthlings at an intergalactic peace conference. To ensure the Martians stay peaceful at the conference, we must make sure that no two Martians sit together, such that between any two Martians there is always at least one Earthling.
(a) Suppose all $m + n$ Martians and Earthlings are seated in a line. How many ways can the Earthlings and Martians be seated in a line?
(b) Suppose now that the $m+n$ Martians and Earthlings are seated around a circular round-table. How many ways can the Earthlings and Martians be seated around the round-table?
2022 Sharygin Geometry Olympiad, 10.1
$A_1A_2A_3A_4$ and $B_1B_2B_3B_4$ are two squares with their vertices arranged clockwise.The perpendicular bisector of segment $A_1B_1,A_2B_2,A_3B_3,A_4B_4$ and the perpendicular bisector of segment $A_2B_2,A_3B_3,A_4B_4,A_1B_1$ intersect at point $P,Q,R,S$ respectively.Show that:$PR\perp QS$.
1984 USAMO, 2
The geometric mean of any set of $m$ non-negative numbers is the $m$-th root of their product.
$\quad (\text{i})\quad$ For which positive integers $n$ is there a finite set $S_n$ of $n$ distinct positive integers such that the geometric mean of any subset of $S_n$ is an integer?
$\quad (\text{ii})\quad$ Is there an infinite set $S$ of distinct positive integers such that the geometric mean of any finite subset of $S$ is an integer?
2013 Greece Team Selection Test, 3
Given is a triangle $ABC$.On the extensions of the side $AB$ we consider points $A_1,B_1$ such that $AB_1=BA_1$ (with $A_1$ lying closer to $B$).On the extensions of the side $BC$ we consider points $B_4,C_4$ such that $CB_4=BC_4$ (with $B_4$ lying closer to $C$).On the extensions of the side $AC$ we consider points $C_1,A_4$ such that $AC_1=CA_4$ (with $C_1$ lying closer to $A$).On the segment $A_1A_4$ we consider points $A_2,A_3$ such that $A_1A_2=A_3A_4=mA_1A_4$ where $0<m<\frac{1}{2}$.Points $B_2,B_3$ and $C_2,C_3$ are defined similarly,on the segments $B_1B_4,C_1C_4$ respectively.If $D\equiv BB_2\cap CC_2 \ , \ E\equiv AA_3\cap CC_2 \ , \ F\equiv AA_3\cap BB_3$, $\ G\equiv BB_3\cap CC_3 \ , \ H\equiv AA_2\cap CC_3$ and $I\equiv AA_2\cap BB_2$,prove that the diagonals $DG,EH,FI$ of the hexagon $DEFGHI$ are concurrent.
[hide=Diagram][asy]import graph; size(12cm);
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 = -7.984603447540051, xmax = 21.28710511372557, ymin = -6.555010307713199, ymax = 10.006614273002825; /* image dimensions */
pen aqaqaq = rgb(0.6274509803921569,0.6274509803921569,0.6274509803921569); pen uququq = rgb(0.25098039215686274,0.25098039215686274,0.25098039215686274);
draw((1.1583842866003107,4.638449718549554)--(0.,0.)--(7.,0.)--cycle, aqaqaq);
/* draw figures */
draw((1.1583842866003107,4.638449718549554)--(0.,0.), uququq);
draw((0.,0.)--(7.,0.), uququq);
draw((7.,0.)--(1.1583842866003107,4.638449718549554), uququq);
draw((1.1583842866003107,4.638449718549554)--(1.623345080409327,6.500264738079558));
draw((0.,0.)--(-0.46496079380901606,-1.8618150195300045));
draw((-3.0803965232149757,0.)--(0.,0.));
draw((7.,0.)--(10.080396523214976,0.));
draw((1.1583842866003107,4.638449718549554)--(0.007284204967787214,5.552463941947242));
draw((7.,0.)--(8.151100081632526,-0.9140142233976905));
draw((-0.46496079380901606,-1.8618150195300045)--(8.151100081632526,-0.9140142233976905));
draw((-3.0803965232149757,0.)--(0.007284204967787214,5.552463941947242));
draw((10.080396523214976,0.)--(1.623345080409327,6.500264738079558));
draw((0.,0.)--(3.7376079411107392,4.8751985535596685));
draw((-0.7646359770779035,4.164347956460432)--(7.,0.));
draw((1.1583842866003107,4.638449718549554)--(5.997084862772141,-1.150964422430769));
draw((0.,0.)--(7.966133662513563,1.6250661845198895));
draw((-2.308476341169285,1.3881159854868106)--(7.,0.));
draw((1.1583842866003107,4.638449718549554)--(1.6890544250513695,-1.624864820496926));
draw((2.0395968109217,2.660375186246903)--(2.9561195753832448,0.6030390855677443), linetype("2 2"));
draw((3.4388364046369224,1.909931693481981)--(1.4816619768719694,0.8229159040072803), linetype("2 2"));
draw((1.3969966570225139,1.8221911417546572)--(4.301698851378541,0.8775330211014288), linetype("2 2"));
/* dots and labels */
dot((1.1583842866003107,4.638449718549554),linewidth(3.pt) + dotstyle);
label("$A$", (0.6263408942608304,4.2), NE * labelscalefactor);
dot((0.,0.),linewidth(3.pt) + dotstyle);
label("$B$", (-0.44658827292841696,0.04763072114368767), NE * labelscalefactor);
dot((7.,0.),linewidth(3.pt) + dotstyle);
label("$C$", (7.008893888822507,0.18518574257820614), NE * labelscalefactor);
dot((1.623345080409327,6.500264738079558),linewidth(3.pt) + dotstyle);
label("$B_1$", (1.7267810657369815,6.6777827542874775), NE * labelscalefactor);
dot((-0.46496079380901606,-1.8618150195300045),linewidth(3.pt) + dotstyle);
label("$A_1$", (-1.1068523758141076,-1.6305405403574376), NE * labelscalefactor);
dot((10.080396523214976,0.),linewidth(3.pt) + dotstyle);
label("$B_4$", (10.062615364668826,-0.612633381742001), NE * labelscalefactor);
dot((-3.0803965232149757,0.),linewidth(3.pt) + dotstyle);
label("$C_4$", (-3.3077327187664096,-0.612633381742001), NE * labelscalefactor);
dot((0.007284204967787214,5.552463941947242),linewidth(3.pt) + dotstyle);
label("$C_1$", (0.1036318128096586,5.714897604245849), NE * labelscalefactor);
dot((8.151100081632526,-0.9140142233976905),linewidth(3.pt) + dotstyle);
label("$A_4$", (8.521999124602214,-1.1903644717669786), NE * labelscalefactor);
dot((-2.308476341169285,1.3881159854868106),linewidth(3.pt) + dotstyle);
label("$C_3$", (-2.9776006673235647,1.7808239912186203), NE * labelscalefactor);
dot((-0.7646359770779035,4.164347956460432),linewidth(3.pt) + dotstyle);
label("$C_2$", (-1.1618743843879151,4.504413415622086), NE * labelscalefactor);
dot((1.6890544250513695,-1.624864820496926),linewidth(3.pt) + dotstyle);
label("$A_2$", (1.6167370485893664,-2.125738617521704), NE * labelscalefactor);
dot((5.997084862772141,-1.150964422430769),linewidth(3.pt) + dotstyle);
label("$A_3$", (6.211074764502297,-1.603029536070534), NE * labelscalefactor);
dot((7.966133662513563,1.6250661845198895),linewidth(3.pt) + dotstyle);
label("$B_3$", (8.081823056011753,1.7808239912186203), NE * labelscalefactor);
dot((3.7376079411107392,4.8751985535596685),linewidth(3.pt) + dotstyle);
label("$B_2$", (3.8451283958285725,5.027122497073257), NE * labelscalefactor);
dot((2.0395968109217,2.660375186246903),linewidth(3.pt) + dotstyle);
label("$D$", (1.7542920700238853,2.991308179842383), NE * labelscalefactor);
dot((3.4388364046369224,1.909931693481981),linewidth(3.pt) + dotstyle);
label("$E$", (3.542507348672631,2.083445038374561), NE * labelscalefactor);
dot((4.301698851378541,0.8775330211014288),linewidth(3.pt) + dotstyle);
label("$F$", (4.22,0.93), NE * labelscalefactor);
dot((2.9561195753832448,0.6030390855677443),linewidth(3.pt) + dotstyle);
label("$G$", (2.909754250073844,0.10265272971749505), NE * labelscalefactor);
dot((1.4816619768719694,0.8229159040072803),linewidth(3.pt) + dotstyle);
label("$H$", (0.9839839499905795,0.43278478116033936), NE * labelscalefactor);
dot((1.3969966570225139,1.8221911417546572),linewidth(3.pt) + dotstyle);
label("$I$", (0.9839839499905795,1.8908680083662353), NE * labelscalefactor);
clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle);
/* end of picture */[/asy][/hide]
2007 Czech-Polish-Slovak Match, 4
For any real number $p\geq1$ consider the set of all real numbers $x$ with
\[p<x<\left(2+\sqrt{p+\frac{1}{4}}\right)^2.\]
Prove that from any such set one can select four mutually distinct natural numbers $a, b, c, d$ with $ab=cd.$
1992 IMO Shortlist, 20
In the plane let $\,C\,$ be a circle, $\,L\,$ a line tangent to the circle $\,C,\,$ and $\,M\,$ a point on $\,L$. Find the locus of all points $\,P\,$ with the following property: there exists two points $\,Q,R\,$ on $\,L\,$ such that $\,M\,$ is the midpoint of $\,QR\,$ and $\,C\,$ is the inscribed circle of triangle $\,PQR$.
2022 CMIMC, 5
For any integer $a$, let $f(a) = |a^4 - 36a^2 + 96a - 64|$. What is the sum of all values of $f(a)$ that are prime?
[i]Proposed by Alexander Wang[/i]
2014 AMC 12/AHSME, 20
For how many positive integers $x$ is $\log_{10}{(x-40)} + \log_{10}{(60-x)} < 2$?
${ \textbf{(A)}\ 10\qquad\textbf{(B)}\ 18\qquad\textbf{(C)}\ 19\qquad\textbf{(D)}}\ 20\qquad\textbf{(E)}\ \text{infinitely many} $
1986 IMO Longlists, 52
Solve the system of equations
\[\tan x_1 +\cot x_1=3 \tan x_2,\]\[\tan x_2 +\cot x_2=3 \tan x_3,\]\[\vdots\]\[\tan x_n +\cot x_n=3 \tan x_1\]
2008 USAPhO, 1
A charged particle with charge $q$ and mass $m$ is given an initial kinetic energy $K_0$ at the middle of a uniformly charged spherical region of total charge $Q$ and radius $R$. $q$ and $Q$ have opposite signs. The spherically charged region is not free to move. Throughout this problem consider electrostatic forces only.
[asy]
pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps);
size(100);
filldraw(circle((0,0),1),gray(.8));
draw((0,0)--(0.5,sqrt(3)/2),EndArrow);
label("$R$",(0.25,sqrt(3)/4),SE);
[/asy]
(a) Find the value of $K_0$ such that the particle will just reach the boundary of the spherically charged region.
(b) How much time does it take for the particle to reach the boundary of the region if it starts with the kinetic energy $K_0$ found in part (a)?
2002 Flanders Math Olympiad, 2
Determine all functions $f: \mathbb{R}\rightarrow\mathbb{R}$ so that $\forall x: x\cdot f(\frac x2) - f(\frac2x) = 1$
2007 ITest, 40
Let $S$ be the sum of all $x$ such that $1\leq x\leq 99$ and \[\{x^2\}=\{x\}^2.\] Compute $\lfloor S\rfloor$.