Mathematical Food for Thought

 
 
google
yahoo
bing
 
  • About

    Serves a Daily Special and an All-You-Can-Eat Course in Problem Solving. Courtesy of me, Jeffrey Wang.
 
RSI 2006. June 23rd, 2006

I’ll be leaving tomorrow morning for Boston, Massachusetts! Probably no blog posts for 6 weeks! Take a break from math! Or not!

All Paired Up. Topic: Algebra/NT. Level: AIME. June 20th, 2006

Problem: Find a closed form for the sum

 \displaystyle \sum_{i=1}^n \sum_{j=i+1}^n i \cdot j = 1 \cdot 2+1 \cdot 3+\cdots+1 \cdot n+2 \cdot 3+2 \cdot 4+\cdots+2 \cdot n+\cdots+(n-1) \cdot n .

Solution: Consider the expansion of

 \displaystyle (1+2+\cdots+n)^2 = \sum_{i=1}^n \sum_{j=1}^n i \cdot j .

It’s not hard to see that if we let the desired sum be  S , we have

 (1+2+\cdots+n)^2 = 2S+(1^2+2^2+\cdots+n^2)

since each pair is counted twice and the squared terms are there. But we can simplify the sums by well-known formulas to get

 \frac{n^2(n+1)^2}{4} = 2S+\frac{n(n+1)(2n+1)}{6} ,

which becomes

 S = \frac{n(n-1)(n+1)(3n+2)}{24}

after massive simplification. QED.

——————–

Comment: Symmetry was definitely the best way to approach this problem (or as far as I know anyway). You could’ve found a lot of ugly summations to get to the desired expression as well.

——————–

Practice Problem: Can you generalize? In any way, shape, or form.

Last Day Of School! June 20th, 2006
Egyptian. Topic: Number Theory. Level: AIME. June 17th, 2006

Problem: (1991 India National Olympiad – #10) For any positive integer n, let s(n) denote the number of ordered pairs (x,y) of positive integers for which \frac{1}{x} + \frac{1}{y} = \frac{1}{n}. Determine the set of positive integers for which s(n) = 5.

Solution: Rewrite the equation as

 n(x+y) = xy

 (x-n)(y-n) = n^2 .

So for each pair  (a,b) with  ab = n^2 , there exist a pair  (x,y) = (a+n, b+n) satisfying

 \frac{1}{x}+\frac{1}{y} = \frac{1}{n} .

Hence we want to find an  n^2 with  5 distinct factors. We see that  n^2 = p^4 for  p prime is the only case (since  5 itself is prime, meaning  n = p^rq^s is not possible), so we thus have  s(n) = 5 for  n = p^2 , where  p is any prime. QED.

——————–

Comment: A standard problem involving Simon’s Favorite Factoring Trick and counting the number of divisors. SFFT is always something to look for when you have  xy, x, y terms (sorta like completing the square except not).

——————–

Practice Problem: (1991 India National Olympiad – #1) Find the number of positive integers n for which

(i) n \leq 1991;

(ii) 6 is a factor of (n^2 + 3n +2).

Mission Accomplished! Topic: Algebra. Level: AIME. June 16th, 2006

Problem: (1991 India National Olympiad – #7) Solve the following system for real  x, y, z

 x+y-z = 4

 x^2-y^2+z^2 = -4

 xyz = 6 .

Solution: Well, we simply go about solving this system the regular way – look for something to eliminate. We try using the first and second equations and find

 (x-z)^2 = (4-y)^2 \Rightarrow x^2-2xz+z^2 = 16-8y+y^2 ,

which we subtract from the second equation to get

 2xz = 8y-20 .

Using the third equation, we have  2xz = \frac{12}{y} so we substitute, multiply through by  y (it can’t be zero), and divide by  4 to get

 0 = 2y^2-5y-3 = (2y+1)(y-3) .

So  y = -\frac{1}{2}, 3 . But from the second equation, we see that  y = -\frac{1}{2} gives  x^2+z^2 < 0 but they are real so this is impossible. Hence  y = 3 . It remains to solve for  x and  z using

 x-z = 1

 xz = 2 .

Substitute  z = \frac{2}{x} into the first one and again multiply through by  x to find

 x^2-x-2 = (x-2)(x+1) = 0 .

We then have  x = 2, -1 with corresponding  z = 1, -2 . Checking, we see that both solutions work, so our final solution set is

 (2, 3, 1) ;  (-1, 3, -2) .

QED.

——————–

Comment: Not bad for an olympiad question – just requires basic algebraic manipulation and solving quadratics. Looking for the right things to square and substitute made this problem considerably easier.

——————–

Practice Problem: (1994 India National Olympiad – #2) If  x^5-x^3+x = a , prove that  x^6 \ge 2a-1 .

Posted in AIME, Algebra || 1 Comment »
Google

 

 
 
free web counters
Etronics