Search Results for ""

A sliver of the surface of a sphere of radius r cut out by two planes through the azimuthal axis with dihedral angle theta. The surface area of the lune is S=2r^2theta, which ...

A figure formed by taking a series of steps of length 1, 2, ..., n, with an angle theta turn after each step. The symbol for a spirolateral is ^(a_1,...,a_k)n_theta, where ...

Consider a star graph S_(n+1) consisting of a central hub vertex and n spokes, but instead of placing a single point at the end of each spoke, place k points along it (in ...

A square-free graph is a graph containing no graph cycles of length four. A simple graph is square-free iff c_4=1/8[Tr(A^4)-2m-2sum_(i!=j)a_(ij)^((2))]=0, where A is the ...

Gardner showed how to dissect a square into eight and nine acute scalene triangles. W. Gosper discovered a dissection of a unit square into 10 acute isosceles triangles, ...

The average number of regions N(n) into which n lines divide a square is N^_(n)=1/(16)n(n-1)pi+n+1 (Santaló 1976; Finch 2003, p. 481). The maximum number of sequences is ...

In the above figure, the identical squares A, B, C appear different in width and height, because subdividing a space makes it appear larger. A different orientation can also ...

A sequence of approximations a/b to sqrt(n) can be derived by factoring a^2-nb^2=+/-1 (1) (where -1 is possible only if -1 is a quadratic residue of n). Then ...

The stacked book graph of order (m,n) is defined as the graph Cartesian product S_(m+1) square P_n, where S_m is a star graph and P_n is the path graph on n nodes. It is ...

Define the minimal bounding rectangle as the smallest rectangle containing a given lattice polygon. If the perimeter of the lattice polygon is equal to that of its minimal ...