Berkeley Math Circle

Berkeley Math Circle
Monthly Contest 1
Due October 7, 2008
Instructions
This contest consists of 5 problems, some of which are easier than the others. Every problem is worth 7 points. Please, write solution
to every problem on a separate sheet of paper, and on top of each sheet include your name, grade and school, as well as the problem
number and the contest number. Thus, the header on each sheet should look something like:
Solution to Problem 3 of BMC Monthly Contest 1

by Bart Simpson
in grade 5
from Springfield Middle School, Springfield
If you submit more than one sheet for a specific problem, please, staple the sheets together to avoid getting them confused with
someone else’s solution. Please, do NOT staple together solutions to DIFFERENT problems, as they will be graded separately.
Carefully justify your answers to avoid losing points. Include all relevant explanations in words and all intermediate calculations.
Answers without justification will receive no credit. However, good reasoning with minor calculational errors may receive a lot of
points. Thus, submit solutions to as many problems as you can since partial credits will be awarded for sufficient progress on any
particular problem.
Remember that you are NOT ALLOWED to consult or talk to anyone else about the problems, whether in person, on the phone,
via e-mail, or other means of communication. You can consult any book that you wish. For more on the contest rules, please, check
the BMC website at http://mathcircle.berkeley.edu.
Enjoy solving these problems and good luck!
Problems
1. If x and y are integers such that

x2 + y 2 = x2 y 2 ,
prove that x = y = 0.
2. The country of Squareland is shaped like a square and is divided into 64 congruent square cities. We want to divide Squareland
into states and assign to each state a capital city so that the following rules are satisfied:
(a) Every city lies entirely within one state.

(b) Given any two states, the numbers of cities in them differ by at most 1.
(c) Any city in a state shares at least one corner with the state’s capital.
What is the smallest possible number of states?
3. Eight unit squares are glued together to make two groups of S

four, and the groups are pressed together so as to meet in three S S
S
SrA S S
S
points A, B, C as shown in the diagram. Find the distance S
AB. S
S S
S
Sr r
S S C
B S
4. Let a, b, c be positive real numbers satisfying abc = 1. Prove that
a(a − 1) + b(b − 1) + c(c − 1) ≥ 0.
5. The positive integers from 1 to 100 are written, in some order, in a 10 × 10 square. In each row, the five smallest numbers are
crossed out. In each column, the five largest numbers (including those that have already been crossed out) are circled. Prove
that at least 25 numbers will be circled but not crossed out.
Monthly Contest 2
Due November 4, 2008
Instructions

by Bart Simpson
in grade 5
particular problem.
Problems
1. A building has seven rooms numbered 1 through 7, all on one floor, and any number of doors connecting these rooms. These
doors may be one-way, admitting motion in only one of the two directions, or two-way. In addition, there is a two-way door
between room 1 and the outside, and a treasure in room 7. Your object is to choose the arrangement of the rooms and the
locations of the doors in such a way that
(a) it is possible to enter room 1, reach the treasure, and make it back outside,
(b) the minimum number of steps required to to this (each step consisting of walking through a door) is as large as possible.
2. Prove that there is exactly one way to place circles in four of + =

the blank squares of the cross-equation puzzle at right such
that, no matter what natural numbers are placed in the cir- + = +
cled squares, the five uncircled squares can be filled with nat-
ural numbers that make the three horizontal and three vertical = +
equations true.
= + =
+ =
3. A number is called a j-half if it leaves a remainder of j when divided by 2j + 1.

(a) Prove that for any k, there is a number which is simultaneously a j-half for j = 1, 2, . . . , k.
(b) Prove that there is no number which is a j-half for all positive integers j.
4. Let AOB be a 60-degree angle. For any point P in the interior of ∠AOB, let A0 and B 0 be the feet of the perpendiculars from
P to AO and BO respectively. Denote by r and s the distances OP and A0 B 0 . Find all possible pairs of real numbers (r, s).
5. Prove that for every positive integer n, there is an integer x such that x2 − 17 is divisible by 2n .
Monthly Contest 3
Due December 2, 2008
Instructions

by Bart Simpson
in grade 5
particular problem.
Problems
1. Find all positive integers p such that p, p + 4, and p + 8 are all prime.
2. Each vertex of a regular heptagon is colored either red or blue. Prove that there is an isosceles triangle with all its vertices the
same color.
3. Let a, b, and c be positive real numbers satisfying ab > ba and bc > cb . Does it follow that ac > ca ?
4. Let n be a positive integer and let S be the set 1, 2, . . . , n. Define a function f : S → S by

2x if 2x ≤ n,
f (x) =
2n − 2x + 1 otherwise.
Define f 2 (x) = f (f (x)), f 3 (x) = f (f (f (x))), and so on. If m is a positive integer satisfying f m (1) = 1, prove that
f m (k) = k for all k ∈ S.
5. This problem was invalid on the contest. Correct formulation as of December 9. Let ω1 , ω2 , and ω3 be three circles passing
through the origin O of the coordinate plane but not tangent to each other or to either axis. Denote by (xi , 0) and (0, yi ),
1 ≤ i ≤ 3, the respective intersections (besides O) of circle ωi with the x and y axes. Prove that ω1 , ω2 , and ω3 have a
common point P 6= O if and only if the points (x1 , y1 ), (x2 , y2 ), and (x3 , y3 ) are collinear.
Monthly Contest 4
Due January 6, 2009
Instructions

by Bart Simpson
in grade 5
particular problem.
Problems
1. Each square of a 100 × 100 grid is colored black or white so that there is at least one square of each color. Prove that there is a
point with is a vertex of exactly one black square.
2. Let a and b be nonzero real numbers. Prove that at least one of the following inequalities is true:
a + √a2 + 2b2

<1 (1)

2b

a − √a2 + 2b2

<1 (2)

2b

3. In acute triangle ABC, the three altitudes meet at H. Given that AH = BC, calculate at least one of the angles of 4ABC.
4. Let x be an integer greater than 2. Prove that the binary representation of x2 − 1 has at least three consecutive identical digits
(000 or 111).
5. Find all functions f : R → R satisfying
f (x(1 + y)) = f (x) (1 + f (y))
for all x, y ∈ R.
Monthly Contest 5
Due February 3, 2009
Instructions

by Bart Simpson
in grade 5
particular problem.
Problems
1. In how many ways can each square of a 2 × 9 board be colored red, blue, or green so that no two squares that share an edge
are the same color?
2. Prove that the sum of the 2009th powers of the first 2009 positive integers is divisible by 2009.
3. If real numbers a, b, c, d satisfy
a+b b+c
= 6= −1,
c+d a+d
prove that a = c.
4. In triangle ABC, the bisector of ∠B meets the circumcircle of 4ABC at D. Prove that
BD2 > BA · BC.
5. A calculator has a switch and four buttons with the following functions:
• Flipping the switch from the down to the up position adds 1 to the number in the display.
• Flipping the switch from the up to the down position subtracts 1 from the number in the display.
• Pressing the red button multiplies the number in the display by 3.
• If the number in the display is divisible by 3, pressing the yellow button divides it by 3; otherwise the yellow button is
nonfunctional.
• Pressing the green button multiplies the number in the display by 5.
• If the number in the display is divisible by 5, pressing the blue button divides it by 5; otherwise the blue button is
nonfunctional.
Initially the display shows 0 and the switch is down. Prove that we can get any positive integer we wish in the display.
Monthly Contest 6
Due March 3, 2009
Instructions

by Bart Simpson
in grade 5
particular problem.
Problems
1. Let p, q, and r be distinct primes. Prove that p + q + r + pqr is composite.

2. The sequence
5, 9, 49, 2209, . . .
is defined by a1 = 5 and an = a1 a2 · · · an−1 + 4 for n > 1. Prove that an is a perfect square for n ≥ 2.
3. The integers from 1 to 13 are arranged around several rings such that every number appears once and every ring contains at
least one two-digit number. Prove that there exist three one-digit numbers adjacent to one another on one ring.
4. Let ABC be a triangle with ∠ABC = 90◦ . Points D and E on AC and BC respectively satisfy BD ⊥ AC and DE ⊥ BC.
The circumcircle of 4CDE intersects AE at two points, E and F . Prove that BF ⊥ AE.
5. Let a1 , a2 , . . . , an be distinct integers. Prove that there do not exist two nonconstant integer-coefficient polynomials p and q
such that
(x − a1 )(x − a2 ) · · · (x − an ) − 1 = p(x)q(x)
for all x.
Monthly Contest 7
Due March 31, 2009
Instructions

by Bart Simpson
in grade 5
particular problem.
Problems
1. In the sequence
77492836181624186886128 . . . ,
all of the digits except the first two are obtained by writing down the products of pairs of consecutive digits. Prove that infinitely
many 6s appear in the sequence.
2. Let k be a positive rational number. Prove that there exist positive integers a, b, c satisfying the equations
a2 + b2 = c2 (1)
a+c
= k. (2)
b
A
3. Four congruent circles are tangent to each other and to the Z
sides of a triangle as shown. # Z
Z
Z
# Z
Z
"! Z
◦
# # Z
(a) Prove that ∠ABC = 90 . Z
"! Z
Z
"!"!
Z
(b) If AB = 3 and BC = 4, find the radius of the circles. B
Z
C
4. Find all pairs (a, b) of positive integers such that

1 + 5a = 6b .
5. The tower function of twos, T (n), is defined by T (1) = 2 and T (n + 1) = 2T (n) for n ≥ 1. Prove that T (n) − T (n − 1) is
divisible by n! for n ≥ 2.
Monthly Contest 8
Due April 28, 2009
Instructions

by Bart Simpson
in grade 5
particular problem.
Problems
1. Determine whether there exists a natural number having exactly 10 divisors (including itself and 1), each ending in a different
digit.
2. Two bikers, Bill and Sal, simultaneously set off from one end of a straight road. Neither biker moves at a constant rate, but
each continues biking until he reaches one end of the road, at which he instantaneously turns around. When they meet at the
opposite end from where they started, Bill has traveled the length of the road eleven times and Sal seven times. Find the number
of times the bikers passed each other moving in opposite directions.
3. A position of the hands of a (12-hour, analog) clock is called valid if it occurs in the course of a day. For example, the position
with both hands on the 12 is valid; the position with both hands on the 6 is not. A position of the hands is called bivalid if it
is valid and, in addition, the position formed by interchanging the hour and minute hands is valid. Find the number of bivalid
positions.
4. Let ABC be a triangle, and let M and N be the respective midpoints of AB and AC. Suppose that
√
CM 3
= .
AC 2
Prove that √
BN 3
= .
AB 2
5. Let Mn be the number of integers N such that
(a) 0 ≤ N < 10n ;
(b) N is divisible by 4;
(c) The sum of the digits of N is also divisible by 4.
Prove that Mn 6= 10n /16 for all positive integers n.

Berkeley Math Circle - Monthly Contests - Problems (2008-09)

Hochgeladen von

Dokumentinformationen

Copyright

Verfügbare Formate

Dieses Dokument teilen

Dokument teilen oder einbetten

Freigabeoptionen

Stufen Sie dieses Dokument als nützlich ein?

Sind diese Inhalte unangemessen?

Copyright:

Verfügbare Formate

Berkeley Math Circle - Monthly Contests - Problems (2008-09)

Hochgeladen von

Copyright:

Verfügbare Formate

Solution to Problem 3 of BMC Monthly Contest 1

1. If x and y are integers such that

(a) Every city lies entirely within one state.

What is the smallest possible number of states?

3. Eight unit squares are glued together to make two groups of S

4. Let a, b, c be positive real numbers satisfying abc = 1. Prove that

a(a − 1) + b(b − 1) + c(c − 1) ≥ 0.

Solution to Problem 3 of BMC Monthly Contest 2

2. Prove that there is exactly one way to place circles in four of + =

3. A number is called a j-half if it leaves a remainder of j when divided by 2j + 1.

Solution to Problem 3 of BMC Monthly Contest 3

Solution to Problem 3 of BMC Monthly Contest 4

Solution to Problem 3 of BMC Monthly Contest 5

BD2 > BA · BC.

Solution to Problem 3 of BMC Monthly Contest 5

1. Let p, q, and r be distinct primes. Prove that p + q + r + pqr is composite.

Solution to Problem 3 of BMC Monthly Contest 7

4. Find all pairs (a, b) of positive integers such that

Solution to Problem 3 of BMC Monthly Contest 8

Prove that Mn 6= 10n /16 for all positive integers n.

Das könnte Ihnen auch gefallen

Berkeley Math Circle - Monthly Contests - Problems (2008-09)

Hochgeladen von

Dokumentinformationen

Copyright

Verfügbare Formate

Dieses Dokument teilen

Dokument teilen oder einbetten

Freigabeoptionen

Stufen Sie dieses Dokument als nützlich ein?

Sind diese Inhalte unangemessen?

Copyright:

Verfügbare Formate

Berkeley Math Circle - Monthly Contests - Problems (2008-09)

Hochgeladen von

Copyright:

Verfügbare Formate

Berkeley Math Circle

Solution to Problem 3 of BMC Monthly Contest 1

1. If x and y are integers such that

(a) Every city lies entirely within one state.

What is the smallest possible number of states?

3. Eight unit squares are glued together to make two groups of S

4. Let a, b, c be positive real numbers satisfying abc = 1. Prove that

a(a − 1) + b(b − 1) + c(c − 1) ≥ 0.

Solution to Problem 3 of BMC Monthly Contest 2

2. Prove that there is exactly one way to place circles in four of + =

3. A number is called a j-half if it leaves a remainder of j when divided by 2j + 1.

Solution to Problem 3 of BMC Monthly Contest 3

Solution to Problem 3 of BMC Monthly Contest 4

Solution to Problem 3 of BMC Monthly Contest 5

BD2 > BA · BC.

Solution to Problem 3 of BMC Monthly Contest 5

1. Let p, q, and r be distinct primes. Prove that p + q + r + pqr is composite.

Solution to Problem 3 of BMC Monthly Contest 7

4. Find all pairs (a, b) of positive integers such that

Solution to Problem 3 of BMC Monthly Contest 8

Prove that Mn 6= 10n /16 for all positive integers n.

Das könnte Ihnen auch gefallen

3. Eight unit squares are glued together to make two groups of S