Search results
Jump to navigation
Jump to search
Page title matches
- #REDIRECT [[Random number generator/Definition]]48 bytes (5 words) - 23:32, 21 August 2009
- {{r|Prime number}} {{r|Whole number}}258 bytes (33 words) - 02:29, 8 February 2009
- 2 bytes (0 words) - 23:46, 9 June 2008
- 2 bytes (0 words) - 00:32, 10 June 2008
- 2 bytes (0 words) - 11:26, 10 June 2008
- A composite number ''c'' such that ''a''<sup>''c''−1</sup> ≡ 1 (mod ''c'') for all165 bytes (25 words) - 16:56, 26 July 2008
- 12 bytes (1 word) - 21:24, 3 November 2007
- 2 bytes (0 words) - 23:20, 9 June 2008
- 2 bytes (0 words) - 00:06, 10 June 2008
- 2 bytes (0 words) - 11:14, 10 June 2008
- 2 bytes (0 words) - 11:27, 10 June 2008
- 12 bytes (1 word) - 07:32, 7 December 2007
- 117 bytes (19 words) - 20:08, 27 January 2010
- 2 bytes (0 words) - 23:27, 9 June 2008
- 2 bytes (0 words) - 00:19, 10 June 2008
- 2 bytes (0 words) - 11:22, 10 June 2008
- 1 bytes (0 words) - 10:56, 12 June 2008
- ...n which the first number is 0, the second number is 1, and each subsequent number is equal to the sum of the previous two numbers.191 bytes (31 words) - 15:05, 3 July 2008
- ...thor=Richard K. Guy|authorlink=Richard K. Guy|title=[[Unsolved Problems in Number Theory]]|publisher=[[Springer-Verlag]]|date=2004|isbn=0-387-20860-7}}180 bytes (24 words) - 16:04, 2 December 2008
- 58 bytes (5 words) - 11:05, 13 August 2007
- #Redirect [[Prime Number Theorem]]34 bytes (4 words) - 16:00, 20 May 2008
- 2 bytes (0 words) - 23:56, 9 June 2008
- 2 bytes (0 words) - 00:33, 10 June 2008
- 2 bytes (0 words) - 11:26, 10 June 2008
- * [[Paulo Ribenboim]]. The New Book of Prime Number Records. Springer-Verlag, 1996, ISBN 0-387-94457-5253 bytes (31 words) - 07:51, 15 June 2009
- 2 bytes (0 words) - 23:20, 9 June 2008
- 2 bytes (0 words) - 00:07, 10 June 2008
- 2 bytes (0 words) - 11:15, 10 June 2008
- 2 bytes (0 words) - 11:27, 10 June 2008
- 2 bytes (0 words) - 23:28, 9 June 2008
- 2 bytes (0 words) - 00:22, 10 June 2008
- 2 bytes (0 words) - 11:22, 10 June 2008
- 35 bytes (4 words) - 11:01, 12 June 2008
- The number of [[proton]]s in the [[nucleus]] of a single [[atom]] of a chemical [[elem128 bytes (19 words) - 12:59, 7 July 2008
- A real number whose digits in some particular base occur equally often in the long run.123 bytes (19 words) - 13:17, 5 December 2008
- ...antly recognizable to students of [[art]] and [[art history]] as ''''Motif Number 1''''. ...ter [[Lester Hornby]] is believed to be the first to call the shack 'Motif Number 1', a reference to its being the favorite subject of the town's painters, a1 KB (235 words) - 08:57, 14 September 2013
- 12 bytes (1 word) - 11:01, 1 January 2008
- 2 bytes (0 words) - 23:57, 9 June 2008
- 2 bytes (0 words) - 00:33, 10 June 2008
- 2 bytes (0 words) - 11:27, 10 June 2008
- 12 bytes (1 word) - 14:45, 27 January 2008
- 180 bytes (24 words) - 09:33, 12 September 2009
- 1 bytes (0 words) - 23:24, 9 June 2008
- 2 bytes (0 words) - 00:10, 10 June 2008
- 2 bytes (0 words) - 11:15, 10 June 2008
- 3 bytes (0 words) - 11:28, 10 June 2008
- ...ite book | author=Alan Baker| authorlink=Alan Baker | title=Transcendental Number Theory | publisher=[[Cambridge University Press]] | year=1975 | isbn=0-521- ...William J. LeVeque | authorlink = William J. LeVeque | title = Topics in Number Theory, Volumes I and II | publisher = Dover Publications | location = New452 bytes (56 words) - 12:09, 1 January 2013
- ...ial division method]] provides an intuitive explanation. To test whether a number <math>n</math> is prime, you have to try whether it can be divided by all n ...[natural logarithm]] of <math>n</math>). The formal statement of the Prime Number Theorem is4 KB (703 words) - 12:02, 13 November 2007
- Represents the number of circles you can arrange to a equilateral triangle.111 bytes (15 words) - 22:28, 17 February 2009
- 2 bytes (0 words) - 12:35, 3 February 2010
- 2 bytes (0 words) - 23:28, 9 June 2008
- 2 bytes (0 words) - 00:22, 10 June 2008
- 2 bytes (0 words) - 11:22, 10 June 2008
- {{#lst:Unobtanium/Properties|Atomic number}}44 bytes (5 words) - 12:34, 19 May 2010
- A number that can be evenly divided by exactly two positive whole numbers, namely on133 bytes (20 words) - 05:24, 8 July 2008
- 12 bytes (1 word) - 10:54, 24 September 2007
- 12 bytes (1 word) - 11:03, 1 January 2008
- 670 bytes (84 words) - 17:24, 27 August 2009
- 7 bytes (0 words) - 17:20, 9 June 2008
- 2 bytes (0 words) - 23:59, 9 June 2008
- 2 bytes (0 words) - 09:27, 10 June 2008
- 2 bytes (0 words) - 11:27, 10 June 2008
- 12 bytes (1 word) - 01:39, 11 November 2007
- ...ption of the [[electron|electronic structure]] of [[atom]]s. The [[quantum number]] first arose in the [[Niels Bohr|Bohr]]-[[Arnold Sommerfeld|Sommerfeld]] t ...electron) atom moves in [[Ellipse|elliptic]] orbits. The principal quantum number appears in this theory at two places: in the energy ''E''<sub>''n''</sub> o5 KB (873 words) - 15:11, 15 May 2022
- 1 bytes (0 words) - 23:24, 9 June 2008
- 2 bytes (0 words) - 00:10, 10 June 2008
- 2 bytes (0 words) - 11:15, 10 June 2008
- 3 bytes (0 words) - 18:21, 10 June 2008
- A number which is not algebraic: that is, does not satisfy any polynomial with integ148 bytes (21 words) - 15:21, 31 October 2008
- 12 bytes (1 word) - 20:01, 19 December 2007
- ...e [[cubic equation|cubic equations]]. Even for equations with three [[real number|real]] solutions, the method they used sometimes required calculations wit ...tion <math>y(4-y) = 125</math>. Getting rid of the brackets and moving the number 125 to the left-hand side gives us the [[quadratic equation]]4 KB (685 words) - 00:41, 6 May 2008
- 2 bytes (0 words) - 23:35, 9 June 2008
- 2 bytes (0 words) - 00:23, 10 June 2008
- 2 bytes (0 words) - 11:24, 10 June 2008
- 9 bytes (2 words) - 15:43, 12 June 2008
- 899 bytes (119 words) - 17:42, 26 September 2007
- 125 bytes (18 words) - 18:41, 20 June 2009
- 2 bytes (0 words) - 00:00, 10 June 2008
- 2 bytes (0 words) - 11:14, 10 June 2008
- 2 bytes (0 words) - 11:27, 10 June 2008
- ...ly the best uncorrelated physical random sequences will do. See [[#Random number/related articles| related articles]] for examples of applications. ...put numbered balls in a bowl, having a blindfolded person take it out, the number recorded, the ball returned to the bowl, and the bowl shaken thoroughly bef23 KB (3,650 words) - 05:49, 8 April 2024
- ...authorlink=Peter Borwein | title=Computational Excursions in Analysis and Number Theory | series=CMS Books in Mathematics | publisher=[[Springer-Verlag]] | ...öhlich | authorlink=Ali Fröhlich | coauthors=M.J. Taylor | title=Algebraic number theory | series=Cambridge studies in advanced mathematics | volume=27 | pub2 KB (209 words) - 02:28, 22 December 2008
- 12 bytes (1 word) - 06:46, 11 November 2007
- 1 bytes (0 words) - 23:24, 9 June 2008
- 2 bytes (0 words) - 00:11, 10 June 2008
- 2 bytes (0 words) - 11:15, 10 June 2008
- 3 bytes (0 words) - 11:28, 10 June 2008
- 81 bytes (10 words) - 16:06, 27 July 2023
- 9 bytes (2 words) - 17:03, 13 March 2009
- 12 bytes (1 word) - 21:59, 19 December 2007
- ...<math> \sigma(n) </math> is the sum of the divisors of <math>n</math>. A number <math>n</math> is perfect precisely when Euclid showed that every number of the form2 KB (397 words) - 12:24, 14 May 2008
- 2 bytes (0 words) - 23:35, 9 June 2008
- 2 bytes (0 words) - 00:25, 10 June 2008
- 2 bytes (0 words) - 11:24, 10 June 2008
- ...form ''a+bi'', where ''a'' and ''b'' are real numbers and ''i'' denotes a number satisfying <math>i^2=-1</math>.163 bytes (26 words) - 05:12, 23 June 2008
- A complex number that is a root of a polynomial with rational coefficients.111 bytes (16 words) - 16:34, 13 July 2008
- Created [[Complex number/Draft]] [[User:David Tribe|David Tribe]] 19:30, 6 May 2007 (CDT)2 KB (190 words) - 10:10, 26 December 2009
- An infinite number, either a cardinal number or an ordinal number.103 bytes (14 words) - 18:45, 20 June 2009
- A number that can be expressed as a ratio of two integers.94 bytes (15 words) - 09:18, 1 June 2008
- 1 bytes (0 words) - 23:53, 6 May 2011
Page text matches
- {{r|Algebraic number theory}} {{r|Algebraic number field}}297 bytes (38 words) - 11:43, 15 June 2009
- ...'''class field theory''' studies the abelian extensions of an [[algebraic number field]], or more generally a [[global field]] or [[local field]].191 bytes (26 words) - 17:20, 10 January 2013
- ...nts the number of [[partition]]s of a positive integer ''n'', that is, the number of ways of expressing ''n'' as a sum of positive integers (where order is n Thus ''p''(3) = 3, since the number 3 has 3 partitions:483 bytes (70 words) - 16:32, 13 December 2008
- ...ranch of algebraic number theory which studies the abelian extensions of a number field, or more generally a global or local field.171 bytes (26 words) - 17:18, 10 January 2013
- {{r|Algebraic number}} {{r|Irrational number}}564 bytes (72 words) - 16:08, 11 January 2010
- |Atomic number | {{#lst:Unobtanium/Properties|Atomic number}}663 bytes (81 words) - 14:22, 19 May 2010
- ...of [[entropy]] such as [[device driver|device drivers]], or a pseudorandom number generator, in which the numbers are not truly random, but based on an algor450 bytes (71 words) - 00:44, 3 August 2009
- ...onvenient category and revealing its publisher, title, edition, and volume number.304 bytes (41 words) - 19:33, 12 September 2009
- ...a small number of blocks, then at least one block contains a rather large number of elements.198 bytes (32 words) - 10:48, 4 September 2009
- {{r|Algebraic number field}} {{r|Algebraic number}}1 KB (146 words) - 16:32, 11 January 2010
- ...fers to a number field regarded as an extension of the field of [[rational number]]s. There need not be a conductor for an extension: indeed, [[class field ...is, an extension by roots of unity. The absolute conductor of an abelian number field ''F'' is then the smallest integer ''f'' such that ''F'' is a [[subfi1 KB (177 words) - 01:07, 18 February 2009
- ...ntly, it is not a root of any polynomial whose coefficients are [[rational number|rational]]. Transcendental numbers are necessarily [[irrational number|irrational]], but there are many irrational numbers that are not transcende875 bytes (130 words) - 12:27, 8 May 2008
- Suppose ''x''<sub>1</sub>, ''x''<sub>2</sub>, ... is a [[sequence]] of [[Real number|real numbers]]. We say that the real number ''L'' is the ''limit'' of this sequence and we write771 bytes (122 words) - 09:45, 28 November 2007
- '''Zero''' is the name for a character, the digit '''0''', and for the [[number]] "zero". == The number zero ==2 KB (326 words) - 18:28, 17 July 2009
- A determinant which is defined for a finite number of functions of the same number of variables and in which each row consists of the first partial derivative256 bytes (42 words) - 20:18, 29 April 2009
- ...ation of a population for a sufficient number of persons over a sufficient number of years to generate [[incidence]] or [[mortality]] rates subsequent to the263 bytes (36 words) - 17:46, 14 May 2010
- .... The number of players in a game can vary from a single player to a large number of players (as in an online game). == Number of players ==903 bytes (152 words) - 04:45, 7 March 2024
- {{r|Complex number}} {{r|Algebraic number theory}}887 bytes (126 words) - 02:29, 22 December 2008
- {{r|0 (number)}} {{r|Algebraic number field}}2 KB (247 words) - 17:28, 11 January 2010
- {{r|Modulus (algebraic number theory)}} {{r|Modulus of a complex number}}205 bytes (29 words) - 15:13, 10 January 2024
- ...tons]] and [[neutrons]] in it's [[nucleus]], and characterized by [[atomic number]] (Z), [[atomic mass|mass]], [[energy state]], [[mass defect]], and [[nucle288 bytes (38 words) - 04:52, 18 May 2010
- ...evel metrics for a [[scientific journal|journal]] article, identifying the number of views of the [[full text]] or [[abstract]] and of PDF downloads as well ...mat|PDF]] or [[XML]]). Some [[reference manager]]s also allow to track the number of printouts or the time an article is displayed in an active window. All t1 KB (194 words) - 09:59, 13 June 2011
- ...eger, denoted σ(''n''), is the sum of all the positive [[divisor]]s of the number ''n''. ...e number itself. Hence a number ''n'' is perfect if σ(''n'') = 2''n''. A number is similarly defined to be ''abundant'' if σ(''n'') > 2''n'' and ''defi1 KB (172 words) - 04:53, 1 November 2013
- * {{cite book | author=Tom M. Apostol | title=Introduction to Analytic Number Theory | series=Undergraduate Texts in Mathematics | year=1976 | publisher= ...e=Multiplicative number theory | series=Lectures in advanced mathematics | number=1 | publisher=Markham | location=[[Chicago, Illinois]] | year=1967 }}796 bytes (90 words) - 16:47, 27 January 2023
- ...tes of America]] which supports research and conferences in the field of [[number theory]].312 bytes (43 words) - 14:07, 2 February 2023
- ...sed to a power, <math>\scriptstyle x \times 10^y</math>. For example, the number 325,000,000 is expressed as <math>3.25 \times 10^8</math> (In computer pro ...ative, a minus sign is placed to the left of the number as a whole. If the number is between -1 and 1, the power of ten is negative, and a minus sign appears2 KB (385 words) - 19:06, 3 September 2008
- ...<sub>0</sub>(''n''), is the number of positive integer [[divisor]]s of the number ''n''.720 bytes (123 words) - 04:26, 1 November 2013
- Auto-populated based on [[Special:WhatLinksHere/Number theory]]. Needs checking by a human. {{r|Algebraic number field}}2 KB (262 words) - 19:07, 11 January 2010
- {{r|Algebraic number field}} {{r|Complex number}}857 bytes (112 words) - 16:32, 11 January 2010
- ...al element]], having the [[chemical symbol]] Sn and [[atomic number]] (the number of [[proton]]s) of 50, with a [[Atomic mass#Standard atomic weights of th291 bytes (40 words) - 18:16, 24 April 2011
- ...only one word. In a verb, the classification of a word form by grammatical number is know as the [[case (grammar)|case]] of the verb. For example, the verb ' ==Subject noun and verb number agreement==2 KB (376 words) - 09:16, 3 October 2010
- ...ignated time. It is differentiated from [[incidence]], which refers to the number of new cases in the population at a given time.<noinclude>{{DefMeSH}}</noin278 bytes (43 words) - 17:58, 14 May 2010
- ...Japanese]]. The first three rows of the first table show number of births, number of deaths and overall population change (-123,000).561 bytes (74 words) - 23:31, 2 January 2011
- {{r|Fibonacci number}} {{r|Algebraic number}}566 bytes (73 words) - 16:56, 11 January 2010
- ...ed by publication of joint papers — as a graph. A researcher's Erdős number is the length of the shortest path, via co-author relationships, connecting More explicitly, your Erdős number is the ''first'' number in the following list which applies to you:2 KB (370 words) - 12:51, 11 February 2013
- ...utron) which cause another fission: (probability to crack a nucleus)*(mean number of neutrons produced by a single fission)276 bytes (41 words) - 21:45, 26 November 2012
- ...sum of two elements of a given set, stating that the average order of this number cannot be close to being a [[linear function]]. ...natural numbers and ''r''(''n'') denote the number of ways that a natural number ''n'' can be expressed as the sum of two elements of ''A'' (taking order in1 KB (199 words) - 10:50, 18 June 2009
- Auto-populated based on [[Special:WhatLinksHere/Modulus (algebraic number theory)]]. Needs checking by a human. {{r|Algebraic number field}}526 bytes (68 words) - 18:36, 11 January 2010
- ===The term planning refers to a number of different topics:=== ===A number of other topics also relate to the general topic of planning:===1 KB (153 words) - 21:35, 30 September 2020
- ...and which is [[unramified]] at all finite primes of ''K''. The '''genus number''' of ''K'' is the degree [''G'':''K''] and the '''genus group''' is the [[ ...te book | last=Ishida | first=Makoto | title=The genus fields of algebraic number fields | series=Lecture Notes in Mathematics | publisher=[[Springer Verlag]846 bytes (124 words) - 16:14, 28 October 2008
- The '''imaginary numbers''' are a part of the [[complex number]]s. Every complex number can be written as3 KB (468 words) - 17:28, 1 January 2010
- ...ers''' is strongly related to the sequence of [[Fibonacci number]]s. Lucas number and Fibonacci numbers have the identical formula <math>a_n = a_{n-1} + a_{n *If <math>p\ </math> is a prime number, than <math>p\ </math> divides <math>L_p - 1\ </math>. The converse is fals798 bytes (117 words) - 04:00, 4 March 2008
- #REDIRECT[[real number]]24 bytes (3 words) - 16:42, 10 July 2007
- #REDIRECT [[Atomic number]]27 bytes (3 words) - 17:22, 2 April 2008
- #Redirect [[Triangular number]]31 bytes (3 words) - 10:43, 19 May 2008
- #REDIRECT [[Erdős number]]27 bytes (4 words) - 01:28, 3 April 2011
- #REDIRECT[[real number]]24 bytes (3 words) - 15:26, 3 February 2007
- #REDIRECT [[Rational number]]29 bytes (3 words) - 21:58, 10 May 2007
- #REDIRECT [[Prime number]]26 bytes (3 words) - 21:24, 19 April 2010
- #REDIRECT[[irrational number]]30 bytes (3 words) - 17:22, 27 July 2007
- #REDIRECT [[0_(number)]]24 bytes (2 words) - 10:38, 19 January 2008
- #REDIRECT[[complex number]]27 bytes (3 words) - 18:02, 26 April 2007
- #REDIRECT [[complex number]]28 bytes (3 words) - 16:26, 22 April 2007
- #Redirect [[Prime number]]26 bytes (3 words) - 16:10, 14 June 2008
- #Redirect [[Perfect number]]28 bytes (3 words) - 21:44, 2 April 2008
- #Redirect [[Number theory]]27 bytes (3 words) - 07:04, 30 May 2008
- #REDIRECT [[Complex number]]28 bytes (3 words) - 15:30, 28 October 2007
- #Redirect [[Prime number]]26 bytes (3 words) - 16:11, 14 June 2008
- #Redirect [[Prime number]]26 bytes (3 words) - 20:21, 1 April 2008
- #REDIRECT [[grammatical number]]32 bytes (3 words) - 14:49, 4 January 2008
- #Redirect [[Perrin number]]27 bytes (3 words) - 10:41, 19 May 2008
- {{r|Complex number}} {{r|Real number}}183 bytes (22 words) - 17:31, 1 January 2010
- {{r|Real number}} {{r|Natural number}}203 bytes (25 words) - 18:31, 26 October 2008
- {{r|Natural number}} {{r|Real number}}307 bytes (44 words) - 16:27, 26 July 2008
- ...d P. Erdős, ''On the number of sets of integers with various properties'', Number theory (Banff, 1988), de Gruyter, Berlin 1990, pp. 61–79.470 bytes (66 words) - 11:48, 18 June 2009
- #REDIRECT [[Darmstadtium/Atomic number]]40 bytes (4 words) - 13:56, 18 June 2008
- #REDIRECT [[Hahnium/Atomic number]]35 bytes (4 words) - 18:21, 10 June 2008
- #REDIRECT [[Random number generator]]37 bytes (4 words) - 08:22, 3 December 2009
- #Redirect [[Prime Number Theorem]]34 bytes (4 words) - 16:00, 20 May 2008
- #REDIRECT [[Random number generator]]37 bytes (4 words) - 23:32, 21 August 2009
- {{r|cardinal number}} {{r|ordinal number}}182 bytes (22 words) - 18:39, 20 June 2009
- {{r|cardinal number}} {{r|natural number}}189 bytes (21 words) - 16:20, 17 June 2009
- Auto-populated based on [[Special:WhatLinksHere/Conductor of a number field]]. Needs checking by a human. {{r|Algebraic number field}}595 bytes (77 words) - 15:38, 11 January 2010
- ...ignated time. It is differentiated from [[incidence]], which refers to the number of new cases in the population at a given time." <ref>{{MeSH}}</ref>290 bytes (45 words) - 09:19, 23 March 2009
- ...iated command line interface. They have been developed by the Algebra and Number Theory research group of the Institute of Mathematics at [[Technische Unive ...tool for computations in algebraic number fields | booktitle=Computational number theory | publisher=de Gruyter | year=1991 | isbn=3-11-012394-0 | pages=321-1 KB (152 words) - 08:31, 14 September 2013
- #redirect [[Number needed to treat]]36 bytes (5 words) - 01:32, 19 January 2008
- #redirect[[Number needed to harm]]34 bytes (5 words) - 23:19, 26 March 2008
- #redirect[[Number needed to treat]]35 bytes (5 words) - 03:20, 30 March 2008
- #REDIRECT [[Mercury (element)/Atomic number]]45 bytes (5 words) - 14:59, 10 May 2010
- {{#lst:Unobtanium/Properties|Atomic number}}44 bytes (5 words) - 12:34, 19 May 2010
- #REDIRECT [[Random number generator/Definition]]48 bytes (5 words) - 23:32, 21 August 2009
- ...math>p\ </math> is a prime number and <math>2\cdot p + 1</math> is a prime number too, then we call <math>p\ </math> a '''Sophie Germain prime'''. The Sophie277 bytes (42 words) - 15:41, 23 February 2009
- ...öhlich | authorlink=Ali Fröhlich | coauthors=M.J. Taylor | title=Algebraic number theory | series=Cambridge studies in advanced mathematics | volume=27 | pub ...Ireland | coauthors=M. Rosen | title = A Classical Introduction to Modern Number Theory | publisher = Springer-Verlag | date = 1993 | location = New York,1 KB (153 words) - 14:18, 16 January 2013
- * {{Citation | last=Weiss | first=Edwin | title=Algebraic number theory | publisher=Chelsea Publishing | year=1976 | isbn=0-8284-0293-0}}. ...2=Taylor | first2=Martin | authorlink2= Martin J. Taylor | title=Algebraic number theory | publisher=[[Cambridge University Press]] | series=Cambridge Studie470 bytes (55 words) - 09:40, 12 June 2009
- #REDIRECT [[Random number generator/Related Articles]]54 bytes (6 words) - 23:32, 21 August 2009
- #REDIRECT [[Algebraic number field#Unit group]]47 bytes (6 words) - 05:06, 1 January 2009
- #REDIRECT [[Random number generator/External Links]]52 bytes (6 words) - 23:32, 21 August 2009
- #REDIRECT [[Algebraic number field#Unit group]]47 bytes (6 words) - 05:12, 1 January 2009
- ...efined as the inverse of the attributable risk. Intuitively, the lower the number needed to harm, the worse the risk-factor. ...web |url=http://www.jr2.ox.ac.uk/bandolier/booth/glossary/NNH.html |title=Number needed to harm (NNH) |accessdate=2008-03-26 |format= |work=}}</ref>.833 bytes (138 words) - 14:09, 29 March 2008
- ...//www.americanscientist.org/issues/pub/2007/2/an-exact-value-for-avogadros-number/1 Online] ...the number ''N''<sub>A</sub> to [[Amedeo Avogadro]]) speaks of "Avogadro's number", not of "the Avogadro constant". [http://nobelprize.org/nobel_prizes/phys1 KB (146 words) - 01:47, 5 October 2013
- {{r|P-adic number|''p''-adic number}}338 bytes (47 words) - 14:45, 26 July 2008
- ...number of moles of a component substance in a mixture divided by the total number of moles of the mixture.245 bytes (41 words) - 12:37, 3 September 2008
- {{r|Number theory}} {{r|Algebraic number}}454 bytes (55 words) - 03:14, 21 October 2010
- #REDIRECT [[Discriminant of an algebraic number field]]55 bytes (7 words) - 13:09, 23 December 2008
- ...ath>. Their study forms a part of the branch of [[mathematics]] known as [[number theory]].542 bytes (82 words) - 19:39, 7 April 2009
- {{r|Algebraic number}} {{r|Complex number}}2 KB (206 words) - 19:38, 11 January 2010
- ...[[real number]] and is the [[integer]] between [[1 (number)|1]] and [[-1 (number)|-1]], which signifies a value of nothing. It is also a [[numerical digit]] The number zero was invented twice - once in India and once in Mesoamerica. This inve1 KB (232 words) - 03:30, 6 November 2009
- ...of [[integer]]s, [[rational number]]s, [[real number|real]] and [[complex number]]s. In this context commutativity is often referred to as the ''commutativ695 bytes (102 words) - 19:40, 31 January 2009
- ...], '''partition''' refers to two related concepts, in [[set theory]] and [[number theory]]. ...ns of a finite set of size ''n'' into ''k'' parts is given by a [[Stirling number]] of the second kind;2 KB (336 words) - 07:17, 16 January 2009
- Periodic variation in the number of sunspots.81 bytes (10 words) - 12:28, 17 November 2011