Search Results for ""

The sequence produced by starting with a_1=1 and applying the greedy algorithm in the following way: for each k>=2, let a_k be the least integer exceeding a_(k-1) for which ...

If a number fails Miller's primality test for some base a, it is not a prime. If the number passes, it may be a prime. A composite number passing Miller's test is called a ...

Mills' constant can be defined as the least theta such that f_n=|_theta^(3^n)_| is prime for all positive integers n (Caldwell and Cheng 2005). The first few f_n for n=1, 2, ...

A modular inverse of an integer b (modulo m) is the integer b^(-1) such that bb^(-1)=1 (mod m). A modular inverse can be computed in the Wolfram Language using PowerMod[b, ...

Module multiplicity is a number associated with every nonzero finitely generated graded module M over a graded ring R for which the Hilbert series is defined. If dim(M)=d, ...

Draw a circle that cuts three given circles perpendicularly. The solution is known as the radical circle of the given three circles. If it lies outside the three circles, ...

The nth Monica set M_n is defined as the set of composite numbers x for which n|[S(x)-S_p(x)], where x = a_0+a_1(10^1)+...+a_d(10^d) (1) = p_1p_2...p_m, (2) and S(x) = ...

A monoid is a set that is closed under an associative binary operation and has an identity element I in S such that for all a in S, Ia=aI=a. Note that unlike a group, its ...

A monotonic matrix of order n is an n×n matrix in which every element is either 0 or contains a number from the set {1,...,n} subject to the conditions 1. The filled-in ...

In 1979, Conway and Norton discovered an unexpected intimate connection between the monster group M and the j-function. The Fourier expansion of j(tau) is given by (1) (OEIS ...