Volume 8, Number 4 August 2003 – October 2003

Olympiad Corner 利用 GW-BASIC 繪畫曼德勃羅集的方法

The 2003 International Mathematical
梁子傑老師
Olympiad took place on July 2003 in 香港道教聯合會青松中學
Japan. Here are the problems.

Problem 1. Let A be a subset of the set S = 已知一個複數 c0，並由此定義一 170 IF J >= 6 AND J < 9 THEN
{1, 2, …, 1000000} containing exactly 個複數數列 { cn }，使 cn+1 = cn2 + c0， COLOR 1 : REM BLUE
101 elements. Prove that there exist 其中 n = 0, 1, 2, ……。如果這個數列 180 IF J >= 9 AND J < 12 THEN
numbers t1, t2, … , t100 such that the sets 有界，即可以找到一個正實數 M，使 COLOR 2 : REM GREEN
190 IF J >= 12 AND J < 15 THEN
對於一切的 n，| cn | < M，那麼 c0 便屬
aj = {x + tj | x∊A } for j = 1, 2, … , 100 COLOR 15 : REM WHITE
於曼德勃羅集（Mandelbrot Set）之內。 200 IF J >= 15 THEN
are pairwise disjoint. COLOR 12 : REM RED
210 PSET (X + LEFT, (TOP – Y)* M)
Problem 2. Determine all pairs of 220 NEXT X
positive integers (a, b) such that 230 NEXT Y
240 COLOR 15 : REM WHITE
a2 250 LINE (LEFT, (TOP – W / 2) * M)
2 ab − b 3 + 1
2
– (W + LEFT, (TOP – W / 2) * M)
260 LINE (W / 2 + LEFT, (TOP – W)
is a positive integer. * M) – (W / 2 + LEFT, TOP * M)
270 END
Problem 3. A convex hexagon is given
in which any two opposite sides have the 以下是這程序的解釋：
following property: the distance between
their midpoints is 3 / 2 times the sum 可以將以上定義寫成一個 W 紀錄在電腦畫面上將要畫出
of their lengths. Prove that all the angles GW-BASIC 程序（對不起！我本人始 圖形的大小。現將 W 設定為 360（見
of the hexagon are equal. (A convex 終都是喜歡最簡單的電腦語言，而且 第 10 行），表示打算在電腦畫面上一
hexagon ABCDEF has three pairs of 我認為將 GW-BASIC 程序翻譯成其他 個 360 × 360 的方格內畫出曼德勃羅集
opposite sides: AB and DE, BC and EF, 電腦語言亦不難），方法如下： （見第 50 及 60 行）。
CD and FA.)
10 LEFT = 150 : TOP = 380 : LEFT 是繪圖時左邊的起點，TOP
(continued on page 4) W = 360 : M = .833 是圖的最低的起點（見第 210、250 及
Editors: 張 百 康 (CHEUNG Pak-Hong), Munsang College, HK 20 R = 2.64 : S = 2 * R / W 260 行）。注意：在 GW-BASIC 中，畫
高 子 眉 (KO Tsz-Mei) 30 RECEN = 0 : IMCEN = 0 面坐標是由上至下排列的，並非像一
梁 達 榮 (LEUNG Tat-Wing) 40 SCREEN 9 : CLS
般的理解，將坐標由下至上排，因此
李 健 賢 (LI Kin-Yin), Dept. of Math., HKUST 50 FOR Y = 0 TO W
吳 鏡 波 (NG Keng-Po Roger), ITC, HKPU 60 FOR X = 0 TO W 要以 “TOP − Y” 的方法將常用的坐標
Artist: 楊 秀 英 (YEUNG Sau-Ying Camille), MFA, CU 70 REC = S * (X – W / 2) + RECEN : 轉換成電腦的坐標。
Acknowledgment: Thanks to Elina Chiu, Math. Dept., HKUST IMC = S * (Y – W / 2) + IMCEN
for general assistance. 80 RE = REC : IM = IMC 由於電腦畫面上的一點並非正
On-line: http://www.math.ust.hk/mathematical_excalibur/ 90 RE2 = RE * RE : IM2 = IM * IM : 方形，橫向和縱向的大小並不一樣，
The editors welcome contributions from all teachers and J=0 故引入 M（= 5
）來調節長闊比（見
100 WHILE RE2 + IM2 <= 256 AND 6
students. With your submission, please include your name,
address, school, email, telephone and fax numbers (if available). J < 15 第 10、210、250 及 260 行）。
Electronic submissions, especially in MS Word, are encouraged.
The deadline for receiving material for the next issue is
110 IM = 2 * RE * IM + IMC
120 RE = RE2 – IM2 + REC 留意 W 祇是「畫面上」的大小，
November 30, 2003.
For individual subscription for the next five issues for the 03-04 130 RE2 = RE * RE : 並非曼德勃羅集內每一個複數點的實
academic year, send us five stamped self-addressed envelopes. IM2 = IM * IM : J = J + 1 際坐標，故需要作出轉換。R 是實際
Send all correspondence to: 的數值（見第 20 行） ，即繪畫的範圍
140 WEND
Dr. Kin-Yin LI
150 IF J < 3 THEN GOTO 220 實軸由 −R 畫至 +R，同時虛軸亦由 −R
Department of Mathematics
The Hong Kong University of Science and Technology 160 IF J >= 3 AND J < 6 THEN 畫至 +R。S 計算 W 與 R 之間的比例，
Clear Water Bay, Kowloon, Hong Kong COLOR 14 : REM YELLOW 並應用於後面的計算之中（見第 20 及
Fax: (852) 2358 1643 70 行）。
Email: makyli@ust.hk
Mathematical Excalibur, Vol. 8, No. 4, Aug 03- Oct 03 Page 2

respectively. The Bulgarian contestants

RECEN 和 IMCEN 用來定出中心 IMO 2003 did extremely well on the two hard
點的位置，現在以 (0, 0) 為中心（見 questions, Problem 3 and 6. Many
第 30 行）。我們可以通過更改 R、 T. W. Leung people found it surprising. On the
RECEN 和 IMCEN 的值來移動或放 other hand, despite going through war
大曼德勃羅集。 in 1960s Vietnam has been strong all
The 44th International Mathematical along. Perhaps they have participated
Olympiad (IMO) was held in Tokyo, in IMOs for a long time and have a
第 40 行選擇繪圖的模式及清除
Japan during the period 7 - 19 July 2003. very good Russian tradition.
舊有的畫面。
Because Hong Kong was declared cleared
from SARS on June 23, our team was able Among 82 teams, we ranked
程序的第 50 及 60 行定出畫面上 to leave for Japan as scheduled. The Hong unofficially 26. We were ahead of
的坐標 X 和 Y，然後在第 70 行計 Kong Team was composed as follows. Greece, Spain, New Zealand and
算出對應複數 c0 的實值和虛值。 Singapore, for instance. Both New
Chung Tat Chi (Queen Elizabeth School) Zealand and we got our first gold last
注意：若 c0 = a0 + b0 i，cn = an + bn i， Kwok Tsz Chiu (Yuen Long Merchants year. But this year the performance of
the New Zealand Team was a bit
則 Assn. Sec. School)
disappointing. On the other hand, we
cn+1 = cn2 + c0 Lau Wai Shun (T. W. Public Ho Chuen were behind Canada, Australia,
= (an + bn i)2 + (a0 + b0 i) Yiu Memorial College) Thailand and U.K.. Australia has been
= an2 − bn2 + 2anbn i + a0 + b0 i Siu Tsz Hang (STFA Leung Kau Kui doing well in the last few years, but this
= (an2 − bn2 + a0) College) year the team was just 1 point ahead of
+ (2anbn + b0)i。 Yeung Kai Sing (La Salle College) us. Thailand has been able to do quite
Yu Hok Pun (SKH Bishop Baker well in these few years.
所以 cn+1 的實部等於 an2 − bn2 + a0，
Secondary School)
而虛部則等於 2anbn + b0。 IMO 2004 will be held in Greece,
Leung Tat Wing (Leader)
Leung Chit Wan (Deputy Leader) IMO 2005 in Mexico, IMO 2006 in
將以上的計算化成程序，得第 Slovenia. IMO 2007 will be held in
110 及 120 行。REC 和 IMC 分別是 Two former Hong Kong Team Vietnam, the site was decided during
c0 的實值和虛值。RE 和 IM 分別是 members, Poon Wai Hoi and Law Ka Ho, this IMO in Japan.
cn 的實值和虛值。RE2 和 IM2 分別 paid us a visit in Japan during this period.
是 cn 的實值和虛值的平方。 For the reader who will try out the
The contestants took two 4.5 Hours IMO problems this year, here are some
comments on Problem 3, the hardest
J 用來紀錄第 100 至 140 行的循 contests on the mornings of July 13 and 14.
problem in the first day of the
環的次數。第 100 行亦同時計算 cn Each contest consisted of three questions, competitions.
模的平方。若模的平方大於 256 或 hence contest 1 composed of Problem 1 to
者循環次數多於 15，循環將會終 3, contest 2 Problem 4 to 6. In each Problem 3. A convex hexagon is
止。這時候，J 的數值越大，表示 contest usually the easier problems come given in which any two opposite sides
first and harder ones come later. After have the following property: the
該數列較「收斂」，即經過多次計
normal coordination procedures and Jury distance between their midpoints is
算後，cn 的模仍不會變得很大。第
meetings cutoff scores for gold, silver and 3 / 2 times the sum of their lengths.
150 至 200 行以顏色將收斂情況分 bronze medals were decided. This year Prove that all the angles of the
類，紅色表示最「收歛」的複數， the cutoff scores for gold, silver and hexagon are equal. (A convex
其次是白色，跟著是綠色、藍色和 bronze medals were 29, 19 and 13 hexagon ABCDEF has three pairs of
黃色，而最快擴散的部分以黑色表 respectively. Our team managed to win opposite sides: AB and DE, BC and
示。第 210 行以先前選定的顏色畫 two silvers, two bronzes and one EF, CD and FA.)
出該點。 honorable mention. (Silver: Kwok Tsz
Chiu and Yu Hok Pun, Bronze: Siu Tsz The problem is hard mainly because
曼德勃羅集繪畫完成後，以白色 Hang and Yeung Kai Sing, Honorable one does not know how to connect the
畫出橫軸及縱軸（見第 240 至 260 Mention: Chung Tat Chi, he got a full given condition with that of the interior
行）
，以供參考。程序亦在此結束。 score of 7 on one question, which angles. Perhaps hexagons are not as
accounted for his honorable mention, and rigid as triangles. It also reminded me
執行本程序所須的時間，要視乎 his total score is 1 point short of bronze). of No. 5, IMO 1996, another hard
Among all contestants three managed to problem of polygons.
電腦的速度，以現時一般的電腦而
obtain a perfect score of 42 on all six
言，整個程序應該可以 1 分鐘左右
questions. One contestant was from The main idea is as follows. Given a
完成。 China and the other two from Vietnam. hexagon ABCDEF, connect AD, BE
and CF to form the diagonals. From
參考書目 The Organizing Committee did not the given condition of the hexagon, it
Heinz-Otto Peitgen, Hartmut Jürgens give official total scores for individual can be proved that the triangles formed
and Dietmar Saupe (1992) Fractals countries, but it is a tradition that scores by the diagonals and the sides are
for the Classroom Part Two: between countries were compared. This actually equilateral triangles. Hence
Introduction to Fractals and Chaos. year the top five teams were Bulgaria, the interior angles of the hexagons are
NCTM, Springer-Verlag. China, U.S.A., Vietnam and Russia 120 o . Good luck.
Mathematical Excalibur, Vol. 8, No. 4, Aug 03- Oct 03 Page 3

Problem Corner ***************** nonnegative integer k. Taking square

We welcome readers to submit their
Solutions root, we get the desired inequality.
solutions to the problems posed below ****************
for publication consideration. The Problem 181. (Proposed by Achilleas Other commended solvers: POON
Ming Fung (STFA Leung Kau Kui
solutions should be preceded by the PavlosPorfyriadis, AmericanCollege of
College, Form 6) and SIU Tsz Hang
solver’s name, home (or email) address Thessaloniki “Anatolia”, Thessaloniki, (CUHK, Math Major, Year 1).
and school affiliation. Please send Greece) Prove that in a convex polygon,
submissions to Dr. Kin Y. Li, there cannot be two sides with no common
Problem 183. Do there exist 10
Department of Mathematics, The Hong vertex, each of which is longer than the
distinct integers, the sum of any 9 of
Kong University of Science & longest diagonal.
which is a perfect square? (Source:
Technology, Clear Water Bay, Kowloon. 1999 Russian Math Olympiad)
Proposer’s Solution.
The deadline for submitting solutions Solution. Achilleas Pavlos
is November 30, 2003. Suppose a convex polygon has two sides, PORFYRIADIS (American College
say AB and CD, which are longer than the of Thessaloniki “Anatolia”,
Problem 186. (Due to Fei Zhenpeng, longest diagonal, where A, B, C, D are Thessaloniki, Greece) and SIU Tsz
Yongfeng High School, Yancheng City, distinct vertices and A, C are on opposite Hang (CUHK, Math Major, Year 1).
Jiangsu Province, China) Let α, β, γ be side of line BD. Since AC, BD are Let a1, a2, …, a10 be distinct integers and
complex numbers such that diagonals of the polygon, we have AB > S be their sum. For i = 1, 2, …, 10, we
AC and CD > BD. Hence, would like to have S – ai = ki2 for some
α + β + γ = 1,
AB + CD > AC + BD. integer ki. Let T be the sum of k12, …,
α + β2 + γ2 = 3,
2
k102. Adding the 10 equations, we get 9S
By convexity, the intersection O of = T. Then ai = S – (S – ai) = (T/9) – ki2.
α3 + β3 + γ3 = 7.
diagonals AC and BD is on these So all we need to do is to choose integers
Determine the value of α21 + β21 + γ21 . diagonals. By triangle inequality, we have k1, k2, …, k10 so that T is divisible by 9.
AO + BO > AB and CO + DO > CD. For example, taking ki = 3i for i = 1, …,
Problem 187. Define f (n) = n!. Let 10, we get 376, 349, 304, 241, 160,
So AC + BD > AB + CD, a contradiction. 61, –56, –191, –344, –515 for a1, …, a10.
a = 0. f (1) f (2) f (3) … .
Other commended solvers: CHEUNG
In other words, to obtain the decimal Yun Kuen (Hong Kong Chinese Other commended solvers: CHEUNG
representation of a write the numbers Women’s Club College, Form5), John Yun Kuen (Hong Kong Chinese
f(1), f (2), f (3), … in base 10 in a row. PANAGEAS (Kaisari High School, Women’s Club College, Form 5).
Is a rational? Give a proof. Athens, Greece), POON Ming Fung
(STFA Leung Kau Kui College, Form 6), Problem 184. Let ABCD be a
SIU Tsz Hang (CUHK, Math Major, Year 1)
Problem 188. The line S is tangent to and YAU Chi Keung (CNC Memorial rhombus with ∠B = 60o . M is a point
the circumcircle of acute triangle ABC College, Form 6). inside ∆ADC such that ∠AMC =
at B. Let K be the projection of the 120o . Let lines BA and CM intersect at
orthocenter of triangle ABC onto line S Problem 182. Let a0, a1, a2, … be a P and lines BC and AM intersect at Q.
(i.e. K is the foot of perpendicular from sequence of real numbers such that Prove that D lies on the line PQ.
the orthocenter of triangle ABC to S). (Source: 2002 Belarussian Math
an+1 ≥ an2+ 1/5 for all n ≥ 0.
Let L be the midpoint of side AC. Show Olympiad)
that triangle BKL is isosceles. Prove that an + 5 ≥ an2− 5 for all n ≥ 5. Solution. John PANAGEAS (Kaisari
(Source: 2001 USA Team Selection Test) High School, Athens, Greece), and
Problem 189. 2n + 1 segments are POON Ming Fung (STFA Leung Kau
marked on a line. Each of the segments Solution. CHEUNG Yun Kuen (Hong
Kong Chinese Women’s Club College, Kui College, Form 6).
intersects at least n other segments.
Form5) and TAM Choi Nang Julian
Prove that one of these segments (Teacher, SKH Lam Kau Mow Secondary Since ABCD is a rhombus and ∠ABC =
intersect all other segments. School). 60o , we see ∠ADC, ∠DAC, ∠DCA,
∠PAD and ∠DCQ are all 60o .
Problem 190. (Due to Abderrahim Adding an+1 – an2 ≥ 1 / 5 for nonnegative
Ouardini) For nonnegative integer n, integers n = k, k + 1, k + 2, k + 3, k + 4, we Now
get
let ⌊x⌋ be the greatest integer less than ∠CAM+∠MCA = 180o –∠AMC = 60o
k +4
or equal to x and a k + 5 − ∑ (a n2 − a n ) − a k2 ≥1. and
[ n + n +1 + ]
n = k +1
f ( n) = n+2 Observe that ∠DCM + ∠MCA =∠DCA = 60o
− [ 9n + 1 ]. x 2 − x + 1 / 4 = ( x − 1 / 2) 2 ≥ 0 imply ∠CAM = ∠DCM.
2
Find the range of f and for each p in the implies 1 / 4 ≥ −( x − x) . Applying this
Since AB || CD, we get
range, find all nonnegative integers n to the inequality above and simplifying,
∠APC = ∠DCM = ∠CAQ.
such that f (n) = p. we easily get a k + 5 ≥ a k2 for nonnegative
integer k. Then a k +10 ≥ a k2 + 5 ≥ a k4 for
Mathematical Excalibur, Vol. 8, No. 4, Aug 03- Oct 03 Page 4

Also, ∠PAC = 120o = ∠ACQ. Hence Solution. Olympiad Corner

∆APC and ∆CAQ are similar. So PA/AC Let ω = cos (2π/n) + i sin (2π/n) and the (continued from page 1)
= AC/CQ. lights be at 1, ω , ω 2 , …, ω n −1 with the
Problem 4. Let ABCD be a cyclic
one at 1 on initially. If d is a divisor of n
Since AC = AD = DC, so PA/AD = DC/CQ. quadrilateral. Let P, Q and R be the feet of
As ∠PAD = 60 o = ∠DCQ, so ∆PAD and that is less than n and the lights at the perpendiculars from D to the lines BC,
∆DCQ are similar. Then ω a , ω a + d , ω a + 2 d ,L, ω a +( n−d ) CA and AB respectively. Show that PQ =
QR if and only if the bisector of ∠ABC and
∠PDA + ∠ADC + ∠CDQ have the same state, then we can change
∠ADC meet on AC.
=∠PDA + ∠PAD + ∠APD = 180 o . the state of these n/d lights. Note their sum
is a geometric series equal to Problem 5. Let n be a positive integer and
Therefore, P, D, Q are collinear.
a n d
ω (1 − ω ) /(1 − ω ) = 0. x1, x2, … , xn be real numbers with x1 ≤ x2
Other commended solvers: CHEUNG ≤ L ≤ xn .
Yun Kuen (Hong Kong Chinese Women’s So if we add up the numbers
Club College, Form 5), Achilleas Pavlos corresponding to the lights that are on (a) Prove that
PORFYRIADIS (American College of before and after a move, it will remain the 2
Thessaloniki “Anatolia”, Thessaloniki, ⎛ n n ⎞
Greece), SIU Tsz Hang (CUHK, Math same. Since in the beginning this number ⎜ ∑ ∑ xi − x j ⎟
⎜ i =1 j =1 ⎟
Major, Year 1), TAM Choi Nang Julian is 1, it will never be ⎝ ⎠
(Teacher, SKH Lam Kau Mow Secondary
School). 1 + ω + ω 2 + L + ω n −1 = 0. 2(n 2 − 1) n n 2
≤ ∑ ∑ ( xi − x j ) .
Therefore, all the lights can never be on at 3 i =1 j =1
Problem 185. Given a circle of n lights,
the same time.
exactly one of which is initially on, it is (b) Show that equality holds if and only if
permitted to change the state of a bulb Comments: This problem was due to x1, x2, …, xn is an arithmetic sequence.
provided one also changes the state of Professor James Propp, University of
every d-th bulb after it (where d is a divisor Wisconsin, Madison (see his website Problem 6. Let p be a prime number.
of n and is less than n), provided that all n/d http://www.math.wisc.edu/~propp/ ) and Prove that there exists a prime number q
bulbs were originally in the same state as was selected from page 141 of the highly such that for every integer n, the number
one another. For what values of n is it recommended book by Paul Zeitz titled n p − p is not divisible by q.
possible to turn all the bulbs on by making The Art and Craft of Problem Solving,
a sequence of moves of this kind? published by Wiley.

The 2003 Hong Kong IMO team from left to right: Wei Fei Fei (Guide), Leung Chit Wan (Deputy Leader), Chung Tat Chi, Siu
Tsz Hang, Kwok Tsz Chiu, Yu Hok Pun, Yeung Kai Sing, Lau Wai Shun, Leung Tat Wing (Leader).