Английская Википедия:2

Материал из Онлайн справочника
Перейти к навигацииПерейти к поиску

Шаблон:Short description Шаблон:Pp-semi Шаблон:Hatnote Шаблон:Infobox number

2 (two) is a number, numeral and digit. It is the natural number following 1 and preceding 3. It is the smallest and only even prime number. Because it forms the basis of a duality, it has religious and spiritual significance in many cultures.

Шаблон:Anchor

Evolution

Arabic digit

Файл:Evolution2glyph.png

The digit used in the modern Western world to represent the number 2 traces its roots back to the Indic Brahmic script, where "2" was written as two horizontal lines. The modern Chinese and Japanese languages (and Korean Hanja) still use this method. The Gupta script rotated the two lines 45 degrees, making them diagonal. The top line was sometimes also shortened and had its bottom end curve towards the center of the bottom line. In the Nagari script, the top line was written more like a curve connecting to the bottom line. In the Arabic Ghubar writing, the bottom line was completely vertical, and the digit looked like a dotless closing question mark. Restoring the bottom line to its original horizontal position, but keeping the top line as a curve that connects to the bottom line leads to our modern digit.[1]

In fonts with text figures, digit 2 usually is of x-height, for example, Файл:Text figures 256.svg.

As a word

Two is most commonly a determiner used with plural countable nouns, as in two days or I'll take these two.[2] Two is a noun when it refers to the number two as in two plus two is four.

Etymology of two

The word two is derived from the Old English words Шаблон:Lang (feminine), Шаблон:Lang (neuter), and Шаблон:Lang (masculine, which survives today in the form twain).[3]

The pronunciation Шаблон:IPA, like that of who is due to the labialization of the vowel by the w, which then disappeared before the related sound. The successive stages of pronunciation for the Old English Шаблон:Lang would thus be Шаблон:IPA, Шаблон:IPA, Шаблон:IPA, Шаблон:IPA, and finally Шаблон:IPA.[3]

In mathematics

Two is the smallest, and the only even prime number. As the smallest prime number, it is also the smallest non-zero pronic number, and the only pronic prime.[4] The next prime is three, which makes two and three the only two consecutive prime numbers. Two is the first prime number that does not have a proper twin prime with a difference two, while three is the first such prime number to have a twin prime, five.[5][6] In consequence, three and five encase four in-between, which is the square of two, <math>2^2</math>. These are also the two odd prime numbers that lie amongst the only all-Harshad numbers (1, 2, 4, and 6)[7] that are also the first four highly composite numbers,[8] with 2 the only number that is both a prime number and a highly composite number.

An integer is called even if it is divisible by 2. For integers written in a numeral system based on an even number such as decimal, divisibility by 2 is easily tested by merely looking at the last digit. If it is even, then the whole number is even. In particular, when written in the decimal system, all multiples of 2 will end in 0, 2, 4, 6, or 8.[9]

Two is the base of the binary system, the numeral system with the fewest tokens that allows denoting a natural number substantially more concisely (with <math>\log_{2}</math> <math>n</math> tokens) than a direct representation by the corresponding count of a single token (with <math>n</math> tokens). This binary number system is used extensively in computing.

The square root of 2 was the first known irrational number. Taking the square root of a number is such a common and essential mathematical operation, that the spot on the root sign where the index would normally be written for cubic and other roots, may simply be left blank for square roots, as it is tacitly understood.

Powers of two are central to the concept of Mersenne primes, and important to computer science. Two is the first Mersenne prime exponent. They are also essential to Fermat primes and Pierpont primes, which have consequences in the constructability of regular polygons using basic tools.

In a set-theoretical construction of the natural numbers, two is identified with the set <math>\{\{\varnothing\},\varnothing\}</math>. This latter set is important in category theory: it is a subobject classifier in the category of sets. A set that is a field has a minimum of two elements.

A Cantor space is a topological space <math>2^\mathbb{N}</math> homeomorphic to the Cantor set. The countably infinite product topology of the simplest discrete two-point space, <math>\{0, 1\}</math>, is the traditional elementary example of a Cantor space.

A number is deficient when the sum of its divisors is less than twice the number, whereas an abundant number has a sum of its proper divisors that is larger than the number itself. Primitive abundant numbers are abundant numbers whose proper divisors are all deficient.

A number is perfect if it is equal to its aliquot sum, or the sum of all of its positive divisors excluding the number itself. This is equivalent to describing a perfect number <math>n</math> as having a sum of divisors <math>\sigma(n)</math> equal to <math>2n</math>.

Two is the first Sophie Germain prime,[10] the first factorial prime,[11] the first Lucas prime,[12] and the first Ramanujan prime.[13] It is also a Motzkin number,[14] a Bell number,[15] and the third (or fourth) Fibonacci number.[16]

<math>(3,5)</math> are the unique pair of twin primes <math>(q, q+2)</math> that yield the second and only prime quadruplet <math>(11, 13, 17, 19)</math> that is of the form <math>(d-4, d-2, d+2, d+4)</math>, where <math>d</math> is the product of said twin primes.[17]

Two has the unique property that <math>2+2=2\times2=2^{2}=2\uparrow\uparrow 2= 2\uparrow\uparrow\uparrow2=\text{ }...</math> up through any level of hyperoperation, here denoted in Knuth's up-arrow notation, all equivalent to <math>4.</math>

Two consecutive twos (as in "22" for "two twos"), or equivalently "2-2", is the only fixed point of John Conway's look-and-say function.[18]

The number-of-divisors function <math>d(n)</math> of positive integers <math>n</math> satisfies <math>\liminf_{n\to\infty} d(n)=2,</math>[19] where <math>\liminf</math> represents the limit inferior, since there will always exist a larger prime number with a maximum of two divisors (itself, and one).

Two is the only number <math>n</math> such that the sum of the reciprocals of the natural powers of <math>n</math> equals itself. In symbols,

<math>\sum_{n=0}^{\infin}\frac {1}{2^n}=1+\frac{1}{2}+\frac{1}{4}+\frac{1}{8}+\frac{1}{16}+\cdots=2.</math>

The sum of the reciprocals of all non-zero triangular numbers converges to 2.[20]

2 is the harmonic mean of the divisors of 6, the smallest Ore number greater than 1.

Like one, two is a meandric number,[21] a semi-meandric number,[22] and an open meandric number.[23]

Euler's number <math>e</math> can be simplified to equal,

<math display ="block">e = \sum\limits_{n = 0}^{\infty} \frac{1}{n!} = 2 + \frac{1}{1\cdot 2} + \frac{1}{1\cdot 2\cdot 3} + \cdots</math>

A continued fraction for <math>e = [2; 1, 2, 1, 1, 4, 1, 1, 8, ...]</math> repeats a <math>\{1, 2n, 1\}</math> pattern from the second term onward.[24][25]

In a Euclidean space of any dimension greater than zero, two distinct points determine a line.

A digon is a polygon with two sides (or edges) and two vertices. On a circle, it is a tessellation with two antipodal points and 180° arc edges.

The circumference of a circle of radius <math>r</math> is <math>2 \pi r</math>.

Regarding regular polygons in two dimensions,

  • The span of an octagon is in silver ratio <math>\delta_s</math> with its sides, which can be computed with the continued fraction <math>[2;2,2,...] = 2.414\;235\dots</math>[27]

Whereas a square of unit side length has a diagonal equal to <math>\sqrt{2}</math>, a space diagonal inside a tesseract measures 2 when its side lengths are of unit length.

There are no <math>2\times2</math> magic squares, and as such they are the only null <math>n</math> by <math>n</math> magic square set.[28] Meanwhile, the magic constant of an <math>n</math>-pointed normal magic star is <math>M = 4n + 2</math>.

For any polyhedron homeomorphic to a sphere, the Euler characteristic is <math>\chi=V-E+F=2 </math>, where <math>V</math> is the number of vertices, <math>E</math> is the number of edges, and <math>F</math> is the number of faces. A double torus has an Euler characteristic of <math>-2</math>, on the other hand, and a non-orientable surface of like genus <math>k</math> has a characteristic <math>\chi=2-k</math>.

The simplest tessellation in two-dimensional space, though an improper tessellation, is that of two <math>\infty</math>-sided apeirogons joined along all their edges, coincident about a line that divides the plane in two. This order-2 apeirogonal tiling is the arithmetic limit of the family of dihedra <math>\{p, 2\}</math>.

There are two known sublime numbers, which are numbers with a perfect number of factors, whose sum itself yields a perfect number. 12 is one of the two sublime numbers, with the other being 76 digits long.[29] The first number to return zero for the Mertens function is two.[30]

List of basic calculations

Multiplication 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 50 100
2 × x 2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 100 200
Division 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20
2 ÷ x 2 1 0.Шаблон:Overline 0.5 0.4 0.Шаблон:Overline 0.Шаблон:Overline 0.25 0.Шаблон:Overline 0.2 0.Шаблон:Overline 0.1Шаблон:Overline 0.Шаблон:Overline 0.Шаблон:Overline 0.1Шаблон:Overline 0.125 0.Шаблон:Overline 0.Шаблон:Overline 0.Шаблон:Overline 0.1
x ÷ 2 0.5 1.5 2 2.5 3 3.5 4 4.5 5 5.5 6 6.5 7 7.5 8 8.5 9 9.5 10
Exponentiation 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20
2Шаблон:Sup 2 4 8 16 32 64 128 256 512 1024 2048 4096 8192 16384 32768 65536 131072 262144 524288 1048576
xШаблон:Sup 1 9 25 36 49 64 81 100 121 144 169 196 225 256 289 324 361 400

In science

In sports

Шаблон:Multiple image

See also

References

Шаблон:Reflist

External links

Шаблон:Portal Шаблон:Commons and category

Шаблон:Wiktionary

Шаблон:Integers

Шаблон:Authority control

  1. Georges Ifrah, The Universal History of Numbers: From Prehistory to the Invention of the Computer transl. David Bellos et al. London: The Harvill Press (1998): 393, Fig. 24.62
  2. Шаблон:Cite book
  3. 3,0 3,1 Шаблон:Cite OED
  4. Шаблон:Cite web
  5. Шаблон:Cite OEIS
  6. Шаблон:Cite OEIS
  7. Шаблон:Cite web
  8. Шаблон:Cite OEIS
  9. Шаблон:Cite OEIS
  10. Шаблон:Cite OEIS
  11. Шаблон:Cite OEIS
  12. Шаблон:Cite OEIS
  13. Шаблон:Cite web
  14. Шаблон:Cite OEIS
  15. Шаблон:Cite OEIS
  16. Шаблон:Cite OEIS
  17. Шаблон:Cite OEIS
    "{11, 13, 17, 19} is the only prime quadruplet {p, p+2, p+6, p+8} of the form {Q-4, Q-2, Q+2, Q+4} where Q is a product of a pair of twin primes {q, q+2} (for prime q = 3) because numbers Q-2 and Q+4 are for q>3 composites of the form 3*(12*k^2-1) and 3*(12*k^2+1) respectively (k is an integer)."
  18. Шаблон:Cite journal
  19. Шаблон:Citation
    Also, <math>\limsup_{n\to\infty}\frac{\log d(n)}{\log n/\log\log n} = \log 2</math>.
  20. Шаблон:Cite journal
  21. Шаблон:Cite OEIS
  22. Шаблон:Cite OEIS
  23. Шаблон:Cite OEIS
  24. Шаблон:Cite journal
  25. Шаблон:Cite OEIS
    "Only a(1) = 0 prevents this from being a simple continued fraction. The motivation for this alternate representation is that the simple pattern {1, 2*n, 1} (from n=0) may be more mathematically appealing than the pattern in the corresponding simple continued fraction (at A003417)."
  26. Шаблон:Cite journal
  27. Шаблон:Cite journal
  28. Шаблон:Cite OEIS
  29. Шаблон:Cite OEIS
  30. Шаблон:Cite OEIS
  31. Шаблон:Cite web
  32. Шаблон:Cite web
  33. Шаблон:Cite journal
  34. Шаблон:Cite web
  35. Шаблон:Cite web
  36. Шаблон:Cite web