[Shortlists] International Mathematical Olympiad 1994


  1. Let $ a_{0} = 1994$ and $ a_{n + 1} = \frac {a_{n}^{2}}{a_{n} + 1}$ for each nonnegative integer $ n$. Prove that $ 1994 - n$ is the greatest integer less than or equal to $ a_{n}$, $ 0 \leq n \leq 998$
  2. Let $ m$ and $ n$ be two positive integers. Let $ a_1$, $ a_2$, $ \ldots$, $ a_m$ be $ m$ different numbers from the set $ \{1, 2,\ldots, n\}$ such that for any two indices $ i$ and $ j$ with $ 1\leq i \leq j \leq m$ and $ a_i + a_j \leq n$, there exists an index $ k$ such that $ a_i + a_j = a_k$. Show that \[ \frac {a_1 + a_2 + ... + a_m}{m} \geq \frac {n + 1}{2}. \]
  3. Let $ S$ be the set of all real numbers strictly greater than −1. Find all functions $ f: S \to S$ satisfying the two conditions:
    a) $ f(x + f(y) + xf(y)) = y + f(x) + yf(x)$ for all $ x, y$ in $ S$;
    b) $ \frac {f(x)}{x}$ is strictly increasing on each of the two intervals $ - 1 < x < 0$ and $ 0 < x$.
  4. Let $ \mathbb{R}$ denote the set of all real numbers and $ \mathbb{R}^+$ the subset of all positive ones. Let $ \alpha$ and $ \beta$ be given elements in $ \mathbb{R},$ not necessarily distinct. Find all functions $ f: \mathbb{R}^+ \mapsto \mathbb{R}$ such that \[ f(x)f(y) = y^{\alpha} f \left( \frac{x}{2} \right) + x^{\beta} f \left( \frac{y}{2} \right) \forall x,y \in \mathbb{R}^+.\]
  5. Let $ f(x) = \frac{x^2+1}{2x}$ for $ x \neq 0.$ Define $ f^{(0)}(x) = x$ and $$f^{(n)}(x) = f(f^{(n-1)}(x))$$ for all positive integers $ n$ and $ x \neq 0.$ Prove that for all non-negative integers $ n$ and $ x \neq \{-1,0,1\}$ \[ \frac{f^{(n)}(x)}{f^{(n+1)}(x)} = 1 + \frac{1}{f \left( \left( \frac{x+1}{x-1} \right)^{2n} \right)}.\]


    1. $ C$ and $ D$ are points on a semicircle. The tangent at $ C$ meets the extended diameter of the semicircle at $ B$, and the tangent at $ D$ meets it at $ A$, so that $ A$ and $ B$ are on opposite sides of the center. The lines $ AC$ and $ BD$ meet at $ E$. $ F$ is the foot of the perpendicular from $ E$ to $ AB$. Show that $ EF$ bisects angle $ CFD$
    2. $ ABCD$ is a quadrilateral with $ BC$ parallel to $ AD$. $ M$ is the midpoint of $ CD$, $ P$ is the midpoint of $ MA$ and $ Q$ is the midpoint of $ MB$. The lines $ DP$ and $ CQ$ meet at $ N$. Prove that $ N$ is inside the quadrilateral $ ABCD$.
    3. A circle $ C$ has two parallel tangents $ L'$ and$ L"$. A circle $ C'$ touches $ L'$ at $ A$ and $ C$ at $ X$. A circle $ C"$ touches $ L"$ at $ B$, $ C$ at $ Y$ and $ C'$ at $ Z$. The lines $ AY$ and $ BX$ meet at $ Q$. Show that $ Q$ is the circumcenter of $ XYZ$
    4. Let $ ABC$ be an isosceles triangle with $ AB = AC$. $ M$ is the midpoint of $ BC$ and $ O$ is the point on the line $ AM$ such that $ OB$ is perpendicular to $ AB$. $ Q$ is an arbitrary point on $ BC$ different from $ B$ and $ C$. $ E$ lies on the line $ AB$ and $ F$ lies on the line $ AC$ such that $ E, Q, F$ are distinct and collinear. Prove that $ OQ$ is perpendicular to $ EF$ if and only if $ QE = QF$.
    5. A circle $ C$ with center $ O.$ and a line $ L$ which does not touch circle $ C.$ $ OQ$ is perpendicular to $ L,$ $ Q$ is on $ L.$ $ P$ is on $ L,$ draw two tangents $ L_1, L_2$ to circle $ C.$ $ QA, QB$ are perpendicular to $ L_1, L_2$ respectively. ($ A$ on $ L_1,$ $ B$ on $ L_2$). Prove that, line $ AB$ intersect $ QO$ at a fixed point.

      Number Theory

      1. $ M$ is a subset of $ \{1, 2, 3, \ldots, 15\}$ such that the product of any three distinct elements of $ M$ is not a square. Determine the maximum number of elements in $ M.$
      2. Find all ordered pairs $ (m,n)$ where $ m$ and $ n$ are positive integers such that $ \frac {n^3 + 1}{mn - 1}$ is an integer.
      3. Show that there exists a set $ A$ of positive integers with the following property: for any infinite set $ S$ of primes, there exist two positive integers $ m$ in $ A$ and $ n$ not in $ A$, each of which is a product of $ k$ distinct elements of $ S$ for some $ k \geq 2$.
      4. Define the sequences $ a_n, b_n, c_n$ as follows. $ a_0 = k, b_0 = 4, c_0 = 1$. If $ a_n$ is even then $$ a_{n + 1} = \frac {a_n}{2},\quad b_{n + 1} = 2b_n,\quad c_{n + 1} = c_n.$$ If $ a_n$ is odd, then $$ a_{n + 1} = a_n - \frac {b_n}{2} - c_n,\quad b_{n + 1} = b_n,\quad c_{n + 1} = b_n + c_n.$$ Find the number of positive integers $ k < 1995$ such that some $ a_n = 0$.
      5. For any positive integer $ k$, let $ f_k$ be the number of elements in the set $ \{ k + 1, k + 2, \ldots, 2k\}$ whose base 2 representation contains exactly three 1s.
        a) Prove that for any positive integer $ m$, there exists at least one positive integer $ k$ such that $ f(k) = m$.
        b) Determine all positive integers $ m$ for which there exists exactly one $ k$ with $ f(k) = m$.
      6. Define the sequence $ a_1, a_2, a_3, ...$ as follows. $ a_1$ and $ a_2$ are coprime positive integers and $ a_{n + 2} = a_{n + 1}a_n + 1$. Show that for every $ m > 1$ there is an $ n > m$ such that $ a_m^m$ divides $ a_n^n$. Is it true that $ a_1$ must divide $ a_n^n$ for some $ n > 1$?
      7. A wobbly number is a positive integer whose digits are alternately zero and non-zero with the last digit non-zero (for example, $201$). Find all positive integers which do not divide any wobbly number.


      1. Two players play alternately on a $ 5 \times 5$ board. The first player always enters a $ 1$ into an empty square and the second player always enters a $ 0$ into an empty square. When the board is full, the sum of the numbers in each of the nine $ 3 \times 3$ squares is calculated and the first player's score is the largest such sum. What is the largest score the first player can make, regardless of the responses of the second player?
      2. In a certain city, age is reckoned in terms of real numbers rather than integers. Every two citizens $x$ and $x'$ either know each other or do not know each other. Moreover, if they do not, then there exists a chain of citizens $x = x_0, x_1, \ldots, x_n = x'$ for some integer $n \geq 2$ such that $ x_{i-1}$ and $x_i$ know each other. In a census, all male citizens declare their ages, and there is at least one male citizen. Each female citizen provides only the information that her age is the average of the ages of all the citizens she knows. Prove that this is enough to determine uniquely the ages of all the female citizens.
      3. Peter has three accounts in a bank, each with an integral number of dollars. He is only allowed to transfer money from one account to another so that the amount of money in the latter is doubled. Prove that Peter can always transfer all his money into two accounts. Can Peter always transfer all his money into one account?
      4. There are $ n + 1$ cells in a row labeled from $ 0$ to $ n$ and $ n + 1$ cards labeled from $ 0$ to $ n$. The cards are arbitrarily placed in the cells, one per cell. The objective is to get card $ i$ into cell $ i$ for each $ i$. The allowed move is to find the smallest $ h$ such that cell $ h$ has a card with a label $ k > h$, pick up that card, slide the cards in cells $ h + 1$, $ h + 2$, ... , $ k$ one cell to the left and to place card $ k$ in cell $ k$. Show that at most $ 2^n - 1$ moves are required to get every card into the correct cell and that there is a unique starting position which requires $ 2^n - 1$ moves. [For example, if $ n = 2$ and the initial position is 210, then we get 102, then 012, a total of 2 moves.]
      5. $ 1994$ girls are seated at a round table. Initially one girl holds $ n$ tokens. Each turn a girl who is holding more than one token passes one token to each of her neighbours.
        a) Show that if $ n < 1994$, the game must terminate.
        b) Show that if $ n = 1994$ it cannot terminate.
      6. Two players play alternatively on an infinite square grid. The first player puts an $X$ in an empty cell and the second player puts an $O$ in an empty cell. The first player wins if he gets $11$ adjacent $X$'s in a line - horizontally, vertically or diagonally. Show that the second player can always prevent the first player from winning.
      7. Let $ n > 2$. Show that there is a set of $ 2^{n-1}$ points in the plane, no three collinear such that no $ 2n$ form a convex $ 2n$-gon.

      Post a Comment





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



      Ả-rập Xê-út,1,Abel,5,Albania,2,AMM,3,Amsterdam,5,Ấn Độ,2,An Giang,23,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,50,Bắc Kạn,1,Bạc Liêu,9,Bắc Ninh,48,Bắc Trung Bộ,7,Bài Toán Hay,5,Balkan,38,Baltic Way,30,BAMO,1,Bất Đẳng Thức,66,Bến Tre,46,Benelux,14,Bình Định,45,Bình Dương,23,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,6,Buôn Ma Thuột,1,BxMO,13,Cà Mau,14,Cần Thơ,14,Canada,40,Cao Bằng,7,Cao Quang Minh,1,Câu Chuyện Toán Học,36,Caucasus,2,CGMO,10,China,10,Chọn Đội Tuyển,352,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,618,Correspondence,1,Cosmin Poahata,1,Crux,2,Czech-Polish-Slovak,26,Đà Nẵng,39,Đa Thức,2,Đại Số,20,Đắk Lắk,56,Đắk Nông,7,Đan Phượng,1,Danube,7,Đào Thái Hiệp,1,ĐBSCL,2,Đề Thi,1,Đề Thi HSG,1767,Đề 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,52,Du Hiền Vinh,1,Đức,1,Duyên Hải Bắc Bộ,25,E-Book,33,EGMO,17,ELMO,19,EMC,9,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,26,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,232,Hà Tĩnh,73,Hà Trung Kiên,1,Hải Dương,50,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,101,HSG 11,91,HSG 12,585,HSG 9,425,HSG Cấp Trường,78,HSG Quốc Gia,106,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,33,Hương Sơn,2,Huỳnh Kim Linh,1,Hy Lạp,1,IMC,26,IMO,56,IMT,1,India,45,Inequality,13,InMC,1,International,315,Iran,11,Jakob,1,JBMO,41,Jewish,1,Journal,20,Junior,38,K2pi,1,Kazakhstan,1,Khánh Hòa,17,KHTN,54,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,17,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,455,Lớp 10 Không Chuyên,229,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,11,Metropolises,4,Mexico,1,MIC,1,Michael Guillen,1,Mochizuki,1,Moldova,1,Moscow,1,Mỹ,10,MYM,227,MYTS,4,Nam Định,33,Nam Phi,1,Nam Trung Bộ,1,National,249,Nesbitt,1,Newton,4,Nghệ An,52,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,4,Nhóm $\LaTeX$,4,Nhóm Toán,1,Ninh Bình,42,Ninh Thuận,15,Nội Suy Lagrange,2,Nội Suy Newton,1,Nordic,19,Olympiad Corner,1,Olympiad Preliminary,2,Olympic 10,99,Olympic 10/3,5,Olympic 11,92,Olympic 12,30,Olympic 24/3,7,Olympic 27/4,20,Olympic 30/4,69,Olympic KHTN,6,Olympic Sinh Viên,73,Olympic Tháng 4,12,Olympic Toán,304,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,29,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,32,Quảng Ngãi,34,Quảng Ninh,43,Quảng Trị,27,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,12,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,62,THCS,2,Thổ Nhĩ Kỳ,5,Thomas J. Mildorf,1,THPT Chuyên Lê Quý Đôn,1,THPTQG,15,THTT,7,Thừa Thiên Huế,36,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,6,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,14,Trường Đông,19,Trường Hè,7,Trường Thu,1,Trường Xuân,2,TST,56,Tuyên Quang,6,Tuyển Sinh,3,Tuyển Sinh 10,680,Tuyển Tập,44,Tuymaada,4,Undergraduate,67,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,21,Vĩnh Phúc,64,Virginia Tech,1,VLTT,1,VMEO,4,VMF,12,VMO,47,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,18,Yên Định,1,Yên Thành,1,Zhautykov,11,Zhou Yuan Zhe,1,
      MOlympiad: [Shortlists] International Mathematical Olympiad 1994
      [Shortlists] International Mathematical Olympiad 1994
      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