Search Results for ""

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

A number satisfying Fermat's little theorem (or some other primality test) for some nontrivial base. A probable prime which is shown to be composite is called a pseudoprime ...

A positive proper divisor is a positive divisor of a number n, excluding n itself. For example, 1, 2, and 3 are positive proper divisors of 6, but 6 itself is not. The number ...

The case of the Weierstrass elliptic function with invariants g_2=-1 and g_3=0. The half-periods for this case are L(1+i)/4 and L(-1+i)/4, where L is the lemniscate constant ...

A figurate number corresponding to a configuration of points which form a pyramid with r-sided regular polygon bases can be thought of as a generalized pyramidal number, and ...

The Pythagorean means are the three "classic" means A (the arithmetic mean), G (the geometric mean), and H (the harmonic mean) are sometimes known as the Pythagorean means. ...

A number of the form +/-sqrt(a), where a is a positive rational number which is not the square of another rational number is called a pure quadratic surd. A number of the ...

Let sigma(m) be the divisor function of m. Then two numbers m and n are a quasiamicable pair if sigma(m)=sigma(n)=m+n+1. The first few are (48, 75), (140, 195), (1050, 1925), ...

A quasiperfect number, called a "slightly excessive number" by Singh (1997), is a "least" abundant number, i.e., one such that sigma(n)=2n+1. Quasiperfect numbers are ...

A positive integer n>1 is quiteprime iff all primes p<=sqrt(n) satisfy |2[n (mod p)]-p|<=p+1-sqrt(p). Also define 2 and 3 to be quiteprimes. Then the first few quiteprimes ...