# 2

(Redirected from 2 (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.

 ← 1 2 3 →
Cardinaltwo
Ordinal2nd (second / twoth)
Numeral systembinary
Factorizationprime
Gaussian integer factorization${\displaystyle (1+i)(1-i)}$
Prime1st
Divisors1, 2
Greek numeralΒ´
Roman numeralII, ii
Greek prefixdi-
Latin prefixduo-/bi-
Old English prefixtwi-
Binary102
Ternary23
Senary26
Octal28
Duodecimal212
Greek numeralβ'
Arabic, Kurdish, Persian, Sindhi, Urdu٢
Ge'ez
Bengali
Chinese numeral二，弍，貳
Devanāgarī
Telugu
Tamil
Hebrewב
Khmer
Thai
Georgian Ⴁ/ⴁ/ბ(Bani)
Malayalam

## Evolution

### Arabic digit

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,  .

## 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 twā (feminine), (neuter), and twēġen (masculine, which survives today in the form twain).[3]

The pronunciation /tuː/, 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 twā would thus be /twɑː/, /twɔː/, /twoː/, /twuː/, and finally /tuː/.[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 or ${\displaystyle 2^{2}}$ . These are also the two odd prime numbers that lie amongst the only all-Harshad numbers 1, 2, 4, and 6.

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.[7]

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 ${\displaystyle \log _{2}}$  ${\displaystyle n}$  tokens) than a direct representation by the corresponding count of a single token (with ${\displaystyle n}$  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 ${\displaystyle \{\{\varnothing \},\varnothing \}}$ . 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 ${\displaystyle 2^{\mathbb {N} }}$  homeomorphic to the Cantor set. The countably infinite product topology of the simplest discrete two-point space, ${\displaystyle \{0,1\}}$ , 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 ${\displaystyle n}$  as having a sum of divisors ${\displaystyle \sigma (n)}$  equal to ${\displaystyle 2n}$ .

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

${\displaystyle (3,5)}$  are the unique pair of twin primes ${\displaystyle (q,q+2)}$  that yield the second and only prime quadruplet ${\displaystyle (11,13,17,19)}$  that is of the form ${\displaystyle (d-4,d-2,d+2,d+4)}$ , where ${\displaystyle d}$  is the product of said twin primes.[15]

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

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.[16]

Two is the only number ${\displaystyle n}$  such that the sum of the reciprocals of the natural powers of ${\displaystyle n}$  equals itself. In symbols,

${\displaystyle \sum _{n=0}^{\infty }{\frac {1}{2^{n}}}=1+{\frac {1}{2}}+{\frac {1}{4}}+{\frac {1}{8}}+{\frac {1}{16}}+\cdots =2.}$

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

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

Like one, two is a meandric number,[18] a semi-meandric number,[19] and an open meandric number.[20]

Euler's number ${\displaystyle e}$  can be simplified to equal,

${\displaystyle e=\sum \limits _{n=0}^{\infty }{\frac {1}{n!}}=2+{\frac {1}{1\cdot 2}}+{\frac {1}{1\cdot 2\cdot 3}}+\cdots }$

A continued fraction for ${\displaystyle e=[2;1,2,1,1,4,1,1,8,...]}$  repeats a ${\displaystyle \{1,2n,1\}}$  pattern from the second term onward.[21][22]

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 ${\displaystyle r}$  is ${\displaystyle 2\pi r}$ .

Regarding regular polygons in two dimensions,

• The equilateral triangle has the smallest ratio of the circumradius ${\displaystyle R}$  to the inradius ${\displaystyle r}$  of any triangle by Euler's inequality, with ${\displaystyle {\tfrac {R}{r}}=2.}$ [23]
• The span of an octagon is in silver ratio ${\displaystyle \delta _{s}}$  with its sides, which can be computed with the continued fraction ${\displaystyle [2;2,2,...]=2.4142\dots }$ [24]

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

There are no ${\displaystyle 2\times 2}$  magic squares, and as such they are the only null ${\displaystyle n}$  by ${\displaystyle n}$  magic square set.[25] Meanwhile, the magic constant of an ${\displaystyle n}$ -pointed normal magic star is ${\displaystyle M=4n+2}$ .

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

The simplest tessellation in two-dimensional space, though an improper tessellation, is that of two ${\displaystyle \infty }$ -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 ${\displaystyle \{p,2\}}$ .

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.[26] The first number to return zero for the Mertens function is two.[27]

### 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.6 0.5 0.4 0.3 0.285714 0.25 0.2 0.2 0.18 0.16 0.153846 0.142857 0.13 0.125 0.1176470588235294 0.1 0.105263157894736842 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
2x 2 4 8 16 32 64 128 256 512 1024 2048 4096 8192 16384 32768 65536 131072 262144 524288 1048576
x2 1 9 25 36 49 64 81 100 121 144 169 196 225 256 289 324 361 400

## References

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. ^ Huddleston, Rodney D.; Pullum, Geoffrey K.; Reynolds, Brett (2022). A student's introduction to English grammar (2nd ed.). Cambridge, United Kingdom: Cambridge University Press. p. 117. ISBN 978-1-316-51464-1. OCLC 1255524478.
3. ^ a b "two, adj., n., and adv.". Oxford English Dictionary (Online ed.). Oxford University Press. (Subscription or participating institution membership required.)
4. ^ "Sloane's A002378: Pronic numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Archived from the original on 2016-06-09. Retrieved 2020-11-30.
5. ^ Sloane, N. J. A. (ed.). "Sequence A007510 (Single (or isolated or non-twin) primes: Primes p such that neither p-2 nor p+2 is prime.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-12-05.
6. ^ Sloane, N. J. A. (ed.). "Sequence A001359 (Lesser of twin primes.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-12-05.
7. ^ Sloane, N. J. A. (ed.). "Sequence A005843 (The nonnegative even numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-12-15.
8. ^ Sloane, N. J. A. (ed.). "Sequence A005384 (Sophie Germain primes p: 2p+1 is also prime.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-12-15.
9. ^ Sloane, N. J. A. (ed.). "Sequence A088054 (Factorial primes: primes which are within 1 of a factorial number.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-12-15.
10. ^ Sloane, N. J. A. (ed.). "Sequence A005479 (Prime Lucas numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-12-15.
11. ^ "Sloane's A104272 : Ramanujan primes". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Archived from the original on 2011-04-28. Retrieved 2016-06-01.
12. ^ Sloane, N. J. A. (ed.). "Sequence A001006 (Motzkin numbers: number of ways of drawing any number of nonintersecting chords joining n (labeled) points on a circle.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-12-15.
13. ^ Sloane, N. J. A. (ed.). "Sequence A000110 (Bell or exponential numbers: number of ways to partition a set of n labeled elements.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-12-15.
14. ^ Sloane, N. J. A. (ed.). "Sequence A000045 (Fibonacci numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-12-15.
15. ^ Sloane, N. J. A. (ed.). "Sequence A136162 (List of prime quadruplets {p, p+2, p+6, p+8}.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-06-09.
"{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)."
16. ^ Martin, Oscar (2006). "Look-and-Say Biochemistry: Exponential RNA and Multistranded DNA" (PDF). American Mathematical Monthly. Mathematical association of America. 113 (4): 289–307. doi:10.2307/27641915. ISSN 0002-9890. JSTOR 27641915. Archived from the original (PDF) on 2006-12-24. Retrieved 2022-07-21.
17. ^ Grabowski, Adam (2013). "Polygonal numbers". Formalized Mathematics. Sciendo (De Gruyter). 21 (2): 103–113. doi:10.2478/forma-2013-0012. S2CID 15643540. Zbl 1298.11029.
18. ^ Sloane, N. J. A. (ed.). "Sequence A005315 (Closed meandric numbers (or meanders): number of ways a loop can cross a road 2n times.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-12-15.
19. ^ Sloane, N. J. A. (ed.). "Sequence A000682 (Semi-meanders: number of ways a semi-infinite directed curve can cross a straight line n times.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-12-15.
20. ^ Sloane, N. J. A. (ed.). "Sequence A005316 (Meandric numbers: number of ways a river can cross a road n times.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-12-15.
21. ^ Cohn, Henry (2006). "A Short Proof of the Simple Continued Fraction Expansion of e". The American Mathematical Monthly. Taylor & Francis, Ltd. 113 (1): 57–62. doi:10.1080/00029890.2006.11920278. JSTOR 27641837. MR 2202921. S2CID 43879696. Zbl 1145.11012. Archived from the original on 2023-04-30. Retrieved 2023-04-30.
22. ^ Sloane, N. J. A. (ed.). "Sequence A005131 (A generalized continued fraction for Euler's number e.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-04-30.
"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)."
23. ^ Svrtan, Dragutin; Veljan, Darko (2012). "Non-Euclidean versions of some classical triangle inequalities" (PDF). Forum Geometricorum. Boca Raton, FL: Department of Mathematical Sciences, Florida Atlantic University. 12: 198. ISSN 1534-1178. MR 2955631. S2CID 29722079. Zbl 1247.51012. Archived (PDF) from the original on 2023-05-03. Retrieved 2023-04-30.
24. ^ Vera W. de Spinadel (1999). "The Family of Metallic Means". Visual Mathematics. Belgrade: Mathematical Institute of the Serbian Academy of Sciences. 1 (3). eISSN 1821-1437. S2CID 125705375. Zbl 1016.11005. Archived from the original on 2023-03-26. Retrieved 2023-02-25.
25. ^ Sloane, N. J. A. (ed.). "Sequence A006052 (Number of magic squares of order n composed of the numbers from 1 to n^2, counted up to rotations and reflections.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-07-21.
26. ^ Sloane, N. J. A. (ed.). "Sequence A081357 (Sublime numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-07-13.
27. ^ Sloane, N. J. A. (ed.). "Sequence A028442 (Numbers k such that Mertens's function M(k) (A002321) is zero.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-09-02.
28. ^ "Double-stranded DNA". Scitable. Nature Education. Archived from the original on 2020-07-24. Retrieved 2019-12-22.
29. ^ "The Complete Explanation of the Nuclear Magic Numbers Which Indicate the Filling of Nucleonic Shells and the Revelation of Special Numbers Indicating the Filling of Subshells Within Those Shells". www.sjsu.edu. Archived from the original on 2019-12-02. Retrieved 2019-12-22.
30. ^ Bezdenezhnyi, V. P. (2004). "Nuclear Isotopes and Magic Numbers". Odessa Astronomical Publications. 17: 11. Bibcode:2004OAP....17...11B.
31. ^ "Asteroid Fact Sheet". nssdc.gsfc.nasa.gov. Archived from the original on 2020-02-01. Retrieved 2019-12-22.
32. ^ Staff (2018-01-17). "Binary Star Systems: Classification and Evolution". Space.com. Archived from the original on 2019-12-22. Retrieved 2019-12-22.
33. ^ Lewis, Tanya (2018-09-28). "Human Brain: Facts, Functions & Anatomy". livescience.com. Archived from the original on 2019-12-22. Retrieved 2019-12-22.