Asal sayı (Turkish Wikipedia)

Analysis of information sources in references of the Wikipedia article "Asal sayı" in Turkish language version.

refsWebsite

Global rank Turkish rank

80books.google.com

3^rd place

5^th place

46doi.org

2^nd place

4^th place

45ams.org

451^st place

1,743^rd place

33web.archive.org

1^st place

21archive.org

6^th place

12jstor.org

26^th place

90^th place

7worldcat.org

5^th place

8^th place

7harvard.edu

18^th place

47^th place

7arxiv.org

69^th place

232^nd place

5utm.edu

1,379^th place

684^th place

4wolfram.com

513^th place

669^th place

4psu.edu

207^th place

424^th place

4dartmouth.edu

2,242^nd place

4,872^nd place

2uwaterloo.ca

3,153^rd place

2,528^th place

2terrytao.wordpress.com

low place

2eff.org

3,285^th place

3,661^st place

2maa.org

3,479^th place

3,553^rd place

1mersenne.org

low place

1st-andrews.ac.uk

1,547^th place

1,164^th place

1mathdoc.fr

low place

1geocities.com

1,151^st place

702^nd place

1clarku.edu

6,602^nd place

4,190^th place

1hathitrust.org

441^st place

904^th place

1numdam.org

8,650^th place

6,980^th place

1archives-ouvertes.fr

1,031^st place

3,199^th place

1handle.net

102^nd place

447^th place

1free.fr

321^st place

1,072^nd place

1primegrid.com

low place

1nodak.edu

5,218^th place

3,646^th place

1theregister.co.uk

1,216^th place

990^th place

1rfc-editor.org

6,184^th place

5,389^th place

1iop.org

1,725^th place

1,928^th place

1nih.gov

4^th place

11^th place

1economist.com

254^th place

272^nd place

1nationalgeographic.com

344^th place

295^th place

1theguardian.com

12^th place

44^th place

1nytimes.com

7^th place

36^th place

ams.org

Ziegler, Günter M. (2004). "The great prime number record races". Notices of the American Mathematical Society. 51 (4): 414-416. MR 2039814.
Sierpiński, Wacław (1964). A Selection of Problems in the Theory of Numbers. New York: Macmillan. s. 40. MR 0170843.
Nathanson, Melvyn B. (2000). "Notations and Conventions". Elementary Methods in Number Theory. Graduate Texts in Mathematics. 195. Springer. ISBN 978-0-387-22738-2. MR 1732941.
Bruins, Evert Marie, review in Mathematical Reviews of Gillings, R.J. (1974). "The recto of the Rhind Mathematical Papyrus. How did the ancient Egyptian scribe prepare it?". Archive for History of Exact Sciences. 12 (4). ss. 291-298. doi:10.1007/BF01307175. MR 0497458.
Mollin, Richard A. (2002). "A brief history of factoring and primality testing B. C. (before computers)". Mathematics Magazine. 75 (1). ss. 18-29. doi:10.2307/3219180. JSTOR 3219180. MR 2107288.
Apostol, Tom M. (2000). "Asal sayı teoreminin yüzyıllık tarihi". Bambah, R.P.; Dumir, V.C.; Hans-Gill, R.J. (Ed.). Sayı Teorisi. Matematikte Eğilimler. Basel: Birkhäuser. ss. 1-14. MR 1764793.
Apostol, Tom M. (1976). "7. Aritmetik Dizilerdeki Asallar Üzerine Dirichlet Teoremi". Analitik Sayı Teorisi'ne Giriş. New York; Heidelberg: Springer-Verlag. ss. 146-156. MR 0434929.
Katz, Shaul (2004). "Berlin roots – Zionist incarnation: the ethos of pure mathematics and the beginnings of the Einstein Institute of Mathematics at the Hebrew University of Jerusalem". Science in Context. 17 (1–2). ss. 199-234. doi:10.1017/S0269889704000092. ISSN 0269-8897. MR 2089305.
Caldwell, Chris K.; Reddick, Angela; Xiong, Yeng; Keller, Wilfrid (2012). "The history of the primality of one: a selection of sources". Journal of Integer Sequences. 15 (9): Article 12.9.8. MR 3005523. 12 Nisan 2018 tarihinde kaynağından arşivlendi. Erişim tarihi: 8 Mart 2024. For a selection of quotes from and about the ancient Greek positions on the status of 1 and 2, see in particular pp. 3–4. For the Islamic mathematicians, see p. 6.
Caldwell, Chris K.; Xiong, Yeng (2012). "What is the smallest prime?" (PDF). Journal of Integer Sequences. 15 (9): Article 12.9.7. MR 3005530. 12 Nisan 2018 tarihinde kaynağından arşivlendi (PDF). Erişim tarihi: 8 Mart 2024.
Conway, John Horton; Guy, Richard K. (1996). The Book of Numbers. New York: Copernicus. ss. 129-130. doi:10.1007/978-1-4612-4072-3. ISBN 978-0-387-97993-9. MR 1411676.
Furstenberg, Harry (1955). "On the infinitude of primes". American Mathematical Monthly. 62 (5). s. 353. doi:10.2307/2307043. JSTOR 2307043. MR 0068566.
Oliveira e Silva, Tomás; Herzog, Siegfried; Pardi, Silvio (2014). "Empirical verification of the even Goldbach conjecture and computation of prime gaps up to $4\cdot 10^{18}$ ". Mathematics of Computation. 83 (288). ss. 2033-2060. doi:10.1090/S0025-5718-2013-02787-1. MR 3194140.
Ramaré, Olivier (1995). "On Šnirel'man's constant". Annali della Scuola Normale Superiore di Pisa. 22 (4). ss. 645-706. MR 1375315. 9 Şubat 2022 tarihinde kaynağından arşivlendi. Erişim tarihi: 23 Ocak 2018.
Rassias, Michael Th. (2017). Goldbach's Problem: Selected Topics. Cham: Springer. s. vii. doi:10.1007/978-3-319-57914-6. ISBN 978-3-319-57912-2. MR 3674356.
Hua, L.K. (2009) [1965]. Additive Theory of Prime Numbers. Translations of Mathematical Monographs. 13. Providence, RI: American Mathematical Society. ss. 176-177. ISBN 978-0-8218-4942-2. MR 0194404. OCLC 824812353.
Patterson, S.J. (1988). An introduction to the theory of the Riemann zeta-function. Cambridge Studies in Advanced Mathematics. 14. Cambridge University Press, Cambridge. s. 1. doi:10.1017/CBO9780511623707. ISBN 978-0-521-33535-5. MR 0933558.
Borwein, Peter; Choi, Stephen; Rooney, Brendan; Weirathmueller, Andrea (2008). Riemann hipotezi: Aficionado ve virtüöz için bir kaynak. CMS Matematik Kitapları/SMC Mathématiques Ouvrages. New York: Springer. ss. 10-11. doi:10.1007/978-0-387-72126-2. ISBN 978-0-387-72125-5. MR 2463715.
Childress, Nancy (2009). Class Field Theory. Universitext. Springer, New York. ss. 8-11. doi:10.1007/978-0-387-72490-4. ISBN 978-0-387-72489-8. MR 2462595. See also p. 64.
Erickson, Marty; Vazzana, Anthony; Garth, David (2016). Introduction to Number Theory. Textbooks in Mathematics (2.2 isbn = 978-1-4987-1749-6 bas.). Boca Raton, FL: CRC Press. s. 200. MR 3468748. KB1 bakım: Dikey çizgi eksik (link)
Weil, André (1995). Basic Number Theory. Classics in Mathematics. Berlin: Springer-Verlag. s. 43. ISBN 978-3-540-58655-5. MR 1344916. Note however that some authors such as Childress (2009) instead use "place" to mean an equivalence class of norms.
Koch, H. (1997). Algebraic Number Theory. Berlin: Springer-Verlag. s. 136. CiteSeerX 10.1.1.309.8812 $2. doi:10.1007/978-3-642-58095-6. ISBN 978-3-540-63003-6. MR 1474965.
Lauritzen, Niels (2003). Concrete Abstract Algebra: From numbers to Gröbner bases. Cambridge: Cambridge University Press. s. 127. doi:10.1017/CBO9780511804229. ISBN 978-0-521-53410-9. MR 2014325.
Eisenbud, David (1995). Commutative Algebra. Graduate Texts in Mathematics. 150. Section 3.3: Springer-Verlag. doi:10.1007/978-1-4612-5350-1. ISBN 978-0-387-94268-1. MR 1322960.
Shafarevich, Igor R. (2013). "Definition of $\operatorname {Spec} A$ ". Basic Algebraic Geometry 2: Schemes and Complex Manifolds (3.3 isbn = 978-3-642-38009-9 bas.). Springer, Heidelberg. s. 5. doi:10.1007/978-3-642-38010-5. MR 3100288. KB1 bakım: Dikey çizgi eksik (link)
Neukirch, Jürgen (1999). Algebraic Number Theory. Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences]. 322. Section I.8, p. 50: Springer-Verlag. doi:10.1007/978-3-662-03983-0. ISBN 978-3-540-65399-8. MR 1697859.
Stevenhagen, P.; Lenstra, H.W. Jr. (1996). "Chebotarëv and his density theorem". The Mathematical Intelligencer. 18 (2): 26-37. CiteSeerX 10.1.1.116.9409 $2. doi:10.1007/BF03027290. MR 1395088.
Hromkovič, Juraj (2001). "5.5 Bibliographic Remarks". Algorithmics for Hard Problems. Texts in Theoretical Computer Science. An EATCS Series. Springer-Verlag, Berlin. ss. 383-385. doi:10.1007/978-3-662-04616-6. ISBN 978-3-540-66860-2. MR 1843669.
Koblitz, Neal (1987). "Chapter V. Primality and Factoring". A Course in Number Theory and Cryptography. Graduate Texts in Mathematics. 114. Springer-Verlag, New York. ss. 112-149. doi:10.1007/978-1-4684-0310-7_5. ISBN 978-0-387-96576-5. MR 0910297.
Tao, Terence (2010). "1.11 The AKS primality test". An epsilon of room, II: Pages from year three of a mathematical blog. Graduate Studies in Mathematics. 117. Providence, RI: American Mathematical Society. ss. 82-86. doi:10.1090/gsm/117. ISBN 978-0-8218-5280-4. MR 2780010.
Atkin, A O.L.; Morain, F. (1993). "Elliptic curves and primality proving" (PDF). Mathematics of Computation. 61 (203): 29-68. Bibcode:1993MaCom..61...29A. doi:10.1090/s0025-5718-1993-1199989-x. JSTOR 2152935. MR 1199989.
Morain, F. (2007). "Implementing the asymptotically fast version of the elliptic curve primality proving algorithm". Mathematics of Computation. 76 (257): 493-505. arXiv:math/0502097 $2. Bibcode:2007MaCom..76..493M. doi:10.1090/S0025-5718-06-01890-4. MR 2261033.
Lenstra, H. W. Jr.; Pomerance, Carl (2019). "Primality testing with Gaussian periods" (PDF). Journal of the European Mathematical Society. 21 (4): 1229-1269. doi:10.4171/JEMS/861. hdl:21.11116/0000-0005-717D-0. MR 3941463. 27 Aralık 2023 tarihinde kaynağından arşivlendi (PDF). Erişim tarihi: 26 Mart 2024.
Robert Baillie; Samuel S. Wagstaff, Jr. (October 1980). "Lucas Pseudoprimes" (PDF). Mathematics of Computation. 35 (152): 1391-1417. doi:10.1090/S0025-5718-1980-0583518-6 . JSTOR 2006406. MR 0583518. 4 Mart 2016 tarihinde kaynağından arşivlendi (PDF). Erişim tarihi: 26 Mart 2024.
Monier, Louis (1980). "Evaluation and comparison of two efficient probabilistic primality testing algorithms". Theoretical Computer Science. 12 (1): 97-108. doi:10.1016/0304-3975(80)90007-9. MR 0582244.
Tao, Terence (2009). "1.7 The Lucas–Lehmer test for Mersenne primes". Poincaré's legacies, pages from year two of a mathematical blog. Part I. Providence, RI: American Mathematical Society. ss. 36-41. ISBN 978-0-8218-4883-8. MR 2523047.
Pomerance, Carl (1996). "A tale of two sieves". Notices of the American Mathematical Society. 43 (12): 1473-1485. MR 1416721.
Roth, K.F. (1951). "On a problem of Heilbronn". Journal of the London Mathematical Society. Second Series. 26 (3). ss. 198-204. doi:10.1112/jlms/s1-26.3.198. MR 0041889.
Lang, Serge (2002). Algebra. Graduate Texts in Mathematics. 211. Berlin; New York: Springer-Verlag. doi:10.1007/978-1-4613-0041-0. ISBN 978-0-387-95385-4. MR 1878556. , Section II.1, s. 90
Schubert, Horst (1949). "Die eindeutige Zerlegbarkeit eines Knotens in Primknoten". S.-B Heidelberger Akad. Wiss. Math.-Nat. Kl. 1949 (3). ss. 57-104. MR 0031733.
Milnor, J. (1962). "A unique decomposition theorem for 3-manifolds". American Journal of Mathematics. 84 (1). ss. 1-7. doi:10.2307/2372800. JSTOR 2372800. MR 0142125.
Křížek, Michal; Luca, Florian; Somer, Lawrence (2001). 17 Lectures on Fermat Numbers: From Number Theory to Geometry. CMS Books in Mathematics. 9. New York: Springer-Verlag. ss. 1-2. doi:10.1007/978-0-387-21850-2. ISBN 978-0-387-95332-8. MR 1866957.
Gleason, Andrew M. (1988). "Angle trisection, the heptagon, and the triskaidecagon". American Mathematical Monthly. 95 (3). ss. 185-194. doi:10.2307/2323624. JSTOR 2323624. MR 0935432.
Ziegler, Günter M. (2015). "Cannons at sparrows". European Mathematical Society Newsletter, 95. ss. 25-31. MR 3330472.
Pomerance, Carl (2004). "Prime Numbers and the Search for Extraterrestrial Intelligence" (PDF). Hayes, David F.; Ross, Peter (Ed.). Mathematical Adventures for Students and Amateurs. MAA Spectrum. Washington, DC: Mathematical Association of America. ss. 3-6. ISBN 978-0-88385-548-5. MR 2085842.

archive.org

Gardiner, Anthony (1997). The Mathematical Olympiad Handbook: An Introduction to Problem Solving Based on the First 32 British Mathematical Olympiads 1965–1996. Oxford University Press. s. 26. ISBN 978-0-19-850105-3.
Adler, Irving (1960). The Giant Golden Book of Mathematics: Exploring the World of Numbers and Space. Golden Press. s. 16. OCLC 6975809.
Leff, Lawrence S. (2000). Math Workbook for the SAT I. Barron's Educational Series. s. 360. ISBN 978-0-7641-0768-9.
Dudley, Underwood (1978). "Section 2: Unique factorization". Elementary number theory (2. bas.). W.H. Freeman and Co. s. 10. ISBN 978-0-7167-0076-0.
Sierpiński, Wacław (1964). A Selection of Problems in the Theory of Numbers. New York: Macmillan. s. 40. MR 0170843.
Pomerance, Carl (Aralık 1982). "The Search for Prime Numbers". Scientific American. 247 (6). ss. 136-147. Bibcode:1982SciAm.247f.136P. doi:10.1038/scientificamerican1282-136. JSTOR 24966751.
Mollin, Richard A. (2002). "A brief history of factoring and primality testing B. C. (before computers)". Mathematics Magazine. 75 (1). ss. 18-29. doi:10.2307/3219180. JSTOR 3219180. MR 2107288.
Conway, John Horton; Guy, Richard K. (1996). The Book of Numbers. New York: Copernicus. ss. 129-130. doi:10.1007/978-1-4612-4072-3. ISBN 978-0-387-97993-9. MR 1411676.
Gowers, T (2002). Mathematics: A Very Short Introduction. Oxford University Press. ss. 118. ISBN 0-19-285361-9. The seemingly arbitrary exclusion of 1 from the definition of a prime … does not express some deep fact about numbers: it just happens to be a useful convention, adopted so there is only one way of factorizing any given number into primes
du Sautoy, Marcus (2003). The Music of the Primes: Searching to Solve the Greatest Mystery in Mathematics. Harper Collins. s. 23. ISBN 978-0-06-093558-0.
Rotman, Joseph J. (2000). A First Course in Abstract Algebra (2.2yayıncı=Prentice Hall bas.). Problem 1.40, p. 56. ISBN 978-0-13-011584-3.
Furstenberg, Harry (1955). "On the infinitude of primes". American Mathematical Monthly. 62 (5). s. 353. doi:10.2307/2307043. JSTOR 2307043. MR 0068566.
Mackinnon, Nick (June 1987). "Prime number formulae". The Mathematical Gazette. 71 (456): 113-114. doi:10.2307/3616496. JSTOR 3616496.
Wright, E.M. (1951). "A prime-representing function". American Mathematical Monthly. 58 (9): 616-618. doi:10.2307/2306356. JSTOR 2306356.
Green, Ben; Tao, Terence (2008). "The primes contain arbitrarily long arithmetic progressions". Annals of Mathematics. 167 (2): 481-547. arXiv:math.NT/0404188 $2. doi:10.4007/annals.2008.167.481.
Weil, André (1995). Basic Number Theory. Classics in Mathematics. Berlin: Springer-Verlag. s. 43. ISBN 978-3-540-58655-5. MR 1344916. Note however that some authors such as Childress (2009) instead use "place" to mean an equivalence class of norms.
Stevenhagen, P.; Lenstra, H.W. Jr. (1996). "Chebotarëv and his density theorem". The Mathematical Intelligencer. 18 (2): 26-37. CiteSeerX 10.1.1.116.9409 $2. doi:10.1007/BF03027290. MR 1395088.
Giblin, Peter (1993). Primes and Programming. Cambridge University Press. s. 39. ISBN 978-0-521-40988-9.
Giblin 1993, p. 54
Goodrich, Michael T.; Tamassia, Roberto (2006). Data Structures & Algorithms in Java. 4th. John Wiley & Sons. ISBN 978-0-471-73884-8. "Quadratic probing" hakkında bilgi için, sayfa 382 ve alıştırma C–9.9, sayfa 415'e bakınız.
Gleason, Andrew M. (1988). "Angle trisection, the heptagon, and the triskaidecagon". American Mathematical Monthly. 95 (3). ss. 185-194. doi:10.2307/2323624. JSTOR 2323624. MR 0935432.

archives-ouvertes.fr

hal-univ-paris8.archives-ouvertes.fr

Bullynck, Maarten (2010). "A history of factor tables with notes on the birth of number theory 1657–1817". Revue d'Histoire des Mathématiques. 16 (2): 133-216. 4 Haziran 2023 tarihinde kaynağından arşivlendi. Erişim tarihi: 25 Mart 2024.

arxiv.org

Green, Ben; Tao, Terence (2008). "The primes contain arbitrarily long arithmetic progressions". Annals of Mathematics. 167 (2): 481-547. arXiv:math.NT/0404188 $2. doi:10.4007/annals.2008.167.481.
Farach-Colton, Martín; Tsai, Meng-Tsung (2015). "On the complexity of computing prime tables". Elbassioni, Khaled; Makino, Kazuhisa (Ed.). Algorithms and Computation: 26th International Symposium, ISAAC 2015, Nagoya, Japan, December 9-11, 2015, Proceedings. Lecture Notes in Computer Science. 9472. Springer. ss. 677-688. arXiv:1504.05240 $2. doi:10.1007/978-3-662-48971-0_57. ISBN 978-3-662-48970-3.
Morain, F. (2007). "Implementing the asymptotically fast version of the elliptic curve primality proving algorithm". Mathematics of Computation. 76 (257): 493-505. arXiv:math/0502097 $2. Bibcode:2007MaCom..76..493M. doi:10.1090/S0025-5718-06-01890-4. MR 2261033.
Martín-López, Enrique; Laing, Anthony; Lawson, Thomas; Alvarez, Roberto; Zhou, Xiao-Qi; O'Brien, Jeremy L. (12 Ekim 2012). "Experimental realization of Shor's quantum factoring algorithm using qubit recycling". Nature Photonics. 6 (11). ss. 773-776. arXiv:1111.4147 $2. Bibcode:2012NaPho...6..773M. doi:10.1038/nphoton.2012.259.
Boklan, Kent D.; Conway, John H. (January 2017). "Expect at most one billionth of a new Fermat prime!". The Mathematical Intelligencer. 39 (1). ss. 3-5. arXiv:1605.01371 $2. doi:10.1007/s00283-016-9644-3.
Zhu, Huangjun (2010). "SIC POVMs and Clifford groups in prime dimensions". Journal of Physics A: Mathematical and Theoretical. 43 (30). s. 305305. arXiv:1003.3591 $2. Bibcode:2010JPhA...43D5305Z. doi:10.1088/1751-8113/43/30/305305.
Campos, Paulo R.A.; de Oliveira, Viviane M.; Giro, Ronaldo; Galvão, Douglas S. (2004). "Emergence of prime numbers as the result of evolutionary strategy". Physical Review Letters. 93 (9). s. 098107. arXiv:q-bio/0406017 $2. Bibcode:2004PhRvL..93i8107C. doi:10.1103/PhysRevLett.93.098107. PMID 15447148.

books.google.com

Henderson, Anne (2014). Dyslexia, Dyscalculia and Mathematics: A practical guide (2. bas.). Routledge. s. 62. ISBN 978-1-136-63662-2.
Dudley, Underwood (1978). "Section 2: Unique factorization". Elementary number theory (2. bas.). W.H. Freeman and Co. s. 10. ISBN 978-0-7167-0076-0.
Sierpiński, Wacław (1988). Elementary Theory of Numbers. North-Holland Mathematical Library. 31 (2. bas.). Elsevier. s. 113. ISBN 978-0-08-096019-7.
Stillwell, John (1997). Numbers and Geometry. Undergraduate Texts in Mathematics. Springer. s. 9. ISBN 978-0-387-98289-2.
Nathanson, Melvyn B. (2000). "Notations and Conventions". Elementary Methods in Number Theory. Graduate Texts in Mathematics. 195. Springer. ISBN 978-0-387-22738-2. MR 1732941.
Faticoni, Theodore G. (2012). The Mathematics of Infinity: A Guide to Great Ideas. Pure and Applied Mathematics: A Wiley Series of Texts, Monographs and Tracts. 111 (2.2yayıncı=John Wiley & Sons bas.). s. 44. ISBN 978-1-118-24382-4.
Stillwell, John (2010). Mathematics and Its History. Undergraduate Texts in Mathematics (3. bas.). Springer. s. 40. ISBN 978-1-4419-6052-8.
Sandifer 2007, 8. Fermat's Little Theorem (November 2003), p. 45
Sandifer, C. Edward (2014). How Euler Did Even More. Mathematical Association of America. s. 42. ISBN 978-0-88385-584-3.
Koshy, Thomas (2002). Elementary Number Theory with Applications. Academic Press. s. 369. ISBN 978-0-12-421171-1.
Yuan, Wang (2002). Goldbach Conjecture. Series In Pure Mathematics (2.2cilt=4 bas.). World Scientific. s. 21. ISBN 978-981-4487-52-8.
Narkiewicz, Wladyslaw (2000). "1.2 Sum of Reciprocals of Primes". The Development of Prime Number Theory: From Euclid to Hardy and Littlewood. Springer Monographs in Mathematics. Springer. s. 11. ISBN 978-3-540-66289-1.
Apostol, Tom M. (2000). "Asal sayı teoreminin yüzyıllık tarihi". Bambah, R.P.; Dumir, V.C.; Hans-Gill, R.J. (Ed.). Sayı Teorisi. Matematikte Eğilimler. Basel: Birkhäuser. ss. 1-14. MR 1764793.
Apostol, Tom M. (1976). "7. Aritmetik Dizilerdeki Asallar Üzerine Dirichlet Teoremi". Analitik Sayı Teorisi'ne Giriş. New York; Heidelberg: Springer-Verlag. ss. 146-156. MR 0434929.
Chabert, Jean-Luc (2012). A History of Algorithms: From the Pebble to the Microchip. Springer. s. 261. ISBN 978-3-642-18192-4.
Cooper, S. Barry; Hodges, Andrew (2016). The Once and Future Turing. Cambridge University Press. ss. 37-38. ISBN 978-1-107-01083-3.
Beiler, Albert H. (1999) [1966]. Recreations in the Theory of Numbers: The Queen of Mathematics Entertains. Dover. s. 2. ISBN 978-0-486-21096-4. OCLC 444171535.
Kraft, James S.; Washington, Lawrence C. (2014). Elementary Number Theory. Textbooks in mathematics. CRC Press. s. 7. ISBN 978-1-4987-0269-0.
Bauer, Craig P. (2013). Secret History: The Story of Cryptology. Discrete Mathematics and Its Applications. CRC Press. s. 468. ISBN 978-1-4665-6186-1.
Klee, Victor; Wagon, Stan (1991). Old and New Unsolved Problems in Plane Geometry and Number Theory. Dolciani mathematical expositions. 11. Cambridge University Press. s. 224. ISBN 978-0-88385-315-3.
Tarán, Leonardo (1981). Speusippus of Athens: A Critical Study With a Collection of the Related Texts and Commentary. Philosophia Antiqua : A Series of Monographs on Ancient Philosophy. 39. Brill. ss. 35-38. ISBN 978-90-04-06505-5.
Riesel, Hans (1994). Prime Numbers and Computer Methods for Factorization (2.2mr=1292250 bas.). Basel, Switzerland: Birkhäuser. s. 36. doi:10.1007/978-1-4612-0251-6. ISBN 978-0-8176-3743-9.
Totient için bkz. Sierpiński 1988, s. 245. Bölenlerin toplamı için bkz. Sandifer, C. Edward (2007). How Euler Did It. MAA Spectrum. Mathematical Association of America. s. 59. ISBN 978-0-88385-563-8.
Smith, Karl J. (2011). The Nature of Mathematics (12.12yayıncı=Cengage Learning bas.). s. 188. ISBN 978-0-538-73758-6.
Dudley 1978, Section 2, Theorem 2, p. 16; Neale, Vicky (2017). Closing the Gap: The Quest to Understand Prime Numbers. p. 107: Oxford University Press. ISBN 978-0-19-109243-5.
Dudley 1978, Section 2, Lemma 5, p. 15; Higgins, Peter M. (1998). Mathematics for the Curious. Oxford University Press. ss. 77-78. ISBN 978-0-19-150050-3.
Ribenboim, Paulo (2004). The little book of bigger primes. Berlin; New York: Springer-Verlag. s. 4. ISBN 978-0-387-20169-6.
Matiyasevich, Yuri V. (1999). "Formulas for prime numbers". Tabachnikov, Serge (Ed.). Kvant Selecta: Algebra and Analysis. II. American Mathematical Society. ss. 13-24. ISBN 978-0-8218-1915-9.
Guy 2013, p. vii.
Guy 2013, C1 Goldbach's conjecture, pp. 105–107.
Tao 2009, 3.1 Structure and randomness in the prime numbers, pp. 239–247. See especially p. 239.
Rassias, Michael Th. (2017). Goldbach's Problem: Selected Topics. Cham: Springer. s. vii. doi:10.1007/978-3-319-57914-6. ISBN 978-3-319-57912-2. MR 3674356.
Koshy 2002, Theorem 2.14, p. 109. Riesel 1994, faktöriyel yerine asal çarpanın kullanıldığı benzer bir mantıksal çıkarımı sunmaktadır.
Riesel 1994, "Large gaps between consecutive primes", pp. 78–79.
Sandifer 2007, Chapter 35, Estimating the Basel problem, pp. 205–208.
Ogilvy, C.S.; Anderson, J.T. (1988). Excursions in Number Theory. Dover Publications Inc. ss. 29-35. ISBN 978-0-486-25778-5.
Miller, Steven J.; Takloo-Bighash, Ramin (2006). An Invitation to Modern Number Theory. Princeton University Press. ss. 43-44. ISBN 978-0-691-12060-7.
Crandall & Pomerance 2005, p. 6.
Crandall & Pomerance 2005, Section 3.7, Counting primes, pp. 152–162.
Crandall & Pomerance 2005, p. 10.
du Sautoy, Marcus (2011). "What are the odds that your telephone number is prime?". The Number Mysteries: A Mathematical Odyssey through Everyday Life. St. Martin's Press. ss. 50-52. ISBN 978-0-230-12028-0.
Gelfand, I.M.; Shen, Alexander (2003). Algebra. Springer. s. 37. ISBN 978-0-8176-3677-7.
Mollin, Richard A. (1997). Fundamental Number Theory with Applications. Discrete Mathematics and Its Applications. CRC Press. s. 76. ISBN 978-0-8493-3987-5.
Crandall & Pomerance 2005, Theorem 1.1.5, p. 12.
The sequence of these primes, starting at $n=1$ rather than $n=0$ , is listed by Lava, Paolo Pietro; Balzarotti, Giorgio (2010). "Chapter 33. Formule fortunate". 103 curiosità matematiche: Teoria dei numeri, delle cifre e delle relazioni nella matematica contemporanea (İtalyanca). Ulrico Hoepli Editore S.p.A. s. 133. ISBN 978-88-203-5804-4.
Chamberland, Marc (2015). "The Heegner numbers". Single Digits: In Praise of Small Numbers. Princeton University Press. ss. 213-215. ISBN 978-1-4008-6569-7.
Guy (2013). "A1 Prime values of quadratic functions". Unsolved Problems in Number Theory. Problem Books in Mathematics (3.3ad=Richard bas.). Springer. ss. 7-10. ISBN 978-0-387-26677-0.
Patterson, S.J. (1988). An introduction to the theory of the Riemann zeta-function. Cambridge Studies in Advanced Mathematics. 14. Cambridge University Press, Cambridge. s. 1. doi:10.1017/CBO9780511623707. ISBN 978-0-521-33535-5. MR 0933558.
Borwein, Peter; Choi, Stephen; Rooney, Brendan; Weirathmueller, Andrea (2008). Riemann hipotezi: Aficionado ve virtüöz için bir kaynak. CMS Matematik Kitapları/SMC Mathématiques Ouvrages. New York: Springer. ss. 10-11. doi:10.1007/978-0-387-72126-2. ISBN 978-0-387-72125-5. MR 2463715.
Sandifer 2007, sayfalar 191–193.
Borwein et al. 2008, Conjecture 2.7 (the Riemann hypothesis), p. 15.
Borwein et al. 2008, p. 18.
Nathanson 2000, Chapter 9, The prime number theorem, pp. 289–324.
Kraft & Washington (2014), Proposition 5.3, p. 96.
Shahriari, Shahriar (2017). Algebra in Action: A Course in Groups, Rings, and Fields. Pure and Applied Undergraduate Texts. 27. American Mathematical Society. ss. 20-21. ISBN 978-1-4704-2849-5.
Dudley 1978, Theorem 3, p. 28.
Shahriari 2017, pp. 27–28.
Childress, Nancy (2009). Class Field Theory. Universitext. Springer, New York. ss. 8-11. doi:10.1007/978-0-387-72490-4. ISBN 978-0-387-72489-8. MR 2462595. See also p. 64.
Erickson, Marty; Vazzana, Anthony; Garth, David (2016). Introduction to Number Theory. Textbooks in Mathematics (2.2 isbn = 978-1-4987-1749-6 bas.). Boca Raton, FL: CRC Press. s. 200. MR 3468748. KB1 bakım: Dikey çizgi eksik (link)
Koch, H. (1997). Algebraic Number Theory. Berlin: Springer-Verlag. s. 136. CiteSeerX 10.1.1.309.8812 $2. doi:10.1007/978-3-642-58095-6. ISBN 978-3-540-63003-6. MR 1474965.
Lauritzen, Niels (2003). Concrete Abstract Algebra: From numbers to Gröbner bases. Cambridge: Cambridge University Press. s. 127. doi:10.1017/CBO9780511804229. ISBN 978-0-521-53410-9. MR 2014325.
Kraft & Washington 2014, Section 12.1, Sums of two squares, pp. 297–301.
Shafarevich, Igor R. (2013). "Definition of $\operatorname {Spec} A$ ". Basic Algebraic Geometry 2: Schemes and Complex Manifolds (3.3 isbn = 978-3-642-38009-9 bas.). Springer, Heidelberg. s. 5. doi:10.1007/978-3-642-38010-5. MR 3100288. KB1 bakım: Dikey çizgi eksik (link)
Hall, Marshall (2018). The Theory of Groups. Dover Books on Mathematics. Courier Dover Publications. ISBN 978-0-486-81690-6. Sylow teoremleri için bkz. s. 43; Lagrange teoremi için bkz. s. 12; Burnside teoremi için bkz. s. 143.
Bryant, John; Sangwin, Christopher J. (2008). How Round is Your Circle?: Where Engineering and Mathematics Meet. p. 178: Princeton University Press. ISBN 978-0-691-13118-4.
Hardy, Godfrey Harold (2012) [1940]. A Mathematician's Apology. Cambridge University Press. s. 140. ISBN 978-0-521-42706-7. OCLC 922010634. No one has yet discovered any warlike purpose to be served by the theory of numbers or relativity, and it seems unlikely that anyone will do so for many years.
Riesel 1994, p. 220.
Wagstaff, Samuel S. Jr. (2013). The Joy of Factoring. Student mathematical library. 68. American Mathematical Society. s. 191. ISBN 978-1-4704-1048-3.
Crandall; Pomerance, Carl (2005). Prime Numbers: A Computational Perspective (2.2ad1=Richard bas.). Springer. s. 121. ISBN 978-0-387-25282-7.
Greaves, George (2013). Sieves in Number Theory. Ergebnisse der Mathematik und ihrer Grenzgebiete (3. Folge). 43. Springer. s. 1. ISBN 978-3-662-04658-6.
Hromkovič, Juraj (2001). "5.5 Bibliographic Remarks". Algorithmics for Hard Problems. Texts in Theoretical Computer Science. An EATCS Series. Springer-Verlag, Berlin. ss. 383-385. doi:10.1007/978-3-662-04616-6. ISBN 978-3-540-66860-2. MR 1843669.
Pieprzyk, Josef; Hardjono, Thomas; Seberry, Jennifer (2013). "2.3.9 Probabilistic Computations". Fundamentals of Computer Security. Springer. ss. 51-52. ISBN 978-3-662-07324-7.
Kraft & Washington 2014, s. 41.
Örnek olarak Guy 2013, A3 Mersenne asalları. Tekrarlanan birimler. Fermat sayıları. $k\cdot 2^{n}+1$ şeklindeki asal sayılar. ss. 13–21.
Kraft & Washington 2014, p. 275.
Hoffstein, Jeffrey; Pipher, Jill; Silverman, Joseph H. (2014). An Introduction to Mathematical Cryptography. Undergraduate Texts in Mathematics (2.2yayıncı=Springer bas.). s. 329. ISBN 978-1-4939-1711-2.
Rieffel, Eleanor G.; Polak, Wolfgang H. (2011). "Chapter 8. Shor's Algorithm". Quantum Computing: A Gentle Introduction. MIT Press. ss. 163-176. ISBN 978-0-262-01506-6.
Kirtland, Joseph (2001). Identification Numbers and Check Digit Schemes. Classroom Resource Materials. 18. Mathematical Association of America. ss. 43-44. ISBN 978-0-88385-720-5.
Křížek, Michal; Luca, Florian; Somer, Lawrence (2001). 17 Lectures on Fermat Numbers: From Number Theory to Geometry. CMS Books in Mathematics. 9. New York: Springer-Verlag. ss. 1-2. doi:10.1007/978-0-387-21850-2. ISBN 978-0-387-95332-8. MR 1866957.
Hill, Peter Jensen, (Ed.) (1995). The Messiaen companion. Ex. 13.2 Messe de la Pentecôte 1 'Entrée': Amadeus Press. ISBN 978-0-931340-95-6.

clarku.edu

aleph0.clarku.edu

Öklid'in Elementleri, Book IX, Proposition 20. bakınız David Joyce'un Öklid'in ispatının İngilizce çevirisi 23 Ocak 2011 tarihinde Wayback Machine sitesinde arşivlendi. ya da Williamson, James (1782). The Elements of Euclid, With Dissertations. Oxford: Clarendon Press. s. 63. OCLC 642232959. 26 Mart 2023 tarihinde kaynağından arşivlendi. Erişim tarihi: 18 Mart 2024.

dartmouth.edu

math.dartmouth.edu

Letter 11 Haziran 2015 tarihinde Wayback Machine sitesinde arşivlendi. Goldbach'tan Euler'e Latince, Temmuz 1730.
Lenstra, H. W. Jr.; Pomerance, Carl (2019). "Primality testing with Gaussian periods" (PDF). Journal of the European Mathematical Society. 21 (4): 1229-1269. doi:10.4171/JEMS/861. hdl:21.11116/0000-0005-717D-0. MR 3941463. 27 Aralık 2023 tarihinde kaynağından arşivlendi (PDF). Erişim tarihi: 26 Mart 2024.
Carl Pomerance; John L. Selfridge; Samuel S. Wagstaff, Jr. (July 1980). "The pseudoprimes to 25·10⁹" (PDF). Mathematics of Computation. 35 (151): 1003-1026. doi:10.1090/S0025-5718-1980-0572872-7 . JSTOR 2006210. 17 Ocak 2024 tarihinde kaynağından arşivlendi (PDF). Erişim tarihi: 26 Mart 2024.

gauss.dartmouth.edu

Pomerance, Carl (2004). "Prime Numbers and the Search for Extraterrestrial Intelligence" (PDF). Hayes, David F.; Ross, Peter (Ed.). Mathematical Adventures for Students and Amateurs. MAA Spectrum. Washington, DC: Mathematical Association of America. ss. 3-6. ISBN 978-0-88385-548-5. MR 2085842.

doi.org

Bruins, Evert Marie, review in Mathematical Reviews of Gillings, R.J. (1974). "The recto of the Rhind Mathematical Papyrus. How did the ancient Egyptian scribe prepare it?". Archive for History of Exact Sciences. 12 (4). ss. 291-298. doi:10.1007/BF01307175. MR 0497458.
Pomerance, Carl (Aralık 1982). "The Search for Prime Numbers". Scientific American. 247 (6). ss. 136-147. Bibcode:1982SciAm.247f.136P. doi:10.1038/scientificamerican1282-136. JSTOR 24966751.
Mollin, Richard A. (2002). "A brief history of factoring and primality testing B. C. (before computers)". Mathematics Magazine. 75 (1). ss. 18-29. doi:10.2307/3219180. JSTOR 3219180. MR 2107288.
Katz, Shaul (2004). "Berlin roots – Zionist incarnation: the ethos of pure mathematics and the beginnings of the Einstein Institute of Mathematics at the Hebrew University of Jerusalem". Science in Context. 17 (1–2). ss. 199-234. doi:10.1017/S0269889704000092. ISSN 0269-8897. MR 2089305.
Riesel, Hans (1994). Prime Numbers and Computer Methods for Factorization (2.2mr=1292250 bas.). Basel, Switzerland: Birkhäuser. s. 36. doi:10.1007/978-1-4612-0251-6. ISBN 978-0-8176-3743-9.
Conway, John Horton; Guy, Richard K. (1996). The Book of Numbers. New York: Copernicus. ss. 129-130. doi:10.1007/978-1-4612-4072-3. ISBN 978-0-387-97993-9. MR 1411676.
Furstenberg, Harry (1955). "On the infinitude of primes". American Mathematical Monthly. 62 (5). s. 353. doi:10.2307/2307043. JSTOR 2307043. MR 0068566.
Mackinnon, Nick (June 1987). "Prime number formulae". The Mathematical Gazette. 71 (456): 113-114. doi:10.2307/3616496. JSTOR 3616496.
Wright, E.M. (1951). "A prime-representing function". American Mathematical Monthly. 58 (9): 616-618. doi:10.2307/2306356. JSTOR 2306356.
Oliveira e Silva, Tomás; Herzog, Siegfried; Pardi, Silvio (2014). "Empirical verification of the even Goldbach conjecture and computation of prime gaps up to $4\cdot 10^{18}$ ". Mathematics of Computation. 83 (288). ss. 2033-2060. doi:10.1090/S0025-5718-2013-02787-1. MR 3194140.
Rassias, Michael Th. (2017). Goldbach's Problem: Selected Topics. Cham: Springer. s. vii. doi:10.1007/978-3-319-57914-6. ISBN 978-3-319-57912-2. MR 3674356.
Chan, Joel (February 1996). "Prime time!". Math Horizons. 3 (3). ss. 23-25. doi:10.1080/10724117.1996.11974965. JSTOR 25678057. Note that Chan lists Legendre's conjecture as "Sierpinski's Postulate".
Green, Ben; Tao, Terence (2008). "The primes contain arbitrarily long arithmetic progressions". Annals of Mathematics. 167 (2): 481-547. arXiv:math.NT/0404188 $2. doi:10.4007/annals.2008.167.481.
Patterson, S.J. (1988). An introduction to the theory of the Riemann zeta-function. Cambridge Studies in Advanced Mathematics. 14. Cambridge University Press, Cambridge. s. 1. doi:10.1017/CBO9780511623707. ISBN 978-0-521-33535-5. MR 0933558.
Borwein, Peter; Choi, Stephen; Rooney, Brendan; Weirathmueller, Andrea (2008). Riemann hipotezi: Aficionado ve virtüöz için bir kaynak. CMS Matematik Kitapları/SMC Mathématiques Ouvrages. New York: Springer. ss. 10-11. doi:10.1007/978-0-387-72126-2. ISBN 978-0-387-72125-5. MR 2463715.
Zagier, Don (1977). "The first 50 million prime numbers". The Mathematical Intelligencer. 1 (S2): 7-19. doi:10.1007/bf03351556. özellikle bakınız: pp. 14–16.
Childress, Nancy (2009). Class Field Theory. Universitext. Springer, New York. ss. 8-11. doi:10.1007/978-0-387-72490-4. ISBN 978-0-387-72489-8. MR 2462595. See also p. 64.
Koch, H. (1997). Algebraic Number Theory. Berlin: Springer-Verlag. s. 136. CiteSeerX 10.1.1.309.8812 $2. doi:10.1007/978-3-642-58095-6. ISBN 978-3-540-63003-6. MR 1474965.
Lauritzen, Niels (2003). Concrete Abstract Algebra: From numbers to Gröbner bases. Cambridge: Cambridge University Press. s. 127. doi:10.1017/CBO9780511804229. ISBN 978-0-521-53410-9. MR 2014325.
Eisenbud, David (1995). Commutative Algebra. Graduate Texts in Mathematics. 150. Section 3.3: Springer-Verlag. doi:10.1007/978-1-4612-5350-1. ISBN 978-0-387-94268-1. MR 1322960.
Shafarevich, Igor R. (2013). "Definition of $\operatorname {Spec} A$ ". Basic Algebraic Geometry 2: Schemes and Complex Manifolds (3.3 isbn = 978-3-642-38009-9 bas.). Springer, Heidelberg. s. 5. doi:10.1007/978-3-642-38010-5. MR 3100288. KB1 bakım: Dikey çizgi eksik (link)
Neukirch, Jürgen (1999). Algebraic Number Theory. Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences]. 322. Section I.8, p. 50: Springer-Verlag. doi:10.1007/978-3-662-03983-0. ISBN 978-3-540-65399-8. MR 1697859.
Stevenhagen, P.; Lenstra, H.W. Jr. (1996). "Chebotarëv and his density theorem". The Mathematical Intelligencer. 18 (2): 26-37. CiteSeerX 10.1.1.116.9409 $2. doi:10.1007/BF03027290. MR 1395088.
Farach-Colton, Martín; Tsai, Meng-Tsung (2015). "On the complexity of computing prime tables". Elbassioni, Khaled; Makino, Kazuhisa (Ed.). Algorithms and Computation: 26th International Symposium, ISAAC 2015, Nagoya, Japan, December 9-11, 2015, Proceedings. Lecture Notes in Computer Science. 9472. Springer. ss. 677-688. arXiv:1504.05240 $2. doi:10.1007/978-3-662-48971-0_57. ISBN 978-3-662-48970-3.
Hromkovič, Juraj (2001). "5.5 Bibliographic Remarks". Algorithmics for Hard Problems. Texts in Theoretical Computer Science. An EATCS Series. Springer-Verlag, Berlin. ss. 383-385. doi:10.1007/978-3-662-04616-6. ISBN 978-3-540-66860-2. MR 1843669.
Koblitz, Neal (1987). "Chapter V. Primality and Factoring". A Course in Number Theory and Cryptography. Graduate Texts in Mathematics. 114. Springer-Verlag, New York. ss. 112-149. doi:10.1007/978-1-4684-0310-7_5. ISBN 978-0-387-96576-5. MR 0910297.
Tao, Terence (2010). "1.11 The AKS primality test". An epsilon of room, II: Pages from year three of a mathematical blog. Graduate Studies in Mathematics. 117. Providence, RI: American Mathematical Society. ss. 82-86. doi:10.1090/gsm/117. ISBN 978-0-8218-5280-4. MR 2780010.
Atkin, A O.L.; Morain, F. (1993). "Elliptic curves and primality proving" (PDF). Mathematics of Computation. 61 (203): 29-68. Bibcode:1993MaCom..61...29A. doi:10.1090/s0025-5718-1993-1199989-x. JSTOR 2152935. MR 1199989.
Morain, F. (2007). "Implementing the asymptotically fast version of the elliptic curve primality proving algorithm". Mathematics of Computation. 76 (257): 493-505. arXiv:math/0502097 $2. Bibcode:2007MaCom..76..493M. doi:10.1090/S0025-5718-06-01890-4. MR 2261033.
Lenstra, H. W. Jr.; Pomerance, Carl (2019). "Primality testing with Gaussian periods" (PDF). Journal of the European Mathematical Society. 21 (4): 1229-1269. doi:10.4171/JEMS/861. hdl:21.11116/0000-0005-717D-0. MR 3941463. 27 Aralık 2023 tarihinde kaynağından arşivlendi (PDF). Erişim tarihi: 26 Mart 2024.
Carl Pomerance; John L. Selfridge; Samuel S. Wagstaff, Jr. (July 1980). "The pseudoprimes to 25·10⁹" (PDF). Mathematics of Computation. 35 (151): 1003-1026. doi:10.1090/S0025-5718-1980-0572872-7 . JSTOR 2006210. 17 Ocak 2024 tarihinde kaynağından arşivlendi (PDF). Erişim tarihi: 26 Mart 2024.
Robert Baillie; Samuel S. Wagstaff, Jr. (October 1980). "Lucas Pseudoprimes" (PDF). Mathematics of Computation. 35 (152): 1391-1417. doi:10.1090/S0025-5718-1980-0583518-6 . JSTOR 2006406. MR 0583518. 4 Mart 2016 tarihinde kaynağından arşivlendi (PDF). Erişim tarihi: 26 Mart 2024.
Monier, Louis (1980). "Evaluation and comparison of two efficient probabilistic primality testing algorithms". Theoretical Computer Science. 12 (1): 97-108. doi:10.1016/0304-3975(80)90007-9. MR 0582244.
Martín-López, Enrique; Laing, Anthony; Lawson, Thomas; Alvarez, Roberto; Zhou, Xiao-Qi; O'Brien, Jeremy L. (12 Ekim 2012). "Experimental realization of Shor's quantum factoring algorithm using qubit recycling". Nature Photonics. 6 (11). ss. 773-776. arXiv:1111.4147 $2. Bibcode:2012NaPho...6..773M. doi:10.1038/nphoton.2012.259.
Matsumoto, Makoto; Nishimura, Takuji (1998). "Mersenne Twister: A 623-dimensionally equidistributed uniform pseudo-random number generator". ACM Transactions on Modeling and Computer Simulation. 8 (1). ss. 3-30. CiteSeerX 10.1.1.215.1141 $2. doi:10.1145/272991.272995.
Roth, K.F. (1951). "On a problem of Heilbronn". Journal of the London Mathematical Society. Second Series. 26 (3). ss. 198-204. doi:10.1112/jlms/s1-26.3.198. MR 0041889.
Cox, David A. (2011). "Why Eisenstein proved the Eisenstein criterion and why Schönemann discovered it first" (PDF). American Mathematical Monthly. 118 (1). ss. 3-31. CiteSeerX 10.1.1.398.3440 $2. doi:10.4169/amer.math.monthly.118.01.003. 26 Mart 2023 tarihinde kaynağından arşivlendi (PDF). Erişim tarihi: 29 Mart 2024.
Lang, Serge (2002). Algebra. Graduate Texts in Mathematics. 211. Berlin; New York: Springer-Verlag. doi:10.1007/978-1-4613-0041-0. ISBN 978-0-387-95385-4. MR 1878556. , Section II.1, s. 90
Milnor, J. (1962). "A unique decomposition theorem for 3-manifolds". American Journal of Mathematics. 84 (1). ss. 1-7. doi:10.2307/2372800. JSTOR 2372800. MR 0142125.
Křížek, Michal; Luca, Florian; Somer, Lawrence (2001). 17 Lectures on Fermat Numbers: From Number Theory to Geometry. CMS Books in Mathematics. 9. New York: Springer-Verlag. ss. 1-2. doi:10.1007/978-0-387-21850-2. ISBN 978-0-387-95332-8. MR 1866957.
Boklan, Kent D.; Conway, John H. (January 2017). "Expect at most one billionth of a new Fermat prime!". The Mathematical Intelligencer. 39 (1). ss. 3-5. arXiv:1605.01371 $2. doi:10.1007/s00283-016-9644-3.
Gleason, Andrew M. (1988). "Angle trisection, the heptagon, and the triskaidecagon". American Mathematical Monthly. 95 (3). ss. 185-194. doi:10.2307/2323624. JSTOR 2323624. MR 0935432.
Hayes, Brian (2003). "Computing science: The spectrum of Riemannium". American Scientist. 91 (4). ss. 296-300. doi:10.1511/2003.26.3349. JSTOR 27858239.
Zhu, Huangjun (2010). "SIC POVMs and Clifford groups in prime dimensions". Journal of Physics A: Mathematical and Theoretical. 43 (30). s. 305305. arXiv:1003.3591 $2. Bibcode:2010JPhA...43D5305Z. doi:10.1088/1751-8113/43/30/305305.
Goles, E.; Schulz, O.; Markus, M. (2001). "Prime number selection of cycles in a predator-prey model". Complexity. 6 (4). ss. 33-38. Bibcode:2001Cmplx...6d..33G. doi:10.1002/cplx.1040.
Campos, Paulo R.A.; de Oliveira, Viviane M.; Giro, Ronaldo; Galvão, Douglas S. (2004). "Emergence of prime numbers as the result of evolutionary strategy". Physical Review Letters. 93 (9). s. 098107. arXiv:q-bio/0406017 $2. Bibcode:2004PhRvL..93i8107C. doi:10.1103/PhysRevLett.93.098107. PMID 15447148.

economist.com

"Invasion of the Brood". The Economist. 6 Mayıs 2004. 15 Mayıs 2006 tarihinde kaynağından arşivlendi. Erişim tarihi: 26 Kasım 2006.

eff.org

"Record 12-Million-Digit Prime Number Nets $100,000 Prize". Electronic Frontier Foundation. 14 Ekim 2009. 5 Ağustos 2011 tarihinde kaynağından arşivlendi. Erişim tarihi: 4 Ocak 2010.
"EFF Cooperative Computing Awards". Electronic Frontier Foundation. 29 Şubat 2008. 9 Kasım 2008 tarihinde kaynağından arşivlendi. Erişim tarihi: 4 Ocak 2010.

free.fr

mpqs.free.fr

Robert Baillie; Samuel S. Wagstaff, Jr. (October 1980). "Lucas Pseudoprimes" (PDF). Mathematics of Computation. 35 (152): 1391-1417. doi:10.1090/S0025-5718-1980-0583518-6 . JSTOR 2006406. MR 0583518. 4 Mart 2016 tarihinde kaynağından arşivlendi (PDF). Erişim tarihi: 26 Mart 2024.

geocities.com

""Arguments for and against the primality of 1 25 Ağustos 2007 tarihinde Wayback Machine sitesinde arşivlendi.".

handle.net

hdl.handle.net

Lenstra, H. W. Jr.; Pomerance, Carl (2019). "Primality testing with Gaussian periods" (PDF). Journal of the European Mathematical Society. 21 (4): 1229-1269. doi:10.4171/JEMS/861. hdl:21.11116/0000-0005-717D-0. MR 3941463. 27 Aralık 2023 tarihinde kaynağından arşivlendi (PDF). Erişim tarihi: 26 Mart 2024.

harvard.edu

adsabs.harvard.edu

Pomerance, Carl (Aralık 1982). "The Search for Prime Numbers". Scientific American. 247 (6). ss. 136-147. Bibcode:1982SciAm.247f.136P. doi:10.1038/scientificamerican1282-136. JSTOR 24966751.
Atkin, A O.L.; Morain, F. (1993). "Elliptic curves and primality proving" (PDF). Mathematics of Computation. 61 (203): 29-68. Bibcode:1993MaCom..61...29A. doi:10.1090/s0025-5718-1993-1199989-x. JSTOR 2152935. MR 1199989.
Morain, F. (2007). "Implementing the asymptotically fast version of the elliptic curve primality proving algorithm". Mathematics of Computation. 76 (257): 493-505. arXiv:math/0502097 $2. Bibcode:2007MaCom..76..493M. doi:10.1090/S0025-5718-06-01890-4. MR 2261033.
Martín-López, Enrique; Laing, Anthony; Lawson, Thomas; Alvarez, Roberto; Zhou, Xiao-Qi; O'Brien, Jeremy L. (12 Ekim 2012). "Experimental realization of Shor's quantum factoring algorithm using qubit recycling". Nature Photonics. 6 (11). ss. 773-776. arXiv:1111.4147 $2. Bibcode:2012NaPho...6..773M. doi:10.1038/nphoton.2012.259.
Zhu, Huangjun (2010). "SIC POVMs and Clifford groups in prime dimensions". Journal of Physics A: Mathematical and Theoretical. 43 (30). s. 305305. arXiv:1003.3591 $2. Bibcode:2010JPhA...43D5305Z. doi:10.1088/1751-8113/43/30/305305.
Goles, E.; Schulz, O.; Markus, M. (2001). "Prime number selection of cycles in a predator-prey model". Complexity. 6 (4). ss. 33-38. Bibcode:2001Cmplx...6d..33G. doi:10.1002/cplx.1040.
Campos, Paulo R.A.; de Oliveira, Viviane M.; Giro, Ronaldo; Galvão, Douglas S. (2004). "Emergence of prime numbers as the result of evolutionary strategy". Physical Review Letters. 93 (9). s. 098107. arXiv:q-bio/0406017 $2. Bibcode:2004PhRvL..93i8107C. doi:10.1103/PhysRevLett.93.098107. PMID 15447148.

hathitrust.org

babel.hathitrust.org

Öklid'in Elementleri, Book IX, Proposition 20. bakınız David Joyce'un Öklid'in ispatının İngilizce çevirisi 23 Ocak 2011 tarihinde Wayback Machine sitesinde arşivlendi. ya da Williamson, James (1782). The Elements of Euclid, With Dissertations. Oxford: Clarendon Press. s. 63. OCLC 642232959. 26 Mart 2023 tarihinde kaynağından arşivlendi. Erişim tarihi: 18 Mart 2024.

iop.org

stacks.iop.org

Zhu, Huangjun (2010). "SIC POVMs and Clifford groups in prime dimensions". Journal of Physics A: Mathematical and Theoretical. 43 (30). s. 305305. arXiv:1003.3591 $2. Bibcode:2010JPhA...43D5305Z. doi:10.1088/1751-8113/43/30/305305.

jstor.org

Pomerance, Carl (Aralık 1982). "The Search for Prime Numbers". Scientific American. 247 (6). ss. 136-147. Bibcode:1982SciAm.247f.136P. doi:10.1038/scientificamerican1282-136. JSTOR 24966751.
Mollin, Richard A. (2002). "A brief history of factoring and primality testing B. C. (before computers)". Mathematics Magazine. 75 (1). ss. 18-29. doi:10.2307/3219180. JSTOR 3219180. MR 2107288.
Furstenberg, Harry (1955). "On the infinitude of primes". American Mathematical Monthly. 62 (5). s. 353. doi:10.2307/2307043. JSTOR 2307043. MR 0068566.
Mackinnon, Nick (June 1987). "Prime number formulae". The Mathematical Gazette. 71 (456): 113-114. doi:10.2307/3616496. JSTOR 3616496.
Wright, E.M. (1951). "A prime-representing function". American Mathematical Monthly. 58 (9): 616-618. doi:10.2307/2306356. JSTOR 2306356.
Chan, Joel (February 1996). "Prime time!". Math Horizons. 3 (3). ss. 23-25. doi:10.1080/10724117.1996.11974965. JSTOR 25678057. Note that Chan lists Legendre's conjecture as "Sierpinski's Postulate".
Atkin, A O.L.; Morain, F. (1993). "Elliptic curves and primality proving" (PDF). Mathematics of Computation. 61 (203): 29-68. Bibcode:1993MaCom..61...29A. doi:10.1090/s0025-5718-1993-1199989-x. JSTOR 2152935. MR 1199989.
Carl Pomerance; John L. Selfridge; Samuel S. Wagstaff, Jr. (July 1980). "The pseudoprimes to 25·10⁹" (PDF). Mathematics of Computation. 35 (151): 1003-1026. doi:10.1090/S0025-5718-1980-0572872-7 . JSTOR 2006210. 17 Ocak 2024 tarihinde kaynağından arşivlendi (PDF). Erişim tarihi: 26 Mart 2024.
Robert Baillie; Samuel S. Wagstaff, Jr. (October 1980). "Lucas Pseudoprimes" (PDF). Mathematics of Computation. 35 (152): 1391-1417. doi:10.1090/S0025-5718-1980-0583518-6 . JSTOR 2006406. MR 0583518. 4 Mart 2016 tarihinde kaynağından arşivlendi (PDF). Erişim tarihi: 26 Mart 2024.
Milnor, J. (1962). "A unique decomposition theorem for 3-manifolds". American Journal of Mathematics. 84 (1). ss. 1-7. doi:10.2307/2372800. JSTOR 2372800. MR 0142125.
Gleason, Andrew M. (1988). "Angle trisection, the heptagon, and the triskaidecagon". American Mathematical Monthly. 95 (3). ss. 185-194. doi:10.2307/2323624. JSTOR 2323624. MR 0935432.
Hayes, Brian (2003). "Computing science: The spectrum of Riemannium". American Scientist. 91 (4). ss. 296-300. doi:10.1511/2003.26.3349. JSTOR 27858239.

maa.org

Cox, David A. (2011). "Why Eisenstein proved the Eisenstein criterion and why Schönemann discovered it first" (PDF). American Mathematical Monthly. 118 (1). ss. 3-31. CiteSeerX 10.1.1.398.3440 $2. doi:10.4169/amer.math.monthly.118.01.003. 26 Mart 2023 tarihinde kaynağından arşivlendi (PDF). Erişim tarihi: 29 Mart 2024.
Peterson, Ivars (28 Haziran 1999). "The Return of Zeta". MAA Online. 20 Ekim 2007 tarihinde kaynağından arşivlendi. Erişim tarihi: 14 Mart 2008.

mathdoc.fr

sites.mathdoc.fr

Tchebychev, P. (1852). "Asal Sayılar Üzerine Bir Bellek" (PDF). Journal de mathématiques pures et appliquées. Série 1 (Fransızca): 366-390. 6 Kasım 2022 tarihinde kaynağından arşivlendi (PDF). Erişim tarihi: 8 Mart 2024. . (Postulatın kanıtı: 371–382). Ayrıca bkz. Mémoires de l'Académie Impériale des Sciences de St. Pétersbourg, cilt 7, sayfa 15–33, 1854

mersenne.org

"GIMPS Discovers Largest Known Prime Number: 2^(136,279,841)-1". Mersenne Research, Inc. 21 Aralık 2018. 4 Kasım 2024 tarihinde kaynağından arşivlendi. Erişim tarihi: 23 Ekim 2024. 16. harf sırasında bulunan |başlık= parametresi line feed character içeriyor (yardım)

nationalgeographic.com

Zimmer, Carl (15 Mayıs 2015). "Bamboo Mathematicians". National Geographic. 6 Mayıs 2021 tarihinde kaynağından arşivlendi. Erişim tarihi: 22 Şubat 2018.

nih.gov

ncbi.nlm.nih.gov

Campos, Paulo R.A.; de Oliveira, Viviane M.; Giro, Ronaldo; Galvão, Douglas S. (2004). "Emergence of prime numbers as the result of evolutionary strategy". Physical Review Letters. 93 (9). s. 098107. arXiv:q-bio/0406017 $2. Bibcode:2004PhRvL..93i8107C. doi:10.1103/PhysRevLett.93.098107. PMID 15447148.

nodak.edu

listserv.nodak.edu

Emmanuel Thomé, “795-bit factoring and discrete logarithms,” 8 Aralık 2019 tarihinde Wayback Machine sitesinde arşivlendi. Aralık 2, 2019.

numdam.org

Ramaré, Olivier (1995). "On Šnirel'man's constant". Annali della Scuola Normale Superiore di Pisa. 22 (4). ss. 645-706. MR 1375315. 9 Şubat 2022 tarihinde kaynağından arşivlendi. Erişim tarihi: 23 Ocak 2018.

nytimes.com

Schillinger, Liesl (9 Nisan 2010). "Counting on Each Other". The New York Times. 12 Nisan 2010 tarihinde kaynağından arşivlendi. Erişim tarihi: 29 Mart 2024.

primegrid.com

"PrimeGrid's Seventeen or Bust Subproject" (PDF). 12 Kasım 2016 tarihinde kaynağından arşivlendi (PDF). Erişim tarihi: 3 Ocak 2017.

psu.edu

citeseerx.ist.psu.edu

Koch, H. (1997). Algebraic Number Theory. Berlin: Springer-Verlag. s. 136. CiteSeerX 10.1.1.309.8812 $2. doi:10.1007/978-3-642-58095-6. ISBN 978-3-540-63003-6. MR 1474965.
Stevenhagen, P.; Lenstra, H.W. Jr. (1996). "Chebotarëv and his density theorem". The Mathematical Intelligencer. 18 (2): 26-37. CiteSeerX 10.1.1.116.9409 $2. doi:10.1007/BF03027290. MR 1395088.
Matsumoto, Makoto; Nishimura, Takuji (1998). "Mersenne Twister: A 623-dimensionally equidistributed uniform pseudo-random number generator". ACM Transactions on Modeling and Computer Simulation. 8 (1). ss. 3-30. CiteSeerX 10.1.1.215.1141 $2. doi:10.1145/272991.272995.
Cox, David A. (2011). "Why Eisenstein proved the Eisenstein criterion and why Schönemann discovered it first" (PDF). American Mathematical Monthly. 118 (1). ss. 3-31. CiteSeerX 10.1.1.398.3440 $2. doi:10.4169/amer.math.monthly.118.01.003. 26 Mart 2023 tarihinde kaynağından arşivlendi (PDF). Erişim tarihi: 29 Mart 2024.

rfc-editor.org

Deutsch, P. (1996). ZLIB Compressed Data Format Specification version 3.3. Request for Comments. 1950. Network Working Group. 26 Şubat 2024 tarihinde kaynağından arşivlendi. Erişim tarihi: 29 Mart 2024.

st-andrews.ac.uk

mathshistory.st-andrews.ac.uk

O'Connor, John J.; Robertson, Edmund F., "Abu Ali al-Hasan ibn al-Haytham", MacTutor Matematik Tarihi arşivi

terrytao.wordpress.com

Tao, Terence (2010). "1.11 The AKS primality test". An epsilon of room, II: Pages from year three of a mathematical blog. Graduate Studies in Mathematics. 117. Providence, RI: American Mathematical Society. ss. 82-86. doi:10.1090/gsm/117. ISBN 978-0-8218-5280-4. MR 2780010.
Tao, Terence (2009). "1.7 The Lucas–Lehmer test for Mersenne primes". Poincaré's legacies, pages from year two of a mathematical blog. Part I. Providence, RI: American Mathematical Society. ss. 36-41. ISBN 978-0-8218-4883-8. MR 2523047.

theguardian.com

GrrlScientist (16 Eylül 2010). "The Curious Incident of the Dog in the Night-Time". The Guardian. 22 Eylül 2010 tarihinde kaynağından arşivlendi. Erişim tarihi: 22 Şubat 2010.

theregister.co.uk

Chirgwin, Richard (9 Ekim 2016). "Crypto needs more transparency, researchers warn". The Register. 12 Temmuz 2019 tarihinde kaynağından arşivlendi. Erişim tarihi: 29 Mart 2024.

utm.edu

primes.utm.edu

""Why is the number one not prime?" 9 Mayıs 2008 tarihinde Wayback Machine sitesinde arşivlendi.". Retrieved 2007-10-02.
Caldwell, Chris K. "The Top Twenty: Largest Known Primes". The Prime Pages. 16 Temmuz 2012 tarihinde kaynağından arşivlendi. Erişim tarihi: 3 Ocak 2017.
Caldwell, Chris K. "The Top Twenty: Factorial". The Prime Pages. 10 Nisan 2013 tarihinde kaynağından arşivlendi. Erişim tarihi: 3 Ocak 2017.
Caldwell, Chris K. "The Top Twenty: Primorial". The Prime Pages. 6 Mayıs 2021 tarihinde kaynağından arşivlendi. Erişim tarihi: 3 Ocak 2017.
Caldwell, Chris K. "The Top Twenty: Twin Primes". The Prime Pages. 27 Ocak 2013 tarihinde kaynağından arşivlendi. Erişim tarihi: 3 Ocak 2017.

uwaterloo.ca

cs.uwaterloo.ca

Caldwell, Chris K.; Reddick, Angela; Xiong, Yeng; Keller, Wilfrid (2012). "The history of the primality of one: a selection of sources". Journal of Integer Sequences. 15 (9): Article 12.9.8. MR 3005523. 12 Nisan 2018 tarihinde kaynağından arşivlendi. Erişim tarihi: 8 Mart 2024. For a selection of quotes from and about the ancient Greek positions on the status of 1 and 2, see in particular pp. 3–4. For the Islamic mathematicians, see p. 6.
Caldwell, Chris K.; Xiong, Yeng (2012). "What is the smallest prime?" (PDF). Journal of Integer Sequences. 15 (9): Article 12.9.7. MR 3005530. 12 Nisan 2018 tarihinde kaynağından arşivlendi (PDF). Erişim tarihi: 8 Mart 2024.

web.archive.org

"GIMPS Discovers Largest Known Prime Number: 2^(136,279,841)-1". Mersenne Research, Inc. 21 Aralık 2018. 4 Kasım 2024 tarihinde kaynağından arşivlendi. Erişim tarihi: 23 Ekim 2024. 16. harf sırasında bulunan |başlık= parametresi line feed character içeriyor (yardım)
"Arşivlenmiş kopya". 12 Nisan 2020 tarihinde kaynağından arşivlendi. Erişim tarihi: 7 Nisan 2020.
Tchebychev, P. (1852). "Asal Sayılar Üzerine Bir Bellek" (PDF). Journal de mathématiques pures et appliquées. Série 1 (Fransızca): 366-390. 6 Kasım 2022 tarihinde kaynağından arşivlendi (PDF). Erişim tarihi: 8 Mart 2024. . (Postulatın kanıtı: 371–382). Ayrıca bkz. Mémoires de l'Académie Impériale des Sciences de St. Pétersbourg, cilt 7, sayfa 15–33, 1854
Caldwell, Chris K.; Reddick, Angela; Xiong, Yeng; Keller, Wilfrid (2012). "The history of the primality of one: a selection of sources". Journal of Integer Sequences. 15 (9): Article 12.9.8. MR 3005523. 12 Nisan 2018 tarihinde kaynağından arşivlendi. Erişim tarihi: 8 Mart 2024. For a selection of quotes from and about the ancient Greek positions on the status of 1 and 2, see in particular pp. 3–4. For the Islamic mathematicians, see p. 6.
Caldwell, Chris K.; Xiong, Yeng (2012). "What is the smallest prime?" (PDF). Journal of Integer Sequences. 15 (9): Article 12.9.7. MR 3005530. 12 Nisan 2018 tarihinde kaynağından arşivlendi (PDF). Erişim tarihi: 8 Mart 2024.
Wells, D. The Penguin Dictionary of Curious and Interesting Numbers. Middlesex, England: Penguin Books, 1986. s 31.<[1] 29 Mart 2013 tarihinde Wayback Machine sitesinde arşivlendi.>
""Why is the number one not prime?" 9 Mayıs 2008 tarihinde Wayback Machine sitesinde arşivlendi.". Retrieved 2007-10-02.
""Arguments for and against the primality of 1 25 Ağustos 2007 tarihinde Wayback Machine sitesinde arşivlendi.".
Letter 11 Haziran 2015 tarihinde Wayback Machine sitesinde arşivlendi. Goldbach'tan Euler'e Latince, Temmuz 1730.
Öklid'in Elementleri, Book IX, Proposition 20. bakınız David Joyce'un Öklid'in ispatının İngilizce çevirisi 23 Ocak 2011 tarihinde Wayback Machine sitesinde arşivlendi. ya da Williamson, James (1782). The Elements of Euclid, With Dissertations. Oxford: Clarendon Press. s. 63. OCLC 642232959. 26 Mart 2023 tarihinde kaynağından arşivlendi. Erişim tarihi: 18 Mart 2024.
Ramaré, Olivier (1995). "On Šnirel'man's constant". Annali della Scuola Normale Superiore di Pisa. 22 (4). ss. 645-706. MR 1375315. 9 Şubat 2022 tarihinde kaynağından arşivlendi. Erişim tarihi: 23 Ocak 2018.
Bullynck, Maarten (2010). "A history of factor tables with notes on the birth of number theory 1657–1817". Revue d'Histoire des Mathématiques. 16 (2): 133-216. 4 Haziran 2023 tarihinde kaynağından arşivlendi. Erişim tarihi: 25 Mart 2024.
Lenstra, H. W. Jr.; Pomerance, Carl (2019). "Primality testing with Gaussian periods" (PDF). Journal of the European Mathematical Society. 21 (4): 1229-1269. doi:10.4171/JEMS/861. hdl:21.11116/0000-0005-717D-0. MR 3941463. 27 Aralık 2023 tarihinde kaynağından arşivlendi (PDF). Erişim tarihi: 26 Mart 2024.
Carl Pomerance; John L. Selfridge; Samuel S. Wagstaff, Jr. (July 1980). "The pseudoprimes to 25·10⁹" (PDF). Mathematics of Computation. 35 (151): 1003-1026. doi:10.1090/S0025-5718-1980-0572872-7 . JSTOR 2006210. 17 Ocak 2024 tarihinde kaynağından arşivlendi (PDF). Erişim tarihi: 26 Mart 2024.
Robert Baillie; Samuel S. Wagstaff, Jr. (October 1980). "Lucas Pseudoprimes" (PDF). Mathematics of Computation. 35 (152): 1391-1417. doi:10.1090/S0025-5718-1980-0583518-6 . JSTOR 2006406. MR 0583518. 4 Mart 2016 tarihinde kaynağından arşivlendi (PDF). Erişim tarihi: 26 Mart 2024.
"Record 12-Million-Digit Prime Number Nets $100,000 Prize". Electronic Frontier Foundation. 14 Ekim 2009. 5 Ağustos 2011 tarihinde kaynağından arşivlendi. Erişim tarihi: 4 Ocak 2010.
"EFF Cooperative Computing Awards". Electronic Frontier Foundation. 29 Şubat 2008. 9 Kasım 2008 tarihinde kaynağından arşivlendi. Erişim tarihi: 4 Ocak 2010.
"PrimeGrid's Seventeen or Bust Subproject" (PDF). 12 Kasım 2016 tarihinde kaynağından arşivlendi (PDF). Erişim tarihi: 3 Ocak 2017.
Caldwell, Chris K. "The Top Twenty: Largest Known Primes". The Prime Pages. 16 Temmuz 2012 tarihinde kaynağından arşivlendi. Erişim tarihi: 3 Ocak 2017.
Caldwell, Chris K. "The Top Twenty: Factorial". The Prime Pages. 10 Nisan 2013 tarihinde kaynağından arşivlendi. Erişim tarihi: 3 Ocak 2017.
Caldwell, Chris K. "The Top Twenty: Primorial". The Prime Pages. 6 Mayıs 2021 tarihinde kaynağından arşivlendi. Erişim tarihi: 3 Ocak 2017.
Caldwell, Chris K. "The Top Twenty: Twin Primes". The Prime Pages. 27 Ocak 2013 tarihinde kaynağından arşivlendi. Erişim tarihi: 3 Ocak 2017.
Emmanuel Thomé, “795-bit factoring and discrete logarithms,” 8 Aralık 2019 tarihinde Wayback Machine sitesinde arşivlendi. Aralık 2, 2019.
Chirgwin, Richard (9 Ekim 2016). "Crypto needs more transparency, researchers warn". The Register. 12 Temmuz 2019 tarihinde kaynağından arşivlendi. Erişim tarihi: 29 Mart 2024.
Deutsch, P. (1996). ZLIB Compressed Data Format Specification version 3.3. Request for Comments. 1950. Network Working Group. 26 Şubat 2024 tarihinde kaynağından arşivlendi. Erişim tarihi: 29 Mart 2024.
Cox, David A. (2011). "Why Eisenstein proved the Eisenstein criterion and why Schönemann discovered it first" (PDF). American Mathematical Monthly. 118 (1). ss. 3-31. CiteSeerX 10.1.1.398.3440 $2. doi:10.4169/amer.math.monthly.118.01.003. 26 Mart 2023 tarihinde kaynağından arşivlendi (PDF). Erişim tarihi: 29 Mart 2024.
Peterson, Ivars (28 Haziran 1999). "The Return of Zeta". MAA Online. 20 Ekim 2007 tarihinde kaynağından arşivlendi. Erişim tarihi: 14 Mart 2008.
"Invasion of the Brood". The Economist. 6 Mayıs 2004. 15 Mayıs 2006 tarihinde kaynağından arşivlendi. Erişim tarihi: 26 Kasım 2006.
Zimmer, Carl (15 Mayıs 2015). "Bamboo Mathematicians". National Geographic. 6 Mayıs 2021 tarihinde kaynağından arşivlendi. Erişim tarihi: 22 Şubat 2018.
GrrlScientist (16 Eylül 2010). "The Curious Incident of the Dog in the Night-Time". The Guardian. 22 Eylül 2010 tarihinde kaynağından arşivlendi. Erişim tarihi: 22 Şubat 2010.
Schillinger, Liesl (9 Nisan 2010). "Counting on Each Other". The New York Times. 12 Nisan 2010 tarihinde kaynağından arşivlendi. Erişim tarihi: 29 Mart 2024.
"Chen Asalı". Chen Prime. Wolfram MathWorld. 24 Ocak 2023. 15 Mart 2006 tarihinde kaynağından arşivlendi. Erişim tarihi: 3 Şubat 2023.
"Mersenne Asalı". Mersenne Prime. Wolfram MathWorld. 24 Ocak 2023. 11 Mayıs 2000 tarihinde kaynağından arşivlendi. Erişim tarihi: 3 Şubat 2023.

wolfram.com

mathworld.wolfram.com

"Arşivlenmiş kopya". 12 Nisan 2020 tarihinde kaynağından arşivlendi. Erişim tarihi: 7 Nisan 2020.
Wells, D. The Penguin Dictionary of Curious and Interesting Numbers. Middlesex, England: Penguin Books, 1986. s 31.<[1] 29 Mart 2013 tarihinde Wayback Machine sitesinde arşivlendi.>
"Chen Asalı". Chen Prime. Wolfram MathWorld. 24 Ocak 2023. 15 Mart 2006 tarihinde kaynağından arşivlendi. Erişim tarihi: 3 Şubat 2023.
"Mersenne Asalı". Mersenne Prime. Wolfram MathWorld. 24 Ocak 2023. 11 Mayıs 2000 tarihinde kaynağından arşivlendi. Erişim tarihi: 3 Şubat 2023.

worldcat.org

Adler, Irving (1960). The Giant Golden Book of Mathematics: Exploring the World of Numbers and Space. Golden Press. s. 16. OCLC 6975809.
Beiler, Albert H. (1999) [1966]. Recreations in the Theory of Numbers: The Queen of Mathematics Entertains. Dover. s. 2. ISBN 978-0-486-21096-4. OCLC 444171535.
Katz, Shaul (2004). "Berlin roots – Zionist incarnation: the ethos of pure mathematics and the beginnings of the Einstein Institute of Mathematics at the Hebrew University of Jerusalem". Science in Context. 17 (1–2). ss. 199-234. doi:10.1017/S0269889704000092. ISSN 0269-8897. MR 2089305.
Öklid'in Elementleri, Book IX, Proposition 20. bakınız David Joyce'un Öklid'in ispatının İngilizce çevirisi 23 Ocak 2011 tarihinde Wayback Machine sitesinde arşivlendi. ya da Williamson, James (1782). The Elements of Euclid, With Dissertations. Oxford: Clarendon Press. s. 63. OCLC 642232959. 26 Mart 2023 tarihinde kaynağından arşivlendi. Erişim tarihi: 18 Mart 2024.
Hua, L.K. (2009) [1965]. Additive Theory of Prime Numbers. Translations of Mathematical Monographs. 13. Providence, RI: American Mathematical Society. ss. 176-177. ISBN 978-0-8218-4942-2. MR 0194404. OCLC 824812353.
Hardy, Godfrey Harold (2012) [1940]. A Mathematician's Apology. Cambridge University Press. s. 140. ISBN 978-0-521-42706-7. OCLC 922010634. No one has yet discovered any warlike purpose to be served by the theory of numbers or relativity, and it seems unlikely that anyone will do so for many years.
Bengtsson, Ingemar; Życzkowski, Karol (2017). Geometry of quantum states : an introduction to quantum entanglement. Second. Cambridge: Cambridge University Press. ss. 313-354. ISBN 978-1-107-02625-4. OCLC 967938939.