• Tidak ada hasil yang ditemukan

DISINI exam2011

N/A
N/A
Protected

Academic year: 2017

Membagikan " DISINI exam2011"

Copied!
1
0
0

Teks penuh

(1)

43

rd

Canadian Mathematical Olympiad

Wednesday, March 23, 2011

(1) Consider 70-digit numbersn, with the property that each of the digits 1,2,3, . . . ,7 appears in the decimal expansion of n ten times (and 8, 9, and 0 do not appear). Show that no number of this form can divide another number of this form.

(2) LetABCD be a cyclic quadrilateral whose opposite sides are not parallel, X the intersection of AB and CD, and Y the intersection of AD and BC. Let the angle bisector of ∠AXD intersect AD, BC at E, F respectively and let the angle bisector of ∠AY B intersect AB, CD at G, H respectively. Prove that EGF H is a parallelogram.

(3) Amy has divided a square up into finitely many white and red rectangles, each with sides parallel to the sides of the square. Within each white rectangle, she writes down its width divided by its height. Within each red rectangle, she writes down its height divided by its width. Finally, she calculates x, the sum of these numbers. If the total area of the white rectangles equals the total area of the red rectangles, what is the smallest possible value ofx?

(4) Show that there exists a positive integerN such that for all integersa > N, there exists a contiguous substring of the decimal expansion ofathat is divisible by 2011. (For instance, if a = 153204, then 15, 532, and 0 are all contiguous substrings of

a. Note that 0 is divisible by 2011.)

(5) Letd be a positive integer. Show that for every integer S, there exists an integer

n >0 and a sequence²1,²2, . . . ,²n, where for any k,²k = 1 or ²k=1, such that

S =²1(1 +d) 2

+²2(1 + 2d) 2

+²3(1 + 3d) 2

+· · ·+²n(1 +nd)

2

.

Referensi

Dokumen terkait

10) An integer n > 1 is abundant if the sum of its proper divisors (positive integer divisors smaller than n) is greater than n.. 12) Larry's retirement portfolio consists

Call a positive integer n practical if every positive integer less than or equal to n can be written as the sum of distinct divisors of n?. For example, the divisors of 6 are 1, 2,

Since 52 is the number formed by the last two digits divisible by 4 then we need only ask, ‘for what values of k is 7 52 k divisible by 3?’ If a number is divisible by 3 the sum

Again, every positive integer less than 114, with the exception of the 12 integers before 114 in the GEB sequence, must occur in the difference sequence, and these integers (113 − 12

If we fix any specific digit in any of the three positions, there will be exactly 81 integers with that digit in that position, as there are 9 possibilities for each of the

How many positive integers less than 100 are there such that the product of all positive divisors of such a number is equal to the square of the

What is the greatest possible number of students who dislike both pizza and spaghetti?. The integer a is the sum of three consecutive positive integers and is

Introduction to 8086 Assembly Lecture 4 Binary, Decimal and Hex Integer representation, signed integers, x86 flags, extending bit size... Decimal numbers