Search Results for ""

A prime number obtained by reading digits around an analog clock. In a clockwise direction, the primes are 2, 3, 5, 7, 11, 23, 67, 89, 4567, 23456789, 23456789101112123, ... ...

Consider a combination lock consisting of n buttons that can be pressed in any combination (including multiple buttons at once), but in such a way that each number is pressed ...

A monoid that is commutative i.e., a monoid M such that for every two elements a and b in M, ab=ba. This means that commutative monoids are commutative, associative, and have ...

A sequence of numbers V={nu_n} is complete if every positive integer n is the sum of some subsequence of V, i.e., there exist a_i=0 or 1 such that n=sum_(i=1)^inftya_inu_i ...

The expected number of trials needed to collect a complete set of n different objects when picked at random with repetition is nH_n (Havil 2003, p. 131). For n=1, 2, ..., the ...

A completely multiplicative function, sometimes known as linear or totally multiplicative function, is an arithmetic function f(n) such that f(mn)=f(m)f(n) holds for each ...

A complex manifold is a manifold M whose coordinate charts are open subsets of C^n and the transition functions between charts are holomorphic functions. Naturally, a complex ...

The complexity of a process or algorithm is a measure of how difficult it is to perform. The study of the complexity of algorithms is known as complexity theory. In general, ...

The composite number problem asks if for a given positive integer N there exist positive integers m and n such that N=mn. The complexity of the composite number problem was ...

Some computations allow shortcuts which can be used to speed them up. Consider the operation of raising a number to a positive integer power. It is possible, for example, to ...