Search Results for ""
4241 - 4250 of 13134 for complexity theorySearch Results
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 monotone triangle (also called a strict Gelfand pattern or a gog triangle) of order n is a number triangle with n numbers along each side and the base containing entries ...
The monster group is the highest order sporadic group M. It has group order |M| = (1) = (2) where the divisors are precisely the 15 supersingular primes (Ogg 1980). The ...
There are several results known as the Morgado identity. The first is (1) where F_n is a Fibonacci number and L_n is a Lucas number (Morgado 1987, Dujella 1995). A second ...
An algebraic loop L is a Moufang loop if all triples of elements x, y, and z in L satisfy the Moufang identities, i.e., if 1. z(x(zy))=((zx)z)y, 2. x(z(yz))=((xz)y)z, 3. ...
Given a sequence {a_i}_(i=1)^N, an n-moving average is a new sequence {s_i}_(i=1)^(N-n+1) defined from the a_i by taking the arithmetic mean of subsequences of n terms, ...
What is the longest ladder that can be moved around a right-angled hallway of unit width? For a straight, rigid ladder, the answer is 2sqrt(2), which allows the ladder to ...
A Münchhausen number (sometimes spelled Münchausen number, with a single 'h') is a number equal to the sum of its digits raised to each digit's power. Münchhausen numbers ...
Two integers n and m<n are (alpha,beta)-multiamicable if sigma(m)-m=alphan and sigma(n)-n=betam, where sigma(n) is the divisor function and alpha,beta are positive integers. ...
...
View search results from all Wolfram sites (28442 matches)

