2014 Nimo Problems: Contributors: V Enhance, Vinayak-Kumar, James4L, Jsgandora, Bogtro, Ahaanomegas
2014 Nimo Problems: Contributors: V Enhance, Vinayak-Kumar, James4L, Jsgandora, Bogtro, Ahaanomegas
2014 Nimo Problems: Contributors: V Enhance, Vinayak-Kumar, James4L, Jsgandora, Bogtro, Ahaanomegas
– Winter Contest
2 Determine, with proof, the smallest positive integer c such that for any positive
integer n, the decimal representation of the number cn + 2014 has digits all less
than 5.
Proposed by Evan Chen
5 Let ABC be an acute triangle with orthocenter H and let M be the midpoint
of BC. (The orthocenter is the point at the intersection of the three altitudes.)
Denote by ωB the circle passing through B, H, and M , and denote by ωC the
circle passing through C, H, and M . Lines AB and AC meet ωB and ωC again
at P and Q, respectively. Rays P H and QH meet ωC and ωB again at R and
S, respectively. Show that △BRS and △CRS have the same area.
Proposed by Aaron Lin
6 Let ϕ(k) denote the numbers of positive integers less than or equal to k and
relatively prime to k. Prove that for some positive integer n,
1
ϕ(2n − 1) + ϕ(2n + 1) < ϕ(2n).
1000
Proposed by Evan Chen
www.artofproblemsolving.com/community/c4092
Contributors: v Enhance, vinayak-kumar, james4l, JSGandora, BOGTRO, ahaanomegas
2014 NIMO Problems
7 Let ABC be a triangle and let Q be a point such that AB ⊥ QB and AC ⊥ QC.
A circle with center I is inscribed in △ABC, and is tangent to BC, CA and
AB at points D, E, and F , respectively. If ray QI intersects EF at P , prove
that DP ⊥ EF .
Proposed by Aaron Lin
– Monthly Contests
2 In the game of Guess the Card, two players each have a 12 chance of winning
and there is exactly one winner. Sixteen competitors stand in a circle, num-
bered 1, 2, . . . , 16 clockwise. They participate in an 4-round single-elimination
tournament of Guess the Card. Each round, the referee randomly chooses one
of the remaining players, and the players pair off going clockwise, starting from
the chosen one; each pair then plays Guess the Card and the losers leave the
circle. If the probability that players 1 and 9 face each other in the last round
is m
n where m, n are positive integers, find 100m + n.
Proposed by Evan Chen
www.artofproblemsolving.com/community/c4092
Contributors: v Enhance, vinayak-kumar, james4l, JSGandora, BOGTRO, ahaanomegas
2014 NIMO Problems
(a + b)(a + c) = bc + 2
(b + c)(b + a) = ca + 5
(c + a)(c + b) = ab + 9
m
If abc = n for relatively prime positive integers m and n, compute 100m + n.
Proposed by Evan Chen
1
5 In triangle ABC, sin A sin B sin C = 1000 and AB · BC · CA = 1000. What is
the area of triangle ABC?
Proposed by Evan Chen
8 The side lengths of △ABC are integers with no common factor greater than 1.
Given that ∠B = 2∠C and AB < 600, compute the sum of all possible values
of AB.
Proposed by Eugene Chen
www.artofproblemsolving.com/community/c4092
Contributors: v Enhance, vinayak-kumar, james4l, JSGandora, BOGTRO, ahaanomegas
2014 NIMO Problems
1 You drop a 7 cm long piece of mechanical pencil lead on the oor. A bully takes
the lead and breaks it at a random point into two pieces. A piece of lead is
unusable if it is 2 cm or shorter. If the expected value of the number of usable
pieces afterwards is mn for relatively prime positive integers m and n, compute
100m + n.
Proposed by Aaron Lin
3 In land of Nyemo, the unit of currency is called a quack. The citizens use coins
that are worth 1, 5, 25, and 125 quacks. How many ways can someone pay o
125 quacks using these coins?
Proposed by Aaron Lin
4 Let S be the set of integers which are both a multiple of 70 and a factor of
630,000. A random element c of S is selected. If the probability that there
exists an integer d with gcd(c, d) = 70 and lcm(c, d) = 630,000 is m
n for some
relatively prime integers m and n, compute 100m + n.
Proposed by Eugene Chen
7 Find the sum of all integers n with 2 ≤ n ≤ 999 and the following property: if
x and y are randomly selected without replacement from the set {1, 2, . . . , n},
then x+y is even with probability p, where p is the square of a rational number.
www.artofproblemsolving.com/community/c4092
Contributors: v Enhance, vinayak-kumar, james4l, JSGandora, BOGTRO, ahaanomegas
2014 NIMO Problems
5=a+b+c+d
125 = (5 − a)4 + (5 − b)4 + (5 − c)4 + (5 − d)4
1205 = (a + b)4 + (b + c)4 + (c + d)4 + (d + a)4 + (a + c)4 + (b + d)4
25 = a4 + b4 + c4 + d4
Compute abcd.
Proposed by Evan Chen
1 Let η(m) be the product of all positive integers that divide m, including 1 and
m. If η(η(η(10))) = 10n , compute n.
Proposed by Kevin Sun
2 Two points A and B are selected independently and uniformly at random along
the perimeter of a unit square with vertices at (0, 0), (1, 0), (0, 1), and (1, 1). The
probability that the y-coordinate of A is strictly greater than the y-coordinate of
B can be expressed as m n , where m and n are relatively prime positive integers.
Compute 100m + n.
Proposed by Rajiv Movva
3 Find the number of positive integers n with exactly 1974 factors such that no
prime greater than 40 divides n, and n ends in one of the digits 1, 3, 7, 9. (Note
that 1974 = 2 · 3 · 7 · 47.)
Proposed by Yonah Borns-Weil
4 A black bishop and a white king are placed randomly on a 2000 × 2000 chess-
board (in distinct squares). Let p be the probability that the bishop attacks the
king (that is, the bishop and king lie on some common diagonal of the board).
Then p can be expressed in the form m n , where m and n are relatively prime
positive integers. Compute m.
Proposed by Ahaan Rungta
www.artofproblemsolving.com/community/c4092
Contributors: v Enhance, vinayak-kumar, james4l, JSGandora, BOGTRO, ahaanomegas
2014 NIMO Problems
5 Let a positive integer n be nice if there exists a positive integer m such that
6 Let P (x) be a polynomial with real coefficients such that P (12) = 20 and
holds for all real numbers x. Compute the remainder when P (2014) is divided
by 1000.
Proposed by Alex Gu
7 Let N denote the number of ordered pairs of sets (A, B) such that A ∪ B is a
size-999 subset of {1, 2, . . . , 1997} and (A ∩ B) ∩ {1, 2} = {1}. If m and k are
integers such that 3m 5k divides N , compute the the largest possible value of
m + k.
Proposed by Michael Tang
8 Triangle ABC lies entirely in the first quadrant of the Cartesian plane, and
its sides have slopes 63, 73, 97. Suppose the curve V with equation y = (x +
3)(x2 + 3) passes through the vertices of ABC. Find the sum of the slopes of
the three tangents to V at each of A, B, C.
Proposed by Akshaj
www.artofproblemsolving.com/community/c4092
Contributors: v Enhance, vinayak-kumar, james4l, JSGandora, BOGTRO, ahaanomegas
2014 NIMO Problems
A m
If B = n where m, n are relatively prime positive integers, determine 100m+n.
Proposed by Lewis Chen
7 Ana and Banana play a game. First, Ana picks a real number p with 0 ≤ p ≤ 1.
Then, Banana picks an integer h greater than 1 and creates a spaceship with
h hit points. Now every minute, Ana decreases the spaceship’s hit points by
2 with probability 1 − p, and by 3 with probability p. Ana wins if and only if
the number of hit points is reduced to exactly 0 at some point (in particular, if
the spaceship has a negative number of hit points at any time then Ana loses).
Given that Ana and Banana select p and h optimally, compute the integer
closest to 1000p.
Proposed by Lewis Chen
www.artofproblemsolving.com/community/c4092
Contributors: v Enhance, vinayak-kumar, james4l, JSGandora, BOGTRO, ahaanomegas
2014 NIMO Problems
1 Let ABC be a triangle with AB = 13, BC = 14, and CA = 15. Let D be the
point inside triangle ABC with the property that BD ⊥ CD and AD ⊥ BC.
√
Then the length AD can be expressed in the form m − n, where m and n are
positive integers. Find 100m + n.
Proposed by Michael Ren
2 In the figure below, how many ways are there to select two squares which do
not share an edge?
www.artofproblemsolving.com/community/c4092
Contributors: v Enhance, vinayak-kumar, james4l, JSGandora, BOGTRO, ahaanomegas
2014 NIMO Problems
7 Find the sum of the prime factors of 67208001, given that 23 is one.
Proposed by Justin Stevens
Day 16
1 For any interval A in the real number line not containing zero, define its recipro-
cal to be the set of numbers of the form x1 where x is an element in A. Compute
the number of ordered pairs of positive integers (m, n) with m < n such that
the length of the interval [m, n] is 1010 times the length of its reciprocal.
Proposed by David Altizio
www.artofproblemsolving.com/community/c4092
Contributors: v Enhance, vinayak-kumar, james4l, JSGandora, BOGTRO, ahaanomegas
2014 NIMO Problems
3 Let ABCD be a square with side length 2. Let M and N be the midpoints of
BC and CD respectively, and let X and Y be the feet of the perpendiculars
from A to M D and N B, also respectively. The square of the length of segment
XY can be written in the form pq where p and q are positive relatively prime
integers. What is 100p + q?
Proposed by David Altizio
Find a6 + b6 .
Proposed by David Altizio
www.artofproblemsolving.com/community/c4092
Contributors: v Enhance, vinayak-kumar, james4l, JSGandora, BOGTRO, ahaanomegas
2014 NIMO Problems
– April Fool’s
– April 1st
1 How many ways are there to fill the 2 × 2 grid below with 0’s and 1’s such that
no row or column has duplicate entries?
2 I’m thinking of a five-letter word that rhymes with “angry” and “hungry”.
What is it?
www.artofproblemsolving.com/community/c4092
Contributors: v Enhance, vinayak-kumar, james4l, JSGandora, BOGTRO, ahaanomegas
2014 NIMO Problems
www.artofproblemsolving.com/community/c4092
Contributors: v Enhance, vinayak-kumar, james4l, JSGandora, BOGTRO, ahaanomegas
2014 NIMO Problems
6 We know Z210 ∼
= Z2 × Z3 × Z5 × Z7 .
Moreover,
53 ≡ 1 (mod 2)
53 ≡ 2 (mod 3)
53 ≡ 3 (mod 5)
53 ≡ 4 (mod 7).
Let
53 158 53
M = 23 93 53 .
50 170 53
Based on the above, find (M mod 2)(M mod 3)(M mod 5)(M mod 7).
8 Three of the below entries, with labels a, b, c, are blatantly incorrect (in the
United States).
What is a2 + b2 + c2 ?
041. The Gentleman’s Alliance Cross
042. Glutamine (an amino acid)
051. Grant Nelson and Norris Windross
052. A compact region at the center of a galaxy
061. The value of \verb+’wat’-1+. (See \url{https://www.destroyallsoftware.com/talks/wat}.)
062. Threonine (an amino acid)
071. Nintendo Gamecube
072. Methane and other gases are compressed
081. A prank or trick
082. Three carbons
091. Australia’s second largest local government area
092. Angoon Seaplane Base
101. A compressed archive file format
102. Momordica cochinchinensis
111. Gentaro Takahashi
112. Nat Geo
www.artofproblemsolving.com/community/c4092
Contributors: v Enhance, vinayak-kumar, james4l, JSGandora, BOGTRO, ahaanomegas
2014 NIMO Problems
9 This is an ARML Super Relay! I’m sure you know how this works! You start
from #1 and #15 and meet in the middle.
We are going to require you to solve all 15 problems, though – so for the entire
task, submit the sum of all the answers, rather than just the answer to #8.
Also, uhh, we can’t actually find the slip for #1. Sorry about that. Have fun
anyways!
Problem 2.
Let T = T N Y W R. Find the number of way to distribute 6 indistinguishable
pieces of candy to T hungry (and distinguishable) schoolchildren, such that
each child gets at most one piece of candy.
Problem 3.
Let T = T N Y W R. If d is the largest proper divisor of T , compute 12 d.
Problem 4.
Let T = T N Y W R and flip 4 fair coins. Suppose the probability that at most
T heads appear is m
n , where m and n are coprime positive integers. Compute
m + n.
Problem 5.
Let T = T N Y W R. Compute the last digit of T T in base 10.
Problem 6.
Let T = T N Y W R and flip 6 fair coins. Suppose the probability that at most
T heads appear is m
n , where m and n are coprime positive integers. Compute
m + n.
Problem 7.
Let T = T N Y W R. Compute the smallest prime p for which nT 6≡ n (mod p)
for some integer n.
Problem 8.
Let M and N be the two answers received, with M ≤ N . Compute the number
√
of integer quadruples (w, x, y, z) with w + x + y + z = M wxyz and 1 ≤
w, x, y, z ≤ N .
Problem 9.
Let T = T N Y W R. Compute the smallest integer n with n ≥ 2 such that n is
coprime to T + 1, and there exists positive integers a, b, c with a2 + b2 + c2 =
n(ab + bc + ca).
www.artofproblemsolving.com/community/c4092
Contributors: v Enhance, vinayak-kumar, james4l, JSGandora, BOGTRO, ahaanomegas
2014 NIMO Problems
Problem 10.
Let T = T N Y W R and flip 10 fair coins. Suppose the probability that at most
T heads appear is m
n , where m and n are coprime positive integers. Compute
m + n.
Problem 11.
Let T = T N Y W R. Compute the last digit of T T in base 10.
Problem 12.
Let T = T N Y W R and flip 12 fair coins. Suppose the probability that at most
T heads appear is m
n , where m and n are coprime positive integers. Compute
m + n.
Problem 13.
Let T = T N Y W R. If d is the largest proper divisor of T , compute 12 d.
Problem 14.
Let T = T N Y W R. Compute the number of way to distribute 6 indistinguish-
able pieces of candy to T hungry (and distinguishable) schoolchildren, such that
each child gets at most one piece of candy.
Also, we can’t find the slip for #15, either. We think the SFBA coaches stole
it to prevent us from winning the Super Relay, but that’s not going to stop us,
is it? We have another #15 slip that produces an equivalent answer. Here you
go!
Problem 15.
Let A, B, C be the answers to #8, #9, #10. Compute gcd(A, C) · B.
– Summer Contest
– August 23rd
1 Compute 1 + 2 · 34 .
Proposed by Evan Chen
2 How many 2×2×2 cubes must be added to a 8×8×8 cube to form a 12×12×12
cube?
Proposed by Evan Chen
3 A square
√ and equilateral triangle have the same perimeter. If the triangle has
area 16 3, what is the area of the square?
Proposed by Evan Chen
www.artofproblemsolving.com/community/c4092
Contributors: v Enhance, vinayak-kumar, james4l, JSGandora, BOGTRO, ahaanomegas
2014 NIMO Problems
⌈log2 x⌉ − ⌊log3 y⌋
m
can be expressed as n where m and n are relatively prime positive integers,
compute 100m + n.
Proposed by Lewis Chen
7 Evaluate
9 9 9
1 XXX
(abc + ab + bc + ca + a + b + c) .
729
a=1 b=1 c=1
8 Aaron takes a square sheet of paper, with one corner labeled A. Point P is
chosen at random inside of the square and Aaron folds the paper so that points
A and P coincide. He cuts the sheet along the crease and discards the piece
containing A. Let p be the probability that the remaining piece is a pentagon.
Find the integer nearest to 100p.
Proposed by Aaron Lin
www.artofproblemsolving.com/community/c4092
Contributors: v Enhance, vinayak-kumar, james4l, JSGandora, BOGTRO, ahaanomegas
2014 NIMO Problems
10 Among 100 points in the plane, no three collinear, exactly 4026 pairs are con-
nected by line segments. Each point is then randomly assigned an integer from
1 to 100 inclusive, each equally likely, such that no integer appears more than
once. Find the expected value of the number of segments which join two points
whose labels differ by at least 50.
Proposed by Evan Chen
15 Let A = (0, 0), B = (−1, −1), C = (x, y), and D = (x + 1, y), where x > y
are positive integers. Suppose points A, B, C, D lie on a circle with radius
r. Denote by r1 and r2 the smallest and second smallest possible values of r.
Compute r12 + r22 .
Proposed by Lewis Chen
www.artofproblemsolving.com/community/c4092
Contributors: v Enhance, vinayak-kumar, james4l, JSGandora, BOGTRO, ahaanomegas