1. A is the point (1, 0), L is the line y = kx (where k > 0). For which points P (t, 0) can we find a point Q on L such that AQ and QP are perpendicular?
2. Is there a positive integer n such that the fractional part of (3 + √5)n > 0.99?
3. Show that an + bn + cn ≥ abn-1 + bcn-1 + can-1 for real a, b, c ≥ 0 and n a positive integer.
4. P1, P2, P3, Q1, Q2, Q3 are distinct points in the plane. The distances P1Q1, P2Q2, P3Q3 are equal. P1P2 and Q2Q1 are parallel (not antiparallel), similarly P1P3 and Q3Q1, and P2P3 and Q3Q2. Show that P1Q1, P2Q2 and P3Q3 intersect in a point.
5. Show that n divides 2n + 1 for infinitely many positive integers n.
6. f(x) is defined for 0 ≤ x ≤ 1 and has a continuous derivative satisfying |f '(x)| ≤ C |f(x)| for some positive constant C. Show that if f(0) = 0, then f(x) = 0 for the entire interval.
Solutions
Problem 2
Is there a positive integer n such that the fractional part of (3 + √5)n > 0.99?
Answer
yes
Solution
Expanding by the binomial theorem we see that (3 + √5)n + (3 - √5)n is an integer, but 0 < (3 - √5) < 1, so (3 - √5)n < 0.01 for sufficiently large n.
Thanks to Suat Namli
Problem 3
Show that an + bn + cn ≥ abn-1 + bcn-1 + can-1 for real a, b, c ≥ 0 and n a positive integer.
Solution
By AM/GM (an + bn + bn + ... + bn)/n ≥ abn-1. Similarly (bn + cn + cn + ... + cn)/n ≥ bcn-1 and (cn + an + an + ... + an)/n ≥ can-1. Adding gives the result.
Thanks to Suat Namli
Problem 5
Show that n divides 2n + 1 for infinitely many positive integers n.
Solution
For n = 3 we have 2n + 1 = 9 which is a multiple of 3. Now we have 23k + 1 = (2k + 1)(22k - 2k + 1), so if 2k + 1 = 0 mod 3, then 22k = 1 mod 3, so 22k - 2k + 1 = 1 + 1 + 1 = 0 mod 3. So if 3h divides 2k + 1, then 3h+1 divides 23k + 1. Hence (by a trivial induction) for n = 3k, n divides 2n + 1.
Thanks to Suat Namli
Labels:
Swedish Mathematical Society