2012 NIMO Problems: Contributors: AIME15, V Enhance
2012 NIMO Problems: Contributors: AIME15, V Enhance
– Winter Contest
– January 22nd
www.artofproblemsolving.com/community/c4090
Contributors: AIME15, v Enhance
2012 NIMO Problems
8 A convex 2012-gon A1 A2 A3 . . . A2012 has the property that for every inte-
ger 1 ≤ i ≤ 1006, Ai Ai+1006 partitions the polygon into two congruent re-
gions. Show that for every pair of integers 1 ≤ j < k ≤ 1006, quadrilateral
Aj Ak Aj+1006 Ak+1006 is a parallelogram.
Proposed by Lewis Chen
– Monthly Contests
1 Dan the dog spots Cate the cat 50m away. At that instant, Cate begins running
away from Dan at 6 m/s, and Dan begins running toward Cate at 8 m/s. Both
of them accelerate instantaneously and run in straight lines. Compute the
number of seconds it takes for Dan to reach Cate.
Proposed by Eugene Chen
www.artofproblemsolving.com/community/c4090
Contributors: AIME15, v Enhance
2012 NIMO Problems
5 If w = a + bi, where a and b are real numbers, then ℜ(w) = a and ℑ(w) = b.
Let z = c + di, where c, d ≥ 0. If
ℜ(z) + ℑ(z) = 7,
ℜ(z 2 ) + ℑ(z 2 ) = 17,
then compute ℜ z 3 + ℑ z 3 .
Proposed by Lewis Chen
6 A square is called proper if its sides are parallel to the coordinate axes. Point
P is randomly selected inside a proper square S with side length 2012. Denote
by T the largest proper square that lies within S and has P on its perimeter,
and denote by a the expected value of the side length of T . Compute ⌊a⌋, the
greatest integer less than or equal to a.
Proposed by Lewis Chen
www.artofproblemsolving.com/community/c4090
Contributors: AIME15, v Enhance
2012 NIMO Problems
4 When flipped, coin A shows heads 13 of the time, coin B shows heads 12 of
the time, and coin C shows heads 32 of the time. Anna selects one of the
coins at random and flips it four times, yielding three heads and one tail. The
probability that Anna flipped coin A can be expressed as pq for relatively prime
positive integers p and q. Compute p + q.
Proposed by Eugene Chen
www.artofproblemsolving.com/community/c4090
Contributors: AIME15, v Enhance
2012 NIMO Problems
2 Compute the number of positive integers n < 2012 that share exactly two
positive factors with 2012.
Proposed by Aaron Lin
4 The subnumbers of an integer n are the numbers that can be formed by using a
contiguous subsequence of the digits. For example, the subnumbers of 135 are
1, 3, 5, 13, 35, and 135. Compute the number of primes less than 1,000,000,000
that have no non-prime subnumbers. One such number is 37, because 3, 7, and
37 are prime, but 135 is not one, because the subnumbers 1, 35, and 135 are
not prime.
Proposed by Lewis Chen
5 The hour and minute hands on a certain 12-hour analog clock are indistinguish-
able. If the hands of the clock move continuously, compute the number of times
strictly between noon and midnight for which the information on the clock is
not sufficient to determine the time.
Proposed by Lewis Chen
√
6 In rhombus N IM O, M N = 150 3 and ∡M ON = 60◦ . Denote by S the locus
of points P in the interior of N IM O such that ∠M P O ∼
= ∠N P O. Find the
greatest integer not exceeding the perimeter of S.
Proposed by Evan Chen
7 For every pair of reals 0 < a < b < 1, we define sequences {xn }n≥0 and {yn }n≥0
by x0 = 0, y0 = 1, and for each integer n ≥ 1:
xn = (1 − a)xn−1 + ayn−1 ,
yn = (1 − b)xn−1 + byn−1 .
The supermean of a and b is the limit of {xn } as n approaches infinity. Over all
2 2
1 2
pairs of real numbers (p, q) satisfying p − 12 + q − 21 ≤ 10 , the minimum
m
possible value of the supermean of p and q can be expressed as n for relatively
prime positive integers m and n. Compute 100m + n.
Proposed by Lewis Chen
www.artofproblemsolving.com/community/c4090
Contributors: AIME15, v Enhance
2012 NIMO Problems
8 Concentric circles Ω1 and Ω2 with radii 1 and 100, respectively, are drawn
with center O. Points A and B are chosen independently at random on the
circumferences of Ω1 and Ω2 , respectively. Denote by ℓ the tangent line to Ω1
passing through A, and denote by P the reflection of B across ℓ. Compute the
expected value of OP 2 .
Proposed by Lewis Chen
9 Let f (x) = x2 − 2x. A set of real numbers S is valid if it satisfies the following:
• If x ∈ S, then f (x) ∈ S. • If x ∈ S and f (f (. . . f (x) . . . )) = x for some
| {z }
k f ’s
integer k, then f (x) = x.
Compute the number of 7-element valid sets.
Proposed by Lewis Chen
333
X
10 For reals x1 , x2 , x3 , . . . , x333 ∈ [−1, ∞), let Sk = xki for each k. If S2 = 777,
i=1
compute the least possible value of S3 .
Proposed by Evan Chen
n 40
2 For which positive integer n is the quantity 3 + n minimized?
Proposed by Eugene Chen
3 In chess, there are two types of minor pieces, the bishop and the knight. A
bishop may move along a diagonal, as long as there√are no pieces obstructing
its path. A knight may jump to any lattice square 5 away as long as it isn’t
occupied.
One day, a bishop and a knight were on squares in the same row of an infinite
chessboard, when a huge meteor storm occurred, placing a meteor in each square
on the chessboard independently and randomly with probability p. Neither the
bishop nor the knight were hit, but their movement may have been obstructed
by the meteors.
The value of p that would make the expected number of valid squares that the
bishop can move to and the number of squares that the knight can move to
www.artofproblemsolving.com/community/c4090
Contributors: AIME15, v Enhance
2012 NIMO Problems
a
equal can be expressed as b for relatively prime positive integers a, b. Compute
100a + b.
Proposed by Lewis Chen
4 Let S = {(x, y) : x, y ∈ {1, 2, 3, . . . , 2012}}. For all points (a, b), let N (a, b) =
{(a − 1, b), (a + 1, b), (a, b − 1), (a, b + 1)}. Kathy constructs a set X
T by adding n
distinct points from S to T at random. If the expected value of |N (a, b)∩
(a,b)∈T
T | is 4, then compute n.
Proposed by Lewis Chen
5 A number is called purple if it can be expressed in the form 2a15b for positive
integers a > b. The sum of all purple numbers can be expressed as ab for
relatively prime positive integers a, b. Compute 100a + b.
Proposed by Eugene Chen
√ √ √
6 The polynomial P (x) = x3 + 6x2 − 2x − 3 has three distinct real roots.
Compute the sum of all 0 ≤ θ < 360 such that P (tan θ◦ ) = 0.
Proposed by Lewis Chen
8 Bob has invented the Very Normal Coin (VNC). When the VNC is flipped,
it shows heads 21 of the time and tails 21 of the time - unless it has yielded
the same result five times in a row, in which case it is guaranteed to yield the
opposite result. For example, if Bob flips five heads in a row, then the next flip
is guaranteed to be tails.
Bob flips the VNC an infinite number of times. On the nth flip, Bob bets 2−n
dollars that the VNC will show heads (so if the second flip shows heads, Bob
wins $0.25, and if the third flip shows tails, Bob loses $0.125).
Assume that dollars are infinitely divisible. Given that the first flip is heads,
the expected number of dollars Bob is expected to win can be expressed as ab
for relatively prime positive integers a, b. Compute 100a + b.
Proposed by Lewis Chen
www.artofproblemsolving.com/community/c4090
Contributors: AIME15, v Enhance
2012 NIMO Problems
9 In how many ways can the following figure be tiled with 2 × 1 dominos?
– Summer Contest
1 Let f (x) = (x4 + 2x3 + 4x2 + 2x + 1)5 . Compute the prime p satisfying f (p) =
418,195,493.
Proposed by Eugene Chen
3 Let
2012
X
S= i!.
i=1
www.artofproblemsolving.com/community/c4090
Contributors: AIME15, v Enhance
2012 NIMO Problems
The tens and units digits of S (in decimal notation) are a and b, respectively.
Compute 10a + b.
Proposed by Lewis Chen
5 In the diagram below, three squares are inscribed in right triangles. Their areas
are A, M , and N , as indicated in the diagram. If M = 5 and N = 12, then A
√
can be expressed as a + b c, where a, b, and c are positive integers and c is not
divisible by the square of any prime. Compute a + b + c.
www.artofproblemsolving.com/community/c4090
Contributors: AIME15, v Enhance
2012 NIMO Problems
6 When Eva counts, she skips all numbers containing a digit divisible by 3. For
example, the first ten numbers she counts are 1, 2, 4, 5, 7, 8, 11, 12, 14, 15.
What is the 100th number she counts?
Proposed by Eugene Chen
8 Points A, B, and O lie in the plane such that ∡AOB = 120◦ . Circle ω0 with
−→ −−→
radius 6 is constructed tangent to both OA and OB. For all i ≥ 1, circle ωi
−→ −−→
with radius ri is constructed such that ri < ri−1 and ωi is tangent to OA, OB,
and ωi−1 . If
∞
X
S= ri ,
i=1
√
then S can be expressed as a b + c, where a, b, c are integers and b is not
divisible by the square of any prime. Compute 100a + 10b + c.
Proposed by Aaron Lin
9 A quadratic polynomial p(x) with integer coefficients satisfies p(41) = 42. For
some integers a, b > 41, p(a) = 13 and p(b) = 73. Compute the value of p(1).
Proposed by Aaron Lin
www.artofproblemsolving.com/community/c4090
Contributors: AIME15, v Enhance
2012 NIMO Problems
12 The NEMO (National Electronic Math Olympiad) is similar to the NIMO Sum-
mer Contest, in that there are fifteen problems, each worth a set number of
points. However, the NEMO is weighted using Fibonacci numbers; that is, the
nth problem is worth Fn points, where F1 = F2 = 1 and Fn = Fn−1 + Fn−2
for n ≥ 3. The two problem writers are fair people, so they make sure that
each of them is responsible for problems worth an equal number of total points.
Compute the number of ways problem writing assignments can be distributed
between the two writers.
Proposed by Lewis Chen
9 × 99 × 999 × · · · × 999999999.
14 A set of lattice points is called good if it does not contain two points that form
a line with slope −1 or slope 1. Let S = {(x, y) | x, y ∈ Z, 1 ≤ x, y ≤ 4}.
Compute the number of non-empty good subsets of S.
Proposed by Lewis Chen
15 In the diagram below, square ABCD with side length 23 is cut into nine rect-
angles by two lines parallel to AB and two lines parallel to BC. The areas
of four of these rectangles are indicated in the diagram. Compute the largest
possible value for the area of the central rectangle.
www.artofproblemsolving.com/community/c4090
Contributors: AIME15, v Enhance
2012 NIMO Problems
A B
13
123 111
37
D C
www.artofproblemsolving.com/community/c4090
Contributors: AIME15, v Enhance