Search Results for ""

Faà di Bruno's formula gives an explicit equation for the nth derivative of the composition f(g(t)). If f(t) and g(t) are functions for which all necessary derivatives are ...

The falling factorial (x)_n, sometimes also denoted x^(n__) (Graham et al. 1994, p. 48), is defined by (x)_n=x(x-1)...(x-(n-1)) (1) for n>=0. Is also known as the binomial ...

A Fermat pseudoprime to a base a, written psp(a), is a composite number n such that a^(n-1)=1 (mod n), i.e., it satisfies Fermat's little theorem. Sometimes the requirement ...

A Ferrers diagram represents partitions as patterns of dots, with the nth row having the same number of dots as the nth term in the partition. The spelling "Ferrars" (Skiena ...

A fiber bundle (also called simply a bundle) with fiber F is a map f:E->B where E is called the total space of the fiber bundle and B the base space of the fiber bundle. The ...

The Fibonacci cube graph of order n is a graph on F_(n+2) vertices, where F_n is a Fibonacci number, labeled by the Zeckendorf representations of the numbers 0 to F_(n+2)-1 ...

A figurate number, also (but mostly in texts from the 1500 and 1600s) known as a figural number (Simpson and Weiner 1992, p. 587), is a number that can be represented by a ...

The finite group C_2×C_2 is one of the two distinct groups of group order 4. The name of this group derives from the fact that it is a group direct product of two C_2 ...

The set of terms of first-order logic (also known as first-order predicate calculus) is defined by the following rules: 1. A variable is a term. 2. If f is an n-place ...

The fish graph is the graph on 6 vertices illustrated above. It is implemented in the Wolfram Language as GraphData["FishGraph"].