[Shortlists] International Mathematical Olympiad 2005


  1. Find all pairs of integers $a,b$ for which there exists a polynomial $P(x) \in \mathbb{Z}[X]$ such that product $(x^2+ax+b)\cdot P(x)$ is a polynomial of a form \[ x^n+c_{n-1}x^{n-1}+\cdots+c_1x+c_0 \] where each of $c_0,c_1,\ldots,c_{n-1}$ is equal to $1$ or $-1$.
  2. We denote by $\mathbb{R}^+$ the set of all positive real numbers. Find all functions $f: \mathbb R^ + \rightarrow\mathbb R^ +$ which have the property \[f(x)f(y)=2f(x+yf(x))\] for all positive real numbers $x$ and $y$.
  3. Four real numbers $p,q,r,s$ satisfy $$p+q+r+s = 9$$ and $$p^{2}+q^{2}+r^{2}+s^{2}=21.$$ Prove that there exists a permutation $ \left(a,b,c,d\right)$ of $ \left(p,q,r,s\right)$ such that $ ab-cd \geq 2$.
  4. Find all functions $ f: \mathbb{R}\to\mathbb{R}$ such that $$f(x+y)+f(x)f(y)=f(xy)+2xy+1$$ for all real numbers $ x$ and $ y$.
  5. Let $x,y,z$ be three positive reals such that $xyz\geq 1$. Prove that \[ \frac { x^5-x^2 }{x^5+y^2+z^2} + \frac {y^5-y^2}{x^2+y^5+z^2} + \frac {z^5-z^2}{x^2+y^2+z^5} \geq 0 . \]


    1. A house has an even number of lamps distributed among its rooms in such a way that there are at least three lamps in every room. Each lamp shares a switch with exactly one other lamp, not necessarily from the same room. Each change in the switch shared by two lamps changes their states simultaneously. Prove that for every initial state of the lamps there exists a sequence of changes in some of the switches at the end of which each room contains lamps which are on as well as lamps which are off.
    2. Let $k$ be a nonnegative integer. A forest consists of rooted (i. e. oriented) trees. Each vertex of the forest is either a leaf or has two successors. A vertex $v$ is called an extended successor of a vertex $u$ if there is a chain of vertices $u_{0}=u$, $u_{1}$, $u_{2}$, ..., $u_{t-1}$, $u_{t}=v$ with $t>0$ such that the vertex $u_{i+1}$ is a successor of the vertex $u_{i}$ for every integer $i$ with $0\leq i\leq t-1$. A vertex is called dynastic if it has two successors and each of these successors has at least $k$ extended successors. Prove that if the forest has $n$ vertices, then there are at most $\frac{n}{k+2}$ dynastic vertices.
    3. Consider a $m\times n$ rectangular board consisting of $mn$ unit squares. Two of its unit squares are called adjacent if they have a common edge, and a path is a sequence of unit squares in which any two consecutive squares are adjacent. Two parths are called non-intersecting if they don't share any common squares. Each unit square of the rectangular board can be colored black or white. We speak of a coloring of the board if all its $mn$ unit squares are colored. Let $N$ be the number of colorings of the board such that there exists at least one black path from the left edge of the board to its right edge. Let $M$ be the number of colorings of the board for which there exist at least two non-intersecting black paths from the left edge of the board to its right edge. Prove that $N^{2}\geq M\cdot 2^{mn}$.
    4. Let $n\geq 3$ be a fixed integer. Each side and each diagonal of a regular $n$-gon is labelled with a number from the set $\left\{1;\;2;\;...;\;r\right\}$ in a way such that the following two conditions are fulfilled:
      • Each number from the set $\left\{1;\;2;\;...;\;r\right\}$ occurs at least once as a label.
      • In each triangle formed by three vertices of the $n$-gon, two of the sides are labelled with the same number, and this number is greater than the label of the third side.
      a) Find the maximal $r$ for which such a labelling is possible.
      b) Harder version (IMO Shortlist 2005): For this maximal value of $r$, how many such labellings are there?
    5. There are $ n$ markers, each with one side white and the other side black. In the beginning, these $ n$ markers are aligned in a row so that their white sides are all up. In each step, if possible, we choose a marker whose white side is up (but not one of the outermost markers), remove it, and reverse the closest marker to the left of it and also reverse the closest marker to the right of it. Prove that, by a finite sequence of such steps, one can achieve a state with only two markers remaining if and only if $ n - 1$ is not divisible by $ 3$.
    6. In a mathematical competition, in which $6$ problems were posed to the participants, every two of these problems were solved by more than $\frac 25$ of the contestants. Moreover, no contestant solved all the $6$ problems. Show that there are at least $2$ contestants who solved exactly $5$ problems each.
    7. Suppose that $ a_1$, $ a_2$, $ \ldots$, $ a_n$ are integers such that $ n\mid a_1 + a_2 + \ldots + a_n$. Prove that there exist two permutations $ \left(b_1,b_2,\ldots,b_n\right)$ and $ \left(c_1,c_2,\ldots,c_n\right)$ of $ \left(1,2,\ldots,n\right)$ such that for each integer $ i$ with $ 1\leq i\leq n$, we have \[ n\mid a_i - b_i - c_i \]
    8. Suppose we have a $n$-gon. Some $n-3$ diagonals are coloured black and some other $n-3$ diagonals are coloured red (a side is not a diagonal), so that no two diagonals of the same colour can intersect strictly inside the polygon, although they can share a vertex. Find the maximum number of intersection points between diagonals coloured differently strictly inside the polygon, in terms of $n$.


    1. Given a triangle $ABC$ satisfying $AC+BC=3\cdot AB$. The incircle of triangle $ABC$ has center $I$ and touches the sides $BC$ and $CA$ at the points $D$ and $E$, respectively. Let $K$ and $L$ be the reflections of the points $D$ and $E$ with respect to $I$. Prove that the points $A$, $B$, $K$, $L$ lie on one circle.
    2. Six points are chosen on the sides of an equilateral triangle $ABC$: $A_1$, $A_2$ on $BC$, $B_1$, $B_2$ on $CA$ and $C_1$, $C_2$ on $AB$, such that they are the vertices of a convex hexagon $A_1A_2B_1B_2C_1C_2$ with equal side lengths. Prove that the lines $A_1B_2$, $B_1C_2$ and $C_1A_2$ are concurrent.
    3. Let $ABCD$ be a parallelogram. A variable line $g$ through the vertex $A$ intersects the rays $BC$ and $DC$ at the points $X$ and $Y$, respectively. Let $K$ and $L$ be the $A$-excenters of the triangles $ABX$ and $ADY$. Show that the angle $\measuredangle KCL$ is independent of the line $g$.
    4. Let $ABCD$ be a fixed convex quadrilateral with $BC=DA$ and $BC$ not parallel with $DA$. Let two variable points $E$ and $F$ lie of the sides $BC$ and $DA$, respectively and satisfy $BE=DF$. The lines $AC$ and $BD$ meet at $P$, the lines $BD$ and $EF$ meet at $Q$, the lines $EF$ and $AC$ meet at $R$. Prove that the circumcircles of the triangles $PQR$, as $E$ and $F$ vary, have a common point other than $P$.
    5. Let $\triangle ABC$ be an acute-angled triangle with $AB \not= AC$. Let $H$ be the orthocenter of triangle $ABC$, and let $M$ be the midpoint of the side $BC$. Let $D$ be a point on the side $AB$ and $E$ a point on the side $AC$ such that $AE=AD$ and the points $D$, $H$, $E$ are on the same line. Prove that the line $HM$ is perpendicular to the common chord of the circumscribed circles of triangle $\triangle ABC$ and triangle $\triangle ADE$.
    6. Let $ABC$ be a triangle, and $M$ the midpoint of its side $BC$. Let $\gamma$ be the incircle of triangle $ABC$. The median $AM$ of triangle $ABC$ intersects the incircle $\gamma$ at two points $K$ and $L$. Let the lines passing through $K$ and $L$, parallel to $BC$, intersect the incircle $\gamma$ again in two points $X$ and $Y$. Let the lines $AX$ and $AY$ intersect $BC$ again at the points $P$ and $Q$. Prove that $BP = CQ$.
    7. In an acute triangle $ABC$, let $D$, $E$, $F$ be the feet of the perpendiculars from the points $A$, $B$, $C$ to the lines $BC$, $CA$, $AB$, respectively, and let $P$, $Q$, $R$ be the feet of the perpendiculars from the points $A$, $B$, $C$ to the lines $EF$, $FD$, $DE$, respectively. Prove that $p\left(ABC\right)p\left(PQR\right) \ge \left(p\left(DEF\right)\right)^{2}$, where $p\left(T\right)$ denotes the perimeter of triangle $T$ .

    Number Theory

    1. Determine all positive integers relatively prime to all the terms of the infinite sequence \[ a_n=2^n+3^n+6^n -1,\ n\geq 1. \]
    2. Let $a_1,a_2,\ldots$ be a sequence of integers with infinitely many positive and negative terms. Suppose that for every positive integer $n$ the numbers $a_1,a_2,\ldots,a_n$ leave $n$ different remainders upon division by $n$. Prove that every integer occurs exactly once in the sequence $a_1,a_2,\ldots$.
    3. Let $ a$, $ b$, $ c$, $ d$, $ e$, $ f$ be positive integers and let $ S = a+b+c+d+e+f$. Suppose that the number $ S$ divides $ abc+def$ and $ ab+bc+ca-de-ef-df$. Prove that $ S$ is composite.
    4. Find all positive integers $ n$ such that there exists a unique integer $ a$ such that $ 0\leq a < n!$ with the following property: \[ n!\mid a^n + 1 \]
    5. Denote by $d(n)$ the number of divisors of the positive integer $n$. A positive integer $n$ is called highly divisible if $d(n) > d(m)$ for all positive integers $m < n$. Two highly divisible integers $m$ and $n$ with $m < n$ are called consecutive if there exists no highly divisible integer $s$ satisfying $m < s < n$.
      a) Show that there are only finitely many pairs of consecutive highly divisible integers of the form $(a, b)$ with $a\mid b$.
      b) Show that for every prime number $p$ there exist infinitely many positive highly divisible integers $r$ such that $pr$ is also highly divisible.
    6. Let $a$, $b$ be positive integers such that $b^n+n$ is a multiple of $a^n+n$ for all positive integers $n$. Prove that $a=b$.
    7. Let $P(x)=a_{n}x^{n}+a_{n-1}x^{n-1}+\ldots+a_{0}$, where $a_{0},\ldots,a_{n}$ are integers, $a_{n}>0$, $n\geq 2$. Prove that there exists a positive integer $m$ such that $P(m!)$ is a composite number.
    MOlympiad.NET là dự án thu thập và phát hành các đề thi tuyển sinh và học sinh giỏi toán. Quý bạn đọc muốn giúp chúng tôi chỉnh sửa đề thi này, xin hãy để lại bình luận facebook (có thể đính kèm hình ảnh) hoặc google (có thể sử dụng $\LaTeX$) bên dưới. BBT rất mong bạn đọc ủng hộ UPLOAD đề thi và đáp án mới hoặc liên hệ
    Chúng tôi nhận tất cả các định dạng của tài liệu: $\TeX$, PDF, WORD, IMG,...


    Abel Albania AMM Amsterdam An Giang Andrew Wiles Anh APMO Austria (Áo) Ba Đình Ba Lan Bà Rịa Vũng Tàu Bắc Bộ Bắc Giang Bắc Kạn Bạc Liêu Bắc Ninh Bắc Trung Bộ Bài Toán Hay Balkan Baltic Way BAMO Bất Đẳng Thức Bến Tre Benelux Bình Định Bình Dương Bình Phước Bình Thuận Birch BMO Booklet Bosnia Herzegovina BoxMath Brazil British Bùi Đắc Hiên Bùi Thị Thiện Mỹ Bùi Văn Tuyên Bùi Xuân Diệu Bulgaria Buôn Ma Thuột BxMO Cà Mau Cần Thơ Canada Cao Bằng Cao Quang Minh Câu Chuyện Toán Học Caucasus CGMO China - Trung Quốc Chọn Đội Tuyển Chu Tuấn Anh Chuyên Đề Chuyên Sư Phạm Chuyên Trần Hưng Đạo Collection College Mathematic Concours Cono Sur Contest Correspondence Cosmin Poahata Crux Czech-Polish-Slovak Đà Nẵng Đa Thức Đại Số Đắk Lắk Đắk Nông Đan Phượng Danube Đào Thái Hiệp ĐBSCL Đề Thi Đề Thi HSG Đề Thi JMO Điện Biên Định Lý Định Lý Beaty Đỗ Hữu Đức Thịnh Do Thái Doãn Quang Tiến Đoàn Quỳnh Đoàn Văn Trung Đống Đa Đồng Nai Đồng Tháp Du Hiền Vinh Đức Duyên Hải Bắc Bộ E-Book EGMO ELMO EMC Epsilon Estonian Euler Evan Chen Fermat Finland Forum Of Geometry Furstenberg G. Polya Gặp Gỡ Toán Học Gauss GDTX Geometry Gia Lai Gia Viễn Giải Tích Hàm Giảng Võ Giới hạn Goldbach Hà Giang Hà Lan Hà Nam Hà Nội Hà Tĩnh Hà Trung Kiên Hải Dương Hải Phòng Hậu Giang Hậu Lộc Hilbert Hình Học HKUST Hòa Bình Hoài Nhơn Hoàng Bá Minh Hoàng Minh Quân Hodge Hojoo Lee HOMC HongKong HSG 10 HSG 10 Bắc Giang HSG 10 Thái Nguyên HSG 11 HSG 11 Bắc Giang HSG 11 Thái Nguyên HSG 12 HSG 12 2010-2011 HSG 12 2011-2012 HSG 12 2012-2013 HSG 12 2013-2014 HSG 12 2014-2015 HSG 12 2015-2016 HSG 12 2016-2017 HSG 12 2017-2018 HSG 12 2018-2019 HSG 12 2019-2020 HSG 12 2020-2021 HSG 12 2021-2022 HSG 12 Bắc Giang HSG 12 Đồng Tháp HSG 12 Quảng Nam HSG 12 Quảng Ninh HSG 12 Thái Nguyên HSG 9 HSG 9 2010-2011 HSG 9 2011-2012 HSG 9 2012-2013 HSG 9 2013-2014 HSG 9 2014-2015 HSG 9 2015-2016 HSG 9 2016-2017 HSG 9 2017-2018 HSG 9 2018-2019 HSG 9 2019-2020 HSG 9 2020-2021 HSG 9 2021-202 HSG 9 2021-2022 HSG 9 Bắc Giang HSG 9 Đồng Tháp HSG 9 Quảng Nam HSG 9 Quảng Ninh HSG Cấp Trường HSG Quốc Gia HSG Quốc Tế Hứa Lâm Phong Hứa Thuần Phỏng Hùng Vương Hưng Yên Hương Sơn Huỳnh Kim Linh Hy Lạp IMC IMO IMT India - Ấn Độ Inequality InMC International Iran Jakob JBMO Jewish Journal Junior K2pi Kazakhstan Khánh Hòa KHTN Kiên Giang Kim Liên Kon Tum Korea - Hàn Quốc Kvant Kỷ Yếu Lai Châu Lâm Đồng Lạng Sơn Langlands Lào Cai Lê Hải Châu Lê Hải Khôi Lê Hoành Phò Lê Khánh Sỹ Lê Minh Cường Lê Phúc Lữ Lê Phương Lê Quý Đôn Lê Viết Hải Lê Việt Hưng Leibniz Long An Lớp 10 Lớp 10 Chuyên Lớp 10 Không Chuyên Lớp 11 Lục Ngạn Lượng giác Lương Tài Lưu Giang Nam Lý Thánh Tông Macedonian Malaysia Margulis Mark Levi Mathematical Excalibur Mathematical Reflections Mathematics Magazine Mathematics Today Mathley MathLinks MathProblems Journal Mathscope MathsVN MathVN MEMO Metropolises Mexico MIC Michael Guillen Mochizuki Moldova Moscow MYM MYTS Nam Định Nam Phi National Nesbitt Newton Nghệ An Ngô Bảo Châu Ngô Việt Hải Ngọc Huyền Nguyễn Anh Tuyến Nguyễn Bá Đang Nguyễn Đình Thi Nguyễn Đức Tấn Nguyễn Đức Thắng Nguyễn Duy Khương Nguyễn Duy Tùng Nguyễn Hữu Điển Nguyễn Mình Hà Nguyễn Minh Tuấn Nguyễn Phan Tài Vương Nguyễn Phú Khánh Nguyễn Phúc Tăng Nguyễn Quản Bá Hồng Nguyễn Quang Sơn Nguyễn Tài Chung Nguyễn Tăng Vũ Nguyễn Tất Thu Nguyễn Thúc Vũ Hoàng Nguyễn Trung Tuấn Nguyễn Tuấn Anh Nguyễn Văn Huyện Nguyễn Văn Mậu Nguyễn Văn Nho Nguyễn Văn Quý Nguyễn Văn Thông Nguyễn Việt Anh Nguyễn Vũ Lương Nhật Bản Nhóm $\LaTeX$ Nhóm Toán Ninh Bình Ninh Thuận Nội Suy Lagrange Nội Suy Newton Nordic Olympiad Corner Olympiad Preliminary Olympic 10 Olympic 10/3 Olympic 11 Olympic 12 Olympic 24/3 Olympic 24/3 Quảng Nam Olympic 27/4 Olympic 30/4 Olympic KHTN Olympic Sinh Viên Olympic Tháng 4 Olympic Toán Olympic Toán Sơ Cấp PAMO Phạm Đình Đồng Phạm Đức Tài Phạm Huy Hoàng Pham Kim Hung Phạm Quốc Sang Phan Huy Khải Phan Thành Nam Pháp Philippines Phú Thọ Phú Yên Phùng Hồ Hải Phương Trình Hàm Phương Trình Pythagoras Pi Polish Problems PT-HPT PTNK Putnam Quảng Bình Quảng Nam Quảng Ngãi Quảng Ninh Quảng Trị Quỹ Tích Riemann RMM RMO Romania Romanian Mathematical Russia Sách Thường Thức Toán Sách Toán Sách Toán Cao Học Sách Toán THCS Saudi Arabia - Ả Rập Xê Út Scholze Serbia Sharygin Shortlists Simon Singh Singapore Số Học - Tổ Hợp Sóc Trăng Sơn La Spain Star Education Stars of Mathematics Swinnerton-Dyer Talent Search Tăng Hải Tuân Tạp Chí Tập San Tây Ban Nha Tây Ninh Thạch Hà Thái Bình Thái Nguyên Thái Vân Thanh Hóa THCS Thổ Nhĩ Kỳ Thomas J. Mildorf THPT Chuyên Lê Quý Đôn THPTQG THTT Thừa Thiên Huế Tiền Giang Tin Tức Toán Học Titu Andreescu Toán 12 Toán Cao Cấp Toán Chuyên Toán Rời Rạc Toán Tuổi Thơ Tôn Ngọc Minh Quân TOT TPHCM Trà Vinh Trắc Nghiệm Trắc Nghiệm Toán Trại Hè Trại Hè Hùng Vương Trại Hè Phương Nam Trần Đăng Phúc Trần Minh Hiền Trần Nam Dũng Trần Phương Trần Quang Hùng Trần Quốc Anh Trần Quốc Luật Trần Quốc Nghĩa Trần Tiến Tự Trịnh Đào Chiến Trường Đông Trường Hè Trường Thu Trường Xuân TST TST 2010-2011 TST 2011-2012 TST 2012-2013 TST 2013-2014 TST 2014-2015 TST 2015-2016 TST 2016-2017 TST 2017-2018 TST 2018-2019 TST 2019-2020 TST 2020-2021 TST 2021-2022 TST Bắc Giang TST Đồng Tháp TST Quảng Nam TST Quảng Ninh TST Thái Nguyên Tuyên Quang Tuyển Sinh Tuyển Sinh 10 Tuyển Sinh 10 Đồng Tháp Tuyển Sinh 10 Quảng Nam Tuyển Sinh 10 Quảng Ninh Tuyển Sinh 10 Thái Nguyên Tuyển Sinh 2010-2011 Tuyển Sinh 2011-2012 Tuyển Sinh 2011-2022 Tuyển Sinh 2012-2013 Tuyển Sinh 2013-2014 Tuyển Sinh 2014-2015 Tuyển Sinh 2015-2016 Tuyển Sinh 2016-2017 Tuyển Sinh 2017-2018 Tuyển Sinh 2018-2019 Tuyển Sinh 2019-2020 Tuyển Sinh 2020-2021 Tuyển Sinh 2021-202 Tuyển Sinh 2021-2022 Tuyển Sinh THPT Bắc Giang Tuyển Tập Tuymaada UK - Anh Undergraduate USA - Mỹ USA TSTST USAJMO USATST USEMO Uzbekistan Vasile Cîrtoaje Vật Lý Viện Toán Học Vietnam Viktor Prasolov VIMF Vinh Vĩnh Long Vĩnh Phúc Virginia Tech VLTT VMEO VMF VMO VNTST Võ Anh Khoa Võ Quốc Bá Cẩn Võ Thành Văn Vojtěch Jarník Vũ Hữu Bình Vương Trung Dũng WFNMC Journal Wiles Yên Bái Yên Định Yên Thành Zhautykov Zhou Yuan Zhe
    MOlympiad.NET: [Shortlists] International Mathematical Olympiad 2005
    [Shortlists] International Mathematical Olympiad 2005
    Not found any posts Not found any related posts VIEW ALL Readmore Reply Cancel reply Delete By Home PAGES POSTS View All RECOMMENDED FOR YOU Tag ARCHIVE SEARCH ALL POSTS Not found any post match with your request Back Home Contents See also related 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 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 THIS PREMIUM CONTENT IS LOCKED