Search Results for ""

Consider an arbitrary one-dimensional map x_(n+1)=F(x_n) (1) (with implicit parameter r) at the onset of chaos. After a suitable rescaling, the Feigenbaum function ...

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 ...

Fermat's spiral, also known as the parabolic spiral, is an Archimedean spiral with m=2 having polar equation r^2=a^2theta. (1) This curve was discussed by Fermat in 1636 ...

According to Hardy and Wright (1979), the 44-digit Ferrier's prime determined to be prime using only a mechanical calculator, is the largest prime found before the days of ...

The W polynomials obtained by setting p(x)=x and q(x)=1 in the Lucas polynomial sequence. (The corresponding w polynomials are called Lucas polynomials.) They have explicit ...

A method for solving an equation by approximating continuous quantities as a set of quantities at discrete points, often regularly spaced into a so-called grid or mesh. ...

Given a first-order ordinary differential equation (dy)/(dx)=F(x,y), (1) if F(x,y) can be expressed using separation of variables as F(x,y)=X(x)Y(y), (2) then the equation ...

First-passage percolation is a time-dependent generalization of discrete Bernoulli percolation in which each graph edge e of Z^d is assigned a nonnegative random variable ...