Search Results for ""

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

The multiplicad is a simple example of an idea like the ruliad. It consists of a rulial multiway system based on the positive integers in which the rules simply multiply by ...

In simple algebra, multiplication is the process of calculating the result when a number a is taken b times. The result of a multiplication is called the product of a and b, ...

In a monoid or multiplicative group where the operation is a product ·, the multiplicative inverse of any element g is the element g^(-1) such that g·g^(-1)=g^(-1)·g=1, with ...

Let A be a non-unital C^*-algebra. There is a unique (up to isomorphism) unital C^*-algebra which contains A as an essential ideal and is maximal in the sense that any other ...

Murata's constant is defined as C_(Murata) = product_(p)[1+1/((p-1)^2)] (1) = 2.82641999... (2) (OEIS A065485), where the product is over the primes p. It can also be written ...

The set of natural numbers (the positive integers Z-+ 1, 2, 3, ...; OEIS A000027), denoted N, also called the whole numbers. Like whole numbers, there is no general agreement ...

The Narayan number N(n,k) for n=1, 2, ... and k=1, ..., n gives a solution to several counting problems in combinatorics. For example, N(n,k) gives the number of expressions ...

A Nash equilibrium of a strategic game is a profile of strategies (s_1^*,...,s_n^*), where s_i^* in S_i (S_i is the strategy set of player i), such that for each player i, ...