This page contains solutions of former potds. You are explicitly encouraged to post your own solutions to old or new potds as comments to this site. An administrator will incorporate them into this page later on (assuming they are correct and stated in a reasonably accessible manner). Please note that in the case of essentially identical solutions only one will be incorporated into the page (usually the first one).

2008-11-19 by kmh

Compute

**Solution by bor0**

Use integration by parts.

(Indeterminate form 0/0, apply l’Hospital)

(Indeterminate form 0/0, apply l’Hospital)

2008-10-30 by kmh

Show that if is divisible by , then is divisble by as well.

**Solution by Magnus_RM and rafno**

:

**2008-7-17 by kmh **

Show that for all power of 3 the 2nd last digit is even. For instance we have and 2 is even.

(original source: de.rec.denksport)

**Solution by rafno**

Show that for all power of 3 the 2nd last digit is even. For instance we have 3^5=729 and 2 is even.

We prove by induction.

For k=1 the second last digit of 3^1=3=03 is 0. True.

Supose its true for k-1.

3^k=3*3^(k-1).

Then the second last digt of 3^(k-1) is even. So 3^(k-1)= ….+2n*10+a written in base 10.

So 3^k= … +(2*(3n)+b)*10+c

where 3*a=b*10+c. So we must verify that b is even.

but the last digit of any power of 3 is 1,3,9 or 7. and 3 times any of these gives an even last second digit. So b=2*r and then 3^k=…+2*(3n+k)*10+c.

Therefore all power of 3 has even second last digit.

2008-6-10 by CaosTheory

Compute .

**Solution by cst-link**

2008-5-30 by kmh

Determine the size of the dark area.

**Solution by pisagor**

**
2008-5-19 by kmh
** Show that for all .

(Original source: The Red Book of Mathematical Problems)

**Solution by cst-link**

First note that and

Now we have

**
2008-4-29 by kmh
**Find all values of for and denoting an angle in degrees.

**Solution by cst-link**

Because´sin(u) = sin(u mod 360)

for u expressed in degrees, this problem is suitable for brute force.

For:

f(x) = x^8 – x^6 – x^4 + x^2

and x natural, one may easily see that

f(x) mod 360 = f(x mod 360) mod 360

and, subsequently

sin(f(x)) = sin(f(x) mod 360) = sin(f(x mod 360) mod 360)

Thus it suffices to find by means of computer/code the set

{f(x mod 360) mod 360 | x in N} =

= {f(x) mod 360 | x in {0, 1,…, 359}} =

= {0, 180}

which gives:

{sin(f(x)) | x in N} = {0}

2008-4-29 by kmh

Compute

( original source: Internet Math Olympiad Israel 2008 )

**Solution by cst-link**

For f(x) = 1/x and each x in [k, k+1] and k>1 one has:

Subsequently:

Since the left sum is telescoping we have:

So with and an analog argument for f(k-1) you’ll get:

Construct the foci of arbitrary ellipse given as a graph using ruler and compass only.

**Solution by kmh**

Construct 2 non collinear pairs of parallel chords. For each pair of parallel chords construct the midpoints of the chords and a line through the 2 midpoints. Due to the conjugated diameter property of the ellipse those 2 lines will intersect in the center C . Now draw a circle around C such that it has 4 intersection points with the ellipse. Construct the bisecting perpendiculars through those intersection points, they are the major and minor axis of the ellipse. The major intersects the ellipse in Q and the minor in R. Draw a circle with radius |CQ| around R this circle with will intersect the major in the foci.

Three friends are taking me out for my birthday. The product of their ages is 2450. The sum of their ages is my cousin’s age. I could tell you my cousin’s age, but to find the ages of my friends, you’d also need to know that each of the three is younger than I am. How old am I?

**Solution by …**

Let a1, a2 and a3 be the 3 ages of the 3 friends. “The product of their ages is 2450” => a1 * a2 * a3 = 2450 = 2 * 5^2 * 7^2. It is fairly simple (by hand, or via a computer) to find all distinct triplets that satisfy the product rule. (Note: throughout thist solution, I call (t1, t2, t3) and (q1, q2, q3) –distinct triplets– if and only if {t1, t2, t3} != {q1, q2, q3}. This means that, for example, (t1, t2, t3) and (t2, t3, t1) are -Not- distinct triplets). “I could tell you my cousin’s age, but to find the ages of my friends, you’d also..” => knowing the sum a1+a2+a3 does Not suffice in finding a1, a2, a3. Picture the triplets “determined” above. Each triplet generates a sum (of its elements). Assume one of these triplets, Triplet_X, generates Sum_X and that no other triplet generates Sum_X. If the sum of the ages (cousin’s age) would be equal to Sum_X, we’d know for sure that the friends age triplet is Triplet_X, since it is the only one that satisfies the “friends_ages_sum = cousins_age” condition. Again: this can not happen, the sum (cousin’s age) must not be sufficient and therefore the sum, whichever it is, must satisfy the following condition: (at least) two distinct triplets must exist so that each triplet has the sum of its elements equal to the cousin’s age. Go back to the distinct triplets “determined” at step1. For each, compute the sum of their elements. If a sum appears only once, this means that the triplet that generated it is invalid. Find any sum which appears at least twice. Luckly, there is only one sum with this proprety, and mainly: 64, generated by distinct triplets (7, 7, 50) and (5, 10, 49). Therefore, it is certain, that the friends age triplet (a1, a2, a3) is equal to one of the two determined previously. The final condition holds the key. “you’d also need to know that each of the three is younger than I am.”. This means that knowing that all 3 of the friends are younger than Karlo MUST invalidate one of the two triplets. If Karlo is older than 50 (> 50), both triplets are “valid”. If Karlo is younger than 49 (<= 49) both triplets are “invalid”. One possibility remains: Karlo is 50, which makes the first triplet: (7, 7, 50) invalid and the second triplet (5, 10, 49) valid. To conclude: the friends are aged 5, 10, 49; the cousin is 64 and Karlo is 50. Happy birthday to Karlo!

Let and . Show that .

**Solution by kmh**

First note that due to we have for . This yields us (*): If we consider the last expression as a function of , then we have an upside down parabola with a maximum of . This can be determined completing the square or finding the the root of the derivative. Completing the square:

Let be a noetherian ring. Prove that if is a surjective ring homomorphism then is bijective.

**Solution by lhrrwcc**

A being noetherian means that every increasing chain of ideals eventually becomes stationary, ie . Now in order to prove that any surjection is an inyection we can prove that the kernel is trivial. So assume that is a surjective ring homomorphism and that Ker f is not trivial. Let Ker f. There is, because f is surjective, an element t such that f(t)=m, so so t in Ker f^2. Now, there is an element s in A such that f(s) = t, and again so s in . If we keep doing will we will get an increasing chain of ideals contradicting the hypothesis that A is noetherian, therefore the kernel is trivial, and f is an injection

## Leave a Reply