Search Results for ""

The base 16 notational system for representing real numbers. The digits used to represent numbers using hexadecimal notation are 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, E, ...

The base 8 notational system for representing real numbers. The digits used are 0, 1, 2, 3, 4, 5, 6, and 7, so that 8_(10) (8 in base 10) is represented as 10_8 ...

The tabulation of raw data obtained by dividing it into classes of some size and computing the number of data elements (or their fraction out of the total) falling within ...

A friendly number is a number that is a member of a friendly pair or a higher-order friendly n-tuple. Numbers that are not friendly are said to be solitary. There are some ...

The numbers defined by the recurrence relation K_(n+1)=1+min(2K_(|_n/2_|),3K_(|_n/3_|)), with K_0=1. The first few values for n=0, 1, 2, ... are 1, 3, 3, 4, 7, 7, 7, 9, 9, ...

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 number of the form Tt_n=((n+2; 2); 2)=1/8n(n+1)(n+2)(n+3) (Comtet 1974, Stanley 1999), where (n; k) is a binomial coefficient. The first few values are 3, 15, 45, 105, 210, ...

An integer is k-smooth if it has no prime factors >k. The following table gives the first few k-smooth numbers for small k. Berndt (1994, p. 52) called the 7-smooth numbers ...

The double factorial of a positive integer n is a generalization of the usual factorial n! defined by n!!={n·(n-2)...5·3·1 n>0 odd; n·(n-2)...6·4·2 n>0 even; 1 n=-1,0. (1) ...

Rule 30 is one of the elementary cellular automaton rules introduced by Stephen Wolfram in 1983 (Wolfram 1983, 2002). It specifies the next color in a cell, depending on its ...