Search Results for ""

The (lower) domination number gamma(G) of a graph G is the minimum size of a dominating set of vertices in G, i.e., the size of a minimum dominating set. This is equivalent ...

There are two identities known as Catalan's identity. The first is F_n^2-F_(n+r)F_(n-r)=(-1)^(n-r)F_r^2, where F_n is a Fibonacci number. Letting r=1 gives Cassini's ...

The heptanacci constant is the limiting ratio of adjacent heptanacci numbers. It is the algebraic number P = (x^7-x^6-x^5-x^4-x^3-x^2-x-1)_1 (1) = 1.99196419660... (2) (OEIS ...

The hexanacci constant is the limiting ratio of adjacent hexanacci numbers. It is the algebraic number P = (x^6-x^5-x^4-x^3-x^2-x-1)_2 (1) = 1.98358284342... (2) (OEIS ...

Applying the Kaprekar routine to 4-digit number reaches 0 for exactly 77 4-digit numbers, while the remainder give 6174 in at most 8 iterations. The value 6174 is sometimes ...

The pentanacci constant is the limiting ratio of adjacent pentanacci numbers. It is the algebraic number P = (x^5-x^4-x^3-x^2-x-1)_1 (1) = 1.96594823... (2) (OEIS A103814), ...

d is called an e-divisor (or exponential divisor) of a number n with prime factorization n=p_1^(a_1)p_2^(a_2)...p_r^(a_r) if d|n and d=p_1^(b_1)p_2^(b_2)...p_r^(b_r), where ...

A number n such that the last digits of n^3 are the same as n. 49 is trimorphic since 49^3=117649 (Wells 1986, p. 124). The first few are 1, 4, 5, 6, 9, 24, 25, 49, 51, 75, ...

The number N_d^((b))(n) of digits d in the base-b representation of a number n is called the b-ary digit count for d. The digit count is implemented in the Wolfram Language ...

Take any positive integer of two digits or more, reverse the digits, and add to the original number. This is the operation of the reverse-then-add sequence. Now repeat the ...