Professional Documents
Culture Documents
By:
Zhero
Brut3Forc3
andersonw
dysfunctionalequations
April 1, 2010
Negative AIME 1
-2. Find the number of ways a teacher can distribute 1 piece of candy among 243 hungry schoolchildren sitting in a row
such that no child receives more than one piece of candy, and that no two children that sit next to each other may both
receive candy.
-3. We have a triangle abc with sides ab, bc, ca with lengths α, β, and γ, respectively, so that α + β + γ = π. The measures
of angles ∠bac, ∠acb, and ∠cba are A, B, and C, respectively, and the perimeter of the triangle with sides AB, BC,
2
and CA is π3 . Let ω, with center I, be the circumcircle of 4abc, and let Γ, with center O, be the incircle of 4abc. Let
[ be the circle tangent to Γ, ω, and bc, let ] be the circle tangent to Γ, ω, and ca, and let \ be the circle tangent to Γ,
ω, and ac. Let [, ], and \ be tangent to ω at
, ×, and , respectively. Find the largest integer less than or equal to
the largest possible value of the area of 4
×.
-4. Let
xyz + 49(x + y + z) + 1337
f (x, y, z) = .
xy + yz + zx + 240
Let g(1) = f (1, 1, 1), and let g(n) = f (g(n − 1), n, n) for n ≥ 2. Find g(2010).
-5. Let f (x) = x2 . Find the last three digits of f (f (f ((((f (((((((1 + 1f ((1 + f (1)1f (11f ((1 + f (1)) + 1) + 11f (f (f (1) +
1)) + 1) + 11) + f (11)) + 1)1f (1 + f (1))))))) + 1) + 1)) + 1) + f (1 + f (1 + f (1)))f (1 + f (1))) + 1) + 1) + 1.
√ √
-6. Let ABC be a triangle with AC = 5 − 3, BC = 2. Let A0 , B 0 be points outside of triangle ABC such √ that
∠A0 BC = 15◦ , ∠A0 CB = 75◦ , ∠ACB 0 = 60◦ , ∠B 0 AC = 30◦ . Given that A0 B 0 can be expressed in the form a b + c,
where a, b, c are positive integers and b is not divisible by the square of any prime, find a + b + c.
-7. In 4ABC, let AB = 9, BC = 13, and CA = 14. Let G, H, I, and O be the centroid, orthocenter, incenter, and
circumcenter of 4ABC, respectively. Let G1 be the centroid of quadrilateral HIOG, and let G01 be the isogonal
conjugate of G1 with respect to 4ABC. Let line `1 be the polar of G01 with respect to the circumcircle of 4ABC, let
`2 be the polar of I with respect to 4ABC, and let X be the point of intersection of `1 and `2 . Let A0 , B 0 , and C 0 be
the inverse images of points A, B, and √C, with respect to an inversion about X with radius 12. Given that the area of
4ABC can be expressed in the form a c b , where b is a positive integer not divisible by the square of any prime and a
and c are relatively prime positive integers, find a + b + c.
2010 2010
133724 −824
-8. Let n be the largest number for which 3n is a positive integer. Find the last three digits of the value of
this integer.
-9. Given that the root to x − 3 = 0 is m n , where m and n are complex numbers such that m = a + bi, n = c + di, where i is
defined as the square root of −4, and a, b, c, d are complex numbers such that a = e + f i, b = g + hi, c = i + ji, d = k + li,
where e, f, g, h, j, k, l are positive integers such that g, j, k and l are not divisible by any prime and e is no greater than
h, and that (|a2 + b2 + c2 + d2 + e2 + f 2 + g 2 + h2 + i2 + j 2 + k 2 + l2 + m2 + n2 |)2 = y, where y is a positive integer,
find the leftmost three digits of y.
q √ q √
3 b+c d
3 2 a+ e + 3 f +gj h
-10. Let x be a positive real number satisfying x − 4x + 3x − 5 = 0. If x = k , where a, b, c, d, e, f, g, h, j, k
are integers with d, h > 0, gcd(a, k) = gcd(b, c, e) = gcd(f, g, h) = 1, gcd(b, c) and gcd(f, g) not divisible by the cube of
any prime. d, h not divisible by the square of any prime, and g > c, find the remainder when abce + d + f + g + h + j + k
is divided by 1000.
-11. Given that the value of
∞
X n4 + 40n3 + 225n2 + 248n + 4
n=1
n6 + 19n5 + 101n4 + 103n3 + 19n2 − 5n + 7
can be expressed in the form pq , where p and q are relatively prime positive integers, find the last three digits of p + q.
-12. Find the sum of all positive integers k such that there exist positive integers a, b, c, d, e, f , g, h, i, j, l, m, n, o, p, q,
r, s, t, u, v, w, x, y, and z such that
Negative AIME 2
wz + h + j − q = 0
(7gk + 7k − 1)(h + j) + h − z = 0
112k(7k − 1)3 (n + 1)2 + 1 − f 2 = 0
2n + p + q + z − e = 0
e (e + 2)(a + 1)2 + 1 − o2 = 0
3
(a2 − 1)y 2 + 1 − x2 = 0
16r2 y 4 (a2 − 1) + 1 − u2 = 0
n+l+v−y =0
(a − 1)l2 + 1 − m2 = 0
2
ai + 7k − 1 − l − i = 0
2 2 2
− 1 (n + 4dy)2 + 1 − (x + cu)2 = 0
a + u (u − a)
p + l(a − n − 1) + b(2an + 2a − n2 − 2n − 2) − m = 0
q + y(a − p − 1) + s(2ap + 2a − p2 − 2p − 2) − x = 0
z + pl(a − p) + t(2ap − p2 − 1) − pm = 0.
-13. Solve the following 14 problems. The answer to each will be an integer. Use the following key to convert your numbers
into a message which will give you further instructions. If any of your answers have more than one digit, simply use
the last digit for converting purposes.
0 1 2 3 4 5 6 7 8 9
D I V A S B O N E R
Problem the first:
Alex and Anderson independently each pick one of the seven deadly sins to commit. In how many distinct ways can
they do this?
Problem the second:
Let {an } be a sequence such that a1 = 1, an+1 = an + 1. Find a18 .
Problem the third:
We call a scalene triangle with integer side lengths almost isosceles if its two shortest side lengths differ by 1. The
smallest (in terms of area) almost isosceles right triangle has side lengths 3,4,5. Find the smallest side length of the
next smallest almost isosceles right triangle.
Problem the fourth:
The Ulam sequence is defined as follows: U1 = 1, U2 = 2, and for n > 2, Un is defined to be the smallest integer that
can be expressed as the sum of two distinct earlier terms in exactly one way. Find the eleventh term in this sequence.
Problem the fifth:
There are four distinguishable hamsters. For lunch, each has the choice of 7 distinguishable meals. How many ways
can they eat lunch together?
Problem the sixth:
Timmy is excited because he is only 1 year away from becoming 18, the legal age of adulthood. How old is Timmy?
Problem the seventh:
In 1989, L. Ming showed that there are only 4 distinct numbers which are both Fibonacci numbers and triangular
numbers. Find the largest of these 4 numbers.
Problem the eighth:
What is the smallest positive integer n such that 1/2 + 1/3 + 1/7 + 1/n < 1?
Problem the ninth:
5 letters are written to different addresses, and 5 matching envelopes are prepared. In how many ways can the letters
be placed in the envelopes so that no letter is in a correct envelope?
Problem the tenth:
Find the largest integer x such that 16x divides (10!)2004 .
Negative AIME 3
a(x) = 1x + 2x + 3x + 4x + 5x − 15x + 89
b(x) = 80x2 + 160x + 80
c(x) = 69x − 69
d(x) = 1 + 3x + 3x2 + 7
e(x) = 2x2 − 278x + 9669
f (x) = x − 2
g(x) = 2 − x
h(x) = 37x + 13
i(x) = 1 + 33x + 7x2 + 1337x3
j(x) = 1337x1337
k(x) = x
l(x) = 1337x
m(x) = 1 + 2x2 + 3x3 + 4x4 + 5x5
n(x) = x + 42
o(x) = x − 42
jxk
p(x) = x − 1
1k
jx
q(x) = x − 2
2
x
r(x) =
5
s(x) = 42x
t(x) = x + 537
u(x) = 13x + 37
v(x) = 964 + 931x
w(x) = x2
x(x̄) = ln ex̄
y(x) = −|x|
z(x) = |x|
(x) = 70 − x
Let
Compute t(h(e( (q(u(i(c(k( (b(r(o(w(n( (f (o(x( (j(u(m(p(e(d( (o(v(e(r( (t(h(e( (l(a(z(y( (d(o(g(a32 )))))))))))))))))))))
))))))))))))))))))))))).
Happy April Fools’ Day! As you may have noticed, the problems aren’t quite... standard. But each one is completely
possible. Some of these problems are really wacky, and we hope you’ll take some time to twist your mind, actually do
the test, and participate in a strange competition. We’ll recognize the high scorers as well as any notable responses we
recieve. Have fun!