Search Results for ""

A stem-and-leaf diagram, also called a stem-and-leaf plot, is a diagram that quickly summarizes data while maintaining the individual data points. In such a diagram, the ...

Stern's diatomic series is the sequence 1, 1,2, 1,3,2,3, 1,4,3,5,2,5,3,4, (1) ... (OEIS A002487) which arises in the Calkin-Wilf tree. It is sometimes also known as the fusc ...

Strang's strange figures are the figures produced by plotting a periodic function f(z) as a function of an integer argument n for n=1, 2, .... Unexpected patterns and ...

A substitution system in which rules are used to operate on a string consisting of letters of a certain alphabet. String rewriting systems are also variously known as ...

A pseudoprime which obeys an additional restriction beyond that required for a Frobenius pseudoprime. A number n with (n,2a)=1 is a strong Frobenius pseudoprime with respect ...

Let U(P,Q) and V(P,Q) be Lucas sequences generated by P and Q, and define D=P^2-4Q. (1) Let n be an odd composite number with (n,D)=1, and n-(D/n)=2^sd with d odd and s>=0, ...

A strongly binary tree is a rooted tree for which the root is adjacent to either zero or two vertices, and all non-root vertices are adjacent to either one or three vertices ...

A strongly connected component of a simple directed graph (i.e., a digraph without loops) is a maximal subdigraph such that for every pair of distinct vertices u, v in the ...

A strongly connected digraph is a directed graph in which it is possible to reach any node starting from any other node by traversing edges in the direction(s) in which they ...

A graph is strongly perfect if every induced subgraph H has an independent vertex set meeting all maximal cliques of H (Berge and Duchet 1984, Ravindra 1999). Every strongly ...