|
In mathematics, and more particularly in number theory, primorial is a function from natural numbers to natural numbers similar to the factorial function, but rather than successively multiplying positive integers, only prime numbers are multiplied. There are two conflicting definitions that differ in the interpretation of the argument: the first interprets the argument as an index into the sequence of prime numbers (so that the function is strictly increasing), while the second interprets the argument as a bound on the prime numbers to be multiplied (so that the function value at any composite number is the same as at its predecessor). The rest of this article uses the latter interpretation. The name "primorial", attributed to Harvey Dubner, draws an analogy to ''primes'' the same way the name "factorial" relates to ''factors''. == Definition for Primorial numbers == For the ''n''th prime number ''pn'' the primorial ''pn#'' is defined as the product of the first ''n'' primes: : where ''pk'' is the ''k''th prime number. For instance, ''p5#'' signifies the product of the first 5 primes: : The first six primorials ''pn#'' are: :1, 2, 6, 30, 210, 2310. The sequence also includes ''p0#'' = 1 as empty product. Asymptotically, primorials ''pn#'' grow according to: : where is the little-o notation.〔 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「primorial」の詳細全文を読む スポンサード リンク
|