Search Results for ""

A shuffle-exchange graph is a nonsimple graph (due to the existence of graph loops) whose vertices are length n binary strings with an edge from w to w^' if 1. w^' differs ...

Two nodes connected to the same node which are same distance from the root vertex in a rooted tree are called siblings. A function to return the siblings of a vertex v in a ...

If a fixed fraction x of a given amount of money P is lost, and then the same fraction x of the remaining amount is gained, the result is less than the original and equal to ...

sum_(n=1)^(infty)1/(phi(n)sigma_1(n)) = product_(p prime)(1+sum_(k=1)^(infty)1/(p^(2k)-p^(k-1))) (1) = 1.786576459... (2) (OEIS A093827), where phi(n) is the totient function ...

A nonzero ring S whose only (two-sided) ideals are S itself and zero. Every commutative simple ring is a field. Every simple ring is a prime ring.

The Sims graph is a distance-transitive graph on 352 vertices (Brouwer et al. 1989, p. 370).

A set having exactly one element a. A singleton set is denoted by {a} and is the simplest example of a nonempty set.

An even number of the form 4n+2 (i.e., an integer which is divisible by 2 but not by 4). The first few for n=0, 1, 2, ... are 2, 6, 10, 14, 18, ... (OEIS A016825)

The Reidemeister move of type III.

An algorithm for computing an Egyptian fraction.