Search Results for ""

Each prime factor p_i^(alpha_i) in an integer's prime factorization is called a primary.

A power series sum^(infty)c_kx^k will converge only for certain values of x. For instance, sum_(k=0)^(infty)x^k converges for -1<x<1. In general, there is always an interval ...

A prime factorization algorithm.

The function from a given nonempty set X to the power set P(X) that maps every element x of X to the set {x}.

Two numbers which are relatively prime.

Just as many interesting integer sequences can be defined and their properties studied, it is often of interest to additionally determine which of their elements are prime. ...

For N=k·2^n+1 with k odd and 2^n>k, if there exists an integer a such that a^((N-1)/2)=-1 (mod N), then N is prime. A prime of this form is known as a Proth prime.

The set of all sets is its own power set. Therefore, the cardinal number of the set of all sets must be bigger than itself.

A positive integer n is kth powerfree if there is no number d such that d^k|n (d^k divides n), i.e., there are no kth powers or higher in the prime factorization of n. A ...

Mathematical growth in which one population grows at a rate proportional to the power of another population.