A bun dance

Prove that, for every natural number nn, there exists some natural number m>nm > n such that pm#pn#\dfrac{p_m \#}{p_n \#} is abundant.

Clarification:

  • pip_i is the ithi^\text{th} prime number.

  • pi#=2×3××pip_i \# = 2 \times 3 \times \cdots \times p_i is the ithi^\text{th} primorial.

  • An abundant number is a number for which the sum of its proper divisors is greater than the number itself. For example, the proper divisors of 12 are 1, 2, 3, 4, 6, and the sum of these proper divisor exceed the number 12, thus 12 is an abundant number.

#NumberTheory

Note by Jake Lai
5 years, 2 months ago

No vote yet
1 vote

  Easy Math Editor

This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.

When posting on Brilliant:

  • Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .
  • Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.
  • Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.
  • Stay on topic — we're all here to learn more about math and science, not to hear about your favorite get-rich-quick scheme or current world events.

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold

- bulleted
- list

  • bulleted
  • list

1. numbered
2. list

  1. numbered
  2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1

paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
    # 4 spaces, and now they show
    # up as a code block.

    print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.
2 \times 3 2×3 2 \times 3
2^{34} 234 2^{34}
a_{i-1} ai1 a_{i-1}
\frac{2}{3} 23 \frac{2}{3}
\sqrt{2} 2 \sqrt{2}
\sum_{i=1}^3 i=13 \sum_{i=1}^3
\sin \theta sinθ \sin \theta
\boxed{123} 123 \boxed{123}

Comments

The sum of divisors σ(n)\sigma(n) of a natural number n=p1e1p2e2pkekn = p_1^{e_1} p_2^{e_2} \ldots p_k^{e_k} is given by

i=1k(1+pi+pi2++piei).\displaystyle \prod_{i=1}^k (1 + p_i + p_i^2 + \ldots + p_i^{e_i}) .

Thus, σ(n)n\frac{\sigma(n)}{n} is given by

σ(n)n=i=1k(1+pi+pi2++piei)i=1kpiei=i=1k1+pi+pi2++pieipiei=i=1k(1+1pi+1pi2++1piei)\displaystyle\begin{aligned} \frac{\sigma(n)}{n} &= \frac{\prod_{i=1}^k (1 + p_i + p_i^2 + \ldots + p_i^{e_i})}{\prod_{i=1}^k p_i^{e_i}} \\ &= \prod_{i=1}^k \frac{1 + p_i + p_i^2 + \ldots + p_i^{e_i}}{p_i^{e_i}} \\ &= \prod_{i=1}^k \left( 1 + \frac{1}{p_i} + \frac{1}{p_i^2} + \ldots + \frac{1}{p_i^{e_i}} \right) \end{aligned}

An abundant number has σ(n)n>2\frac{\sigma(n)}{n} > 2.

Note that pm#pn#=pn+1pn+2pm\frac{p_m \#}{p_n \#} = p_{n+1} p_{n+2} \ldots p_m, thus

σ(pm#pn#)=i=n+1m(1+1pi)\displaystyle \sigma \left( \frac{p_m \#}{p_n \#} \right) = \prod_{i=n+1}^m \left( 1 + \frac{1}{p_i} \right)

We know that i=1(1+1pi)\displaystyle\prod_{i=1}^\infty \left( 1 + \frac{1}{p_i} \right) diverges to infinity, so given any nn, we can pick mm large enough so that the result is as large as desired (otherwise the product doesn't diverge to infinity). To be more precise, we can pick some mm so that

i=1m(1+1pi)>i=1n(1+1pi)2\displaystyle \prod_{i=1}^m \left( 1 + \frac{1}{p_i} \right) > \prod_{i=1}^n \left( 1 + \frac{1}{p_i} \right) \cdot 2

because the right hand side is a constant, while the left hand side grows to infinity. If we couldn't pick one, that would imply that i=1n(1+1pi)2\displaystyle \prod_{i=1}^n \left( 1 + \frac{1}{p_i} \right) \cdot 2 is an upper bound to i=1(1+1pi)\displaystyle\prod_{i=1}^\infty \left( 1 + \frac{1}{p_i} \right), contradiction.

This is similar reasoning to the following: given nn, we can pick mm so that 1n+1+1n+2++1m>1\frac{1}{n+1} + \frac{1}{n+2} + \ldots + \frac{1}{m} > 1, because 1i\sum \frac{1}{i} diverges to infinity.

Ivan Koswara - 5 years, 2 months ago

Log in to reply

Exactly. Neat proof.

Jake Lai - 5 years, 2 months ago

I noticed that this is called "a bun dance", but where are the dancing buns?

Kent Hitchborn - 2 weeks, 2 days ago
×

Problem Loading...

Note Loading...

Set Loading...