Wiki Article
1105 (number)
Nguồn dữ liệu từ Wikipedia, hiển thị bởi DefZone.Net
| ||||
|---|---|---|---|---|
| Cardinal | one thousand one hundred five | |||
| Ordinal | 1105th (one thousand one hundred fifth) | |||
| Factorization | 5 × 13 × 17 | |||
| Greek numeral | ,ΑΡΕ´ | |||
| Roman numeral | MCV, mcv | |||
| Binary | 100010100012 | |||
| Ternary | 11112213 | |||
| Senary | 50416 | |||
| Octal | 21218 | |||
| Duodecimal | 78112 | |||
| Hexadecimal | 45116 | |||
1105 (eleven hundred [and] five, or one thousand one hundred [and] five) is the natural number following 1104 and preceding 1106.
Mathematical properties
[edit]1105 is the smallest positive integer that is a sum of two positive squares in exactly four different ways,[1][2] a property that can be connected (via the sum of two squares theorem) to its factorization 5 × 13 × 17 as the product of the three smallest prime numbers that are congruent to 1 modulo 4.[2][3] It is also the second-smallest Carmichael number, after 561,[4][5] one of the first four Carmichael numbers identified by R. D. Carmichael in his 1910 paper introducing this concept.[5][6] It is also a Fermat pseudoprime.[7]
It is a member of the Moser–de Bruijn sequence of sums of distinct powers of four.[8]
References
[edit]- ^ Sloane, N. J. A. (ed.). "Sequence A016032 (Least positive integer that is the sum of two squares of positive integers in exactly n ways)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ a b Tenenbaum, Gérald (1997). "1105: first steps in a mysterious quest". In Graham, Ronald L.; Nešetřil, Jaroslav (eds.). The mathematics of Paul Erdős, I. Algorithms and Combinatorics. Vol. 13. Berlin: Springer. pp. 268–275. doi:10.1007/978-3-642-60408-9_21. ISBN 978-3-642-64394-1. MR 1425191.
- ^ Sloane, N. J. A. (ed.). "Sequence A006278 (product of the first n primes congruent to 1 (mod 4))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ Sloane, N. J. A. (ed.). "Sequence A002997 (Carmichael numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ a b Křížek, Michal; Luca, Florian; Somer, Lawrence (2001). 17 Lectures on Fermat Numbers: From Number Theory to Geometry. CMS Books in Mathematics/Ouvrages de Mathématiques de la SMC. Vol. 9. Springer-Verlag, New York. p. 136. doi:10.1007/978-0-387-21850-2. ISBN 0-387-95332-9. MR 1866957.
- ^ Carmichael, R. D. (1910). "Note on a new number theory function". Bulletin of the American Mathematical Society. 16 (5): 232–238. doi:10.1090/S0002-9904-1910-01892-9. JFM 41.0226.04.
- ^ Sloane, N. J. A. (ed.). "Sequence A001567 (Fermat pseudoprimes to base 2, also called Sarrus numbers or Poulet numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ Sloane, N. J. A. (ed.). "Sequence A000695 (Moser-de Bruijn sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
| |||||||||
| |||||||||
| |||||||||
| |||||||||
