This thesis treats the problem of enumerating equivalence
classes of Euler paths of full graphs. A full graph
is a complete, unordered, graph with no loops or repeated
edges. Two Euler paths are equivalent if and only if one
can be transformed into the other by a finite sequence of...
An algorithm is described for determining the vertices
and supporting planes (or lines) of the convex hull
of a given set of N distinct points in 3-space. The
method involves determining a finite sequence of convex
hulls, each successive convex hull being a better approximation
to the convex hull of...
This thesis contains a collection of properties of the greatest integer part function which were obtained by an extensive literature search. A few original properties are stated and proved and some of the properties which were found unproved in the literature are proved.
Let A and B be two subsets of the set of all non-negative
integers with 0 ε A and O ε B. The sum of the sets A and B is
the set C = A + B = {a + b: a ε A, b ε B). For n...
This thesis brings together under one cover a survey of the
history of the real number pi along with a study of the present state
of its theory, application, and calculation.