Search Results for ""

In general, an integer n is divisible by d iff the digit sum s_(d+1)(n) is divisible by d. Write a positive decimal integer a out digit by digit in the form ...

A theorem sometimes called "Euclid's first theorem" or Euclid's principle states that if p is a prime and p|ab, then p|a or p|b (where | means divides). A corollary is that ...

An Eulerian graph is a graph containing an Eulerian cycle. The numbers of Eulerian graphs with n=1, 2, ... nodes are 1, 1, 2, 3, 7, 15, 52, 236, ... (OEIS A133736), the first ...

The fundamental group of an arcwise-connected set X is the group formed by the sets of equivalence classes of the set of all loops, i.e., paths with initial and final points ...

A hyperbolic knot is a knot that has a complement that can be given a metric of constant curvature -1. All hyperbolic knots are prime knots (Hoste et al. 1998). A prime knot ...

Operations research is a vast branch of mathematics which encompasses many diverse areas of minimization and optimization. Thousands of books have been written worldwide on ...

An n-polyhedral graph (sometimes called a c-net) is a 3-connected simple planar graph on n nodes. Every convex polyhedron can be represented in the plane or on the surface of ...

A knot is called prime if, for any decomposition as a connected sum, one of the factors is unknotted (Livingston 1993, pp. 5 and 78). A knot which is not prime is called a ...

Pythagoras's constant sqrt(2) has decimal expansion sqrt(2)=1.4142135623... (OEIS A000129), It was computed to 2000000000050 decimal digits by A. J. Yee on Feb. 9, 2012. The ...

A figurate number of the form P_n^((4))=1/6n(n+1)(2n+1), (1) corresponding to a configuration of points which form a square pyramid, is called a square pyramidal number (or ...