Sie sind auf Seite 1von 3

2015 Mock AIME II

Henrik Boecken et al.

March 12, 2015

1
2015 Mock AIME II

1. Let

X 1 1 1 1
S= n 2 = 1
+ 4 + 9 + ...
n=1
2 2 2 2

Find b1000Sc

2. In 4ABC, AB = 5, BC = 12, and AC = 13. Let the perpendicular bisector of AC meet the extension
m
of AB at D. Given that CD = , where m and n are relatively prime positive integers, find m + n.
n
3. Find 360a, given that a is a nonzero real number, z is a complex number, and

|z| = |z + a|2 + |z − a|2 = a.

4. Suppose integers x and y satisfy 19|2x+7y (that is, 19 divides 2x+7y). This guarantees that 19|ax+by
for other (a, b) as well. For example, 19|2 · (2x + 7y) = 4x + 14y. Including the original (2, 7) with
2 + 7 = 9, find the sum of all values of a + b if 0 < a, b < 19, repeats allowed.
5. 4XY Z has side lengths XY = 13, Y Z = 14, and XZ = 15. Consider a point W on Y Z. 4XY W is
rotated about X to 4XY 0 W 0 so that X, Y 0 , and Z lie on the same line and W W 0 is perpendicular to
ZW p
XZ. If = , where p and q are relatively prime positive integers, find p + q.
WY q
6. Consider the equation
3n 2 4n
c + b c 2 = n2 − k
b
5 5
where n, k are positive integers. How many distinct values can k take on if k ≤ 1200?

7. Ten lamps are placed on the vertices of a regular decagon. The circuitry on each lamp has become
somewhat tangled. In changing the state of any lamp from on to off or vice versa, one of its neighboring
lamps also switches state. This tangling is not mutual (that is, if flipping switch A makes lamp B light
up, flipping switch B will not necessarily light up lamp A). If all the lamps are initially off, in how
many ways can the circuitry be arranged such that it is possible to have every lamp on at once?
2014
X
8. How many trailing zeroes are in the decimal representation of n = 1 + k! · (k 3 + 2k 2 + 3k + 1)?
k=1

9. In 4ABC, AB = 4, AC = 5, BC = 21. Denote its circumcenter by O and let ω be the circumcircle of
triangle BOC, centered at point D. Denote E,F as the intersections of ω with AB and AC, respectively
(other than B and C). Let G be the intersection of AD and ω that is between √ A and
√ D. If the sum of
a b−c d
the areas of triangle GAE and triangle GAF can be written in the form where a, b, c, d,
e
and e are positive integers, and b and d are not divisible by the square of any prime, find a+b+c+d+e.
10. Positive integers a, b, c, and d satisfy a > b, c > d and

ab + cd = a2 + b2 − c2 − d2 = 1007.

For all possible ordered quadruplets (a, b, c, d), find the sum of the values of a.
11. Ten people are in a room, and each is assigned a number from 1 to 10. Every minute, a person
leaves, and when a person leaves, all the other people with a number higher than that person’s leave
immediately after him, in increasing order. The only exception to this rule is that if person n leaves
and person n + 2 is still there, then person n + 2 stays. For example, if the person numbered 7 leaves
first, then the people numbered 8 and 10 leave in that order, but person 9 stays. If N is the number
of different ways for everyone to leave the room, find the remainder when N is divided by 1000.

2
2015 Mock AIME II

12. Consider a perfectly reflective semicircle with diameter AB. A beam of light exits from A in a straight
line at 58◦ relative to AB, and eventually reflects back to point A. How many times does it reflect of
the walls of the semicircle(not including when it hits A at the end)?

A 58◦ B

13. Real numbers a, b, and c, satisfy the system of equations:

(a + b)(b + c) = −1
(a − b) + (a2 − b2 )2 = 85
2

(b − c)2 + (b2 − c2 )2 = 75.

Find (a − c)2 + (a2 − c2 )2 .

14. A phibonacci recurrence is a sequence of positive integers (an )n≥1 defined by the relation

an = ϕ(an−1 ) + ϕ(an−2 ),

where ϕ(x) indicates the number of integers less than x that are relatively prime to x (ϕ(1) is vacuously
set as 1). Additionally, there exists an n < 20 such that ϕ(an ) ≥ ϕ(an−1 ) and an |an+1 . Find the largest
possible three digit value of a20 .
15. Let A be the set of points (x, y) in the plane such that x and y are positive integers and x, y ≤ 1000,
and let B = {(1, 1), (1, 1000), (1000, 1), (1000, 1000)}. Consider S, the set of points that are in A but
not B, and define the taxicab distance between two points (x1 , y1 ) and (x2 , y2 ) as |x2 − x1 | + |y2 − y1 |.
Ellen randomly chooses 1000 points in S, and colors them green. For a given coloring, let SC be the
sum of the taxicab distances between all possible pairs of green points. Let M be the maximum value
of SC over all colorings, and let N be the number of colorings for which SC = M . Find the remainder
when M + N is divided by 1000.

Das könnte Ihnen auch gefallen