Search Results for ""
1631 - 1640 of 2910 for Integer complexitySearch Results
The maximum possible weight of a fractional clique of a graph G is called the fractional clique number of G, denoted omega^*(G) (Godsil and Royle 2001, pp. 136-137) or ...
The fractional derivative of f(t) of order mu>0 (if it exists) can be defined in terms of the fractional integral D^(-nu)f(t) as D^muf(t)=D^m[D^(-(m-mu))f(t)], (1) where m is ...
The Franel numbers are the numbers Fr_n=sum_(k=0)^n(n; k)^3, (1) where (n; k) is a binomial coefficient. The first few values for n=0, 1, ... are 1, 2, 10, 56, 346, ... (OEIS ...
The Fransén-Robinson constant F is defined by F=int_0^infty(dx)/(Gamma(x))=2.8077702420... (OEIS A058655) where Gamma(x) is the gamma function. No closed-form expression in ...
A strophoid of a circle with the pole O at the center of the circle and the fixed point P on the circumference of the circle. Freeth (1878, pp. 130 and 228) described this ...
The end of the last gap in the Lagrange spectrum, given by F=(2221564096+283748sqrt(462))/(491993569)=4.5278295661... (OEIS A118472). Real numbers greater than F are members ...
A friendly number is a number that is a member of a friendly pair or a higher-order friendly n-tuple. Numbers that are not friendly are said to be solitary. There are some ...
Let f(x) be a monic polynomial of degree d with discriminant Delta. Then an odd integer n with (n,f(0)Delta)=1 is called a Frobenius pseudoprime with respect to f(x) if it ...
An irrational number x can be called GK-regular (defined here for the first time) if the distribution of its continued fraction coefficients is the Gauss-Kuzmin distribution. ...
For a positive integer n, (2pi)^((n-1)/2)n^(1/2-nz)Gamma(nz)=product_(k=0)^(n-1)Gamma(z+k/n),
...
View search results from all Wolfram sites (340627 matches)

