Maths Olympiad Prep

Library / /403 of 520

Number theory Difficulty 6.6 National olympiad Prove it

38. Prove: The number n=1+σ(n)n!\sum_{n=1}^{+\infty} \frac{\sigma(n)}{n!} is irrational, where σ(n)\sigma(n) denotes the sum of all positive divisors of nn.

Solution

38. If h=n=1+σ(n)n!=rsh=\sum_{n=1}^{+\infty} \frac{\sigma(n)}{n!}=\frac{r}{s} is a rational number, where (r,s)=1(r, s)=1, and let p>max{s,6}p>\max \{s, 6\} be a prime number. From h=n=1p1σ(n)n!+n=p+σ(n)n!h=\sum_{n=1}^{p-1} \frac{\sigma(n)}{n!}+\sum_{n=p}^{+\infty} \frac{\sigma(n)}{n!}, we get
(p1)!h=(p1)!n=1p1σ(n)n!+k=0+σ(p+k)p(p+1)(p+k)(p-1)!h=(p-1)!\sum_{n=1}^{p-1} \frac{\sigma(n)}{n!}+\sum_{k=0}^{+\infty} \frac{\sigma(p+k)}{p(p+1) \cdot \cdots \cdot(p+k)}.
Let m=k=0+σ(p+k)p(p+1)(p+k)m=\sum_{k=0}^{+\infty} \frac{\sigma(p+k)}{p(p+1) \cdot \cdots \cdot(p+k)}, since
σ(p)=p+1,σ(p+k)6\sigma(p)=p+1, \sigma(p+k)6, thus 1<m<1+1p+p1p=21<m<1+\frac{1}{p}+\frac{p-1}{p}=2. Since (p1)!h(p-1)!h and (p1)!n=1p1σ(n)n!(p-1)! - \sum_{n=1}^{p-1} \frac{\sigma(n)}{n!} are both integers, and mm is not an integer, this leads to a contradiction. This proves that n=1+σ(n)n!\sum_{n=1}^{+\infty} \frac{\sigma(n)}{n!} is an irrational number.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.