Math 2.0

example

The nth root of n tends to 1

Example

For each integer n≥1n \ge 1, let an=n1/na_n = n^{1/n} be the positive nn-th root of nn. Then an→1a_n \to 1 as n→∞n \to \infty. For the proof, write an=1+hna_n = 1 + h_n with hn≥0h_n \ge 0. For n≥2n \ge 2, the binomial theorem gives n=(1+hn)n≥(n2)hn2=n(n−1)2hn2n = (1 + h_n)^n \ge \binom{n}{2} h_n^2 = \frac{n(n-1)}{2} h_n^2. Thus 0≤hn≤2/(n−1)0 \le h_n \le \sqrt{2/(n-1)}, and the squeeze theorem gives hn→0h_n \to 0.

Remarks

The first terms are 1,2≈1.414,31/3≈1.442,41/4≈1.4141, \sqrt{2} \approx 1.414, 3^{1/3} \approx 1.442, 4^{1/4} \approx 1.414. The largest term is at n=3n = 3. In the same way, c1/n→1c^{1/n} \to 1 for each real c>0c > 0. Mathlib proves the version for a real variable, x1/x→1x^{1/x} \to 1 as x→∞x \to \infty, in the lemma tendsto_rpow_div.

Explanations

L1 human

The number nn grows, but the root index nn grows too, and the root wins. For example, 10001/10001000^{1/1000} is about 1.00691.0069, very close to 11.

What this node needs for W1
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What this needs

To read this node, read these 5 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Sequence definition
  2. Real sequence definition
  3. Limit of a sequence definition
  4. Squeeze theorem statement
  5. The nth root of n tends to 1 example

Sources

  1. Web https://en.wikipedia.org/wiki/Nth_root, Definition and notation