Search Results for ""

A generalization of the equation whose solution is desired in Fermat's last theorem x^n+y^n=z^n to x^n+y^n=cz^n for x, y, z, and c positive constants, with trivial solutions ...

A d-dimensional framework is a pair (G,p) where G=(V,E) is a graph with vertex set V and edge set E and p:V->R^d is a map that assigns a point in R^d to each vertex of G. The ...

A gigantic prime is a prime with 10000 or more decimal digits. The first few gigantic primes are given by 10^(9999)+n for n=33603, 55377, 70999, 78571, 97779, 131673, 139579, ...

The global clustering coefficient C of a graph G is the ratio of the number of closed trails of length 3 to the number of paths of length two in G. Let A be the adjacency ...

Let G be a simple connected graph, and take 0<=i<=d(G), where d(G) is the graph diameter. Then G has global parameters c_i (respectively a_i, b_i) if the number of vertices ...

A figurate number of the form g_n=2n-1 giving the area of the square gnomon obtained by removing a square of side n-1 from a square of side n, g_n = n^2-(n-1)^2 (1) = 2n-1. ...

A Goldbach number is a positive integer that is the sum of two odd primes (Li 1999). Let E(x) (the "exceptional set of Goldbach numbers") denote the number of even numbers ...

The golden angle is the angle that divides a full angle in a golden ratio (but measured in the opposite direction so that it measures less than 180 degrees), i.e., GA = ...

The golden gnomon is the obtuse isosceles triangle whose ratio of side to base lengths is given by 1/phi=phi-1, where phi is the golden ratio. Such a triangle has angles of ...

Nice approximations for the golden ratio phi are given by phi approx sqrt((5pi)/6) (1) approx (7pi)/(5e), (2) the last of which is due to W. van Doorn (pers. comm., Jul. 18, ...