Search Results for ""

Let p be an odd prime and F_n the cyclotomic field of p^(n+1)th roots of unity over the rational field. Now let p^(e(n)) be the power of p which divides the class number h_n ...

A rewriting of a given quantity (e.g., a matrix) in terms of a combination of "simpler" quantities.

A multiplication * is said to be right distributive if (x+y)z=xz+yz for every x, y, and z. Similarly, it is said to be left distributive if z(x+y)=zx+zy for every x, y, and ...

For discrete problems in which no efficient solution method is known, it might be necessary to test each possibility sequentially in order to determine if it is the solution. ...

Lehmer's formula is a formula for the prime counting function, pi(x) = (1) where |_x_| is the floor function, a = pi(x^(1/4)) (2) b = pi(x^(1/2)) (3) b_i = pi(sqrt(x/p_i)) ...

The second-order ordinary differential equation y^('')-[(m(m+1)+1/4-(m+1/2)cosx)/(sin^2x)+(lambda+1/2)]y=0.

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 ...

A primality test is a test to determine whether or not a given number is prime, as opposed to actually decomposing the number into its constituent prime factors (which is ...

A number r is an nth root of unity if r^n=1 and a primitive nth root of unity if, in addition, n is the smallest integer of k=1, ..., n for which r^k=1.

The second-order ordinary differential equation y^('')-[(M^2-1/4+K^2-2MKcosx)/(sin^2x)+(sigma+K^2+1/4)]y=0.