Misplaced Pages

#76923

61-531: Not to be confused with primorial . [REDACTED] Look up primordial in Wiktionary, the free dictionary. Primordial may refer to: Primordial era, an era after the Big Bang . See Chronology of the universe Primordial soup , hypothetical conditions under which life on Earth may have begun Primordial nuclide , nuclides, a few radioactive, that formed before

122-602: A {\displaystyle a} (often, a = 0 {\displaystyle a=0} ): we say f ( x ) = O ( g ( x ) )  as    x → a {\displaystyle f(x)=O{\bigl (}g(x){\bigr )}\quad {\text{ as }}\ x\to a} if there exist positive numbers δ {\displaystyle \delta } and M {\displaystyle M} such that for all defined x {\displaystyle x} with 0 < | x −

183-467: A | < δ , {\displaystyle 0<|x-a|<\delta ,} | f ( x ) | ≤ M | g ( x ) | . {\displaystyle |f(x)|\leq M|g(x)|.} As g ( x ) {\displaystyle g(x)} is non-zero for adequately large (or small) values of x , {\displaystyle x,} both of these definitions can be unified using

244-463: A stronger statement than the corresponding big-O notation: every function that is little-o of g is also big-O of g , but not every function that is big-O of g is little-o of g . For example, 2 x 2 = O ( x 2 ) {\displaystyle 2x^{2}=O(x^{2})} but 2 x 2 ≠ o ( x 2 ) {\displaystyle 2x^{2}\neq o(x^{2})} . If g ( x )

305-484: A group of Greek deities born in the beginning of our universe Adi-Buddha , also referred to as "primordial Buddha", a self-emanating, self-originating Buddha Primordial covenant , God's covenant with humanity in Islam See also [ edit ] All pages with titles beginning with Primordial Primal (disambiguation) Primeval (disambiguation) Primitive (disambiguation) Topics referred to by

366-403: A more colloquial "is", so the second expression is sometimes considered more accurate (see the " Equals sign " discussion below) while the first is considered by some as an abuse of notation . Big O can also be used to describe the error term in an approximation to a mathematical function. The most significant terms are written explicitly, and then the least-significant terms are summarized in

427-467: A particular value or infinity. Big O is a member of a family of notations invented by German mathematicians Paul Bachmann , Edmund Landau , and others, collectively called Bachmann–Landau notation or asymptotic notation . The letter O was chosen by Bachmann to stand for Ordnung , meaning the order of approximation . In computer science , big O notation is used to classify algorithms according to how their run time or space requirements grow as

488-425: A real number x 0 {\displaystyle x_{0}} such that | f ( x ) | ≤ M   | g ( x ) |  for all  x ≥ x 0   . {\displaystyle |f(x)|\leq M\ |g(x)|\quad {\text{ for all }}x\geq x_{0}~.} In many contexts, the assumption that we are interested in

549-962: A real number x 0 and a positive real number M and for all x > x 0 . To prove this, let x 0 = 1 and M = 13 . Then, for all x > x 0 : | 6 x 4 − 2 x 3 + 5 | ≤ 6 x 4 + | 2 x 3 | + 5 ≤ 6 x 4 + 2 x 4 + 5 x 4 = 13 x 4 {\displaystyle {\begin{aligned}|6x^{4}-2x^{3}+5|&\leq 6x^{4}+|2x^{3}|+5\\&\leq 6x^{4}+2x^{4}+5x^{4}\\&=13x^{4}\end{aligned}}} so | 6 x 4 − 2 x 3 + 5 | ≤ 13 x 4 . {\displaystyle |6x^{4}-2x^{3}+5|\leq 13x^{4}.} Big O notation has two main areas of application: In both applications,

610-431: A single big O term. Consider, for example, the exponential series and two expressions of it that are valid when x is small: The middle expression (the one with O ( x )) means the absolute-value of the error e − (1 + x + x /2) is at most some constant times | x | when x is close enough to 0. If the function f can be written as a finite sum of other functions, then the fastest growing one determines

671-646: A symmetry that this statement does not have. As de Bruijn says,   O [ x ] = O [ x ]   is true but   O [ x ] = O [ x ]   is not. Knuth describes such statements as "one-way equalities", since if the sides could be reversed, "we could deduce ridiculous things like   n = n   from the identities   n = O [ n ]   and   n = O [ n ]   ". In another letter, Knuth also pointed out that For these reasons, it would be more precise to use set notation and write   f ( x ) ∈ O [ g ( x ) ]   (read as: "   f ( x )  

SECTION 10

#1732845253077

732-1141: Is O ( n ) when measured in terms of the number n of digits of an input number x , then its run time is O (log x ) when measured as a function of the input number x itself, because n = O (log x ) . If f 1 = O ( g 1 ) {\displaystyle f_{1}=O(g_{1})} and f 2 = O ( g 2 ) {\displaystyle f_{2}=O(g_{2})} then f 1 + f 2 = O ( max ( g 1 , g 2 ) ) {\displaystyle f_{1}+f_{2}=O(\max(g_{1},g_{2}))} . It follows that if f 1 = O ( g ) {\displaystyle f_{1}=O(g)} and f 2 = O ( g ) {\displaystyle f_{2}=O(g)} then f 1 + f 2 ∈ O ( g ) {\displaystyle f_{1}+f_{2}\in O(g)} . In other words, this second statement says that O ( g ) {\displaystyle O(g)}

793-1350: Is a convex cone . Let k be a nonzero constant. Then O ( | k | ⋅ g ) = O ( g ) {\displaystyle O(|k|\cdot g)=O(g)} . In other words, if f = O ( g ) {\displaystyle f=O(g)} , then k ⋅ f = O ( g ) . {\displaystyle k\cdot f=O(g).} Big O (and little o, Ω, etc.) can also be used with multiple variables. To define big O formally for multiple variables, suppose f {\displaystyle f} and g {\displaystyle g} are two functions defined on some subset of R n {\displaystyle \mathbb {R} ^{n}} . We say if and only if there exist constants M {\displaystyle M} and C > 0 {\displaystyle C>0} such that | f ( x ) | ≤ C | g ( x ) | {\displaystyle |f(\mathbf {x} )|\leq C|g(\mathbf {x} )|} for all x {\displaystyle \mathbf {x} } with x i ≥ M {\displaystyle x_{i}\geq M} for some i . {\displaystyle i.} Equivalently,

854-473: Is a "big O" of x . Mathematically, we can write f ( x ) = O ( x ) . One may confirm this calculation using the formal definition: let f ( x ) = 6 x − 2 x + 5 and g ( x ) = x . Applying the formal definition from above, the statement that f ( x ) = O ( x ) is equivalent to its expansion, | f ( x ) | ≤ M x 4 {\displaystyle |f(x)|\leq Mx^{4}} for some suitable choice of

915-477: Is a product of primorials (e.g. 360 = 2 × 6 × 30 ). Primorials are all square-free integers , and each one has more distinct prime factors than any number smaller than it. For each primorial n , the fraction ⁠ φ ( n ) / n ⁠ is smaller than for any lesser integer, where φ is the Euler totient function . Any completely multiplicative function is defined by its values at primorials, since it

976-436: Is a subset of O ( n c + ε ) {\displaystyle O(n^{c+\varepsilon })} for any ε > 0 {\displaystyle \varepsilon >0} , so may be considered as a polynomial with some bigger order. Big O is widely used in computer science. Together with some other related notations, it forms the family of Bachmann–Landau notations. Intuitively,

1037-569: Is an element of   O [ g ( x ) ]   ", or "   f ( x )   is in the set   O [ g ( x ) ]  "), thinking of   O [ g ( x ) ]   as the class of all functions   h ( x )   such that   | h ( x ) | ≤ C | g ( x ) |   for some positive real number C . However, the use of the equals sign is customary. Big O notation can also be used in conjunction with other arithmetic operators in more complicated equations. For example, h ( x ) + O ( f ( x )) denotes

1098-402: Is as follows: for any functions which satisfy each O (·) on the left side, there are some functions satisfying each O (·) on the right side, such that substituting all these functions into the equation makes the two sides equal. For example, the third equation above means: "For any function f ( n ) = O (1), there is some function g ( n ) = O ( e ) such that n = g ( n )." In terms of

1159-459: Is at most a positive constant multiple of the absolute value of g ( x ) {\displaystyle g(x)} for all sufficiently large values of x . {\displaystyle x.} That is, f ( x ) = O ( g ( x ) ) {\displaystyle f(x)=O{\bigl (}g(x){\bigr )}} if there exists a positive real number M {\displaystyle M} and

1220-469: Is defined by its values at primes, which can be recovered by division of adjacent values. Base systems corresponding to primorials (such as base 30, not to be confused with the primorial number system ) have a lower proportion of repeating fractions than any smaller base. Every primorial is a sparsely totient number . The n -compositorial of a composite number n is the product of all composite numbers up to and including n . The n -compositorial

1281-458: Is different from Wikidata All article disambiguation pages All disambiguation pages Primorial The name "primorial", coined by Harvey Dubner , draws an analogy to primes similar to the way the name "factorial" relates to factors . For the n th prime number p n , the primorial p n # is defined as the product of the first n primes: where p k is the k th prime number. For instance, p 5 # signifies

SECTION 20

#1732845253077

1342-418: Is equal to the n - factorial divided by the primorial n # . The compositorials are The Riemann zeta function at positive integers greater than one can be expressed by using the primorial function and Jordan's totient function J k ( n ) : Little O notation Big O notation is a mathematical notation that describes the limiting behavior of a function when the argument tends towards

1403-491: Is nonzero, or at least becomes nonzero beyond a certain point, the relation f ( x ) = o ( g ( x ) ) {\displaystyle f(x)=o(g(x))} is equivalent to Little-o respects a number of arithmetic operations. For example, It also satisfies a transitivity relation: Another asymptotic notation is Ω {\displaystyle \Omega } , read "big omega". There are two widespread and incompatible definitions of

1464-425: Is not the only generalization of big O to multivariate functions, and in practice, there is some inconsistency in the choice of definition. The statement "   f ( x )   is   O [ g ( x ) ]   " as defined above is usually written as   f ( x ) = O [ g ( x ) ]   . Some consider this to be an abuse of notation , since the use of the equals sign could be misleading as it suggests

1525-424: Is read "   f ( x )   {\displaystyle \ f(x)\ } is big O of g ( x ) {\displaystyle g(x)} " or more often " f ( x ) {\displaystyle f(x)} is of the order of g ( x ) {\displaystyle g(x)} " if the absolute value of f ( x ) {\displaystyle f(x)}

1586-503: Is strictly positive for all large enough values of x . One writes if for every positive constant ε there exists a constant x 0 {\displaystyle x_{0}} such that For example, one has The difference between the definition of the big-O notation and the definition of little-o is that while the former has to be true for at least one constant M , the latter must hold for every positive constant ε , however small. In this way, little-o notation makes

1647-448: Is the prime-counting function (sequence A000720 in the OEIS ), which gives the number of primes ≤ n . This is equivalent to: For example, 12# represents the product of those primes ≤ 12: Since π (12) = 5 , this can be calculated as: Consider the first 12 values of n # : We see that for composite n every term n # simply duplicates the preceding term ( n − 1)# , as given in

1708-402: Is the sum of three terms: 6 x , −2 x , and 5 . Of these three terms, the one with the highest growth rate is the one with the largest exponent as a function of x , namely 6 x . Now one may apply the second rule: 6 x is a product of 6 and x in which the first factor does not depend on x . Omitting this factor results in the simplified form x . Thus, we say that f ( x )

1769-448: The O notation is asymptotical, that is, it refers to very large x . In this setting, the contribution of the terms that grow "most quickly" will eventually make the other ones irrelevant. As a result, the following simplification rules can be applied: For example, let f ( x ) = 6 x − 2 x + 5 , and suppose we wish to simplify this function, using O notation, to describe its growth rate as x approaches infinity. This function

1830-472: The 2 n term. Ignoring the latter would have negligible effect on the expression's value for most purposes. Further, the coefficients become irrelevant if we compare to any other order of expression, such as an expression containing a term n or n . Even if T ( n ) = 1,000,000 n , if U ( n ) = n , the latter will always exceed the former once n grows larger than 1,000,000 , viz. T (1,000,000) = 1,000,000 = U (1,000,000) . Additionally,

1891-477: The Chebyshev norm . For example, the statement asserts that there exist constants C and M such that whenever either m ≥ M {\displaystyle m\geq M} or n ≥ M {\displaystyle n\geq M} holds. This definition allows all of the coordinates of x {\displaystyle \mathbf {x} } to increase to infinity. In particular,

Primordial - Misplaced Pages Continue

1952-444: The limit point a {\displaystyle a} (whether ∞ {\displaystyle \infty } or not) is a cluster point of the domains of f {\displaystyle f} and g , {\displaystyle g,} i. e., in every neighbourhood of a {\displaystyle a} there have to be infinitely many points in common. Moreover, as pointed out in

2013-557: The limit superior : f ( x ) = O ( g ( x ) )  as    x → a {\displaystyle f(x)=O{\bigl (}g(x){\bigr )}\quad {\text{ as }}\ x\to a} if lim sup x → a | f ( x ) | | g ( x ) | < ∞ . {\displaystyle \limsup _{x\to a}{\frac {\left|f(x)\right|}{\left|g(x)\right|}}<\infty .} And in both of these definitions

2074-641: The positive integers to the nonnegative real numbers; then f ( x ) = O ( g ( x ) ) {\displaystyle f(x)=O{\bigl (}g(x){\bigr )}} if there exist positive integer numbers M {\displaystyle M} and n 0 {\displaystyle n_{0}} such that | f ( n ) | ≤ M | g ( n ) | {\displaystyle |f(n)|\leq M|g(n)|} for all n ≥ n 0 . {\displaystyle n\geq n_{0}.} In typical usage

2135-417: The "set notation" above, the meaning is that the class of functions represented by the left side is a subset of the class of functions represented by the right side. In this use the "=" is a formal symbol that unlike the usual use of "=" is not a symmetric relation . Thus for example n = O ( e ) does not imply the false statement O ( e ) = n . Big O is typeset as an italicized uppercase "O", as in

2196-713: The Earth existed and are stable enough to still occur on Earth Primordial elements , elements formed before the Earth came into existence Primordial narcissism , the psychological condition of prenatal existence Primordialism , the argument which contends that nations are ancient, natural phenomena Primordial (band) , Irish heavy metal band Primordial (roller coaster) , a roller coaster at Lagoon in Farmington, Utah Primordial (album) , debut studio album by American deathcore band Shadow of Intent Religion and mythology [ edit ] Greek primordial deities ,

2257-477: The article about the limit inferior and limit superior , the lim sup x → a {\displaystyle \textstyle \limsup _{x\to a}} (at least on the extended real number line ) always exists. In computer science, a slightly more restrictive definition is common: f {\displaystyle f} and g {\displaystyle g} are both required to be functions from some unbounded subset of

2318-438: The assertion " f ( x ) is o ( g ( x )) " (read " f ( x ) is little-o of g ( x ) " or " f ( x ) is of inferior order to g ( x ) ") means that g ( x ) grows much faster than f ( x ) , or equivalently f ( x ) grows much slower than g ( x ) . As before, let f be a real or complex valued function and g a real valued function, both defined on some unbounded subset of the positive real numbers , such that g ( x )

2379-446: The big O notation ignores that. Similarly, logs with different constant bases are equivalent. On the other hand, exponentials with different bases are not of the same order. For example, 2 and 3 are not of the same order. Changing units may or may not affect the order of the resulting algorithm. Changing units is equivalent to multiplying the appropriate variable by a constant wherever it appears. For example, if an algorithm runs in

2440-423: The collection of functions having the growth of h ( x ) plus a part whose growth is limited to that of f ( x ). Thus, expresses the same as Suppose an algorithm is being developed to operate on a set of n elements. Its developers are interested in finding a function T ( n ) that will express how long the algorithm will take to run (in some arbitrary measurement of time) in terms of the number of elements in

2501-458: The condition that x i ≥ M {\displaystyle x_{i}\geq M} for some i {\displaystyle i} can be written ‖ x ‖ ∞ ≥ M {\displaystyle \|\mathbf {x} \|_{\infty }\geq M} , where ‖ x ‖ ∞ {\displaystyle \|\mathbf {x} \|_{\infty }} denotes

Primordial - Misplaced Pages Continue

2562-412: The definition. In the above example we have 12# = p 5 # = 11# since 12 is a composite number. Primorials are related to the first Chebyshev function , written ϑ ( n ) or θ ( n ) according to: Since ϑ ( n ) asymptotically approaches n for large values of n , primorials therefore grow according to: The idea of multiplying all known primes occurs in some proofs of the infinitude of

2623-459: The following example: O ( n 2 ) {\displaystyle O(n^{2})} . In TeX , it is produced by simply typing O inside math mode. Unlike Greek-named Bachmann–Landau notations, it needs no special symbol. However, some authors use the calligraphic variant O {\displaystyle {\mathcal {O}}} instead. Here is a list of classes of functions that are commonly encountered when analyzing

2684-444: The form c is called subexponential . An algorithm can require time that is both superpolynomial and subexponential; examples of this include the fastest known algorithms for integer factorization and the function n . We may ignore any powers of n inside of the logarithms. The set O (log n ) is exactly the same as O (log( n )) . The logarithms differ only by a constant factor (since log( n ) = c log n ) and thus

2745-404: The function g ( x ) appearing within the O (·) is typically chosen to be as simple as possible, omitting constant factors and lower order terms. There are two formally close, but noticeably different, usages of this notation: This distinction is only in application and not in principle, however—the formal definition for the "big O" is the same for both cases, only with different limits for

2806-412: The function argument. Big O notation is useful when analyzing algorithms for efficiency. For example, the time (or the number of steps) it takes to complete a problem of size n might be found to be T ( n ) = 4 n − 2 n + 2 . As n grows large, the n term will come to dominate, so that all other terms can be neglected—for instance when n = 500 , the term 4 n is 1000 times as large as

2867-743: The function to be estimated, be a real or complex valued function, and let   g {\displaystyle \ g\,} the comparison function, be a real valued function. Let both functions be defined on some unbounded subset of the positive real numbers , and g ( x ) {\displaystyle g(x)} be non-zero (often, but not necessarily, strictly positive) for all large enough values of x . {\displaystyle x.} One writes f ( x ) = O ( g ( x ) )  as  x → ∞ {\displaystyle f(x)=O{\bigl (}g(x){\bigr )}\quad {\text{ as }}x\to \infty } and it

2928-454: The growth rate as the variable   x   {\displaystyle \ x\ } goes to infinity or to zero is left unstated, and one writes more simply that f ( x ) = O ( g ( x ) ) . {\displaystyle f(x)=O{\bigl (}g(x){\bigr )}.} The notation can also be used to describe the behavior of f {\displaystyle f} near some real number

2989-410: The input set. The algorithm works by first calling a subroutine to sort the elements in the set and then perform its own operations. The sort has a known time complexity of O ( n ), and after the subroutine runs the algorithm must take an additional 55 n + 2 n + 10 steps before it terminates. Thus the overall time complexity of the algorithm can be expressed as T ( n ) = 55 n + O ( n ) . Here

3050-461: The input size grows. In analytic number theory , big O notation is often used to express a bound on the difference between an arithmetical function and a better understood approximation; a famous example of such a difference is the remainder term in the prime number theorem . Big O notation is also used in many other fields to provide similar estimates. Big O notation characterizes functions according to their growth rates: different functions with

3111-450: The number of steps depends on the details of the machine model on which the algorithm runs, but different types of machines typically vary by only a constant factor in the number of steps needed to execute an algorithm. So the big O notation captures what remains: we write either or and say that the algorithm has order of n time complexity. The sign " = " is not meant to express "is equal to" in its normal mathematical sense, but rather

SECTION 50

#1732845253077

3172-461: The order of f ( n ) . For example, In particular, if a function may be bounded by a polynomial in n , then as n tends to infinity , one may disregard lower-order terms of the polynomial. The sets O ( n ) and O ( c ) are very different. If c is greater than one, then the latter grows much faster. A function that grows faster than n for any c is called superpolynomial . One that grows more slowly than any exponential function of

3233-449: The order of n , replacing n by cn means the algorithm runs in the order of c n , and the big O notation ignores the constant c . This can be written as c n = O( n ) . If, however, an algorithm runs in the order of 2 , replacing n with cn gives 2 = (2 ) . This is not equivalent to 2 in general. Changing variables may also affect the order of the resulting algorithm. For example, if an algorithm's run time

3294-485: The prime numbers , where it is used to derive the existence of another prime. Notes: Primorials play a role in the search for prime numbers in additive arithmetic progressions . For instance, 2 236 133 941  + 23# results in a prime, beginning a sequence of thirteen primes found by repeatedly adding 23#, and ending with 5 136 341 251 . 23# is also the common difference in arithmetic progressions of fifteen and sixteen primes. Every highly composite number

3355-398: The product of the first 5 primes: The first five primorials p n # are: The sequence also includes p 0 # = 1 as empty product . Asymptotically, primorials p n # grow according to: where o ( ) is Little O notation . In general, for a positive integer n , its primorial, n# , is the product of the primes that are not greater than n ; that is, where π ( n )

3416-761: The running time of an algorithm. In each case, c is a positive constant and n increases without bound. The slower-growing functions are generally listed first. The statement f ( n ) = O ( n ! ) {\displaystyle f(n)=O(n!)} is sometimes weakened to f ( n ) = O ( n n ) {\displaystyle f(n)=O\left(n^{n}\right)} to derive simpler formulas for asymptotic complexity. For any k > 0 {\displaystyle k>0} and c > 0 {\displaystyle c>0} , O ( n c ( log ⁡ n ) k ) {\displaystyle O(n^{c}(\log n)^{k})}

3477-538: The same asymptotic growth rate may be represented using the same O notation. The letter O is used because the growth rate of a function is also referred to as the order of the function . A description of a function in terms of big O notation usually only provides an upper bound on the growth rate of the function. Associated with big O notation are several related notations, using the symbols o , Ω, ω , and Θ , to describe other kinds of bounds on asymptotic growth rates. Let f , {\displaystyle f,}

3538-417: The same term [REDACTED] This disambiguation page lists articles associated with the title Primordial . If an internal link led you here, you may wish to change the link to point directly to the intended article. Retrieved from " https://en.wikipedia.org/w/index.php?title=Primordial&oldid=1247756367 " Category : Disambiguation pages Hidden categories: Short description

3599-451: The statement (i.e., ∃ C ∃ M ∀ n ∀ m ⋯ {\displaystyle \exists C\,\exists M\,\forall n\,\forall m\,\cdots } ) is quite different from (i.e., ∀ m ∃ C ∃ M ∀ n ⋯ {\displaystyle \forall m\,\exists C\,\exists M\,\forall n\,\cdots } ). Under this definition,

3660-836: The subset on which a function is defined is significant when generalizing statements from the univariate setting to the multivariate setting. For example, if f ( n , m ) = 1 {\displaystyle f(n,m)=1} and g ( n , m ) = n {\displaystyle g(n,m)=n} , then f ( n , m ) = O ( g ( n , m ) ) {\displaystyle f(n,m)=O(g(n,m))} if we restrict f {\displaystyle f} and g {\displaystyle g} to [ 1 , ∞ ) 2 {\displaystyle [1,\infty )^{2}} , but not if they are defined on [ 0 , ∞ ) 2 {\displaystyle [0,\infty )^{2}} . This

3721-1141: The terms 2 n + 10 are subsumed within the faster-growing O ( n ). Again, this usage disregards some of the formal meaning of the "=" symbol, but it does allow one to use the big O notation as a kind of convenient placeholder. In more complicated usage, O (·) can appear in different places in an equation, even several times on each side. For example, the following are true for n → ∞ {\displaystyle n\to \infty } : ( n + 1 ) 2 = n 2 + O ( n ) , ( n + O ( n 1 / 2 ) ) ⋅ ( n + O ( log ⁡ n ) ) 2 = n 3 + O ( n 5 / 2 ) , n O ( 1 ) = O ( e n ) . {\displaystyle {\begin{aligned}(n+1)^{2}&=n^{2}+O(n),\\(n+O(n^{1/2}))\cdot (n+O(\log n))^{2}&=n^{3}+O(n^{5/2}),\\n^{O(1)}&=O(e^{n}).\end{aligned}}} The meaning of such statements

SECTION 60

#1732845253077
#76923