tailieunhanh - ĐỀ THI TOÁN APMO (CHÂU Á THÁI BÌNH DƯƠNG)_ĐỀ 7

Tham khảo tài liệu 'đề thi toán apmo (châu á thái bình dương)_đề 7', khoa học tự nhiên, toán học phục vụ nhu cầu học tập, nghiên cứu và làm việc hiệu quả | APMO XVIII Asian Pacific Mathematics Olympiad Time allowed 4 hours Each problem is worth 7 points The contest problems are to be kept confidential until they are posted on the official APMO website. Please do not disclose nor discuss the problems over the internet until that date. No calculators are to be used during the contest. Problem 1. Let n be a positive integer. Find the largest nonnegative real number f n depending on n with the following property whenever a1 a2 . an are real numbers such that a1 a2 an is an integer there exists some i such that I a 2 I f n . Problem 2. Prove that every positive integer can be written as a finite sum of distinct integral powers of the golden mean T 1 2vZ5. Here an integral power of T is of the form Ti where i is an integer not necessarily positive . Problem 3. Let p 5 be a prime and let r be the number of ways of placing p checkers on a p p checkerboard so that not all checkers are in the same row but they may all be in the same column . Show that r is divisible by p5. Here we assume that all the checkers are identical. Problem 4. Let A B be two distinct points on a given circle O and let P be the midpoint of the line segment AB. Let O1 be the circle tangent to the line AB at P and tangent to the circle O. Let be the tangent line different from the line AB to O1 passing through A. Let C be the intersection point different from A of and O. Let Q be the midpoint of the line segment BC and O2 be the circle tangent to the line BC at Q and tangent to the line segment AC. Prove that the circle O2 is tangent to the circle O. Problem 5. In a circus there are n clowns who dress and paint themselves up using a selection of 12 distinct colours. Each clown is required to use at least five different colours. One day the ringmaster of the circus orders that no two clowns have exactly the same set of colours and no more than 20 clowns may use any one particular colour. Find the largest number n of clowns so as to make the ringmaster s .