Search Results for ""

Start with an integer n, known as the digitaddition generator. Add the sum of the digitaddition generator's digits to obtain the digitaddition n^'. A number can have more ...

Consider the process of taking a number, multiplying its digits, then multiplying the digits of numbers derived from it, etc., until the remaining number has only one digit. ...

A riffle shuffle, in which the top half of the deck is placed in the left hand, and cards are then alternatively interleaved from the left and right hands. Using an ...

Elementary number theory is the branch of number theory in which elementary methods (i.e., arithmetic, geometry, and high school algebra) are used to solve equations with ...

The Pontryagin number is defined in terms of the Pontryagin class of a manifold as follows. For any collection of Pontryagin classes such that their cup product has the same ...

The net graph is the graph on 6 vertices illustrated above. It is implemented in the Wolfram Language as GraphData["NetGraph"]. The bipartite double graph of the net graph is ...

A figurate number Te_n of the form Te_n = sum_(k=1)^(n)T_k (1) = 1/6n(n+1)(n+2) (2) = (n+2; 3), (3) where T_k is the kth triangular number and (n; m) is a binomial ...

The number of outward directed graph edges from a given graph vertex in a directed graph.

Replacing the logistic equation (dx)/(dt)=rx(1-x) (1) with the quadratic recurrence equation x_(n+1)=rx_n(1-x_n), (2) where r (sometimes also denoted mu) is a positive ...

The nth central binomial coefficient is defined as (2n; n) = ((2n)!)/((n!)^2) (1) = (2^n(2n-1)!!)/(n!), (2) where (n; k) is a binomial coefficient, n! is a factorial, and n!! ...