# 2

(Redirected from 2 (number))

 ← 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ב
ArmenianԲ
Khmer
Maya numerals••
Thai
Georgian Ⴁ/ⴁ/ბ(Bani)
Malayalam
Babylonian numeral𒐖
Egyptian hieroglyph, Aegean numeral, Chinese counting rod||
Morse code.._ _ _

2 (two) is a number, numeral and digit. It is the natural number following 1 and preceding 3. It is the smallest and the only even prime number.

Because it forms the basis of a duality, it has religious and spiritual significance in many cultures.

## As a word

Two is most commonly a determiner used with plural countable nouns, as in two days or I'll take these two.[1] 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).[2]

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ː/.[2]

## Characterizations of the number

### Parity

An integer is determined to be even if it is divisible by two. For integers written in a numeral system based on an even number such as decimal, divisibility by two is easily tested by merely looking at the last digit. If it is even, then the whole number is even. When written in the decimal system, all multiple of 2 will end in 0, 2, 4, 6, or 8.[3]

1 is neither prime nor composite yet odd. 0, which is an origin to the integers in the real line, especially when considered alongside negative integers, is neither prime nor composite, however it is distinctively even (as a multiple of two) since if it were to be odd, then for some integer ${\displaystyle k}$ there would be ${\displaystyle 0=2k+1}$ that yields a ${\displaystyle k}$ of ${\displaystyle -{\tfrac {1}{2}}}$, which is a contradiction (however, for a function, the zero function ${\displaystyle f(x)=0}$ is the only function to both be even and odd).

### Primality

2 is the smallest, and the only even prime number. As the smallest prime number, two is also the smallest non-zero pronic number, and the only pronic prime.[4]

#### The divisor function

Every integer greater than 1 will have at least two distinct factors; by definition, a prime number only has two distinct factors (itself and 1). Therefore, the number-of-divisors function ${\displaystyle d(n)}$ of positive integers ${\displaystyle n}$ satisfies, ${\displaystyle \liminf _{n\to \infty }d(n)=2,}$ where ${\displaystyle \liminf }$ represents the limit inferior (since there will always exist a larger prime number with a maximum of two divisors).[5] Aside from square numbers and prime powers raised to an even exponent, or integers that are the product of an even number of prime powers with even exponents, an integer will have a ${\displaystyle d(n)}$ that is a multiple of ${\displaystyle 2}$. The two smallest natural numbers ${\displaystyle (0,1)\in \mathbb {N} _{0}}$ have unique properties in this regard: ${\displaystyle 1}$ is the only number with a single divisor (itself), where on the other hand, ${\displaystyle 0}$ is the only number to have an infinite number of divisors, since dividing zero by any strictly positive or negative integer yields ${\displaystyle 0}$ (i.e., aside from division of zero by zero, ${\displaystyle {\tfrac {0}{0}}}$).

${\displaystyle (0,2)\in \mathbb {N} _{0}}$ is the only set of numbers whose distinct divisors (with more than one) are also consecutive integers, when excluding negative integers.[a]

#### Twin primes

Meanwhile, the numbers two and three are the only two prime numbers that are consecutive integers, where the number two is also adjacent to the unit. 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.[6][7] In consequence, three and five encase four in-between, which is the square of two, ${\displaystyle 2^{2}}$. These are also the two odd prime numbers that lie amongst the only all-Harshad numbers (1, 2, 4, and 6)[8] that are also the first four highly composite numbers,[9] with ${\displaystyle 2}$ the only number that is both a prime number and a "highly composite number".[b]

Twin primes are the smallest type of prime k-tuples, that represent patterns of repeating differences between prime numbers. A difference of two in prime k-tuples exists inside prime quintuplets, and in some types of prime triplets and prime quadruplets (etc.).

#### Ramanujan prime

${\displaystyle 2}$ is the first Ramanujan prime satisfying ${\displaystyle \pi (x)-\pi \left({\frac {x}{2}}\right)\geq 1,2,3,\ldots {\text{ for all }}x\geq 2,11,17,\ldots }$ where ${\displaystyle \pi (x)}$ is the prime-counting function, equal to the number of primes less than or equal to ${\displaystyle x}$.[11][c]

### Set theory and topology

A set that is a field has a minimum of two elements. In a set-theoretical construction of the natural numbers ${\displaystyle \mathbb {N} }$, two is identified with the set ${\displaystyle \{\varnothing ,\{\varnothing \}\}}$, where ${\displaystyle \varnothing }$ denotes the empty set. This latter set is important in category theory: it is a subobject classifier in the category of sets. With two identified with ${\displaystyle \{0,1\}=\{\varnothing ,\{\varnothing \}\}}$, ${\displaystyle 2^{S}}$ can be identified with the power set of set S, and ${\displaystyle 2^{\kappa }>\kappa }$ holds for any cardinal number κ; this is the content of Cantor's theorem.

A Cantor space is a topological space ${\displaystyle 2^{\mathbb {N} }}$ homeomorphic to the Cantor set, whose general set is a closed set consisting purely of boundary points. The countably infinite product topology of the simplest discrete two-point space, ${\displaystyle \{0,1\}}$, is the traditional elementary example of a Cantor space. Points whose initial conditions remain on a ${\displaystyle [0,1]}$ boundary in the logistic map ${\displaystyle x_{n+1}=rx_{n}(1-x_{n})}$ form a Cantor set, where values begin to diverge beyond ${\displaystyle r=4.}$ Between ${\displaystyle r\approx 3.45}$ and ${\displaystyle 3.57}$, the population approaches oscillations among ${\displaystyle 8,16,...,2^{n},\ldots ,2^{\infty }}$ values before chaos ensues.

## In classes of numbers

### Powers of 2

Powers of two are essential in computer science, and important in the constructability of regular polygons using basic tools (e.g., through the use of Fermat or Pierpont primes). ${\displaystyle 2}$ is the only number such that the sum of the reciprocals of its natural powers 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.}$

Two also 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.}$

Notably, row sums in Pascal's triangle are in equivalence with successive powers of two, ${\displaystyle 2^{n}.}$[12][13] Two is the first Mersenne prime exponent, and it is the difference between the first two Fermat primes (3 and 5).

### Perfect numbers

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.}$ The harmonic mean of the divisors of ${\displaystyle 6}$ — the smallest perfect number, unitary perfect number, and Ore number greater than ${\displaystyle 1}$ — is ${\displaystyle 2}$. Two itself is the smallest primary pseudoperfect number ${\displaystyle n}$ such that the reciprocal of ${\displaystyle n}$ plus the sum of reciprocals of prime factors of ${\displaystyle n}$ is ${\displaystyle 1.}$[14] There are only two known sublime numbers, which are numbers with a perfect number of factors, whose sum itself yields a perfect number:[15]

• ${\displaystyle 12=(2^{2})\times (2^{2}-1)}$
• ${\displaystyle 6\;086\;\ldots \;264=(2^{126})\times (2^{61}-1)\times (2^{31}-1)\times (2^{19}-1)\times (2^{7}-1)\times (2^{5}-1)\times (2^{3}-1)}$

The latter is a number that is seventy-six digits long (in decimal representation).

#### Deficient and abundant numbers

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

### Transcendental numbers

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

For a simple calculation involving pi, Brouncker's formula using the generalized continued fraction[18][19]

${\displaystyle {\frac {4}{\pi }}=1+{\cfrac {1^{2}}{2+{\cfrac {3^{2}}{2+{\cfrac {5^{2}}{2+{\cfrac {7^{2}}{2+\ddots }}}}}}}}}$

contains ${\displaystyle 2}$ as a constant partial denominator, where partial numerators are successive odd squares.

### In other sequences

• The sum of the reciprocals of all non-zero triangular numbers converges to 2.[20]
• Numbers also cannot be laid out in a ${\displaystyle 2\times 2}$ magic square that yields a magic constant, and as such they are the only null ${\displaystyle n}$ by ${\displaystyle n}$ magic square set.[21][d]
• Every number ${\displaystyle n}$ is polygonal by being ${\displaystyle 2}$-gonal (i.e., a natural number), as well as the root of some type of ${\displaystyle n}$-gonal number. For ${\displaystyle n=2}$, being ${\displaystyle 2}$-gonal and ${\displaystyle n}$-gonal is the same, which make two the only number that is polygonal in only one way.
• In John Conway's look-and-say function, which can be represented faithfully with a quaternary numeral system, two consecutive twos (as in "22" for "two twos"), or equivalently "2 - 2", is the only fixed point.[22]

Regarding Bernouilli numbers ${\displaystyle B_{2k}}$, by convention ${\displaystyle 2}$ has an irregularity of ${\displaystyle -1.}$[23] Two is also the first number to return zero for the Mertens function.[24]

#### Cunningham chains

In the smallest Cunningham chains of nearly doubled primes (of the first and second kind) two is the first member, as part of the sets ${\displaystyle \{2,3,5\}}$ and ${\displaystyle \{2,5,11,23,47\}}$.

The first fifteen prime numbers between ${\displaystyle 2}$ and ${\displaystyle 47}$ are also consecutive primes that are part of Bhargava's seventeen-integer quadratic matrix representative of all prime numbers (only two other numbers are part of this set of prime integers, namely the nineteenth and twenty-first prime numbers 67 and 73).[25] The seventh square number, ${\displaystyle 49=7^{2}}$, is in equivalence with the sum of the first and fifteenth primes.[e]

## Binary numbers

The binary system has a radix of two, and it is 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 number system is used extensively in computing.[26]

### Thue-Morse sequence

In the Thue-Morse sequence ${\displaystyle T}$, that successively adjoins the binary Boolean complement from ${\displaystyle \{0\}}$ onward (in succession), the critical exponent, or largest number of times an adjoining subsequence repeats, is ${\displaystyle 2}$, where there exist a vast amount of square words of the form ${\displaystyle ww.}$[27] Furthermore, in ${\displaystyle c}$, which counts the instances of ${\displaystyle 1}$ between consecutive occurrences of ${\displaystyle 0}$ in ${\displaystyle T}$ that is instead square-free, the critical exponent is also ${\displaystyle 2}$, since ${\displaystyle c=\{210201210120\ldots \}}$ contains factors of exponents close to ${\displaystyle 2}$ due to ${\displaystyle T}$ containing a large factor of squares.[28] In general, the repetition threshold of an infinite binary-rich word will be ${\displaystyle 2+{\tfrac {\sqrt {2}}{2}}\approx 2.707\ldots }$[29]

## In geometry

In a Euclidean space of any dimension greater than zero, two distinct points in a plane are always sufficient to define a unique line.[30]

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

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.}$[31]
• 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.414\;235\dots }$[33]

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

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}$.[citation needed]

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\}}$.[citation needed] The second dimension is also the only dimension where there are both an infinite number of Euclidean and hyperbolic regular polytopes (as polygons), and an infinite number of regular hyperbolic paracompact tesselations.

## 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

## Evolution of the 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.[34]

In fonts with text figures, digit 2 usually is of x-height, for example, .[citation needed]

## Notes

1. ^ Since zero has an infinite number of divisors, except for itself, the real line does not divide wholesomely into zero (in parts); as the only integer, zero (itself) is the only divisor that does not strictly map back to itself through division, when the only element in ${\displaystyle {\tfrac {a}{a}}}$ is zero (only in select cases). Therefore, ${\displaystyle {\tfrac {0}{0}}}$ is seen as in an indeterminate form, since it can behave in various different ways, depending on the context of a function.
2. ^ Furthermore, ${\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.[10]
3. ^ Where ${\displaystyle 2}$ is strictly the first prime number, and the only even prime number, the sum between the second prime number 3 and the second composite number 6 (that is twice 3, or thrice 2) is the first odd composite number, ${\displaystyle 9=3^{2}}$. At nine, the ratio of composite numbers to prime numbers is one-to-one, a proportion that is only repeated again at 11 and 13.
4. ^ Meanwhile, the magic constant of an ${\displaystyle n}$-pointed normal magic star is ${\displaystyle M=4n+2}$.
5. ^ Where also, ${\displaystyle 1+15=16=4^{2}.}$ The sum of the first fifteen integers is one less than a square, ${\displaystyle 1+2+3+\ldots +15=120=11^{2}-1.}$

## References

1. ^ 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.
2. ^ a b "two, adj., n., and adv.". Oxford English Dictionary (Online ed.). Oxford University Press. (Subscription or participating institution membership required.)
3. ^ Sloane, N. J. A. (ed.). "Sequence A005843 (The nonnegative even numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-12-15.
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. ^ Hardy, G. H.; Wright, E. M. (2008), An Introduction to the Theory of Numbers, Revised by D. R. Heath-Brown and J. H. Silverman. Foreword by Andrew Wiles. (6th ed.), Oxford: Oxford University Press, pp. 342–347, §18.1, ISBN 978-0-19-921986-5, MR 2445243, Zbl 1159.11001
Also, ${\displaystyle \limsup _{n\to \infty }{\frac {\log d(n)}{\log n/\log \log n}}=\log 2}$.
6. ^ 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.
7. ^ Sloane, N. J. A. (ed.). "Sequence A001359 (Lesser of twin primes.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-12-05.
8. ^ PrimeFan (2013-03-22). "Harshad number". PlanetMath. Retrieved 2023-12-18.
9. ^ Sloane, N. J. A. (ed.). "Sequence A002182 (Highly composite numbers, definition (1): numbers n where d(n), the number of divisors of n (A000005), increases to a record.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-12-18.
10. ^ 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)."
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. ^ Smith, Karl J. (1973). "Pascal's Triangle". The Two-Year College Mathematics Journal. 4 (1). Washington, D.C.: Mathematical Association of America: 4. doi:10.2307/2698949. JSTOR 2698949. S2CID 265738469.
13. ^ Sloane, N. J. A. (ed.). "Sequence A000079 (Powers of 2: a(n) equal to 2^n.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-01-06.
14. ^ Sloane, N. J. A. (ed.). "Sequence A054377 (Primary pseudoperfect numbers: numbers n > 1 such that 1/n + sum 1/p is equal to 1, where the sum is over the primes p | n.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2024-02-29.
15. ^ Sloane, N. J. A. (ed.). "Sequence A081357 (Sublime numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-07-13.
16. ^ Cohn, Henry (2006). "A Short Proof of the Simple Continued Fraction Expansion of e". The American Mathematical Monthly. 113 (1). Taylor & Francis, Ltd.: 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.
17. ^ 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)."
18. ^ Levrie, Paul (2007). "A Short Derivation of Lord Brouncker's Continued Fraction for π". The Mathematical Intelligencer. 29. Heidelberg: Springer: 8–9. doi:10.1007/BF02986198.
19. ^ Khrushchev, Sergey (July 2010). Rowe, David E. (ed.). "Two Great Theorems of Lord Brouncker and His Formula". The Mathematical Intelligencer. 32. Heidelberg: Springer: 19–31. doi:10.1007/s00283-010-9155-6. MR 2747700. Zbl 1215.11001.
20. ^ Grabowski, Adam (2013). "Polygonal numbers". Formalized Mathematics. 21 (2). Sciendo (De Gruyter): 103–113. doi:10.2478/forma-2013-0012. S2CID 15643540. Zbl 1298.11029.
21. ^ 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.
22. ^ Martin, Oscar (2006). "Look-and-Say Biochemistry: Exponential RNA and Multistranded DNA" (PDF). American Mathematical Monthly. 113 (4). Mathematical association of America: 289–307. doi:10.2307/27641915. ISSN 0002-9890. JSTOR 27641915. Archived from the original (PDF) on 2006-12-24. Retrieved 2022-07-21.
23. ^ Sloane, N. J. A. (ed.). "Sequence A061576 (Smallest prime of irregularity index n.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2024-03-25.
24. ^ 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.
25. ^ Sloane, N. J. A. (ed.). "Sequence A154363 (Numbers from Bhargava's prime-universality criterion theorem.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2024-05-22.
26. ^ "How computers see the world - Binary - KS3 Computer Science Revision". BBC Bitesize. Retrieved 2024-06-05.
27. ^ Krieger, Dalia (2006). "On critical exponents in fixed points of non-erasing morphisms". In Ibarra, Oscar H.; Dang, Zhe (eds.). Developments in Language Theory: Proceedings 10th International Conference, DLT 2006, Santa Barbara, California, USA, June 26-29, 2006. Lecture Notes in Computer Science. Vol. 4036. Springer-Verlag. pp. 280–291. ISBN 978-3-540-35428-4. Zbl 1227.68074.
28. ^ Schaeffer, Luke; Shallit, Jeffrey (2012). "The Critical Exponent is Computable for Automatic Sequences". International Journal of Foundations of Computer Science. 23 (8 (Special Issue Words 2011)). Singapore: World Scientific: 1611–1613. arXiv:1104.2303. doi:10.1142/S0129054112400655. MR 3038646. S2CID 38713. Zbl 1285.68138.
29. ^ Currie, James D.; Mol, Lucas; Rampersad, Narad (2020). "The repetition threshold for binary rich words". Discrete Mathematics and Theoretical Computer Science. 22 (1). Boise, ID: Episciences: 1–16. doi:10.23638/DMTCS-22-1-6. MR 4075140. S2CID 199501906. Zbl 1456.68135.
30. ^ Carrell, Jim. "Chapter 1 | Euclidean Spaces and Their Geometry". MATH 307 Applied Linear Algebra (PDF).
31. ^ Svrtan, Dragutin; Veljan, Darko (2012). "Non-Euclidean versions of some classical triangle inequalities" (PDF). Forum Geometricorum. 12. Boca Raton, FL: Department of Mathematical Sciences, Florida Atlantic University: 198. ISSN 1534-1178. MR 2955631. S2CID 29722079. Zbl 1247.51012. Archived (PDF) from the original on 2023-05-03. Retrieved 2023-04-30.
32. ^ "How to Find the Diagonal of a Hexagon". Sciencing. Retrieved 2024-06-05.
33. ^ Vera W. de Spinadel (1999). "The Family of Metallic Means". Visual Mathematics. 1 (3). Belgrade: Mathematical Institute of the Serbian Academy of Sciences. eISSN 1821-1437. S2CID 125705375. Zbl 1016.11005. Archived from the original on 2023-03-26. Retrieved 2023-02-25.
34. ^ 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
35. ^ "Double-stranded DNA". Scitable. Nature Education. Archived from the original on 2020-07-24. Retrieved 2019-12-22.
36. ^ "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.
37. ^ Bezdenezhnyi, V. P. (2004). "Nuclear Isotopes and Magic Numbers". Odessa Astronomical Publications. 17: 11. Bibcode:2004OAP....17...11B.