Search Results for ""

An abundant number for which all proper divisors are deficient is called a primitive abundant number (Guy 1994, p. 46). The first few odd primitive abundant numbers are 945, ...

Given an integer sequence {a_n}_(n=1)^infty, a prime number p is said to be a primitive prime factor of the term a_n if p divides a_n but does not divide any a_m for m<n. It ...

A pseudoperfect number for which none of its proper divisors are pseudoperfect (Guy 1994, p. 46). The first few are 6, 20, 28, 88, 104, 272, ... (OEIS A006036). Primitive ...

The principal branch of an analytic multivalued function, also called a principal sheet, is a single-valued "slice" (i.e., branch) of the function chosen that is for ...

A general quintic equation a_5x^5+a_4x^4+a_3x^3+a_2x^2+a_1x+a_0=0 (1) can be reduced to one of the form y^5+b_2y^2+b_1y+b_0=0, (2) called the principal quintic form. Vieta's ...

A principal nth root omega of unity is a root satisfying the equations omega^n=1 and sum_(i=0)^(n-1)omega^(ij)=0 for j=1, 2, ..., n. Therefore, every primitive root of unity ...

The unique nonnegative square root of a nonnegative real number. For example, the principal square root of 9 is 3, although both -3 and 3 are square roots of 9. The concept ...

The principal value of an analytic multivalued function is the single value chosen by convention to be returned for a given argument. Complex multivalued functions have ...

Almost all processes that are not obviously simple can be viewed as computations of equivalent sophistication (Wolfram 2002, pp. 5 and 716-717). More specifically, the ...

A principle that was first enunciated by Jakob Bernoulli which states that if we are ignorant of the ways an event can occur (and therefore have no reason to believe that one ...