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.
 
Just A “Natural” Thing. Topic: Algebra. Level: AIME/Olympiad. April 28th, 2007

Problem: Factor  7^{6(2k-1)}-7^{5(2k-1)}+7^{4(2k-1)}-7^{3(2k-1)}+7^{2(2k-1)}-7^{2k-1}+1 .

Solution: Consider the polynomial  x^7+1 . We have

 x^7+1 = (x+1)(x^6-x^5+x^4-x^3+x^2-1) ,

so we want to factor the second term when  x = 7^{2k-1} . Call it  P(x) so that  P(x) = \frac{x^7+1}{x+1} . Consider the relation

 (x+1)^7-(x^7+1) = 7x^6+21x^5+35x^4+35x^3+21x^2+7x .

Since  -1 is a root of the LHS, we factor it out of the RHS as well to get

 (x+1)^7-(x^7+1) = 7x(x+1)(x^4+2x^3+3x^2+2x+1) = 7x(x+1)(x^2+x+1)^2 .

Dividing through by  x+1 and rearranging, we obtain the nice expression

 P(x) = (x+1)^6-7x(x^2+x+1)^2 .

Letting  x = 7^{2k-1} , this becomes

 P(7^{2k-1}) = (7^{3(2k-1)}+3 \cdot 7^{2(2k-1)}+3 \cdot 7^{2k-1}+1)^2-7^{2k}(7^{2(2k-1)}+7^{2k-1}+1)^2

which is conveniently enough a difference of two squares. And we’ll leave it as this because the factors are not particularly nice or anything. QED.

——————–

Comment: This “natural” factorization was basically the one crucial step to solving the USAMO #5 this year and most people did not see it, unsurprisingly. Taking the difference  (x+1)^7-(x^7+1) was the trickiest/cleverest part, and there were definitely a limited number of approaches to this factorization. Oh well, at least it seems sort of cool after you know about it.

——————–

Practice Problem: (2007 USAMO – #5) Prove that for every nonnegative integer n, the number 7^{7^{n}}+1 is the product of at least 2n+3 (not necessarily distinct) primes.

2007 USAMO. April 23rd, 2007

Good luck to everyone on the USAMO tomorrow and Wednesday!

Something To Think About. Topic: Probability. Level: AMC/AIME. April 18th, 2007

Problem: A coin is repeatedly flipped. What is the expected number of flips to get two heads in a row?  n heads in a row?

——————–

I will be out of town for the next four days, so have fun with the problem!

Sense Of Poise And Rationality. Topic: Algebra. Level: AIME/Olympiad. April 15th, 2007

Problem: (1993 Canada National Olympiad – #2) Show that  x is rational if and only if three distinct terms that form a geometric progression can be chosen from the sequence  x, x+1, x+2, x+3, \ldots .

Solution: We will prove the “if” statement first, i.e.  x is rational implies we can find the geometric progression. Let  x = \frac{p}{q} . The terms of the sequence are then

 \frac{p}{q} ,  \frac{p+q}{q} ,  \frac{p+2q}{q} ,  \frac{p+3q}{q}, \ldots .

We simply choose the terms

 \frac{p}{q} ,  \frac{p+pq}{q} ,  \frac{p+(2p+pq)q}{q} which are the same as  \frac{p}{q} ,  \frac{p(1+q)}{q} ,  \frac{p(1+q)^2}{q} ,

clearly a geometric progression.

Now for the other direction, assume  x+a, x+b, x+c are a geometric progression with  a < b < c positive integers. Then

 \frac{x+a}{x+b} = \frac{x+b}{x+c} \Rightarrow x^2+(a+c)x+ac = x^2+2bx+b^2 \Rightarrow (a+c)x+ac = 2bx+b^2 .

Solving for  x yields  x = \frac{b^2-ac}{a+c-2b} which is clearly rational, as desired. QED.

——————–

Comment: An interesting “definition” of a rational number, pretty neat in fact. Though it may not seem so at first, the “if” direction was actually considerably harder than the “only if” direction because the approach was not as straightforward. The “only if” proof required simple algebra, while the “if” proof needed a little creative picking and choosing. Another approach for the “if” direction is to set  x = \frac{p}{q} and try to find corresponding  a, b, c but that makes it a little more difficult than necessary.

——————–

Practice Problem: (1993 Canada National Olympiad – #3) In triangle  ABC , medians to the sides  \overline{AB} and  \overline{AC} are perpendicular. Show that  \cot{B}+\cot{C} \ge \frac{2}{3} .

Fishy Triangular Number. Topic: Inequalities. Level: AIME. April 12th, 2007

Problem: (2001 Poland Finals – #1) Prove the following inequality:

 x_1+2x_2+3x_3+\cdots+nx_n \le \frac{n(n-1)}{2}+x_1+x_2^2+x_3^3+\cdots+x_n^n

where  x_i are positive reals.

Solution: Like the title says, that triangular number looks really fishy… let’s write it as  1+2+\cdots+(n-1) and pair up the terms on the RHS.

 \frac{n(n-1)}{2}+x_1+x_2^2+x_3^3+\cdots+x_n^n = x_1+(x_2^2+1)+(x_3^3+2)+\cdots+(x_n^n+n-1) .

We claim that  x_i^i+i-1 \ge ix_i for  i = 1, 2, \ldots, n . We’ll use our good friend AM-GM to show this; in fact, it is quite simple.

 \frac{x_i+1+1+\cdots+1 \text{(i-1 times)}}{i} \ge \sqrt[i]{x_i^i} = x_i so  x_i^i+i-1 \ge ix_i

as desired. Sum them up to get our inequality. QED.

——————–

Comment: Just a clever little application of AM-GM; apparantly not a strong inequality at all, and the only equality case is  x_i = 1 for all  i . Nevertheless, slightly on the tricky side which makes it sufficiently satisfying to solve.

——————–

Practice Problem: (2006 Poland Finals – #1) Solve in reals:

 a^2 = b^3+c^3
 b^2 = c^3+d^3
 c^2 = d^3+e^3
 d^2 = e^3+a^3
 e^2 = a^3+b^3 .

Google

 

 
 
free web counters
Etronics