Search Results for ""

Multiply all the digits of a number n by each other, repeating with the product until a single digit is obtained. The number of steps required is known as the multiplicative ...

A Gray code is an encoding of numbers so that adjacent numbers have a single digit differing by 1. The term Gray code is often used to refer to a "reflected" code, or more ...

The look and say sequence generated from a starting digit of 3, as given by Vardi (1991).

Two bits or half a nibble. Since a crumb encodes values from 0 to 2^2-1=3, it can conveniently be represented using single quaternary digit. However, the term "crumb" is ...

A phenomenological law also called the first digit law, first digit phenomenon, or leading digit phenomenon. Benford's law states that in listings, tables of statistics, ...

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

A 10-digit number satisfying the following property. Number the digits 0 to 9, and let digit n be the number of ns in the number. There is exactly one such number: 6210001000.

The procedure used in subtraction to "borrow" 10 from the next higher digit column in order to obtain a positive difference in the column in question.

In general, an integer n is divisible by d iff the digit sum s_(d+1)(n) is divisible by d. Write a positive decimal integer a out digit by digit in the form ...

A number is said to be pandigital if it contains each of the digits from 0 to 9 (and whose leading digit must be nonzero). However, "zeroless" pandigital quantities contain ...