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

The combining of two or more quantities using the plus operator. The individual numbers being combined are called addends, and the total is called the sum. The first of ...

The lattice method is an alternative to long multiplication for numbers. In this approach, a lattice is first constructed, sized to fit the numbers being multiplied. If we ...

where _8phi_7 is a q-hypergeometric function.

_2phi_1(a,q^(-n);c;q,q)=(a^n(c/a,q)_n)/((a;q)_n), where _2phi_1(a,b;c;q,z) is a q-hypergeometric function.

A q-analog of the Saalschütz theorem due to Jackson is given by where _3phi_2 is the q-hypergeometric function (Koepf 1998, p. 40; Schilling and Warnaar 1999).

The Cartesian product of a finite or infinite set of modules over a ring with only finitely many nonzero entries in each sequence.

The parity of an integer is its attribute of being even or odd. Thus, it can be said that 6 and 14 have the same parity (since both are even), whereas 7 and 12 have opposite ...

A factorion is an integer which is equal to the sum of factorials of its digits. There are exactly four such numbers: 1 = 1! (1) 2 = 2! (2) 145 = 1!+4!+5! (3) 40585 = ...

Consider an n-digit number k. Square it and add the right n digits to the left n or n-1 digits. If the resultant sum is k, then k is called a Kaprekar number. For example, 9 ...