Movatterモバイル変換


[0]ホーム

URL:


Jump to content
WikipediaThe Free Encyclopedia
Search

21 (number)

Page semi-protected
From Wikipedia, the free encyclopedia
Natural number
"XXI" and "Twenty-One" redirect here. For other uses, see21.

Natural number
← 2021 22 →
Cardinaltwenty-one
Ordinal21st
(twenty-first)
Factorization3 × 7
Divisors1, 3, 7, 21
Greek numeralΚΑ´
Roman numeralXXI,xxi
Binary101012
Ternary2103
Senary336
Octal258
Duodecimal1912
Hexadecimal1516

21 (twenty-one) is thenatural number following20 and preceding22.

The current century is the21st century AD, under theGregorian calendar.

Mathematics

Twenty-one is the fifth distinctsemiprime,[1] and the second of the form3×q{\displaystyle 3\times q} whereq{\displaystyle q} is a higher prime.[2] It is arepdigit inquaternary (1114).

Properties

As abiprime with properdivisors1,3 and7, twenty-one has a primealiquot sum of11 within an aliquot sequence containing only one composite number (21,11,1,0). 21 is the first member of the second cluster of consecutive discretesemiprimes (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 between100 and200.

21 is the firstBlum integer, since it is a semiprime with both itsprime factors beingGaussian primes.[3]

While 21 is the sixthtriangular number,[4] it is also the sum of thedivisors of the first fivepositive integers:

1+2+3+4+5+6=211+(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-trivialoctagonal number.[5] It is the fifthMotzkin number,[6] and the seventeenthPadovan number (preceded by the terms9,12, and16, where it is the sum of the first two of these).[7]

Indecimal, the number of two-digit prime numbers is twenty-one (a base in which 21 is the fourteenthHarshad number).[8][9] It is the smallest non-trivial example in base ten of aFibonacci number (where 21 is the 8th member, as the sum of the preceding terms in the sequence8 and13) whose digits (2,1) are Fibonacci numbers and whosedigit sum is also a Fibonacci number (3).[10] It is also the largest positiveintegern{\displaystyle n} in decimal such that for any positive integersa,b{\displaystyle a,b} wherea+b=n{\displaystyle a+b=n}, at least one ofab{\displaystyle {\tfrac {a}{b}}} andba{\displaystyle {\tfrac {b}{a}}} is a terminating decimal; see proof below:

Proof

For anya{\displaystyle a} coprime ton{\displaystyle n} andna{\displaystyle n-a}, the condition above holds when one ofa{\displaystyle a} andna{\displaystyle n-a} only has factors2{\displaystyle 2} and5{\displaystyle 5} (for a representation inbase ten).

LetA(n){\displaystyle A(n)} denote the quantity of the numbers smaller thann{\displaystyle n} that only have factor2{\displaystyle 2} and5{\displaystyle 5} and that are coprime ton{\displaystyle n}, we instantly haveφ(n)2<A(n){\displaystyle {\frac {\varphi (n)}{2}}<A(n)}.

We can easily see that for sufficiently largen{\displaystyle n},A(n)log2(n)log5(n)2=ln2(n)2ln(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)neγlnlnn{\displaystyle \varphi (n)\sim {\frac {n}{e^{\gamma }\;\ln \ln n}}} whereA(n)=o(φ(n)){\displaystyle A(n)=o(\varphi (n))} asn{\displaystyle n} approachesinfinity; thusφ(n)2<A(n){\displaystyle {\frac {\varphi (n)}{2}}<A(n)} fails to hold for sufficiently largen{\displaystyle n}.

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

A(n)<1+log2(n)+3log5(n)2+log2(n)log5(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)>neγloglogn+3loglogn.{\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 whenn>273{\displaystyle n>273} (actually, whenn>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 apower of two(2n){\displaystyle (2^{n})}, where the range of nearness is±n.{\displaystyle \pm {n}.}

Squaring the square

The minimum number ofsquares needed tosquare the square (using differentedge-lengths) is 21.

Twenty-one is the smallest number of differently sizedsquares needed tosquare the square.[11]

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 of427 when excluding a square of side length7{\displaystyle 7};[a] this sum represents the largest square-free integer over a quadratic field of class number two, where163 is the largest such (Heegner) number of class one.[12] 427 number is also the first number to hold asum-of-divisors in equivalence with the thirdperfect number and thirty-firsttriangular number (496),[13][14][15] where it is also the fiftieth number to return0{\displaystyle 0} in theMertens function.[16]

Quadratic matrices in Z

While the twenty-first prime number73 is the largest member of Bhargava'sdefinite quadratic 17–integer matrixΦs(P){\displaystyle \Phi _{s}(P)} representative of allprime numbers,[17]Φ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 number33 is the largest member of a like definite quadratic 7–integer matrix[18]Φs(2Z0+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 allodd numbers.[19][b]

Age 21

In sports

In other fields

See also:List of highways numbered 21
Building called "21" inZlí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 ofall numbers is 15,Φs(Z0)={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 thealiquot sum of 33 is15, the second such number to have this sum after16 (A001065); see also,15 and 290 theorems. In this sequence, the sum of all members is63=3×21.{\displaystyle 63=3\times 21.}

References

  1. ^Sloane, N. J. A. (ed.)."Sequence A001358".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  2. ^Sloane, N. J. A. (ed.)."Sequence A001748".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  3. ^"Sloane's A016105 : Blum integers".The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved2016-05-31.
  4. ^"Sloane's A000217 : Triangular numbers".The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved2016-05-31.
  5. ^"Sloane's A000567 : Octagonal numbers".The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved2016-05-31.
  6. ^"Sloane's A001006 : Motzkin numbers".The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved2016-05-31.
  7. ^"Sloane's A000931 : Padovan sequence".The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved2016-05-31.
  8. ^"Sloane's A005349 : Niven (or Harshad) numbers".The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved2016-05-31.
  9. ^Sloane, N. J. A. (ed.)."Sequence A006879 (Number of primes with n digits.)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  10. ^"Sloane's A000045 : Fibonacci numbers".The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved2016-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).)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved2024-03-19.
  13. ^Sloane, N. J. A. (ed.)."Sequence A000203 (The sum of the divisors of n. Also called sigma_1(n).)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved2024-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.)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved2024-03-19.
  15. ^Sloane, N. J. A. (ed.)."Sequence A000217 (Triangular numbers: a(n) binomial(n+1,2))".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved2024-03-19.
  16. ^Sloane, N. J. A. (ed.)."Sequence A028442 (Numbers k such that Mertens's function M(k) (A002321) is zero.)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved2024-03-19.
  17. ^Sloane, N. J. A. (ed.)."Sequence A154363 (Numbers from Bhargava's prime-universality criterion theorem)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved2023-10-13.
  18. ^Sloane, N. J. A. (ed.)."Sequence A116582 (Numbers from Bhargava's 33 theorem.)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved2023-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.
Wikimedia Commons has media related to21 (number).
0 to 199
200 to 399
400 to 999
1000s and 10,000s
1000s
10,000s
100,000s to 10,000,000,000,000s
Retrieved from "https://en.wikipedia.org/w/index.php?title=21_(number)&oldid=1320195938"
Category:
Hidden categories:

[8]ページ先頭

©2009-2025 Movatter.jp