Search Results for ""

A forest is an acyclic graph (i.e., a graph without any graph cycles). Forests therefore consist only of (possibly disconnected) trees, hence the name "forest." Examples of ...

Consider the Euclid numbers defined by E_k=1+p_k#, where p_k is the kth prime and p# is the primorial. The first few values of E_k are 3, 7, 31, 211, 2311, 30031, 510511, ... ...

The Gauss map is a function N from an oriented surface M in Euclidean space R^3 to the unit sphere in R^3. It associates to every point on the surface its oriented unit ...

The constant e^pi that Gelfond's theorem established to be transcendental seems to lack a generally accepted name. As a result, in this work, it will be dubbed Gelfond's ...

A generalized Moore graph is a regular graph of degree r where the counts of vertices at each distance d=0, 1, ... from any vertex are 1, r, r(r-1), r(r-1)^2, r(r-1)^3, ..., ...

Ore (1962) noted that not only does a tree possesses a unique shortest path between any two vertices, but that there also exist also other connected graphs having the same ...

The Gergonne point Ge is the perspector of a triangle DeltaABC and its contact triangle DeltaT_AT_BT_C. It has equivalent triangle center functions alpha = [a(b+c-a)]^(-1) ...

The Gibert point can be defined as follows. Given a reference triangle DeltaABC, reflect the point X_(1157) (which is the inverse point of the Kosnita point in the ...

Let the difference of successive primes be defined by d_n=p_(n+1)-p_n, and d_n^k by d_n^k={d_n for k=1; |d_(n+1)^(k-1)-d_n^(k-1)| for k>1. (1) N. L. Gilbreath claimed that ...

Any composite number n with p|(n/p-1) for all prime divisors p of n. n is a Giuga number iff sum_(k=1)^(n-1)k^(phi(n))=-1 (mod n) (1) where phi is the totient function and ...