Search Results for ""

The number of regions into which space can be divided by n mutually intersecting spheres is N=1/3n(n^2-3n+8), giving 2, 4, 8, 16, 30, 52, 84, ... (OEIS A046127) for n=1, 2, ...

A fundamental structural result in extremal graph theory due to Szemerédi (1978). The regularity lemma essentially says that every graph can be well-approximated by the union ...

With n cuts of a torus of genus 1, the maximum number of pieces which can be obtained is N(n)=1/6(n^3+3n^2+8n). The first few terms are 2, 6, 13, 24, 40, 62, 91, 128, 174, ...

An n-uniform tessellation is a tessellation than has n transitivity classes of vertices. The 1-uniform tessellations are sometimes known as Archimedean tessellations. The ...

For a given point lattice, some number of points will be within distance d of the origin. A Waterman polyhedron is the convex hull of these points. A progression of Waterman ...

Given the incircle and circumcircle of a bicentric polygon of n sides, the centroid of the tangent points on the incircle is a fixed point W, known as the Weill point, ...

The abundancy of a number n is defined as the ratio sigma(n)/n, where sigma(n) is the divisor function. For n=1, 2, ..., the first few values are 1, 3/2, 4/3, 7/4, 6/5, 2, ...

Aleph-1 is the set theory symbol aleph_1 for the smallest infinite set larger than aleph_0 (Aleph-0), which in turn is equal to the cardinal number of the set of countable ...

An Euler-Jacobi pseudoprime to a base a is an odd composite number n such that (a,n)=1 and the Jacobi symbol (a/n) satisfies (a/n)=a^((n-1)/2) (mod n) (Guy 1994; but note ...

The term "Euler function" may be used to refer to any of several functions in number theory and the theory of special functions, including 1. the totient function phi(n), ...