Documente Academic
Documente Profesional
Documente Cultură
1. Given n ∈ N, let σ(n) denote the sum of the divisors of n and ϕ(n)
denote the number of positive integers m ≤ n for which gcd(m, n) = 1.
Show that for all n ∈ N,
1 1 2
+ ≥
ϕ(n) σ(n) n
and determine when equality holds.
(1 + r2 )(1 + s2 ) ≤ (r + s)2 ,
Solution. It suffices to show that for n ≥ 18, the total number of colorings
(without restriction) exceeds those that make some n-term arithmetic
sequence monochromatic.
There are 22017 colorings of a set with 2017 elements. The number of col-
orings that make a fixed n-term sequence monochromatic is 2 · 22017−n =
22018−n , since the terms not in the sequence can be colored without re-
striction, while those in the sequence can be colored either all red or all
white.
We now find the number of n-term arithmetic sequences that can be
obtained from A. Such a sequence a, a + r, . . . , a + (n − 1)r is completely
determined by the first term a and common ratio r, subject to the con-
2017−a
straint a + (n − 1)r ≤ 2017. For each value of a, there are n−1
sequences that start with a. This means that the number of arithmetic
sequences does not exceed
2017
X 2017 − a 2016 · 2017
= .
a=1
n−1 2(n − 1)
Therefore, the total number of colorings that make at least one arith-
metic sequence monochromatic does not exceed
2016 · 2017
22018−n · .
2(n − 1)
But for n ≥ 18,
2016 · 2017 2048 · 2048
22018−n · ≤ 22018−n ·
2(n − 1) 2(n − 1)
2039−n
2 22021
= ≤ < 22017 .
n−1 17
We use Ptolemy’s Theorem next on C1 RC2 C and P RQS. Since 4C1 CC2 ∼
4P SQ (both are isosceles with base angle α),
SP CC1
CA = (RP + RQ) − (RC1 + RC2 )
PQ C1 C2
SQ · RP + SP · RQ CC2 · RC1 + CC1 · RC2
= −
PQ C1 C2
RS · P Q RC · C1 C2
= − = RS − RC = CS.
PQ C1 C2