Search Results for ""

An algorithm is said to be solvable in polynomial time if the number of steps required to complete the algorithm for a given input is O(n^k) for some nonnegative integer k, ...

All Euclidean geometric constructions can be carried out with a straightedge alone if, in addition, one is given the radius of a single circle and its center. The theorem was ...

An elementary theorem in geometry whose name means "asses' bridge," perhaps in reference to the fact that fools would be unable to pass this point in their geometric studies. ...

The term "porism" is an archaic type of mathematical proposition whose historical purpose is not entirely known. It is used instead of "theorem" by some authors for a small ...

A power is an exponent to which a given quantity is raised. The expression x^a is therefore known as "x to the ath power." A number of powers of x are plotted above (cf. ...

An integer N which is a product of distinct primes and which satisfies 1/N+sum_(p|N)1/p=1 (Butske et al. 1999). The first few are 2, 6, 42, 1806, 47058, ... (OEIS A054377). ...

The set of numbers generated by excluding the sums of two or more consecutive earlier members is called the prime numbers of measurement, or sometimes the segmented numbers. ...

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 pseudosmarandache function Z(n) is the smallest integer such that sum_(k=1)^(Z(n))k=1/2Z(n)[Z(n)+1] is divisible by n. The values for n=1, 2, ... are 1, 3, 2, 7, 4, 3, 6, ...

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