Search Results for ""

For a general second-order linear recurrence equation f_(n+1)=xf_n+yf_(n-1), (1) define a multiplication rule on ordered pairs by (A,B)(C,D)=(AD+BC+xAC,BD+yAC). (2) The ...

An efficient version of the Walsh transform that requires O(nlnn) operations instead of the n^2 required for a direct Walsh transform (Wolfram 2002, p. 1072).

A Julia set J consisting of a set of isolated points which is formed by taking a point outside an underlying set M (e.g., the Mandelbrot set). If the point is outside but ...

If {f_n} is a sequence of nonnegative measurable functions, then intlim inf_(n->infty)f_ndmu<=lim inf_(n->infty)intf_ndmu. (1) An example of a sequence of functions for which ...

The Faulkner-Younger graphs (Faulkner and Younger 1974) are the cubic polyhedral nonhamiltonian graphs on 42 and 44 vertices illustrated above that are counterexamples to ...

The Feit-Thompson conjecture asserts that there are no primes p and q for which (p^q-1)/(p-1) and (q^p-1)/(q-1) have a common factor. Parker noticed that if this were true, ...

Every finite simple group (that is not cyclic) has even group order, and the group order of every finite simple noncommutative group is doubly even, i.e., divisible by 4 ...

The Feller-Tornier constant is the density of integers that have an even number of prime factors p_i^(a_i) with a_1>1 in their prime factorization. It is given by ...

The Fermat axis is the central line connecting the first and second Fermat points. It has line function l=a(b^2-c^2)(a^2-b^2-bc-c^2)(a^2-b^2+bc-c^2), corresponding to ...

The Fermat quotient for a number a and a prime base p is defined as q_p(a)=(a^(p-1)-1)/p. (1) If pab, then q_p(ab) = q_p(a)+q_p(b) (2) q_p(p+/-1) = ∓1 (3) (mod p), where the ...