Search results

For a nonnegative integer ''n'' and a prime number ''p'', the exponent <math> e_{p} </math> in the factorization is called the

...y set {0,1,...,p-1} under addition and multiplication modulo p, for any [[prime number]] p, is a field. ...eld is taken to be 0. If the characteristic of a field is nonzero, it is a prime number because otherwise, the number <math>1+1+\cdots+1</math>, where the number o

...sidered as acting on [[commutativity|commutative]] algebras or fields of [[prime number|prime]] [[characteristic of a field|characteristic]] ''p''.

* The [[Prime Number Theorem]] is equivalent to the statement that the [[von Mangoldt function]]

{{r|Prime Number Theorem}}

...used in the study of [[arithmetic function]]s and yields a proof of the [[Prime number theorem]]. It is an example of a [[Tauberian theorem]]. ...are values of the [[von Mangoldt function]], it is possible to deduce the prime number theorem from the fact that the zeta function has no zeroes on the line <mat

* Analytic number theory: distribution of prime numbers, comparative prime number theory, multiplicative functions, sieve methods

{{r|Prime number}}

...orm a full rectangle more than one square wide with 11 squares, so 11 is a prime number.]] ...and itself. The first few prime numbers are 2, 3, 5, 7, 11, 13, and 17. A prime number <math>p</math> cannot be factored as the [[multiplication|product]] of two

{{r|Prime number}}

...Folgen]]. Aber nichts in der Mathematik finde ich so interessant wie die [[Prime number|Primzahlen]] und die mit ihnen zusammenhängenden [[Pseudoprime|Pseudoprimz

...umber]] greater than 2 can be expressed as a sum of two (possibly equal) [[prime number]]s''

== [[prime number]] == :Addition: I suggested this because you're math editor and because [[prime number]] is approved and cannot be corrected without intervention of a math editor

...orm a full rectangle more than one square wide with 11 squares, so 11 is a prime number.]] A '''prime number''' is a [[integer|whole number]] greater than 1 that can be evenly divided

...erty of the sequence of Perrin numbers is, that if <math>p\ </math> is a [[prime number]], then <math>p\ </math> divides <math>P_p\ </math>. The converse is false,

...is a polynomial whose roots are used to generate [[field extension]]s of [[prime number|prime]] degree ''p'' in [[characteristic of a field|characteristic]] ''p''.

*If <math>\ F_p\ </math>&nbsp; is a prime number different from 3, then <math>\ p</math>&nbsp; is prime. (The converse is fa

{{rpl|Prime number}}. ...Lewis|Lion|Snake|Tiger|Cat|Charles Dickens|New York, New York|York|DNA|Dog|Prime number|Rottweiler}}

...ence when it was shown to have a connection with the distribution of the [[prime number]]s. The most important result related to the Riemann zeta function is the (the index ''p'' running through the set of [[prime number]]s).

...r vectors in the space can be assembled. This is similar to viewing the [[prime number]]s as building blocks from which [[positive]] [[integer]]s can be assembled