Search Results for ""

The residue classes of a function f(x) mod n are all possible values of the residue f(x) (mod n). For example, the residue classes of x^2 (mod 6) are {0,1,3,4}, since 0^2=0 ...

Riddell's formula for unlabeled graphs is the Euler transform relating the number of unlabeled connected graphs on n nodes satisfying some property with the corresponding ...

The ring of integers is the set of integers ..., -2, -1, 0, 1, 2, ..., which form a ring. This ring is commonly denoted Z (doublestruck Z), or sometimes I (doublestruck I). ...

In the directed graph above, pick any vertex and follow the arrows in sequence blue-red-red three times. You will finish at the green vertex. Similarly, follow the sequence ...

Robertson's apex graph is the 15-vertex graph illustrated above constructed by Neil Robertson as an example of an apex graph that is not YDeltaY-reducible. The graph may be ...

Let E be a Euclidean space, (beta,alpha) be the dot product, and denote the reflection in the hyperplane P_alpha={beta in E|(beta,alpha)=0} by ...

The so-called rule of three is an educational tool utilized historically to verbalize the process of solving basic linear equations with four terms where three of the terms ...

Let K subset= C be compact, let f be analytic on a neighborhood of K, and let P subset= C^*\K contain at least one point from each connected component of C^*\K. Then for any ...

A Saunders graphic is a plot of the dth base-b digits of a function f(x,y) as a function of x and y. The plots above show Saunders graphics for the functions ...

Let lambda_1, ..., lambda_n in C be linearly independent over the rationals Q, then Q(lambda_1,...,lambda_n,e^(lambda_1),...,e^(lambda_n)) has transcendence degree at least n ...