Search Results for ""

A curious approximation to the Feigenbaum constant delta is given by pi+tan^(-1)(e^pi)=4.669201932..., (1) where e^pi is Gelfond's constant, which is good to 6 digits to the ...

The first practical algorithm for determining if there exist integers a_i for given real numbers x_i such that a_1x_1+a_2x_2+...+a_nx_n=0, or else establish bounds within ...

A Fermat prime is a Fermat number F_n=2^(2^n)+1 that is prime. Fermat primes are therefore near-square primes. Fermat conjectured in 1650 that every Fermat number is prime ...

Given a number n, Fermat's factorization methods look for integers x and y such that n=x^2-y^2. Then n=(x-y)(x+y) (1) and n is factored. A modified form of this observation ...

A graph is a forbidden minor if its presence as a graph minor of a given graph means it is not a member of some family of graphs. More generally, there may be a family of ...

A rational number expressed in the form a/b (in-line notation) or a/b (traditional "display" notation), where a is called the numerator and b is called the denominator. When ...

The Gauss map is a function N from an oriented surface M in Euclidean space R^3 to the unit sphere in R^3. It associates to every point on the surface its oriented unit ...

In one dimension, the Gaussian function is the probability density function of the normal distribution, f(x)=1/(sigmasqrt(2pi))e^(-(x-mu)^2/(2sigma^2)), (1) sometimes also ...

In his monumental treatise Disquisitiones Arithmeticae, Gauss conjectured that the class number h(-d) of an imaginary quadratic field with binary quadratic form discriminant ...

A generalization of the Fibonacci numbers defined by 1=G_1=G_2=...=G_(c-1) and the recurrence relation G_n=G_(n-1)+G_(n-c). (1) These are the sums of elements on successive ...