Movatterモバイル変換


[0]ホーム

URL:


Jump to content
WikipediaThe Free Encyclopedia
Search

73 (number)

From Wikipedia, the free encyclopedia
Natural number
← 7273 74 →
Cardinalseventy-three
Ordinal73rd
(seventy-third)
Factorizationprime
Prime21st
Divisors1, 73
Greek numeralΟΓ´
Roman numeralLXXIII,lxxiii
Binary10010012
Ternary22013
Senary2016
Octal1118
Duodecimal6112
Hexadecimal4916

73 (seventy-three) is thenatural number following72 and preceding74. In English, it is the smallest natural number with twelve letters in its spelled out name.

It is the 21stprime number and the fourthstar number.[1] It is also the eighthtwin prime, with71.

In mathematics

[edit]

73 is the 21stprime number, andemirp with37, the 12th prime number.[2] It is also the eighthtwin prime, with71. It is the largest minimalprimitive root in the first 100,000 primes; in other words, ifp is one of the firstone hundred thousand primes, then at least one of the numbers2,3,4,5,6, ...,73 is a primitive root modulop. 73 is also the smallest factor of the firstcompositegeneralized Fermat number indecimal:104+1=10,001=73×137{\displaystyle 10^{4}+1=10,001=73\times 137}, and the smallest primecongruent to 1 modulo24, as well as the only primerepunit inoctal (1118). It is the fourthstar number.[1]

Sheldon prime

[edit]

Where 73 and37 are part of the sequence ofpermutable primes andemirps in base-ten, the number 73 is more specifically the uniqueSheldon prime, named as an homage to TV characterSheldon Cooper and defined as satisfying "mirror" and "product" properties, where:[3]

  • 73 has 37 as the mirroring of itsdecimal digits. 73 is the 21st prime number, and 37 the 12th. The "mirror property" is fulfilled when 73 has a mirroredpermutation of its digits (37) that remains prime. Similarly, their respective prime indices (21 and 12) in thelist of prime numbers are also permutations of the same digits (1, and 2).
  • 73 is the 21st prime number. It satisfies the "product property" since the product of its decimal digits is precisely in equivalence with its index in thesequence of prime numbers. i.e., 21 = 7 × 3. On the other hand, 37 does not fulfill the product property, since, naturally, its digits also multiply to 21; therefore, the only number to fulfill this property between these two numbers is 73, and as such it is the only "Sheldon prime".

Other connections between 37 and 73

[edit]
73 as astar number (up toblue dots).37, its dualpermutable prime, is the preceding consecutive star number (up togreen dots).

73 and 37 are also consecutivestar numbers, equivalently consecutivecentered dodecagonal (12-gonal) numbers (respectively the 4th and the 3rd).[1] They are successivelucky primes andsexy primes, both twice over,[4][5][6] and successivePierpont primes, respectively the 9th and 8th.[7] 73 and 37 are consecutive values ofg(k){\displaystyle g(k)} such that everypositive integer can be written as thesum of 73 or fewer sixth powers, or 37 or fewer fifth powers (and 19 or fewerfourth powers; seeWaring's problem).[8]

73 and 37 are consecutive primes in the seven-integercovering set of the first knownSierpiński number 78,557 of the formk×2n+1{\displaystyle k\times 2^{n}+1} that iscomposite for all natural numbersn{\displaystyle n}, where 73 is the largest member:{3,5,7,13,19,37,73}.{\displaystyle \{3,5,7,13,19,37,73\}.} More specifically,78,557×2n+1{\displaystyle 78,557\times 2^{n}+1}modulo36 will be divisible by at least one of the integers in this set.[citation needed]

Consider the following sequenceA(n){\displaystyle A(n)}:[9]

Letk{\displaystyle k} be a Sierpiński number orRiesel number divisible by2n1{\displaystyle 2n-1}, and letp{\displaystyle p} be the largest number in a set of primes which cover every number of the formk×2m+1{\displaystyle k\times 2^{m}+1} or of the formk×2m1{\displaystyle k\times 2^{m}-1}, withm1{\displaystyle m\geq 1};
A(n){\displaystyle A(n)} equalsp{\displaystyle p}if and only if there exists no numberk{\displaystyle k} that has a covering set with largest prime greater thanp{\displaystyle p}.

Known such index valuesn{\displaystyle n} wherep{\displaystyle p} is equal to 73 as the largest member of such covering sets are:{1,6,9,12,15,16,21,22,24,27}{\displaystyle \{1,6,9,12,15,16,21,22,24,27\}}, with 37 present alongside 73. In particular,A(n){\displaystyle A(n)} ≥ 73 for anyn{\displaystyle n}.

In addition, 73 is the largest member in the covering set{5,7,13,73}{\displaystyle \{5,7,13,73\}} of the smallest provengeneralized Sierpiński number of the formk×bn+1{\displaystyle k\times b^{n}+1} innonary(2,344×9n+1){\displaystyle (2,344\times 9^{n}+1)}, while it is also the largest member of the covering set{7,11,13,73}{\displaystyle \{7,11,13,73\}} that belongs to the smallest such provable number indecimal(9,175×10n+1){\displaystyle (9,175\times 10^{n}+1)} — both in congruenciesmod 6{\displaystyle {\text{mod }}6}.[10][11]

Other properties

[edit]
Lah numbers forn{\displaystyle n} andk{\displaystyle k} between 1 and 4. The sum of values withn=4{\displaystyle n=4} andk={1,2,3,4}{\displaystyle k=\{1,2,3,4\}} is73.

73 is one of the fifteen left-truncatable and right-truncatable primes indecimal, meaning it remains prime when the last "right" digit is successively removed and it remains prime when the last "left" digit is successively removed; and because it is a twin prime (with 71), it is the only two-digit twin prime that is both a left-truncatable and right-truncatable prime.

The row sum ofLah numbers of the formL(n,k)=nk{\displaystyle L(n,k)=\textstyle {\left\lfloor {n \atop k}\right\rfloor }} withn=4{\displaystyle n=4} andk=1,2,3,4{\displaystyle k={1,2,3,4}} is equal to73{\displaystyle 73}.[12] These numbers representcoefficients expressingrising factorials in terms of falling factorials, and vice-versa; equivalently in this case to the number ofpartitions of{1,2,3,4}{\displaystyle \{{1,2,3,4}\}} into any number of lists, where a list means anordered subset.[13]

73 requires 115 steps to return to 1 in theCollatz problem, and 37 requires 21: {37, 112, 56, 28, 14, 7, 22, 11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2,1}.[14] Collectively, the sum between these steps is136, the 16th triangular number, where {16, 8, 4, 2, 1} is the only possible step root pathway.[15]

There are 73 three-dimensionalarithmetic crystal classes that are part of 230 crystallographic space group types.[16] These 73 groups are specificallysymmorphic groups such that all operating lattice symmetries have one common fixedisomorphicpoint, with the remaining157 groups nonsymmorphic (the 37th prime is 157).

Infive-dimensional space, there are 73Euclidean solutions of5-polytopes withuniform symmetry, excludingprismatic forms:19 from theA5{\displaystyle \mathrm {A} _{5}}simplex group,23 from theD5{\displaystyle \mathrm {D} _{5}}demihypercube group, and31 from theB5{\displaystyle \mathrm {B} _{5}}hypercubic group, of which 15 equivalent solutions are shared betweenD5{\displaystyle \mathrm {D} _{5}} andB5{\displaystyle \mathrm {B} _{5}} from distinctpolytope operations.

Inmoonshine theory ofsporadic groups, 73 is the firstnon-supersingular prime greater than 71 that does not divide theorder of the largest sporadic groupF1{\displaystyle \mathrm {F_{1}} }. All primesgreater than or equal to 73 are non-supersingular, while 37, on the other hand, is the smallest prime number that is not supersingular.[17]F1{\displaystyle \mathrm {F_{1}} } contains a total of 194conjugacy classes that involve 73 distinct orders (without includingmultiplicities over which letters run).[18]

73 is the largest member of a 17-integer matrixdefinite quadratic that represents allprime numbers: {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31,37, 41, 43, 47, 67,73},[19] with consecutive primes between2 through47.

73 is the ninth member of the sequence ofHogben's central polygonal numbers, which enumerates the maximal number of interior regions formed by nine intersecting circles.[20]

In other fields

[edit]

73 is also:

  • Amateur radio operators and othermorse code users commonly use the number 73 as a"92 Code" abbreviation for "best regards", typically when ending aQSO (a conversation with another operator). These codes also facilitate communication between operators who may not be native English speakers.[21] InMorse code, 73 is an easily recognized palindrome: ( - - · · ·   · · · - - ).
  • On aCB radio, 10-73 means "speed trap at..."

Popular culture

[edit]

The Big Bang Theory

[edit]

73 isSheldon Cooper's favorite number in the television seriesThe Big Bang Theory. He first expresses his love for it in episode 73, "The Alien Parasite Hypothesis" (2010).[22]Jim Parsons, who plays Cooper in the series, was born in1973.[23] His character often wears at-shirt with the number 73 on it.[24]

See also

[edit]

References

[edit]
  1. ^abc"Sloane's A003154 : Centered 12-gonal numbers. Also star numbers: 6*n*(n-1) + 1".The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved2016-05-29.
  2. ^"Sloane's A006567 : Emirps".The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved2016-05-29.
  3. ^Pomerance, Carl; Spicer, Chris (February 2019)."Proof of the Sheldon conjecture"(PDF).American Mathematical Monthly.126 (8):688–698.doi:10.1080/00029890.2019.1626672.S2CID 204199415.
  4. ^Sloane, N. J. A. (ed.)."Sequence A031157 (Numbers that are both lucky and prime.)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved2022-10-14.
  5. ^Sloane, N. J. A. (ed.)."Sequence A023201 (Primes p such that p + 6 is also prime. (Lesser of a pair of sexy primes.))".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved2022-10-14.
  6. ^Sloane, N. J. A. (ed.)."Sequence A046117 (Primes p such that p-6 is also prime. (Upper of a pair of sexy primes.))".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved2022-10-14.
  7. ^Sloane, N. J. A. (ed.)."Sequence A005109 (Class 1- (or Pierpont) primes)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved2022-12-19.
  8. ^Sloane, N. J. A. (ed.)."Sequence A002804 ((Presumed) solution to Waring's problem)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  9. ^Sloane, N. J. A. (ed.)."Sequence A305473 (Let k be a Sierpiński or Riesel number divisible by 2*n – 1...)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved2022-10-13.
  10. ^Brunner, Amy; Caldwell, Chris K.; Krywaruczenko, Daniel; Lownsdale, Chris (2009)."Generalized Sierpiński Numbers to Base b"(PDF).数理解析研究所講究録 [Notes from the Institute of Mathematical Analysis] (New Aspects of Analytic Number Theory).1639. Kyoto:RIMS:69–79.hdl:2433/140555.S2CID 38654417.
  11. ^Gary Barnes (December 2007)."Sierpinski conjectures and proofs (Conjectures 'R Us Project)".No Prime Left Behind (NPLB). Retrieved2024-03-10.
  12. ^Riordan, John (1968).Combinatorial Identities.John Wiley & Sons. p. 194.LCCN 67031375.MR 0231725.OCLC 681863847.
  13. ^Sloane, N. J. A. (ed.)."Sequence A000262 (Number of "sets of lists": number of partitions of {1,...,n} into any number of lists, where a list means an ordered subset.)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved2023-09-02.
  14. ^Sloane, N. J. A. (ed.)."Sequence A006577 (Number of halving and tripling steps to reach 1 in '3x+1' problem, or -1 if 1 is never reached.)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved2023-09-18.
  15. ^Sloane, N. J. A."3x+1 problem".TheOn-Line Encyclopedia of Integer Sequences. The OEIS Foundation. Retrieved2023-09-18.
  16. ^Sloane, N. J. A. (ed.)."Sequence A004027 (Number of arithmetic n-dimensional crystal classes.)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved2022-11-29.
  17. ^Sloane, N. J. A. (ed.)."Sequence A002267 (The 15 supersingular primes)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved2022-10-13.
  18. ^He, Yang-Hui;McKay, John (2015). "Sporadic and Exceptional". p. 20.arXiv:1505.06742 [math.AG].
  19. ^Sloane, N. J. A. (ed.)."Sequence A154363 (Numbers from Bhargava's prime-universality criterion theorem)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  20. ^Sloane, N. J. A. (ed.)."Sequence A002061 (Central polygonal numbers: a(n) equal to n^2 - n + 1.)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved2024-02-29.
  21. ^"Ham Radio History".
  22. ^"The Big Bang Theory (TV Series) - The Alien Parasite Hypothesis (2010) - Jim Parsons: Sheldon Cooper".IMDb. Retrieved13 March 2023.
  23. ^"Jim Parsons".IMDb.
  24. ^"The Alien Parasite Hypothesis".The Big Bang Theory. Season 4. Episode 10.
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=73_(number)&oldid=1320257385"
Category:
Hidden categories:

[8]ページ先頭

©2009-2025 Movatter.jp