Misplaced Pages

21 (number)

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.
(Redirected from 21st) "XXI" and "Twenty-One" redirect here. For other uses, see 21. Natural number
← 20 21 22 →
← 20 21 22 23 24 25 26 27 28 29 → ← 0 10 20 30 40 50 60 70 80 90 →
Cardinaltwenty-one
Ordinal21st
(twenty-first)
Factorization3 × 7
Divisors1, 3, 7, 21
Greek numeralΚΑ´
Roman numeralXXI
Binary101012
Ternary2103
Senary336
Octal258
Duodecimal1912
Hexadecimal1516

21 (twenty-one) is the natural number following 20 and preceding 22.

The current century is the 21st century AD, under the Gregorian calendar.

Mathematics

Twenty-one is the fifth distinct semiprime, and the second of the form 3 × q {\displaystyle 3\times q} where q {\displaystyle q} is a higher prime. It is a repdigit in quaternary (1114).

Properties

As a biprime with proper divisors 1, 3 and 7, twenty-one has a prime aliquot sum of 11 within an aliquot sequence containing only one composite number (21, 11, 1, 0); it is the second composite number with an aliquot sum of 11, following 18. 21 is the first member of the second cluster of consecutive discrete semiprimes (21, 22), where the next such cluster is (33, 34, 35). There are 21 prime numbers with 2 digits. There are A total of 21 prime numbers between 100 and 200.

21 is the first Blum integer, since it is a semiprime with both its prime factors being Gaussian primes.

While 21 is the sixth triangular number, it is also the sum of the divisors of the first five positive integers:

1 + 2 + 3 + 4 + 5 + 6 = 21 1 + ( 1 + 2 ) + ( 1 + 3 ) + ( 1 + 2 + 4 ) + ( 1 + 5 ) = 21 {\displaystyle {\begin{aligned}1&+2+3+4+5+6=21\\1&+(1+2)+(1+3)+(1+2+4)+(1+5)=21\\\end{aligned}}}

21 is also the first non-trivial octagonal number. It is the fifth Motzkin number, and the seventeenth Padovan number (preceded by the terms 9, 12, and 16, where it is the sum of the first two of these).

In decimal, the number of two-digit prime numbers is twenty-one (a base in which 21 is the fourteenth Harshad number). It is the smallest non-trivial example in base ten of a Fibonacci number (where 21 is the 8th member, as the sum of the preceding terms in the sequence 8 and 13) whose digits (2, 1) are Fibonacci numbers and whose digit sum is also a Fibonacci number (3). It is also the largest positive integer n {\displaystyle n} in decimal such that for any positive integers a , b {\displaystyle a,b} where a + b = n {\displaystyle a+b=n} , at least one of a b {\displaystyle {\tfrac {a}{b}}} and b a {\displaystyle {\tfrac {b}{a}}} is a terminating decimal; see proof below:

Proof

For any a {\displaystyle a} coprime to n {\displaystyle n} and n − a {\displaystyle n-a} , the condition above holds when one of a {\displaystyle a} and n − a {\displaystyle n-a} only has factors 2 {\displaystyle 2} and 5 {\displaystyle 5} (for a representation in base ten).

Let A ( n ) {\displaystyle A(n)} denote the quantity of the numbers smaller than n {\displaystyle n} that only have factor 2 {\displaystyle 2} and 5 {\displaystyle 5} and that are coprime to n {\displaystyle n} , we instantly have φ ( n ) 2 < A ( n ) {\displaystyle {\frac {\varphi (n)}{2}}<A(n)} .

We can easily see that for sufficiently large n {\displaystyle n} , A ( n ) ∼ log 2 ⁡ ( n ) log 5 ⁡ ( n ) 2 = ln 2 ⁡ ( n ) 2 ln ⁡ ( 2 ) ln ⁡ ( 5 ) . {\displaystyle A(n)\sim {\frac {\log _{2}(n)\log _{5}(n)}{2}}={\frac {\ln ^{2}(n)}{2\ln(2)\ln(5)}}.}

However, φ ( n ) ∼ n e γ ln ⁡ ln ⁡ n {\displaystyle \varphi (n)\sim {\frac {n}{e^{\gamma }\;\ln \ln n}}} where A ( n ) = o ( φ ( n ) ) {\displaystyle A(n)=o(\varphi (n))} as n {\displaystyle n} approaches infinity; thus φ ( n ) 2 < A ( n ) {\displaystyle {\frac {\varphi (n)}{2}}<A(n)} fails to hold for sufficiently large n {\displaystyle n} .

In fact, for every n > 2 {\displaystyle n>2} , we have

A ( n ) < 1 + log 2 ⁡ ( n ) + 3 log 5 ⁡ ( n ) 2 + log 2 ⁡ ( n ) log 5 ⁡ ( n ) 2   {\displaystyle A(n)<1+\log _{2}(n)+{\frac {3\log _{5}(n)}{2}}+{\frac {\log _{2}(n)\log _{5}(n)}{2}}{\text{ }}} and
φ ( n ) > n e γ log ⁡ log ⁡ n + 3 log ⁡ log ⁡ n . {\displaystyle \varphi (n)>{\frac {n}{e^{\gamma }\;\log \log n+{\frac {3}{\log \log n}}}}.}

So φ ( n ) 2 < A ( n ) {\displaystyle {\frac {\varphi (n)}{2}}<A(n)} fails to hold when n > 273 {\displaystyle n>273} (actually, when n > 33 {\displaystyle n>33} ).

Just check a few numbers to see that the complete sequence of numbers having this property is { 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 , 11 , 12 , 15 , 21 } . {\displaystyle \{2,3,4,5,6,7,8,9,11,12,15,21\}.}

21 is the smallest natural number that is not close to a power of two ( 2 n ) {\displaystyle (2^{n})} , where the range of nearness is ± n . {\displaystyle \pm {n}.}

Squaring the square

The minimum number of squares needed to square the square (using different edge-lengths) is 21.

Twenty-one is the smallest number of differently sized squares needed to square the square.

The lengths of sides of these squares are { 2 , 4 , 6 , 7 , 8 , 9 , 11 , 15 , 16 , 17 , 18 , 19 , 24 , 25 , 27 , 29 , 33 , 35 , 37 , 42 , 50 } {\displaystyle \{2,4,6,7,8,9,11,15,16,17,18,19,24,25,27,29,33,35,37,42,50\}} which generate a sum of 427 when excluding a square of side length 7 {\displaystyle 7} ; this sum represents the largest square-free integer over a quadratic field of class number two, where 163 is the largest such (Heegner) number of class one. 427 number is also the first number to hold a sum-of-divisors in equivalence with the third perfect number and thirty-first triangular number (496), where it is also the fiftieth number to return 0 {\displaystyle 0} in the Mertens function.

Quadratic matrices in Z

While the twenty-first prime number 73 is the largest member of Bhargava's definite quadratic 17–integer matrix Φ s ( P ) {\displaystyle \Phi _{s}(P)} representative of all prime numbers, Φ s ( P ) = { 2 , 3 , 5 , 7 , 11 , 13 , 17 , 19 , 23 , 29 , 31 , 37 , 41 , 43 , 47 , 67 , 73 } , {\displaystyle \Phi _{s}(P)=\{2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,67,{\mathbf {73}}\},}

the twenty-first composite number 33 is the largest member of a like definite quadratic 7–integer matrix Φ s ( 2 Z ≥ 0 + 1 ) = { 1 , 3 , 5 , 7 , 11 , 15 , 33 } {\displaystyle \Phi _{s}(2\mathbb {Z} _{\geq 0}+1)=\{1,3,5,7,11,15,{\mathbf {33}}\}}

representative of all odd numbers.

In science

Age 21

  • In thirteen countries, 21 is the age of majority. See also: Coming of age.
  • In eight countries, 21 is the minimum age to purchase tobacco products.
  • In seventeen countries, 21 is the drinking age.
  • In nine countries, it is the voting age.
  • In the United States:
    • 21 is the minimum age at which a person may gamble or enter casinos in most states (since alcohol is usually provided).
    • 21 is the minimum age to purchase a handgun or handgun ammunition under federal law.
    • In some states, 21 is the minimum age to accompany a learner driver, provided that the person supervising the learner has held a full driver license for a specified amount of time. See also: List of minimum driving ages.

In sports

  • Twenty-one is a variation of street basketball, in which each player, of which there can be any number, plays for himself only (i.e. not part of a team); the name comes from the requisite number of baskets.
  • In three-on-three basketball games held under FIBA rules, branded as 3x3, the game ends by rule once either team has reached 21 points.
  • In badminton, and table tennis (before 2001), 21 points are required to win a game.
  • In AFL Women's, the top-level league of women's Australian rules football, each team is allowed a squad of 21 players (16 on the field and five interchanges).
  • In NASCAR, 21 has been used by Wood Brothers Racing and Ford for decades. The team has won 99 NASCAR Cup Series races, a majority with 21, and 5 Daytona 500's. Their current driver is Harrison Burton.

In other fields

See also: List of highways numbered 21
Building called "21" in Zlín, Czech Republic
Detail of the building entrance

21 is:

Notes

  1. This square of side length 7 is adjacent to both the "central square" with side length of 9, and the smallest square of side length 2.
  2. On the other hand, the largest member of an integer quadratic matrix representative of all numbers is 15, Φ s ( Z ≥ 0 ) = { 1 , 2 , 3 , 5 , 6 , 7 , 10 , 14 , 15 } {\displaystyle \Phi _{s}(\mathbb {Z} _{\geq 0})=\{1,2,3,5,6,7,10,14,{\mathbf {15}}\}} where the aliquot sum of 33 is 15, the second such number to have this sum after 16 (A001065); see also, 15 and 290 theorems. In this sequence, the sum of all members is 63 = 3 × 21. {\displaystyle 63=3\times 21.}

References

  1. Sloane, N. J. A. (ed.). "Sequence A001358". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  2. Sloane, N. J. A. (ed.). "Sequence A001748". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  3. "Sloane's A016105 : Blum integers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-31.
  4. "Sloane's A000217 : Triangular numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-31.
  5. "Sloane's A000567 : Octagonal numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-31.
  6. "Sloane's A001006 : Motzkin numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-31.
  7. "Sloane's A000931 : Padovan sequence". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-31.
  8. "Sloane's A005349 : Niven (or Harshad) numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-31.
  9. Sloane, N. J. A. (ed.). "Sequence A006879 (Number of primes with n digits.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  10. "Sloane's A000045 : Fibonacci numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-31.
  11. C. J. Bouwkamp, and A. J. W. Duijvestijn, "Catalogue of Simple Perfect Squared Squares of Orders 21 Through 25." Eindhoven University of Technology, Nov. 1992.
  12. Sloane, N. J. A. (ed.). "Sequence A005847 (Imaginary quadratic fields with class number 2 (a finite sequence).)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2024-03-19.
  13. Sloane, N. J. A. (ed.). "Sequence A000203 (The sum of the divisors of n. Also called sigma_1(n).)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2024-03-19.
  14. Sloane, N. J. A. (ed.). "Sequence A000396 (Perfect numbers k: k is equal to the sum of the proper divisors of k.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2024-03-19.
  15. Sloane, N. J. A. (ed.). "Sequence A000217 (Triangular numbers: a(n) binomial(n+1,2))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2024-03-19.
  16. 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 2024-03-19.
  17. 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 2023-10-13.
  18. Sloane, N. J. A. (ed.). "Sequence A116582 (Numbers from Bhargava's 33 theorem.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-10-09.
  19. Cohen, Henri (2007). "Consequences of the Hasse–Minkowski Theorem". Number Theory Volume I: Tools and Diophantine Equations. Graduate Texts in Mathematics. Vol. 239 (1st ed.). Springer. pp. 312–314. doi:10.1007/978-0-387-49923-9. ISBN 978-0-387-49922-2. OCLC 493636622. Zbl 1119.11001.
Integers
0s
100s
200s
300s
400s
500s
600s
700s
800s
900s
≥1000
Category: