Search Results for ""

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.

Pre-Algebra

A solution zeta_k=e^(2piik/d) to the cyclotomic equation x^d=1. The de Moivre numbers give the coordinates in the complex plane of the polygon vertices of a regular polygon ...

d is called an e-divisor (or exponential divisor) of a number n with prime factorization n=p_1^(a_1)p_2^(a_2)...p_r^(a_r) if d|n and d=p_1^(b_1)p_2^(b_2)...p_r^(b_r), where ...

Arithmetic is the branch of mathematics dealing with integers or, more generally, numerical computation. Arithmetical operations include addition, congruence calculation, ...