TOPICS
Search

Search Results for ""


3571 - 3580 of 3905 for Fibonacci NumbersSearch Results
An important and fundamental axiom in set theory sometimes called Zermelo's axiom of choice. It was formulated by Zermelo in 1904 and states that, given any set of mutually ...
Ball point picking is the selection of points randomly placed inside a ball. n random points can be picked in a unit ball in the Wolfram Language using the function ...
Given a set of n+1 control points P_0, P_1, ..., P_n, the corresponding Bézier curve (or Bernstein-Bézier curve) is given by C(t)=sum_(i=0)^nP_iB_(i,n)(t), where B_(i,n)(t) ...
A bishop graph is a graph formed from possible moves of a bishop chess piece, which may make diagonal moves of any length on a chessboard (or any other board). To form the ...
Let F be the set of complex analytic functions f defined on an open region containing the set closure of the unit disk D={z:|z|<1} satisfying f(0)=0 and df/dz(0)=1. For each ...
The subset B of the Euclidean plane formed by the union of the interval [0,1] of the x-axis and all line segments of unit length passing through the origin which form an ...
Cards are a set of n rectangular pieces of cardboard with markings on one side and a uniform pattern on the other. The collection of all cards is called a "deck," and a ...
Let {a_i}_(i=1)^n be a set of positive numbers. Then sum_(i=1)^n(a_1a_2...a_i)^(1/i)<=esum_(i=1)^na_i (which is given incorrectly in Gradshteyn and Ryzhik 2000). Here, the ...
There are two definitions of the Carmichael function. One is the reduced totient function (also called the least universal exponent function), defined as the smallest integer ...
An equation representing a locus L in the n-dimensional Euclidean space. It has the form L:f(x_1,...,x_n)=0, (1) where the left-hand side is some expression of the Cartesian ...
1 ... 355|356|357|358|359|360|361 ... 391 Previous Next

...