Search Results for ""
5591 - 5600 of 13134 for Naive set theorySearch Results
A classic arithmetical problem probably first posed by Euclid and investigated by various authors in the Middle Ages. The problem is formulated as a dialogue between the two ...
A recursive primality certificate for a prime p. The certificate consists of a list of 1. A point on an elliptic curve C y^2=x^3+g_2x+g_3 (mod p) for some numbers g_2 and ...
B-trees were introduced by Bayer (1972) and McCreight. They are a special m-ary balanced tree used in databases because their structure allows records to be inserted, ...
The BBP (named after Bailey-Borwein-Plouffe) is a formula for calculating pi discovered by Simon Plouffe in 1995, ...
Given an n-ball B^n of radius R, find the distribution of the lengths s of the lines determined by two points chosen at random within the ball. The probability distribution ...
The nth Beraha constant (or number) is given by B(n)=2+2cos((2pi)/n). B(5) is phi+1, where phi is the golden ratio, B(7) is the silver constant, and B(10)=phi+2. The ...
If F(x) is a probability distribution with zero mean and rho=int_(-infty)^infty|x|^3dF(x)<infty, (1) where the above integral is a stieltjes integral, then for all x and n, ...
A biplanar graph is defined as a graph that is the graph union of two planar edge-induced subgraphs. In other words, biplanar graphs are graphs with graph thickness 1 or 2 ...
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 ...
The nth cabtaxi number is the smallest positive number that can be written in n ways as a sum of two (not necessarily positive) cubes. The name derived from the taxicab ...
...
View search results from all Wolfram sites (53007 matches)

