$hide=mobile

[Shortlists & Solutions] International Mathematical Olympiad 2019

Algebra

  1. Let $\mathbb{Z}$ be the set of integers. Determine all functions $f: \mathbb{Z} \rightarrow \mathbb{Z}$ such that, for all integers $a$ and $b$, $$f(2a)+2f(b)=f(f(a+b)).$$
  2. Let $u_1, u_2, \dots, u_{2019}$ be real numbers satisfying \[u_{1}+u_{2}+\cdots+u_{2019}=0 \quad \text { and } \quad u_{1}^{2}+u_{2}^{2}+\cdots+u_{2019}^{2}=1.\]Let $a=\min \left(u_{1}, u_{2}, \ldots, u_{2019}\right)$ and $b=\max \left(u_{1}, u_{2}, \ldots, u_{2019}\right)$. Prove that
    \[ a b \leqslant-\frac{1}{2019}. \]
  3. Let $n \geqslant 3$ be a positive integer and let $\left(a_{1}, a_{2}, \ldots, a_{n}\right)$ be a strictly increasing sequence of $n$ positive real numbers with sum equal to 2. Let $X$ be a subset of $\{1,2, \ldots, n\}$ such that the value of \[ \left|1-\sum_{i \in X} a_{i}\right| \]is minimised. Prove that there exists a strictly increasing sequence of $n$ positive real numbers $\left(b_{1}, b_{2}, \ldots, b_{n}\right)$ with sum equal to 2 such that \[ \sum_{i \in X} b_{i}=1. \]
  4. Let $n\geqslant 2$ be a positive integer and $a_1,a_2, \ldots ,a_n$ be real numbers such that \[a_1+a_2+\dots+a_n=0.\]Define the set $A$ by
    \[A=\left\{(i, j)\,|\,1 \leqslant i<j \leqslant n,\left|a_{i}-a_{j}\right| \geqslant 1\right\}\]Prove that, if $A$ is not empty, then \[\sum_{(i, j) \in A} a_{i} a_{j}<0.\]
  5. Let $x_1, x_2, \dots, x_n$ be different real numbers. Prove that
    \[\sum_{1 \leqslant i \leqslant n} \prod_{j \neq i} \frac{1-x_{i} x_{j}}{x_{i}-x_{j}}=\left\{\begin{array}{ll} 0, & \text { if } n \text { is even; } \\ 1, & \text { if } n \text { is odd. } \end{array}\right.\]
  6. A polynomial $P(x, y, z)$ in three variables with real coefficients satisfies the identities $$P(x, y, z)=P(x, y, xy-z)=P(x, zx-y, z)=P(yz-x, y, z).$$ Prove that there exists a polynomial $F(t)$ in one variable such that $$P(x,y,z)=F(x^2+y^2+z^2-xyz).$$
  7. Let $\mathbb Z$ be the set of integers. We consider functions $f :\mathbb Z\to\mathbb Z$ satisfying
    \[f\left(f(x+y)+y\right)=f\left(f(x)+y\right)\]for all integers $x$ and $y$. For such a function, we say that an integer $v$ is f-rare if the set \[X_v=\{x\in\mathbb Z:f(x)=v\}\]is finite and nonempty.
    a) Prove that there exists such a function $f$ for which there is an $f$-rare integer.
    b) Prove that no such function $f$ can have more than one $f$-rare integer.

Combinatorics

  1. The infinite sequence $a_0,a _1, a_2, \dots$ of (not necessarily distinct) integers has the following properties: $0\le a_i \le i$ for all integers $i\ge 0$, and \[\binom{k}{a_0} + \binom{k}{a_1} + \dots + \binom{k}{a_k} = 2^k\]for all integers $k\ge 0$. Prove that all integers $N\ge 0$ occur in the sequence (that is, for all $N\ge 0$, there exists $i\ge 0$ with $a_i=N$).
  2. You are given a set of $n$ blocks, each weighing at least $1$; their total weight is $2n$. Prove that for every real number $r$ with $0 \leq r \leq 2n-2$ you can choose a subset of the blocks whose total weight is at least $r$ but at most $r + 2$.
  3. The Bank of Bath issues coins with an $H$ on one side and a $T$ on the other. Harry has $n$ of these coins arranged in a line from left to right. He repeatedly performs the following operation: if there are exactly $k>0$ coins showing $H$, then he turns over the $k$th coin from the left; otherwise, all coins show $T$ and he stops. For example, if $n=3$ the process starting with the configuration $THT$ would be $THT \to HHT  \to HTT \to TTT$, which stops after three operations.
    a) Show that, for each initial configuration, Harry stops after a finite number of operations.
    b) For each initial configuration $C$, let $L(C)$ be the number of operations before Harry stops. For example, $L(THT) = 3$ and $L(TTT) = 0$. Determine the average value of $L(C)$ over all $2^n$ possible initial configurations $C$.
  4. On a flat plane in Camelot, King Arthur builds a labyrinth $\mathfrak{L}$ consisting of $n$ walls, each of which is an infinite straight line. No two walls are parallel, and no three walls have a common point. Merlin then paints one side of each wall entirely red and the other side entirely blue. At the intersection of two walls there are four corners: two diagonally opposite corners where a red side and a blue side meet, one corner where two red sides meet, and one corner where two blue sides meet. At each such intersection, there is a two-way door connecting the two diagonally opposite corners at which sides of different colours meet. After Merlin paints the walls, Morgana then places some knights in the labyrinth. The knights can walk through doors, but cannot walk through walls. Let $k(\mathfrak{L})$ be the largest number $k$ such that, no matter how Merlin paints the labyrinth $\mathfrak{L},$ Morgana can always place at least $k$ knights such that no two of them can ever meet. For each $n,$ what are all possible values for $k(\mathfrak{L}),$ where $\mathfrak{L}$ is a labyrinth with $n$ walls?
  5. A social network has $2019$ users, some pairs of whom are friends. Whenever user $A$ is friends with user $B$, user $B$ is also friends with user $A$. Events of the following kind may happen repeatedly, one at a time: Three users $A$, $B$, and $C$ such that $A$ is friends with both $B$ and $C$, but $B$ and $C$ are not friends, change their friendship statuses such that $B$ and $C$ are now friends, but $A$ is no longer friends with $B$, and no longer friends with $C$. All other friendship statuses are unchanged. Initially, $1010$ users have $1009$ friends each, and $1009$ users have $1010$ friends each. Prove that there exists a sequence of such events after which each user is friends with at most one other user. 
  6. Let $n>1$ be an integer. Suppose we are given $2n$ points in the plane such that no three of them are collinear. The points are to be labelled $A_1, A_2, \dots , A_{2n}$ in some order. We then consider the $2n$ angles $$\angle A_1A_2A_3, \angle A_2A_3A_4, \dots , \angle A_{2n-2}A_{2n-1}A_{2n}, \angle A_{2n-1}A_{2n}A_1, \angle A_{2n}A_1A_2.$$ We measure each angle in the way that gives the smallest positive value (i.e. between $0^{\circ}$ and $180^{\circ}$). Prove that there exists an ordering of the given points such that the resulting $2n$ angles can be separated into two groups with the sum of one group of angles equal to the sum of the other group.
  7. There are 60 empty boxes $B_1,\ldots,B_{60}$ in a row on a table and an unlimited supply of pebbles. Given a positive integer $n$, Alice and Bob play the following game. In the first round, Alice takes $n$ pebbles and distributes them into the 60 boxes as she wishes. Each subsequent round consists of two steps
    a) Bob chooses an integer $k$ with $1\leq k\leq 59$ and splits the boxes into the two groups $B_1,\ldots,B_k$ and $B_{k+1},\ldots,B_{60}$.
    b) Alice picks one of these two groups, adds one pebble to each box in that group, and removes one pebble from each box in the other group. Bob wins if, at the end of any round, some box contains no pebbles. Find the smallest $n$ such that Alice can prevent Bob from winning.
  8. Alice has a map of Wonderland, a country consisting of $n \geq 2$ towns. For every pair of towns, there is a narrow road going from one town to the other. One day, all the roads are declared to be “one way” only. Alice has no information on the direction of the roads, but the King of Hearts has offered to help her. She is allowed to ask him a number of questions. For each question in turn, Alice chooses a pair of towns and the King of Hearts tells her the direction of the road connecting those two towns Alice wants to know whether there is at least one town in Wonderland with at most one outgoing road. Prove that she can always find out by asking at most $4n$ questions.
  9. For any two different real numbers $x$ and $y$, we define $D(x,y)$ to be the unique integer $d$ satisfying $2^d\le |x-y| < 2^{d+1}$. Given a set of reals $\mathcal F$, and an element $x\in \mathcal F$, we say that the scales of $x$ in $\mathcal F$ are the values of $D(x,y)$ for $y\in\mathcal F$ with $x\neq y$. Let $k$ be a given positive integer. Suppose that each member $x$ of $\mathcal F$ has at most $k$ different scales in $\mathcal F$ (note that these scales may depend on $x$). What is the maximum possible size of $\mathcal F$?

Geometry

  1. Let $ABC$ be a triangle. Circle $\Gamma$ passes through $A$, meets segments $AB$ and $AC$ again at points $D$ and $E$ respectively, and intersects segment $BC$ at $F$ and $G$ such that $F$ lies between $B$ and $G$. The tangent to circle $BDF$ at $F$ and the tangent to circle $CEG$ at $G$ meet at point $T$. Suppose that points $A$ and $T$ are distinct. Prove that line $AT$ is parallel to $BC$.
  2. Let $ABC$ be an acute-angled triangle and let $D, E$, and $F$ be the feet of altitudes from $A, B$, and $C$ to sides $BC, CA$, and $AB$, respectively. Denote by $\omega_B$ and $\omega_C$ the incircles of triangles $BDF$ and $CDE$, and let these circles be tangent to segments $DF$ and $DE$ at $M$ and $N$, respectively. Let line $MN$ meet circles $\omega_B$ and $\omega_C$ again at $P \ne M$ and $Q \ne N$, respectively. Prove that $MP = NQ$.
  3. In triangle $ABC$, point $A_1$ lies on side $BC$ and point $B_1$ lies on side $AC$. Let $P$ and $Q$ be points on segments $AA_1$ and $BB_1$, respectively, such that $PQ$ is parallel to $AB$. Let $P_1$ be a point on line $PB_1$, such that $B_1$ lies strictly between $P$ and $P_1$, and $\angle PP_1C=\angle BAC$. Similarly, let $Q_1$ be the point on line $QA_1$, such that $A_1$ lies strictly between $Q$ and $Q_1$, and $\angle CQ_1Q=\angle CBA$. Prove that points $P,Q,P_1$, and $Q_1$ are concyclic.
  4. Let $P$ be a point inside triangle $ABC$. Let $AP$ meet $BC$ at $A_1$, let $BP$ meet $CA$ at $B_1$, and let $CP$ meet $AB$ at $C_1$. Let $A_2$ be the point such that $A_1$ is the midpoint of $PA_2$, let $B_2$ be the point such that $B_1$ is the midpoint of $PB_2$, and let $C_2$ be the point such that $C_1$ is the midpoint of $PC_2$. Prove that points $A_2, B_2$, and $C_2$ cannot all lie strictly inside the circumcircle of triangle $ABC$.
  5. Let $ABCDE$ be a convex pentagon with $CD= DE$ and $\angle EDC \ne 2 \cdot \angle ADB$. Suppose that a point $P$ is located in the interior of the pentagon such that $AP =AE$ and $BP= BC$. Prove that $P$ lies on the diagonal $CE$ if and only if area $(BCD)$ + area $(ADE)$ = area $(ABD)$ + area $(ABP)$.
  6. Let $I$ be the incentre of acute-angled triangle $ABC$. Let the incircle meet $BC, CA$, and $AB$ at $D, E$, and $F,$ respectively. Let line $EF$ intersect the circumcircle of the triangle at $P$ and $Q$, such that $F$ lies between $E$ and $P$. Prove that $\angle DPA + \angle AQD =\angle QIP$.
  7. Let $I$ be the incentre of acute triangle $ABC$ with $AB\neq AC$. The incircle $\omega$ of $ABC$ is tangent to sides $BC, CA$, and $AB$ at $D, E,$ and $F$, respectively. The line through $D$ perpendicular to $EF$ meets $\omega$ at $R$. Line $AR$ meets $\omega$ again at $P$. The circumcircles of triangle $PCE$ and $PBF$ meet again at $Q$. Prove that lines $DI$ and $PQ$ meet on the line through $A$ perpendicular to $AI$.
  8. Let $\mathcal L$ be the set of all lines in the plane and let $f$ be a function that assigns to each line $\ell\in\mathcal L$ a point $f(\ell)$ on $f(\ell)$. Suppose that for any point $X$, and for any three lines $\ell_1,\ell_2,\ell_3$ passing through $X$, the points $f(\ell_1),f(\ell_2),f(\ell_3)$, and $X$ lie on a circle. Prove that there is a unique point $P$ such that $f(\ell)=P$ for any line $\ell$ passing through $P$.

Number Theory

  1. Find all pairs $(k,n)$ of positive integers such that \[ k!=(2^n-1)(2^n-2)(2^n-4)\cdots(2^n-2^{n-1}). \]
  2. Find all triples $(a, b, c)$ of positive integers such that $a^3 + b^3 + c^3 = (abc)^2$.
  3. We say that a set $S$ of integers is rootiful if, for any positive integer $n$ and any $a_0, a_1, \cdots, a_n \in S$, all integer roots of the polynomial $a_0+a_1x+\cdots+a_nx^n$ are also in $S$. Find all rootiful sets of integers that contain all numbers of the form $2^a - 2^b$ for positive integers $a$ and $b$.
  4. Find all functions $f:\mathbb Z_{>0}\to \mathbb Z_{>0}$ such that $a+f(b)$ divides $a^2+bf(a)$ for all positive integers $a$ and $b$ with $a+b>2019$.
  5. Let $a$ be a positive integer. We say that a positive integer $b$ is $a$-good if $\tbinom{an}{b}-1$ is divisible by $an+1$ for all positive integers $n$ with $an \geq b$. Suppose $b$ is a positive integer such that $b$ is $a$-good, but $b+2$ is not $a$-good. Prove that $b+1$ is prime.
  6. Let $H = \{ \lfloor i\sqrt{2}\rfloor : i \in \mathbb Z_{>0}\} = \{1,2,4,5,7,\dots \}$ and let $n$ be a positive integer. Prove that there exists a constant $C$ such that, if $A\subseteq \{1,2,\dots, n\}$ satisfies $|A| \ge C\sqrt{n}$, then there exist $a,b\in A$ such that $a-b\in H$. (Here $\mathbb Z_{>0}$ is the set of positive integers, and $\lfloor z\rfloor$ denotes the greatest integer less than or equal to $z$.)
  7. Prove that there is a constant $c>0$ and infinitely many positive integers $n$ with the following property: there are infinitely many positive integers that cannot be expressed as the sum of fewer than $cn\log(n)$ pairwise coprime $n$th powers.
  8. Let $a$ and $b$ be two positive integers. Prove that the integer \[a^2+\left\lceil\frac{4a^2}b\right\rceil\] is not a square. (Here $\lceil z\rceil$ denotes the least integer greater than or equal to $z$.)

DOWNLOAD SOLUTIONS

Post a Comment


$hide=home

$type=three$count=6$sr=random$t=oot$h=1$l=0$meta=hide$rm=hide$sn=0

$hide=post$type=three$count=6$sr=random$t=oot$h=1$l=0$meta=hide$rm=hide$sn=0

$hide=home

Kỷ Yếu$cl=violet$type=three$count=6$sr=random$t=oot$h=1$l=0$meta=hide$rm=hide$sn=0

Journals$cl=green$type=three$count=6$sr=random$t=oot$h=1$l=0$meta=hide$rm=hide$sn=0

Name

Ả-rập Xê-út,1,Abel,5,Albania,2,AMM,2,Amsterdam,5,Ấn Độ,1,An Giang,22,Andrew Wiles,1,Anh,2,Áo,1,APMO,19,Ba Đình,2,Ba Lan,1,Bà Rịa Vũng Tàu,52,Bắc Giang,49,Bắc Kạn,1,Bạc Liêu,9,Bắc Ninh,47,Bắc Trung Bộ,7,Bài Toán Hay,5,Balkan,37,Baltic Way,30,BAMO,1,Bất Đẳng Thức,66,Bến Tre,46,Benelux,13,Bình Định,44,Bình Dương,21,Bình Phước,38,Bình Thuận,34,Birch,1,Booklet,11,Bosnia Herzegovina,3,BoxMath,3,Brazil,2,Bùi Đắc Hiên,1,Bùi Thị Thiện Mỹ,1,Bùi Văn Tuyên,1,Bùi Xuân Diệu,1,Bulgaria,5,Buôn Ma Thuột,1,BxMO,12,Cà Mau,13,Cần Thơ,14,Canada,39,Cao Bằng,6,Cao Quang Minh,1,Câu Chuyện Toán Học,36,Caucasus,2,CGMO,10,China,10,Chọn Đội Tuyển,347,Chu Tuấn Anh,1,Chuyên Đề,124,Chuyên Sư Phạm,31,Chuyên Trần Hưng Đạo,3,Collection,8,College Mathematic,1,Concours,1,Cono Sur,1,Contest,610,Correspondence,1,Cosmin Poahata,1,Crux,2,Czech-Polish-Slovak,25,Đà Nẵng,39,Đa Thức,2,Đại Số,20,Đắk Lắk,54,Đắk Nông,7,Đan Phượng,1,Danube,7,Đào Thái Hiệp,1,ĐBSCL,2,Đề Thi HSG,1643,Đề Thi JMO,1,Điện Biên,8,Định Lý,1,Định Lý Beaty,1,Đỗ Hữu Đức Thịnh,1,Do Thái,3,Doãn Quang Tiến,4,Đoàn Quỳnh,1,Đoàn Văn Trung,1,Đống Đa,4,Đồng Nai,49,Đồng Tháp,51,Du Hiền Vinh,1,Đức,1,Duyên Hải Bắc Bộ,25,E-Book,33,EGMO,16,ELMO,19,EMC,8,Epsilon,1,Estonian,5,Euler,1,Evan Chen,1,Fermat,3,Finland,4,Forum Of Geometry,2,Furstenberg,1,G. Polya,3,Gặp Gỡ Toán Học,26,Gauss,1,GDTX,3,Geometry,12,Gia Lai,25,Gia Viễn,2,Giải Tích Hàm,1,Giảng Võ,1,Giới hạn,2,Goldbach,1,Hà Giang,2,Hà Lan,1,Hà Nam,29,Hà Nội,231,Hà Tĩnh,72,Hà Trung Kiên,1,Hải Dương,49,Hải Phòng,42,Hàn Quốc,5,Hậu Giang,4,Hậu Lộc,1,Hilbert,1,Hình Học,33,HKUST,7,Hòa Bình,13,Hoài Nhơn,1,Hoàng Bá Minh,1,Hoàng Minh Quân,1,Hodge,1,Hojoo Lee,2,HOMC,5,HongKong,8,HSG 10,100,HSG 11,87,HSG 12,581,HSG 9,402,HSG Cấp Trường,78,HSG Quốc Gia,99,HSG Quốc Tế,16,Hứa Lâm Phong,1,Hứa Thuần Phỏng,1,Hùng Vương,2,Hưng Yên,32,Hương Sơn,2,Huỳnh Kim Linh,1,Hy Lạp,1,IMC,25,IMO,54,India,45,Inequality,13,InMC,1,International,307,Iran,11,Jakob,1,JBMO,41,Jewish,1,Journal,20,Junior,38,K2pi,1,Kazakhstan,1,Khánh Hòa,16,KHTN,53,Kiên Giang,64,Kim Liên,1,Kon Tum,18,Korea,5,Kvant,2,Kỷ Yếu,42,Lai Châu,4,Lâm Đồng,33,Lạng Sơn,21,Langlands,1,Lào Cai,16,Lê Hải Châu,1,Lê Hải Khôi,1,Lê Hoành Phò,4,Lê Khánh Sỹ,3,Lê Minh Cường,1,Lê Phúc Lữ,1,Lê Phương,1,Lê Quý Đôn,1,Lê Viết Hải,1,Lê Việt Hưng,1,Leibniz,1,Long An,42,Lớp 10,10,Lớp 10 Chuyên,452,Lớp 10 Không Chuyên,230,Lớp 11,1,Lục Ngạn,1,Lượng giác,1,Lương Tài,1,Lưu Giang Nam,2,Lý Thánh Tông,1,Macedonian,1,Malaysia,1,Margulis,2,Mark Levi,1,Mathematical Excalibur,1,Mathematical Reflections,1,Mathematics Magazine,1,Mathematics Today,1,Mathley,1,MathLinks,1,MathProblems Journal,1,Mathscope,8,MathsVN,5,MathVN,1,MEMO,10,Metropolises,4,Mexico,1,MIC,1,Michael Guillen,1,Mochizuki,1,Moldova,1,Moscow,1,Mỹ,9,MYTS,4,Nam Định,32,Nam Phi,1,Nam Trung Bộ,1,National,249,Nesbitt,1,Newton,4,Nghệ An,50,Ngô Bảo Châu,2,Ngô Việt Hải,1,Ngọc Huyền,2,Nguyễn Anh Tuyến,1,Nguyễn Bá Đang,1,Nguyễn Đình Thi,1,Nguyễn Đức Tấn,1,Nguyễn Đức Thắng,1,Nguyễn Duy Khương,1,Nguyễn Duy Tùng,1,Nguyễn Hữu Điển,3,Nguyễn Mình Hà,1,Nguyễn Minh Tuấn,8,Nguyễn Phan Tài Vương,1,Nguyễn Phú Khánh,1,Nguyễn Phúc Tăng,1,Nguyễn Quản Bá Hồng,1,Nguyễn Quang Sơn,1,Nguyễn Tài Chung,5,Nguyễn Tăng Vũ,1,Nguyễn Tất Thu,1,Nguyễn Thúc Vũ Hoàng,1,Nguyễn Trung Tuấn,8,Nguyễn Tuấn Anh,2,Nguyễn Văn Huyện,3,Nguyễn Văn Mậu,25,Nguyễn Văn Nho,1,Nguyễn Văn Quý,2,Nguyễn Văn Thông,1,Nguyễn Việt Anh,1,Nguyễn Vũ Lương,2,Nhật Bản,3,Nhóm $\LaTeX$,4,Nhóm Toán,1,Ninh Bình,41,Ninh Thuận,15,Nội Suy Lagrange,2,Nội Suy Newton,1,Nordic,19,Olympiad Corner,1,Olympiad Preliminary,2,Olympic 10,98,Olympic 10/3,5,Olympic 11,89,Olympic 12,30,Olympic 24/3,6,Olympic 27/4,20,Olympic 30/4,66,Olympic KHTN,6,Olympic Sinh Viên,73,Olympic Tháng 4,12,Olympic Toán,300,Olympic Toán Sơ Cấp,3,PAMO,1,Phạm Đình Đồng,1,Phạm Đức Tài,1,Phạm Huy Hoàng,1,Pham Kim Hung,3,Phạm Quốc Sang,2,Phan Huy Khải,1,Phan Thành Nam,1,Pháp,2,Philippines,8,Phú Thọ,30,Phú Yên,26,Phùng Hồ Hải,1,Phương Trình Hàm,11,Phương Trình Pythagoras,1,Pi,1,Polish,32,Problems,1,PT-HPT,14,PTNK,45,Putnam,25,Quảng Bình,44,Quảng Nam,31,Quảng Ngãi,33,Quảng Ninh,43,Quảng Trị,26,Quỹ Tích,1,Riemann,1,RMM,12,RMO,24,Romania,36,Romanian Mathematical,1,Russia,1,Sách Thường Thức Toán,7,Sách Toán,69,Sách Toán Cao Học,1,Sách Toán THCS,7,Saudi Arabia,7,Scholze,1,Serbia,17,Sharygin,24,Shortlists,56,Simon Singh,1,Singapore,1,Số Học - Tổ Hợp,27,Sóc Trăng,28,Sơn La,11,Spain,8,Star Education,5,Stars of Mathematics,11,Swinnerton-Dyer,1,Talent Search,1,Tăng Hải Tuân,2,Tạp Chí,14,Tập San,6,Tây Ban Nha,1,Tây Ninh,29,Thạch Hà,1,Thái Bình,39,Thái Nguyên,49,Thái Vân,2,Thanh Hóa,57,THCS,2,Thổ Nhĩ Kỳ,5,Thomas J. Mildorf,1,THPT Chuyên Lê Quý Đôn,1,THPTQG,15,THTT,6,Thừa Thiên Huế,35,Tiền Giang,19,Tin Tức Toán Học,1,Titu Andreescu,2,Toán 12,7,Toán Cao Cấp,3,Toán Chuyên,2,Toán Rời Rạc,5,Toán Tuổi Thơ,3,Tôn Ngọc Minh Quân,2,TOT,1,TPHCM,126,Trà Vinh,5,Trắc Nghiệm,1,Trắc Nghiệm Toán,2,Trại Hè,34,Trại Hè Hùng Vương,25,Trại Hè Phương Nam,5,Trần Đăng Phúc,1,Trần Minh Hiền,2,Trần Nam Dũng,9,Trần Phương,1,Trần Quang Hùng,1,Trần Quốc Anh,2,Trần Quốc Luật,1,Trần Quốc Nghĩa,1,Trần Tiến Tự,1,Trịnh Đào Chiến,2,Trung Quốc,12,Trường Đông,19,Trường Hè,7,Trường Thu,1,Trường Xuân,2,TST,55,Tuyên Quang,6,Tuyển Sinh,3,Tuyển Tập,44,Tuymaada,4,Undergraduate,66,USA,44,USAJMO,10,USATST,7,Uzbekistan,1,Vasile Cîrtoaje,4,Vật Lý,1,Viện Toán Học,2,Vietnam,4,Viktor Prasolov,1,VIMF,1,Vinh,27,Vĩnh Long,20,Vĩnh Phúc,63,Virginia Tech,1,VLTT,1,VMEO,4,VMF,12,VMO,46,VNTST,22,Võ Anh Khoa,1,Võ Quốc Bá Cẩn,26,Võ Thành Văn,1,Vojtěch Jarník,6,Vũ Hữu Bình,7,Vương Trung Dũng,1,WFNMC Journal,1,Wiles,1,Yên Bái,17,Yên Định,1,Yên Thành,1,Zhautykov,11,Zhou Yuan Zhe,1,
ltr
item
MOlympiad: [Shortlists & Solutions] International Mathematical Olympiad 2019
[Shortlists & Solutions] International Mathematical Olympiad 2019
MOlympiad
https://www.molympiad.net/2020/12/shortlists-solutions-imo-2019.html
https://www.molympiad.net/
https://www.molympiad.net/
https://www.molympiad.net/2020/12/shortlists-solutions-imo-2019.html
true
2506595080985176441
UTF-8
Loaded All Posts Not found any posts VIEW ALL Readmore Reply Cancel reply Delete By Home PAGES POSTS View All RECOMMENDED FOR YOU LABEL ARCHIVE SEARCH ALL POSTS Not found any post match with your request Back Home Sunday Monday Tuesday Wednesday Thursday Friday Saturday Sun Mon Tue Wed Thu Fri Sat January February March April May June July August September October November December Jan Feb Mar Apr May Jun Jul Aug Sep Oct Nov Dec just now 1 minute ago $$1$$ minutes ago 1 hour ago $$1$$ hours ago Yesterday $$1$$ days ago $$1$$ weeks ago more than 5 weeks ago Followers Follow THIS PREMIUM CONTENT IS LOCKED Please share to unlock Copy All Code Select All Code All codes were copied to your clipboard Can not copy the codes / texts, please press [CTRL]+[C] (or CMD+C with Mac) to copy